4.10.24 · D3 · Maths › Advanced Topics (Elite Level) › Uniform convergence of function sequences
Intuition Yeh page kis kaam aati hai
Parent note ne tumhe definitions aur ek classic counterexample diya tha. Yahan hum har tarah ki situation ko dhundhte hain jo ek uniform-convergence problem mein aa sakti hai, aur har ek ko poora solve karte hain. Iske baad tumne dekh liya hoga har trap ki shape.
Ek hi tool hai jo hum poore time use karte hain — woh hai uniform deviation :
M n := sup x ∈ E ∣ f n ( x ) − f ( x ) ∣ , f n → f uniformly ⟺ M n → 0.
sup x ∈ E ka matlab hai "uske daaye wali cheez ki sabse badi value, jab x poore domain E par ghoomta hai" (supremum ek least upper bound hai — graph ke gap ka sabse upar wala point). Pehle hume sahi pointwise limit f nikalni hoti hai (dekho Pointwise convergence ), kyunki M n usi f ke against measure hota hai.
Har uniform-convergence exercise inhi cells mein se kisi ek mein aati hai. Neeche ke examples un cells ke saath tagged hain jo woh cover karte hain.
Cell
Situation
Kya galat ho sakta hai / kya dekhna hai
A
Limit continuous hai, convergence uniform hai
benign — M n ko ek x se independent formula se bound karo
B
Limit discontinuous hai ⇒ kabhi uniform nahi
jump failure ki pehchaan hai
C
Ek travelling bump (max domain par chhup ke jaata hai)
M n constant reh sakta hai bhi jab f ≡ 0 ho
D
Uniformity domain par depend karti hai (E par fail, E ′ ⊂ E par hold)
trouble point se door ho jaao
E
Degenerate / zero input: x = 0 , endpoints, f n already = f
check karo ki trivial points sup ko todte toh nahi
F
Limiting behaviour : sup calculus se milta hai (derivative se max dhundho)
locate karo ki peak step n par kahan hai
G
Series case — Cauchy / Weierstrass M-test use karo bina f jaane
har term ko ek summable constant se bound karo
H
Word problem / real-world framing (ek "error budget" deadline)
"sab users ke liye ek saath" = uniform translate karo
I
Exam twist : convergence uniform hai lekin derivatives/integrals behave nahi karte
f n ka uniform ≠ f n ′ ka uniform
Neeche ke chhe figures cells B, C, D, F ki geometry dikhate hain.
f n ( x ) = n x on [ 0 , 1 ]
Forecast: Abhi andaza lagao — kya poora graph ek shared pace se 0 par flatten hota hai, ya koi point peechhe reh jaata hai?
Step 1. Pointwise limit nikalo.
Yeh step kyun? Bina f jaane hum gap measure nahi kar sakte. Har fixed x ke liye, n x → 0 jab n → ∞ , toh f ( x ) = 0 .
Step 2. Gap likho.
Yeh step kyun? M n , ∣ f n − f ∣ ka sup hai. Yahan ∣ f n ( x ) − f ( x ) ∣ = n x − 0 = n x .
Step 3. x ∈ [ 0 , 1 ] par sup lo.
Yeh step kyun? n x , x mein increase karta hai, toh sabse badi value right endpoint x = 1 par hai:
M n = sup x ∈ [ 0 , 1 ] n x = n 1 .
Step 4. M n → 0 test karo. n 1 → 0 , toh convergence uniform hai. ✅
Verify: Bound n 1 mein x ka koi zikr nahi — yahi uniformity ki pehchaan hai. Ek value sanity check karo: n = 100 par, koi bhi point 0.01 se zyada deviate nahi karta; poora graph half-width 0.01 ke ek horizontal band ke andar hai.
f n ( x ) = 1 + x 2 n 1 on [ 0 , 2 ]
Forecast: Har f n ek smooth bump hai. Limit ki shape guess karo — kya woh smooth rehti hai?
Step 1. Pointwise limit — x ki size ke hisaab se split karo.
Yeh step kyun? x 2 n ka behavior x < 1 , x = 1 , x > 1 ke liye bilkul alag hai, toh hume case-split karni hogi.
0 ≤ x < 1 : x 2 n → 0 , toh f n → 1 + 0 1 = 1 .
x = 1 : x 2 n = 1 , toh f n = 2 1 sab n ke liye; limit = 2 1 .
1 < x ≤ 2 : x 2 n → ∞ , toh f n → 0 .
Toh f ( x ) = ⎩ ⎨ ⎧ 1 2 1 0 0 ≤ x < 1 x = 1 1 < x ≤ 2 — x = 1 par ek jump hai.
Step 2. Continuity theorem ka contrapositive lagao.
Yeh step kyun? Har f n continuous hai. Agar convergence uniform hoti, toh limit bhi continuous hoti . Woh nahi hai — x = 1 par jump karta hai. Isliye convergence uniform nahi hai. ❌
Step 3. M n se directly confirm karo.
Yeh step kyun? Hume ek doosra, computational witness chahiye. x → 1 − se approach karo: wahan f ( x ) = 1 hai lekin f n ( x ) = 1 + x 2 n 1 , 2 1 ki taraf dip karta hai. Exactly x = 1 par, ∣ f n ( 1 ) − f ( 1 ) ∣ = ∣ 2 1 − 2 1 ∣ = 0 , lekin 1 se thoda left mein gap 2 1 tak chadh jaata hai. Toh M n ≥ 2 1 sab n ke liye, isliye M n → 0 .
Verify: Do independent arguments (discontinuity + sup) agree karte hain. Figure mein dekho: curves 1 ke paas rehti hain phir plunge karti hain, aur woh plunge kabhi ek step mein sharpen nahi hoti jise tum ek patle band mein trap kar sako.
f n ( x ) = n x e − n x on [ 0 , ∞ )
Forecast: Har fixed x > 0 ke liye yeh → 0 jaata hai (exponential factor n ko beat karta hai). Toh f ≡ 0 . Kya iska matlab uniform hai? Aage padhne se pehle guess karo.
Step 1. Pointwise limit.
Yeh step kyun? x = 0 par, f n ( 0 ) = 0 . Fixed x > 0 ke liye, e − n x exponentially decay karta hai jabki n x sirf linearly badhta hai, toh n x e − n x → 0 . Isliye f ( x ) = 0 har jagah.
Step 2. Derivative se f n ki peak locate karo.
Yeh step kyun? M n = sup x n x e − n x ; graph sabse upar kahan hai yeh jaanne ke liye derivative zero karte hain — yahi calculus tool hai jo answer deta hai "maximum kahan hai?"
d x d ( n x e − n x ) = n e − n x ( 1 − n x ) = 0 ⟹ x n = n 1 .
Peak x n = n 1 par hai, jo n badhne ke saath 0 ki taraf slide karta hai — ek moving bump.
Step 3. Peak ki height.
Yeh step kyun? x n = n 1 wapas plug karo:
M n = n ⋅ n 1 ⋅ e − n ⋅ n 1 = e − 1 ≈ 0.368.
Step 4. Test karo. M n = e − 1 → 0 . [ 0 , ∞ ) par Not uniform . ❌
Verify: Figure dekho — har curve ki height same 1/ e hai, bas peak left ki taraf march kar rahi hai. 1/ e se kam height ka koi bhi horizontal band kabhi saari tails contain nahi kar sakta. Numerically e − 1 = 0.3679 , n mein constant.
f n ( x ) = n x e − n x , ab [ δ , ∞ ) par fixed δ > 0 ke saath
Forecast: Hum abhi [ 0 , ∞ ) par fail ho gaye kyunki bump x = 0 tak pahunchti hai. Agar hum x ko 0 ke paas jaane se rok dein, toh kya hum jeet sakte hain?
Step 1. Peak δ ke relative kahan hai?
Yeh step kyun? Unconstrained peak x n = n 1 par hai. Jab n > δ 1 (yaani n 1 < δ ), peak domain se bahar slide ho jaati hai — woh δ ke left mein hai. [ δ , ∞ ) par function n x e − n x tab decreasing hai, toh uska sup left endpoint x = δ par hai.
Step 2. Sup evaluate karo.
Yeh step kyun? n > δ 1 ke liye,
M n = n δ e − n δ .
Step 3. Limit lo.
Yeh step kyun? e − n δ , n mein exponentially decay karta hai aur linear n δ ko crush kar deta hai, toh n δ e − n δ → 0 . [ δ , ∞ ) par Uniform. ✅
Verify: Same formula, ulta verdict — yahi moral hai parent ke x n examples se: uniformity (function, domain) pair ki ek property hai. Numerically δ = 1 ke saath: M 5 = 5 e − 5 ≈ 0.0337 , M 10 = 10 e − 10 ≈ 4.54 × 1 0 − 4 — clearly 0 ki taraf ja raha hai.
f n ( x ) = x 2 + n 1 x 2 on R , x = 0 par special dhyan ke saath
Forecast: x = 0 par formula 0 + 1/ n 0 = 0 deta hai har n ke liye — ek point jahan f n kabhi hilta nahi. Kya woh akela point trouble deta hai?
Step 1. Pointwise limit.
Yeh step kyun? x = 0 ke liye, n → ∞ mein n 1 → 0 , toh x 2 x 2 = 1 milta hai. x = 0 par hamesha 0 hai. Toh
f ( x ) = { 1 0 x = 0 x = 0 ,
0 par ek removable-looking discontinuity hai.
Step 2. Degenerate point.
Yeh step kyun? Hume confirm karna hai ki sup accidentally x = 0 se tame toh nahi ho gaya. x = 0 par, ∣ f n − f ∣ = ∣0 − 0∣ = 0 — harmless. Danger 0 ke paas hai, par nahi.
Step 3. Trouble point ke paas M n compute karo.
Yeh step kyun? Chhote x = 0 ke liye, f ( x ) = 1 hai lekin f n ( x ) = x 2 + 1/ n x 2 ko x tiny leke 0 ke close kiya ja sakta hai (e.g. x = n 1 deta hai 1/ n + 1/ n 1/ n = 2 1 , toh gap 2 1 hai). Isliye M n ≥ 2 1 sab n ke liye.
Step 4. Verdict. M n → 0 : R par not uniform (aur discontinuous limit ne Cell B ke through pehle hi bata diya tha). ❌
Verify: Isolated degenerate point x = 0 gap 0 contribute karta hai aur red herring hai; asli killer uske aas-paas ka neighbourhood hai. Sanity: x = 1/ n par, f n = 1/2 exactly, gap = 1/2 , kisi bhi n ke liye confirmed.
S ( x ) = k = 1 ∑ ∞ k 2 cos ( k x ) on R ; dikhao ki partial sums uniformly converge karte hain.
Forecast: Hume S ( x ) closed form mein pata nahi . Kya hum phir bhi uniform convergence prove kar sakte hain? Guess karo kaunsa tool limit jaane ki zaroorat ko bypass karta hai.
Step 1. Har term ko x se independent bound karo.
Yeh step kyun? Weierstrass M-test kehta hai: agar ∣ u k ( x ) ∣ ≤ M k sab x ke liye aur ∑ M k < ∞ , toh series uniformly converge karti hai. Hume aisi constants M k chahiye. Kyunki ∣ cos ( k x ) ∣ ≤ 1 ,
k 2 c o s ( k x ) ≤ k 2 1 =: M k .
Step 2. Check karo ki constant series converge kare.
Yeh step kyun? M-test ko ∑ M k < ∞ chahiye. Yahan ∑ k ≥ 1 k 2 1 = 6 π 2 < ∞ (Basel sum).
Step 3. Conclude karo.
Yeh step kyun? Dono hypotheses hold karti hain, toh ∑ k 2 c o s k x poore R par uniformly converge karta hai. Kyunki har term continuous hai, S bhi continuous hai. ✅
Verify: Koi bhi pointwise limit kabhi compute nahi ki — yahi M-test ki poori power hai (yeh actually uniform Cauchy criterion disguise mein hai: tail ∑ k > N k 2 1 ek uniform, x -free bound hai). Numerically k = 11 se aage ka tail ≤ ∑ k = 11 ∞ k − 2 ≈ 0.0952 hai, aur yeh shrink karta rehta hai.
Worked example Ek signal reconstruction approximations
f n ( t ) = f ( t ) + n r sin ( ω t ) har receiver ko time-index t par bhejta hai. Engineering spec: error ε = 0.001 se kam honi chahiye sab receivers ke liye simultaneously. Amplitude r = 2 lo. Kis n ke baad spec meet hoti hai?
Forecast: Kya ek deadline N hai jo sab t ke liye satisfy ho, ya har t ko apna alag time wait karna padta hai?
Step 1. Deviation identify karo.
Yeh step kyun? "t par error" hai ∣ f n ( t ) − f ( t ) ∣ = n r ∣ sin ( ω t ) ∣ . Worst receiver woh hai jahan ∣ sin ω t ∣ = 1 , toh
M n = sup t n r ∣ sin ω t ∣ = n r = n 2 .
Yeh bound t se free hai — ek uniform situation (structurally Cell A), isliye ek single deadline exist kar sakti hai.
Step 2. Budget solve karo.
Yeh step kyun? Hume M n < ε chahiye: n 2 < 0.001 ⟹ n > 2000 . Toh n ≥ 2001 .
Step 3. Interpret karo. Ek shared N = 2001 , har receiver ko satisfy karta hai — parent ki Feynman story se "single stopwatch" ki picture. ✅
Verify: n = 2001 par, worst-case error = 2001 2 ≈ 9.995 × 1 0 − 4 < 1 0 − 3 . n = 2000 par, 2000 2 = 1 0 − 3 , strictly kam nahi hai, toh 2000 strict spec fail karta hai — boundary matter karti hai.
f n ( x ) = n sin ( n 2 x ) on R . Kya f n → f uniform hai? Kya f n ′ → f ′ ?
Forecast: Amplitude n 1 shrink hota hai — uniform lagta hai. Lekin frequency n 2 fast badhti hai. Slopes ka kya hoga guess karo.
Step 1. f n ki uniform convergence.
Yeh step kyun? ∣ f n ( x ) ∣ ≤ n 1 sab x ke liye, toh f = 0 pointwise aur M n = sup x n ∣ s i n n 2 x ∣ = n 1 → 0 . Uniform. ✅
Step 2. Derivative sequence.
Yeh step kyun? Differentiation inner frequency se multiply karta hai: f n ′ ( x ) = n n 2 cos ( n 2 x ) = n cos ( n 2 x ) . x = 0 par: f n ′ ( 0 ) = n → ∞ . Toh f n ′ diverge karta hai, buri tarah se. ❌
Step 3. Moral.
Yeh step kyun? f n ki uniform convergence f n ′ ke baare mein kuch nahi kehti; differentiation high-frequency wiggles ko amplify karta hai (parent ki teesri galti). f n ′ → f ′ conclude karne ke liye ek alag theorem chahiye: f n ′ ki uniform convergence plus ek point par convergence.
Verify: f n → 0 uniformly (amplitude 1/ n ) lekin f n ′ ( 0 ) = n → ∞ . ∫ se contrast karo: kyunki convergence uniform hai, integrals limit ke paas jaate hain — sirf differentiation fail karta hai.
Recall Kaunsi cell, kaunsa test? (answers cover karo)
Limit discontinuous nikle — verdict? ::: Automatically not uniform (Cell B), koi sup computation zaroor nahi.
Pointwise limit 0 hai lekin bump travel karta hai — M n aksar kya hota hai? ::: Ek constant jaise e − 1 jo kabhi → 0 nahi karta (Cell C/F); derivative se peak dhundho.
Same formula E par fail, chhote E ′ par hold — iska naam kya hai? ::: Domain-dependence (Cell D); trouble point ko exclude karo.
Series, closed-form limit nahi — tool kya hai? ::: Weierstrass M-test / uniform Cauchy (Cell G).
Uniform f n lekin wild f n ′ — allowed hai? ::: Haan (Cell I); differentiation ko apna alag theorem chahiye.
f pointwise nikalo → phir peak dhundho (zaroorat ho toh derivative se) → M n padho → kya woh 0 tak pahunchta hai? Peak wahi hai jahan poori kahani rehti hai.
Parent: Uniform convergence
Pointwise convergence — hamesha pehle compute hota hai.
Weierstrass M-test — Example 6.
Continuity preserved under uniform limits — Example 2 ka shortcut.
Interchange of limit and integral / Dominated convergence theorem — Example 8 ka contrast.
Cauchy sequences in metric spaces — M-test ka engine.
Equicontinuity and Arzelà–Ascoli .