Intuition The big picture
We have a sequence of functions f 1 , f 2 , f 3 , … f_1, f_2, f_3, \dots f 1 , f 2 , f 3 , … and we ask: do they "settle down" to a limit function f f f ? There are two strengths of settling down:
Pointwise : at each x x x separately, the numbers f n ( x ) f_n(x) f n ( x ) converge to f ( x ) f(x) f ( x ) . Each point may converge at its own pace.
Uniform : all points converge together, at one shared pace. There is a single "error budget" ε \varepsilon ε that fits the whole graph eventually.
WHY we care: pointwise convergence is too weak to carry nice properties (continuity, integrability, limits) across to the limit. Uniform convergence is the strong glue that lets you swap limits, integrals and derivatives.
Definition Pointwise convergence
f n → f f_n \to f f n → f pointwise on a set E E E means: for every x ∈ E x\in E x ∈ E and every ε > 0 \varepsilon>0 ε > 0 , there exists N N N (allowed to depend on both x x x and ε \varepsilon ε ) such that
n ≥ N ⟹ ∣ f n ( x ) − f ( x ) ∣ < ε . n\ge N \implies |f_n(x)-f(x)| < \varepsilon. n ≥ N ⟹ ∣ f n ( x ) − f ( x ) ∣ < ε .
Key phrase: N = N ( ε , = = x = = ) N = N(\varepsilon, ==x==) N = N ( ε , == x == ) .
Definition Uniform convergence
f n → f f_n \to f f n → f uniformly on E E E means: for every ε > 0 \varepsilon>0 ε > 0 , there exists N N N (depending on ε \varepsilon ε only ) such that
n ≥ N ⟹ ∣ f n ( x ) − f ( x ) ∣ < ε for ALL x ∈ E . n\ge N \implies |f_n(x)-f(x)| < \varepsilon \quad \text{for ALL } x\in E. n ≥ N ⟹ ∣ f n ( x ) − f ( x ) ∣ < ε for ALL x ∈ E .
Key phrase: N = N ( ε ) N = N(\varepsilon) N = N ( ε ) , one N N N works for every x x x at once.
Intuition WHY a sup test exists
"∣ f n ( x ) − f ( x ) ∣ < ε |f_n(x)-f(x)|<\varepsilon ∣ f n ( x ) − f ( x ) ∣ < ε for all x x x " is exactly the statement that the largest gap over the whole set is below ε \varepsilon ε . The largest gap is the supremum. So uniform convergence = the supremum of the gap goes to 0 0 0 .
f n ( x ) = x n f_n(x)=x^n f n ( x ) = x n on [ 0 , 1 ] [0,1] [ 0 , 1 ]
Step 1 — find pointwise limit. Why? We must know f f f before testing uniformity.
For 0 ≤ x < 1 0\le x<1 0 ≤ x < 1 : x n → 0 x^n\to 0 x n → 0 .
For x = 1 x=1 x = 1 : 1 n = 1 → 1 1^n = 1\to 1 1 n = 1 → 1 .
So f ( x ) = { 0 0 ≤ x < 1 1 x = 1 f(x)=\begin{cases}0 & 0\le x<1\\ 1 & x=1\end{cases} f ( x ) = { 0 1 0 ≤ x < 1 x = 1 .
Step 2 — note f f f is discontinuous at x = 1 x=1 x = 1 , even though every f n f_n f n is continuous. Why this matters: if convergence were uniform, the limit would have to be continuous (Theorem in §4). The break is our clue it is NOT uniform.
Step 3 — compute M n M_n M n . Why? Direct sup test.
M n = sup x ∈ [ 0 , 1 ] ∣ x n − f ( x ) ∣ . M_n=\sup_{x\in[0,1]}|x^n - f(x)|. M n = sup x ∈ [ 0 , 1 ] ∣ x n − f ( x ) ∣.
For x ∈ [ 0 , 1 ) x\in[0,1) x ∈ [ 0 , 1 ) the gap is x n x^n x n , whose sup as x → 1 − x\to 1^- x → 1 − is 1 1 1 . So M n = 1 M_n=1 M n = 1 for all n n n .
Since M n = 1 ↛ 0 M_n=1\not\to 0 M n = 1 → 0 , convergence is not uniform . ■ \blacksquare ■
Forecast-then-verify: Before computing, you might guess "it converges nicely to 0 0 0 ." The hidden trouble is the point sneaking toward x = 1 x=1 x = 1 , where x n x^n x n stays near 1 1 1 . The sup catches that point.
f n ( x ) = x n f_n(x)=x^n f n ( x ) = x n on [ 0 , a ] [0,a] [ 0 , a ] with 0 < a < 1 0<a<1 0 < a < 1
Here M n = sup x ∈ [ 0 , a ] x n = a n → 0 M_n=\sup_{x\in[0,a]}x^n = a^n \to 0 M n = sup x ∈ [ 0 , a ] x n = a n → 0 . So uniform on [ 0 , a ] [0,a] [ 0 , a ] .
Why this step: on a set bounded away from 1 1 1 , the troublesome point is excluded, the sup is attained at x = a x=a x = a , and a n → 0 a^n\to0 a n → 0 . Moral: uniformity depends on the domain , not just the formula.
f n ( x ) = sin ( n x ) n f_n(x)=\dfrac{\sin(nx)}{n} f n ( x ) = n sin ( n x ) on R \mathbb{R} R
Pointwise limit: ∣ f n ( x ) ∣ ≤ 1 / n → 0 |f_n(x)|\le 1/n\to 0 ∣ f n ( x ) ∣ ≤ 1/ n → 0 , so f = 0 f=0 f = 0 . Then
M n = sup x ∣ sin n x n ∣ = 1 n → 0. M_n=\sup_x \left|\tfrac{\sin nx}{n}\right| = \tfrac1n \to 0. M n = sup x n s i n n x = n 1 → 0.
Uniform on all of R \mathbb{R} R . Why this step: the bound 1 / n 1/n 1/ n is independent of x x x , which is the hallmark of uniformity. (Note: derivatives f n ′ ( x ) = cos ( n x ) f_n'(x)=\cos(nx) f n ′ ( x ) = cos ( n x ) do NOT converge — uniform convergence of f n f_n f n does not give convergence of f n ′ f_n' f n ′ .)
Common mistake "Pointwise + each
f n f_n f n continuous ⇒ f \Rightarrow f ⇒ f continuous."
Why it feels right: continuity seems like it should "carry over" to a limit. The fix: pointwise lets each point converge at its own speed, so a corner can sneak in (see x n x^n x n giving a jump at 1 1 1 ). Only uniform convergence preserves continuity. Steel-man it: the intuition is correct if you add uniformity.
M n → 0 M_n\to 0 M n → 0 only needs to hold for the limit you guessed."
Why it feels right: you compute f f f first then sup ∣ f n − f ∣ \sup|f_n-f| sup ∣ f n − f ∣ . The fix: that's correct — but you must use the true pointwise limit f f f , not a convenient one. Using the wrong f f f gives a wrong M n M_n M n . Always find f f f pointwise first.
Common mistake "Uniform convergence of
f n f_n f n implies uniform/any convergence of f n ′ f_n' f n ′ ."
Why it feels right: if functions are close, surely slopes are close. The fix: sin ( n x ) / n → 0 \sin(nx)/n\to 0 sin ( n x ) / n → 0 uniformly but cos ( n x ) \cos(nx) cos ( n x ) diverges. Differentiation amplifies high-frequency wiggles. Need a separate theorem (uniform convergence of f n ′ f_n' f n ′ + one converging point).
Recall Active recall — cover the answers
State both definitions; what's the ONE difference? ::: Quantifier order; N ( ε , x ) N(\varepsilon,x) N ( ε , x ) vs N ( ε ) N(\varepsilon) N ( ε ) .
The single computational test for uniformity? ::: M n = sup x ∣ f n − f ∣ → 0 M_n=\sup_x|f_n-f|\to 0 M n = sup x ∣ f n − f ∣ → 0 .
Why is x n x^n x n on [ 0 , 1 ] [0,1] [ 0 , 1 ] not uniform? ::: M n = 1 M_n=1 M n = 1 always; limit is discontinuous at 1 1 1 .
Recall Feynman: explain to a 12-year-old
Imagine a class of runners (each x x x is a runner) all heading to a finish line f ( x ) 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.
Pointwise convergence — the weaker cousin.
Weierstrass M-test — sufficient condition for uniform convergence of series.
Continuity preserved under uniform limits — the ε / 3 \varepsilon/3 ε /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) 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) N = N ( ε , x ) ; uniform requires one
N = N ( ε ) N=N(\varepsilon) N = N ( ε ) for all
x x x .
Sup-norm test for uniform convergence f n → f f_n\to f f n → f uniformly
⟺ M n = sup x ∣ f n ( x ) − f ( x ) ∣ → 0 \iff M_n=\sup_x|f_n(x)-f(x)|\to 0 ⟺ M n = sup x ∣ f n ( x ) − f ( x ) ∣ → 0 .
Is x n x^n x n uniformly convergent on [ 0 , 1 ] [0,1] [ 0 , 1 ] ? No;
M n = 1 M_n=1 M n = 1 for all
n n n and the limit jumps at
x = 1 x=1 x = 1 .
Is x n x^n x n uniformly convergent on [ 0 , a ] [0,a] [ 0 , a ] , a < 1 a<1 a < 1 ? Yes;
M n = a n → 0 M_n=a^n\to0 M n = a n → 0 .
Which property does uniform (not pointwise) convergence preserve? Continuity of the limit function (also integral interchange).
Counterexample that uniform conv. of f n f_n f n doesn't give conv. of f n ′ f_n' f n ′ f n = sin ( n x ) / n → 0 f_n=\sin(nx)/n\to0 f n = sin ( n x ) / n → 0 uniformly but
f n ′ = cos ( n x ) f_n'=\cos(nx) f n ′ = cos ( n x ) diverges.
Uniform Cauchy criterion statement Uniform convergence
⟺ ∀ ε ∃ N : m , n ≥ N ⇒ sup x ∣ f n − f m ∣ < ε \iff \forall\varepsilon\,\exists N: m,n\ge N\Rightarrow\sup_x|f_n-f_m|<\varepsilon ⟺ ∀ ε ∃ N : m , n ≥ N ⇒ sup x ∣ f n − f m ∣ < ε .
Why does ∫ f n → ∫ f \int f_n\to\int f ∫ f n → ∫ f under uniform conv.? ∣ ∫ f n − ∫ f ∣ ≤ ( b − a ) M n → 0 |\int f_n-\int f|\le(b-a)M_n\to0 ∣ ∫ f n − ∫ f ∣ ≤ ( b − a ) M n → 0 .
fails, limit discontinuous
Quantifiers: for all x, exists N
Quantifiers: exists N, for all x
Sup-norm criterion Mn to 0
Continuity, integrals, limits
Intuition Hinglish mein samjho
Dekho, function sequence f n f_n f n ka convergence do flavour me aata hai. Pointwise me har point x x x apni alag speed se limit tak pahunchta hai — kisi point ke liye jaldi, kisi ke liye bahut der. Yaha N N N depend karta hai ε \varepsilon ε aur x x x dono pe. Uniform me ek single N N N hota hai jo saare points ke liye ek saath kaam karta hai — bas ε \varepsilon ε pe depend, x x x 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: M n = sup x ∣ f n ( x ) − f ( x ) ∣ M_n = \sup_x |f_n(x)-f(x)| M n = sup x ∣ f n ( x ) − f ( x ) ∣ nikaalo. Agar M n → 0 M_n \to 0 M n → 0 to uniform, warna nahi. Classic example x n x^n x n on [ 0 , 1 ] [0,1] [ 0 , 1 ] : pointwise limit 0 0 0 banta hai except x = 1 x=1 x = 1 pe jaha 1 1 1 , isliye limit discontinuous ho jaata hai aur M n = 1 M_n=1 M n = 1 hamesha — to uniform NAHI. Lekin agar domain [ 0 , a ] [0,a] [ 0 , a ] le lo (a < 1 a<1 a < 1 ), to M n = a n → 0 M_n=a^n\to0 M n = a n → 0 , 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 f n f_n f n continuous hai aur convergence uniform hai, to limit f f f bhi continuous rahega (famous ε / 3 \varepsilon/3 ε /3 proof). Saath hi integral aur limit ko swap kar sakte ho: ∫ f n → ∫ f \int f_n \to \int f ∫ f n → ∫ f . Pointwise me yeh guarantees nahi milti — corner ya jump sneak kar sakta hai. Exam tip: pehle pointwise limit f f f nikaalo, fir M n M_n M n ka sup lo — bas yahi 80/20 hai.