Let $\{a_n\}$ be a bounded sequence of real numbers. Let $s_n=\dfrac{a_1+a_2+\cdots+a_n}{n}~\forall~n\in\mathbb N.$ Show that $\lim \inf a_n\le\lim\inf s_n.$
The only definition I know of limit infimum is the lowest subsequencial limit. I've first prechoosed a convergent subsequence $\{s_{n_k}\}$ converging to $l$ of $\{s_n\}$ and then tried to find a convergent subsequence of $\{a_n\}$ whose limit is $\le l.$
But it didn't help.
Let $\alpha=\liminf_{n\to\infty}a_n$, by the Remark2 below, there exists $N>0$, such that for each $n>N$, we have $a_n\ge\beta$ (*), thus $$s_n=\frac{a_1+\dotsb+a_n}n=\frac{a_1+\dotsb+a_{N+1}+\dotsb+a_n}n\ge\frac{a_1+\dotsb+a_N+(n-N)\beta}n$$ Take limit as $n\to\infty$, we have $\liminf_{n\to\infty}s_n\ge\beta$ for each $\beta<\alpha$, hence $\liminf s_n\ge\liminf a_n$.
Especially, even if $\alpha=-\infty$, there's no $\beta<\alpha$, thus $\forall\beta<\alpha\colon\liminf s_n\ge\beta$ is vacuously true, which also implies that $\liminf s_n\ge\alpha$.
Generally, if $S$ is a totally-ordered set, and $x\ge\beta$ for all $\beta<\alpha$, then $x\ge\alpha$, no matter whether $\alpha$ is the minimum.
If $\alpha=\liminf a_n$, we have $\alpha$ is a subsequential limit. Suppose $\exists\beta_0<\alpha,\forall N,\exists n>N\colon\alpha<\beta_0$, we can choose a subsequence $\{a_{n_k}\}$, such that $a_{n_k}<\beta_0$, which contradicts the assumption that $\alpha$ is the lowest subsequential limit (choose a proper subsequence). For the reverse deduction, note that $\forall\beta<\alpha,\exists\gamma(\beta<\gamma<\alpha),\exists N>0,\forall n>N\colon a_n\le\gamma$, thus $\beta$ isn't a subsequential limit. The argument works even if $\alpha=-\infty$, by the same reason of vacuous truth.