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

Let $f_1,f_2,\ldots$ be continuous functions on $[0,1]$ satisfying $f_1 \geq f_2 \geq \cdots$ and such that $\lim_{n\to\infty} f_n(x)=0$ for each $x$. Must the sequence $\left\{f_n\right\}$ converge to $0$ uniformly on $[0,1]$?

I want to say yes and I want to try to invoke Arzela-Ascoli Theorem. My intuition tells me that for large $n$ we have that the slope of $f_n$ on small enough interval has slope less than 1. So $f_n$ must be Lipschitz and hence equicontinuous. So it must have a uniformly convergent subsequence, but that gives us that $f_n$ must converge uniformly to $0$.

Any help would be appreciated.

share|cite|improve this question
Look at Dini's theorem on Wikipedia. – KCd Mar 18 '12 at 5:42
@KCd Thanks that helps. – Galois Mar 18 '12 at 5:46
You can get by with a lot less than Arzela-Ascoli. There's a fairly simple way to do it, unless I've missed something in my answer below. – Michael Hardy Mar 18 '12 at 19:02
Just fixed a horrible typo in my answer. If you read it when it said "$\le$" and were confused, try again now. It says "$\ge$". – Michael Hardy Mar 18 '12 at 19:07
up vote 6 down vote accepted

Let $C_{n,\varepsilon} = \{x\in[0,1] : f_n(x) \ge \varepsilon\}$. Then $C_{1,\varepsilon} \supseteq C_{2,\varepsilon}\supseteq\cdots$ and these are compact sets. Since $\lim\limits_n f_n=0$, their intersection is empty (assume $\varepsilon>0$, of course). Therefore the intersection of some finite subcollection is empty. The sequence of $C$s reaches $\varnothing$ after only finitely many steps. So the sequence of $f$s is uniformly $<\varepsilon$ after finitely many steps. Hence you have uniform convergence.

share|cite|improve this answer
+1: beautifully simple. I don't think I've seen that proof before. – t.b. Mar 19 '12 at 0:22
@t.b. : Thank you. – Michael Hardy Mar 19 '12 at 2:30
@MichaelHardy : Sir , can you tell me why $C_{n,\epsilon } $ are compact ?? – Theorem Jun 9 '12 at 9:26
The set $[\varepsilon,\infty)$ is closed. The inverse-image of a closed set under a continuous function is closed. A closed bounded set in the line (or in any Euclidean space) is compact. The set is bounded since it's a subset of $[0,1]$. – Michael Hardy Jun 9 '12 at 17:18
@MichaelHardy I think this explain clearly but i have a question. Why do we need to have the compactness restriction? can't it just closed or just bounded? As it seems the proof doesn't involved the property of compactness but if it is not compact the theorem is not true in general. Can you briefing explain the role of the compact set in the proof? – Mathematics Dec 8 '12 at 17:40

Define the sequence $a_n=\max\limits_{x \in [0,1]} f_n(x)$. The fact that $f_n$ is decreasing proves that $a_n$ is also decreasing and bounded by zero, thus convergent. Denote by $L=\lim a_n$. If $L=0$ then $f_n$ uniformly converges to zero.

For every $n$ there is an $x_n$ such that $f_n(x_n)=a_n$. Passing eventually to a subsequence we can say that $x_n$ is convergent and denote $x=\lim x_n$.

Pick $\varepsilon >0$. For $p$ large enough, from continuity of $f_n$ we get that $$ |f_n(x_{n+p})-f_n(x)|<\varepsilon $$ Therefore, we can write $$ f_{n+p}(x_{n+p})-f_n(x)\leq f_n(x_{n+p})-f_n(x) <\varepsilon$$ which is $$ a_{n+p}-f_n(x)<\varepsilon$$ Take $p \to \infty$ and get $$ L -f_n(x)<\varepsilon$$ Take $n \to \infty$ and get $L<\varepsilon$. Finally for $\varepsilon \to 0$ we get $L=0$.

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.