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

Rudin PMA p.150

This is the theorem;


(i)Let $X$ be a metric space and $K$ be a compact subset.

(ii)Let $\{f_n\}$ be a sequence of continuous functions such that $f_n:K\rightarrow \mathbb{R}$

(iii)$\forall x\in K, f_n(x)≧f_{n+1}(x)$

(iv)$f_n \rightarrow f$ pointwise on $K$.

(v)$f$ is continuous.

Then $f_n\rightarrow f$ uniformly on $K$.


I think the condition (iii) is not essential.

I think (iii) can be replaced to "$\{f_n(x)\}_{n\in \mathbb{N}}$ is monotonic for all $x\in K$" and i actually proved it.

Here's what i tried;

Define $g_n=f_n - f$.

Let $A=\{x\in K|\{g_n(x)\}_{n\in\mathbb{N}} \text{ is monotonically decreasing}\}$ and $B=\{x\in K|\{g_n(x)\}_{n\in\mathbb{N}} \text{ is monotonically increasing}\}$

Let $K_n=\{x\in K|g_n(x)≧\epsilon \bigvee g_n(x)≦-\epsilon\}$.

Then $K_n$ is compact.

Also, it can be shown that$\forall x\in A \forall n\in \mathbb{N}, g_n(x)≧0$ and $\forall x\in B \forall n\in \mathbb{N} g_n(x)≦0$.

Thus $K_{n+1} \subset K_n$.

Since $g_n\rightarrow 0$ pointwise on $K$, $K\cap (\bigcap K_n)=\emptyset$.

Thus, $\exists N\in \mathbb{N}$ such that $n≧N \Rightarrow K_n=\emptyset$. Q.E.D.

Is my argument correct?

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

I think your argument is perfect. Here is just a comment. Since $g_n(x)$ monotonically converges to $0$ for every $x\in K$, $|g_n(x)|$ decreases to $0$ for every $x\in K$, so your replacement of (iii) could be reduced to (iii).

share|cite|improve this answer
what if K is not compact, what need to be done in order to get the same conclusion? – math101 Mar 5 '15 at 13:54

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.