4.10.24Advanced Topics (Elite Level)

Uniform convergence of function sequences

1,892 words9 min readdifficulty · medium

1. Definitions, built from scratch


2. The sup-norm criterion (the working tool)

Figure — Uniform convergence of function sequences

3. The classic counterexample (must memorize)


4. Why uniform convergence is worth the trouble


5. Cauchy criterion (test without knowing the limit)


Common mistakes


Recall & Feynman

Recall Active recall — cover the answers
  • State both definitions; what's the ONE difference? ::: Quantifier order; N(ε,x)N(\varepsilon,x) vs N(ε)N(\varepsilon).
  • The single computational test for uniformity? ::: Mn=supxfnf0M_n=\sup_x|f_n-f|\to 0.
  • Why is xnx^n on [0,1][0,1] not uniform? ::: Mn=1M_n=1 always; limit is discontinuous at 11.
Recall Feynman: explain to a 12-year-old

Imagine a class of runners (each xx is a runner) all heading to a finish line f(x)f(x). Pointwise: every runner eventually arrives, but some are super slow — you can't say "in 10 minutes everyone's done." Uniform: there's a single stopwatch time after which every runner is already inside a tiny circle of the finish. One time fits all. That single shared deadline is what lets you safely say nice things about the whole crowd at once.


Connections

  • Pointwise convergence — the weaker cousin.
  • Weierstrass M-test — sufficient condition for uniform convergence of series.
  • Continuity preserved under uniform limits — the ε/3\varepsilon/3 theorem.
  • Interchange of limit and integral / Dominated convergence theorem — measure-theoretic upgrade.
  • Cauchy sequences in metric spaces — uniform Cauchy = completeness of C(E)C(E) under sup-norm.
  • Equicontinuity and Arzelà–Ascoli.
Pointwise vs uniform — the key difference
Order of quantifiers: pointwise allows N=N(ε,x)N=N(\varepsilon,x); uniform requires one N=N(ε)N=N(\varepsilon) for all xx.
Sup-norm test for uniform convergence
fnff_n\to f uniformly     Mn=supxfn(x)f(x)0\iff M_n=\sup_x|f_n(x)-f(x)|\to 0.
Is xnx^n uniformly convergent on [0,1][0,1]?
No; Mn=1M_n=1 for all nn and the limit jumps at x=1x=1.
Is xnx^n uniformly convergent on [0,a][0,a], a<1a<1?
Yes; Mn=an0M_n=a^n\to0.
Which property does uniform (not pointwise) convergence preserve?
Continuity of the limit function (also integral interchange).
Counterexample that uniform conv. of fnf_n doesn't give conv. of fnf_n'
fn=sin(nx)/n0f_n=\sin(nx)/n\to0 uniformly but fn=cos(nx)f_n'=\cos(nx) diverges.
Uniform Cauchy criterion statement
Uniform convergence     εN:m,nNsupxfnfm<ε\iff \forall\varepsilon\,\exists N: m,n\ge N\Rightarrow\sup_x|f_n-f_m|<\varepsilon.
Why does fnf\int f_n\to\int f under uniform conv.?
fnf(ba)Mn0|\int f_n-\int f|\le(b-a)M_n\to0.

Concept Map

settles to

weak mode

strong mode

N depends on eps and x

N depends on eps only

swaps order, harder than

equivalent to

Mn = sup gap

strong glue, preserves

too weak, may break

converges pointwise but

fails, limit discontinuous

Function sequence fn

Limit function f

Pointwise convergence

Uniform convergence

Quantifiers: for all x, exists N

Quantifiers: exists N, for all x

Sup-norm criterion Mn to 0

Uniform deviation

Continuity, integrals, limits

Example x^n on 0,1

Hinglish (regional understanding)

Intuition Hinglish mein samjho

Dekho, function sequence fnf_n ka convergence do flavour me aata hai. Pointwise me har point xx apni alag speed se limit tak pahunchta hai — kisi point ke liye jaldi, kisi ke liye bahut der. Yaha NN depend karta hai ε\varepsilon aur xx dono pe. Uniform me ek single NN hota hai jo saare points ke liye ek saath kaam karta hai — bas ε\varepsilon pe depend, xx pe nahi. Yahi ek sentence ka difference hai: quantifier ka order ulta ho jaata hai.

Practically test karne ke liye sirf ek cheez yaad rakho: Mn=supxfn(x)f(x)M_n = \sup_x |f_n(x)-f(x)| nikaalo. Agar Mn0M_n \to 0 to uniform, warna nahi. Classic example xnx^n on [0,1][0,1]: pointwise limit 00 banta hai except x=1x=1 pe jaha 11, isliye limit discontinuous ho jaata hai aur Mn=1M_n=1 hamesha — to uniform NAHI. Lekin agar domain [0,a][0,a] le lo (a<1a<1), to Mn=an0M_n=a^n\to0, uniform ho gaya. Matlab uniformity domain pe bhi depend karti hai, sirf formula pe nahi.

Yeh important kyu? Kyunki uniform convergence "strong glue" hai — agar har fnf_n continuous hai aur convergence uniform hai, to limit ff bhi continuous rahega (famous ε/3\varepsilon/3 proof). Saath hi integral aur limit ko swap kar sakte ho: fnf\int f_n \to \int f. Pointwise me yeh guarantees nahi milti — corner ya jump sneak kar sakta hai. Exam tip: pehle pointwise limit ff nikaalo, fir MnM_n ka sup lo — bas yahi 80/20 hai.

Go deeper — visual, from zero

Test yourself — Advanced Topics (Elite Level)