PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very low Entry average rating: No information on entry rating
[parent] proof of Weierstrass' criterion of uniform convergence (Proof)

The assumption that $|f_n(x)| \le M_n$ for every $x$ guarantees that each numerical series $\sum_n f_n(x)$ converges absolutely. We call the limit $f(x)$

To see that the convergence is uniform: let $\epsilon>0$ Then there exists $K$ such that $n>K$ implies $\sum_{n>K} M_n < \epsilon$ Now, if $k>K$

$$ |f(x)-\sum_{n=1}^k f_n(x)| = |\sum_{n>k} f_n(x) | \le \sum_{n>k} |f_n(x)| \le \sum_{n>k} M_n < \epsilon $$

The $\epsilon$ does not depend on $x$ so the convergence is uniform.




"proof of Weierstrass' criterion of uniform convergence" is owned by argerami.
(view preamble | get metadata)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: implies, limit, converges absolutely, series

This is version 1 of proof of Weierstrass' criterion of uniform convergence, born on 2006-12-01.
Object id is 8596, canonical name is ProofOfWeierstrassCriterionOfUniformConvergence2.
Accessed 1679 times total.

Classification:
AMS MSC40A30 (Sequences, series, summability :: Convergence and divergence of infinite limiting processes :: Convergence and divergence of series and sequences of functions)
 26A15 (Real functions :: Functions of one variable :: Continuity and related questions )

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)