4.9.15 · Maths › Probability Theory & Statistics
Intuition Bada picture (YEH kyun exist karta hai)
Individual random events messy aur unpredictable hote hain. Lekin jab aap unme se bahut saare ko average karte ho , toh woh messiness ek bahut specific tarike se cancel out ho jaati hai: average true mean ke aas-paas hilta hai, aur woh hilna hamesha Gaussian hota hai , chahe original mess kaisi bhi shape ki ho. CLT hi woh mathematical wajah hai jis se bell curve har jagah dikhta hai — heights, measurement errors, polling results, casino profits. Yeh "main ek cheez predict nahi kar sakta" aur "main aggregate almost exactly predict kar sakta hoon" ke beech ka bridge hai.
Definition Classical (Lindeberg–Lévy) CLT
Maano X 1 , X 2 , … , X n i.i.d. (independent, identically distributed) random variables hain jinka finite mean μ = E [ X i ] aur finite variance σ 2 = Var ( X i ) > 0 hai. Maano X ˉ n = n 1 ∑ i = 1 n X i . Toh standardized sample mean
Z n = σ / n X ˉ n − μ = σ n ∑ i = 1 n X i − n μ
distribution mein standard normal ki taraf converge karta hai:
Z n d N ( 0 , 1 ) , i.e. P ( Z n ≤ z ) → Φ ( z ) for all z .
HAR piece ka matlab:
X ˉ n − μ : sample average truth se kitna door hai.
σ / n se divide karna: X ˉ n ka standard deviation exactly σ / n hota hai (yeh standard error hai), toh hum rescale kar rahe hain taaki spread hamesha 1 ho.
Limit X i ki shape ki parwah nahi karta — sirf yahi chahiye ki mean aur variance finite hon.
Intuition Characteristic functions kyun?
Ek characteristic function (CF) φ X ( t ) = E [ e i tX ] distribution ki "fingerprint" hoti hai: do distributions equal hain iff unki CFs equal hain, aur — sabse important baat — CFs independent sums ke under multiply hoti hain jabki densities ka messy convolution simple multiplication ban jaata hai. CFs ka convergence (pointwise) distribution mein convergence imply karta hai (Lévy's continuity theorem). Toh hum sirf ek function track karte hain.
Step 1 — Center aur scale karo. Define karo Y i = σ X i − μ . Toh E [ Y i ] = 0 , Var ( Y i ) = 1 , aur
Z n = n 1 ∑ i = 1 n Y i .
Yeh step kyun? Isse μ , σ remove ho jaate hain taaki hum sirf standardized case prove kar sakein; algebra cleaner ho jaati hai.
Step 2 — Independence use karke CF ko factor karo.
φ Z n ( t ) = E [ exp ( i t n 1 ∑ Y i ) ] = ∏ i = 1 n E [ e i ( t / n ) Y i ] = [ φ Y ( n t ) ] n .
Yeh step kyun? Independence ⇒ product ki expectation = expectations ka product; identical distribution ⇒ sab factors equal hain, isse n -th power milta hai.
Step 3 — CF ko 0 ke paas Taylor-expand karo. Kyunki E [ Y ] = 0 , E [ Y 2 ] = 1 ,
φ Y ( s ) = 1 + i s E [ Y ] − 2 s 2 E [ Y 2 ] + o ( s 2 ) = 1 − 2 s 2 + o ( s 2 ) .
Yeh step kyun? Pehle do moments hi woh data hain jo CLT use karta hai; baaki sab n → ∞ par vanish ho jaate hain. s = t / n rakhte hain:
φ Y ( n t ) = 1 − 2 n t 2 + o ( n 1 ) .
Step 4 — n -th power ki limit lo.
φ Z n ( t ) = ( 1 − 2 n t 2 + o ( n 1 ) ) n n → ∞ e − t 2 /2 .
Yeh step kyun? Classic limit ( 1 + n a n ) n → e a jab a n → a , yahan a = − t 2 /2 hai.
Step 5 — Limit ko pehchano. e − t 2 /2 exactly N ( 0 , 1 ) ki CF hai. Lévy's continuity theorem se, Z n d N ( 0 , 1 ) . ■
Recall Proof ko 5 words mein reconstruct karo
Standardize. 2) Independence factors CF. 3) Taylor to second moment. 4) ( 1 − 2 n t 2 ) n → e − t 2 /2 . 5) That's N ( 0 , 1 ) 's CF.
Intuition Goldilocks normalization
Var ( ∑ X i ) = n σ 2 , toh SD ( ∑ X i ) = σ n . Ek stable, non-degenerate limit paane ke liye deviation ko uski SD se divide karna padta hai — jo n ki tarah grow karti hai.
∑ ( X i − μ ) ko n se divide karo → 0 ho jaata hai (yeh Law of Large Numbers hai, bahut zyada squashing).
1 se divide karo → ∞ par blow up ho jaata hai.
n se divide karo → bilkul sahi , N ( 0 , σ 2 ) mein settle ho jaata hai.
Worked example 1. 100 dice rolls ka sum
Ek fair die ka μ = 3.5 , σ 2 = 12 35 ≈ 2.9167 , toh σ ≈ 1.708 . n = 100 baar roll karo; S = ∑ X i .
E [ S ] = 100 ⋅ 3.5 = 350 . Kyun: mean add hote hain.
Var ( S ) = 100 ⋅ 2.9167 = 291.67 , SD = 17.08 . Kyun: independent variables ke variances add hote hain.
P ( S > 380 ) ? Standardize karo: z = 17.08 380 − 350 = 1.756 . Kyun: table use karne ke liye N ( 0 , 1 ) mein convert karo.
P ( S > 380 ) ≈ 1 − Φ ( 1.756 ) ≈ 0.0395 . Original distribution (discrete, flat) sirf 100 terms ke baad ek smooth bell ban gayi.
Worked example 2. Exponential ka sample mean (bahut skewed!)
X i ∼ Exp ( λ = 2 ) : μ = 1/ λ = 0.5 , σ = 1/ λ = 0.5 . n = 50 lo, P ( X ˉ > 0.6 ) nikalo.
Standard error = σ / n = 0.5/ 50 = 0.0707 . Kyun: mean ki SD 1/ n ki tarah shrink karti hai.
z = 0.0707 0.6 − 0.5 = 1.414 . Kyun: sample mean ko standardize karo.
P ( X ˉ > 0.6 ) ≈ 1 − Φ ( 1.414 ) ≈ 0.0786 . Chahe Exp heavily right-skewed ho, unke 50 ka mean nicely normal hota hai.
Worked example 3. Binomial ka normal approximation (de Moivre–Laplace)
X ∼ Bin ( n = 200 , p = 0.3 ) , 200 i.i.d. Bernoulli( 0.3 ) ka ∑ hai. μ = n p = 60 , σ = n p ( 1 − p ) = 42 = 6.48 .
P ( X ≤ 50 ) continuity correction ke saath: z = 6.48 50.5 − 60 = − 1.466 . Continuity correction kyun? Ek discrete count ko continuous bell se approximate kiya jaata hai; bar ki width capture karne ke liye 0.5 shift karo.
≈ Φ ( − 1.466 ) ≈ 0.071 .
Common mistake "CLT kehta hai ki
data normal ho jaata hai jab n badhta hai."
Kyun sahi lagta hai: log "normal" + "large sample" dekhte hain aur unhe merge kar dete hain. Sachchi baat: raw data hamesha ke liye apni original distribution rakhta hai. Yeh mean/sum ki sampling distribution (ek derived quantity) hai jo normal ban jaati hai. Exponentials ke ek bade sample ka histogram fir bhi exponential hi rahega.
X i normal hone ki zaroorat hai."
Kyun sahi lagta hai: conclusion normal hai, toh input bhi hoga. Fix: poora point yahi hai ki input kuch bhi ho sakta hai finite variance ke saath (dice, coins, exponentials). Normality averaging se emerge hoti hai.
Common mistake "Zyada data hamesha better normal approximation deta hai, distribution chahe jo bhi ho."
Kyun sahi lagta hai: "n → ∞ " se universality lagti hai. Fix: convergence real hai any finite variance ke liye, lekin bahut skewed ya heavy-tailed distributions ko bahut bada n chahiye. Agar σ 2 = ∞ (jaise Cauchy), toh CLT bilkul fail ho jaata hai — mean stabilize bhi nahi hota.
Common mistake Discrete sums ke liye continuity correction bhool jaana.
Kyun sahi lagta hai: formula raw cutoff k use karta hai. Fix: P ( X ≤ k ) ke liye k + 0.5 use karo; P ( X ≥ k ) ke liye k − 0.5 . Yeh 0.5 continuous curve ke neeche discrete bar ki width account karta hai.
Intuition CLT se kya milta hai
Inference: Confidence intervals X ˉ ± z α /2 n σ aur t -tests, z -tests isi par based hain.
Estimate ki quality: error 1/ n ki tarah shrink hoti hai — apna error aadha karne ke liye 4× data chahiye ("diminishing returns" of sampling).
Bell curve ki universality: explain karta hai kyun measurement noise (bahut saare chote effects ka sum) Gaussian hoti hai.
Monte Carlo: simulation error bars CLT se aate hain.
Mnemonic Recipe yaad karo:
"SS² over √n"
S tandardize karo, S um ka variance n σ 2 use karo, deviation ko σ n se divide karo. Ya: "Bahut saare add karo, root-n se divide karo, bell milti hai."
Recall Feynman: ek 12-saal ke bacche ko explain karo
Socho school ke har bacche ne ek jar mein candies ki number guess ki. Ek bacche ki guess wild hai — bahut door. Lekin agar aap pure school ki guesses ka average lo, toh jo guesses bahut zyada thi aur jo bahut kam thi woh cancel ho jaati hain, aur average sachchi number ke paas pahunch jaata hai. Central Limit Theorem ek aur magical baat kehta hai: agar aap bahut saare alag-alag schools imagine karo jo apna-apna average banayein, toh woh averages, jab plot karo, hamesha ek smooth hill shape banate hain — "bell" — chahe individual bacche bilkul crazy tarike se guess karein. Aur jitne zyada bacche per school, utni hi patli aur reliable woh hill hoti hai.
Classical CLT X i se kya require karta hai? Independent, identically distributed, with finite mean μ and finite variance σ 2 > 0 .
X ˉ n ka standard error kya hai?Z n = ( X ˉ n − μ ) / ( σ / n ) ki CLT limit distribution kya hai?N ( 0 , 1 ) .
Specifically n se divide kyun karte hain? Kyunki
SD ( ∑ X i ) = σ n ; yeh normalization non-degenerate limit deta hai (
n se divide karo → 0, LLN; 1 se → ∞).
Kaun sa tool "independent vars ka sum" ko product mein badalta hai? Characteristic function φ X ( t ) = E [ e i tX ] (CFs independent sums ke liye multiply hoti hain).
0 ke paas standardized CF ka Taylor expansion?φ Y ( s ) = 1 − 2 s 2 + o ( s 2 ) (kyunki E [ Y ] = 0 , E [ Y 2 ] = 1 ).
Proof finish karne wali limit identity kaun si hai? ( 1 − 2 n t 2 ) n → e − t 2 /2 , jo N ( 0 , 1 ) ki CF hai.
Kaun sa theorem CF convergence se distributional convergence imply karta hai? Lévy's continuity theorem.
Kya CLT raw data ko normal banata hai? Nahi — sirf mean/sum ki sampling distribution ko.
Classical CLT kab fail hota hai? Jab variance infinite ho (jaise Cauchy distribution).
P ( X ≤ k ) , X discrete ke liye continuity correction?Φ ( ( k + 0.5 − μ ) / σ ) use karo.
Standard error aadha karne ke liye kitna zyada data chahiye? ∑ i = 1 n X i ka mean aur variance?n μ aur n σ 2 .
Bernoulli sums ke liye CLT ka discrete special case ka naam batao. de Moivre–Laplace theorem (binomial ka normal approximation).
converges in distribution
linear transform of normal
multiplies under indep sums
i.i.d. Xi, finite mean and var
Standard error sigma over sqrt n
Xbar, sum Xi, Zn all Gaussian
Characteristic function fingerprint
Heights, errors, polls, casinos