Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In this proof of the completeness of $(C(K), \| \cdot \|_\infty)$ they use the following inequality:

$$ \sup_{x \in K} \lim_{m \to \infty} | f_n(x) - f_m(x) | \leq \liminf_{m \to \infty}\, \sup_{x \in K} | f_n(x) - f_m(x) |.$$

Can someone explain to me why this is true? Presumably, they first write $$ \sup_{x \in K} \lim_{m \to \infty} | f_n(x) - f_m(x) | = \sup_{x \in K} \,\liminf_{m \to \infty} | f_n(x) - f_m(x) |$$ and then swap but the exact argument why this gives the inequality is unclear to me.

Many thanks for your help.

share|cite|improve this question
up vote 5 down vote accepted

We have for all $x\in K$, $m,n$ integers: $|f_n(x)-f_m(x)|\leq\sup_{x\in K}|f_n(x)-f_m(x)|$ and taking the $\liminf$: $$\forall n\in\mathbb N,\forall x\in K\quad\liminf_m|f_n(x)-f_m(x)|\leq\liminf_m\,\sup_{z\in K}|f_n(z)-f_m(z)|,$$ and now taking the supremum over $x\in K$ we get $$\forall n\in\mathbb N: \quad\sup_{x\in K}\,\liminf_m|f_n(x)-f_m(x)|\leq\liminf_m\,\sup_{z\in K}|f_n(z)-f_m(z)|,$$ hence $$\forall n\in\mathbb N: \quad\sup_{x\in K}\,\lim_m|f_n(x)-f_m(x)|\leq\liminf_m\,\sup_{z\in K}|f_n(z)-f_m(z)|,$$ since we got the convergence of $\{f_n(x)-f_n(x)\}_m$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.