1.3.15 · D3 · AI-ML › Probability & Statistics › Central limit theorem
Intuition Ek poore page ke examples kyun?
Central limit theorem ek hi machine deta hai: koi bhi i.i.d. samples lo, unka average nikalo, aur woh average ek bell curve ki tarah behave karta hai jiska centre μ hai aur spread σ / n hai. Lekin is machine ko bahut alag-alag inputs mile hain — dice, coins, network gradients, chote samples, bade samples, symmetric aur tedhe sources. Yeh page machine ko har tarah ke input se chalata hai taaki jab exam (ya real dataset) tumhe koi ek de, tum uska "joda" pehle se dekh chuke ho.
Koi bhi example shuru karne se pehle, us poore page mein use hone wale symbols ko simple shabdon mein ek baar phir se anchor karte hain:
Definition Sample mean, aur woh teen quantities jo tum hamesha compute karte ho
X ˉ n (padho "X-bar-n") — sample mean : tum n actual draws X 1 , X 2 , … , X n lete ho, unhe add karte ho, aur n se divide karte ho:
X ˉ n = n 1 ∑ i = 1 n X i
Socho: apne n dice rolls line up karo aur unka balance point dhundo. Yeh ek number har example ka hero hai — jo bhi hum compute karte hain woh X ˉ n ke behavior ke baare mein ek statement hai.
μ (mu) — population mean E [ X ] : EK draw ka long-run average. CLT kehta hai X ˉ n μ ke aas paas rehta hai.
σ (sigma) — population standard deviation Var ( X ) : ek draw typically μ se kitna door padta hai.
SE = n σ — standard error : X ˉ n typically μ se kitna door padta hai. Yeh woh width hai bell curve ki jo CLT tumhe deta hai. Yeh n ki tarah shrink karta hai: n chaar guna karo, spread aadha ho jaata hai.
Standardize karne ka move har ek example mein aata hai, isliye ise ek baar define karo:
Is topic ke har problem ka type in cells mein se ek hai. Neeche har example us cell(s) ke saath tagged hai jo woh fill karta hai.
Cell
Kya cheez ise distinct banati hai
Covered by
A. Symmetric source
uniform/symmetric X , moderate n
Ex 1
B. Skewed / Bernoulli source
tedha X (ek coin), CLT phir bhi kaam karta hai
Ex 2
C. n ke liye solve karo (inverse)
probability di gayi hai, sample size dhundo
Ex 3
D. One-sided tail
P ( X ˉ > c ) , sirf ek boundary
Ex 4
E. Negative-mean / sign-flip
μ < 0 , Z ke signs ke saath careful rehna
Ex 5
F. Degenerate: σ = 0
zero-variance source, limiting behaviour
Ex 6
G. Small n warning
jab bell ek buri approximation hai
Ex 7
H. Limit n → ∞
Law of Large Numbers CLT ki parchhain ke roop mein
Ex 8
I. Mean ki jagah Sum
total, average nahi — dhyan se rescale karo
Ex 9
J. Exam twist: symmetry probability
$P(
Z
Main poore page mein rounded standard-normal areas use karta hoon:
Φ ( 0.70 ) = 0.758 , Φ ( 0.16 ) = 0.564 , Φ ( 1 ) = 0.841 , Φ ( 1.96 ) = 0.975 , Φ ( 2 ) = 0.977 , Φ ( 0.5 ) = 0.691 .
Worked example 36 dice ka average 3.3 aur 3.7 ke beech
Statement. Ek fair die n = 36 baar roll karo. P ( 3.3 ≤ X ˉ 36 ≤ 3.7 ) nikalo.
Forecast: Die 3.5 par centred hai aur 3.3 –3.7 uske aas-paas ka ek narrow band hai. Andaaza: thoda aadhe se upar? (Yeh ≈ 0.52 hai.)
Population mean. μ = E [ X ] = 6 1 + 2 + 3 + 4 + 5 + 6 = 3.5 .
Yeh step kyun? CLT bell ko μ par centre karta hai; pehle centre chahiye.
Population variance. σ 2 = E [ X 2 ] − μ 2 = 6 91 − 3. 5 2 = 2.9167 , toh σ = 1.708 .
Yeh step kyun? Bell ki width σ se aati hai; hum upar define kiya hua E [ X 2 ] − μ 2 shortcut use karte hain.
Standard error. SE = 36 1.708 = 6 1.708 = 0.2847 .
Yeh step kyun? Hum average kar rahe hain, isliye relevant spread SE hai, σ nahi.
Dono edges standardize karo. Z lo = 0.2847 3.3 − 3.5 = − 0.70 , Z hi = 0.2847 3.7 − 3.5 = + 0.70 .
Yeh step kyun? "3.3 aur 3.7 ke beech" ko ek tabulated curve par area mein convert karta hai.
Areas padho. Φ ( 0.70 ) − Φ ( − 0.70 ) = 0.758 − 0.242 = 0.516 .
Verify karo: Symmetry se answer 2Φ ( 0.70 ) − 1 = 2 ( 0.758 ) − 1 = 0.516 ke barabar hona chahiye. ✓ Dono edges centre se same distance par → symmetric Z 's → sanity hold karta hai.
Figure — CLT ek picture mein (Example 1). Neeche ka chart source aur average dono overlay karta hai: flat blue bars ek die hain (uniform — har face equally likely), aur orange curve 36 dice ke average ki distribution hai. Dekho kaise flat, bell-shaped ban jaata hai, μ = 3.5 par centred (gray dashed line). Green shaded slice exactly woh P ( 3.3 ≤ X ˉ 36 ≤ 3.7 ) ≈ 0.516 hai jo hum step 5 mein compute kiya — dekho woh band kitna narrow hai ek single die ki puri 1 –6 range ke comparison mein, jo n se divide karne ka shrinking effect hai.
Worked example 100 flips mein heads ka fraction
Statement. Ek biased coin heads p = 0.3 probability se land karta hai. Ise n = 100 baar flip karo. P ( X ˉ 100 ≥ 0.35 ) kya hai, jahan X ˉ heads ka fraction hai?
Forecast: 0.35 true rate 0.30 se upar hai, isliye yeh aadhe se kam hona chahiye. Andaaza ≈ 0.14 .
Bernoulli parameters. μ = E [ X ] = p = 0.30 , aur σ 2 = Var ( X ) = p ( 1 − p ) = 0.3 × 0.7 = 0.21 , toh σ = 0.4583 .
Yeh step kyun? Ek Bernoulli source skewed hota hai (die ki tarah symmetric nahi), phir bhi CLT uske average par apply hota hai — exactly isliye polls kaam karte hain.
Standard error. SE = 100 0.4583 = 0.04583 .
Yeh step kyun? Question heads ke fraction ke baare mein hai, jo ek sample mean X ˉ 100 hai; uska spread SE hai, isliye standardize karne se pehle σ ko n se divide karna zaroori hai.
Single boundary standardize karo. Z = 0.04583 0.35 − 0.30 = 1.091 ≈ 1.09 .
Yeh step kyun? One-sided question → ek Z value.
Tail area. P ( X ˉ ≥ 0.35 ) = 1 − Φ ( 1.09 ) = 1 − 0.862 = 0.138 .
Verify karo: 0.138 < 0.5 jaise forecast kiya gaya tha (mean se upar → right tail). Units check: fractions dimensionless hain, Z dimensionless hai. ✓
Worked example 0.5% margin ke liye kitne users chahiye?
Statement. Conversion rate p = 0.05 hai. Itne users n chahiye taaki sample rate 95% confidence ke saath truth ke ± 0.005 ke andar ho.
Forecast: Chote margins ke liye bada n chahiye. Andaaza "hazaron".
Parameters. μ = 0.05 , σ 2 = Var ( X ) = 0.05 × 0.95 = 0.0475 , σ = 0.2179 .
Yeh step kyun? Har CLT computation μ aur σ se shuru hoti hai; yahan σ directly us margin formula mein jaata hai jise hum invert karne wale hain.
95% condition likho. Hume chahiye P ( ∣ X ˉ n − μ ∣ ≤ 0.005 ) = 0.95 . Standard normal par, 95% area ± 1.96 ke andar hota hai: Φ ( 1.96 ) − Φ ( − 1.96 ) = 0.95 .
Yeh step kyun? Hum usual direction ulta karte hain — probability fixed hai, hum n ke liye solve karte hain.
Margin = 1.96 × SE set karo. 0.005 = 1.96 ⋅ n σ .
Yeh step kyun? Ek 95% interval ki half-width 1.96 SE hoti hai; ise desired margin ke barabar force karo.
n ke liye solve karo. n = 0.005 1.96 σ = 0.005 1.96 × 0.2179 = 85.42 , toh n = 85.4 2 2 = 7297.6 (round up karke 7298 ).
Verify karo: Plug back karo — SE = 0.2179/ 7298 = 0.002551 , aur 1.96 × 0.002551 = 0.005000 ≤ target margin. ✓
Worked example Kya mini-batch gradient sahi direction mein point karega?
Statement. Per-sample gradient ka μ g = − 0.03 , σ g 2 = 0.25 , batch n = 64 hai. P ( g ˉ 64 > 0 ) kya hai — matlab batch ke galat direction (negative hone par positive) mein point karne ka chance?
Forecast: True mean negative hai lekin noise bada hai, isliye sign flip ka real chance hai. Andaaza ≈ 0.3 .
Standard error. σ g = 0.5 , SE = 64 0.5 = 0.0625 .
Yeh step kyun? g ˉ 64 ek sample mean hai, isliye uska spread SE hai; boundary 0 ko standardize karne se pehle hume yeh chahiye.
0 standardize karo. Z = 0.0625 0 − ( − 0.03 ) = 0.0625 0.03 = 0.48 .
Yeh step kyun? "g ˉ > 0 " ek one-sided event hai; sirf boundary 0 ko Z chahiye.
Tail area. P ( g ˉ 64 > 0 ) = 1 − Φ ( 0.48 ) = 1 − 0.684 = 0.316 .
Verify karo: Positive Z (boundary mean se upar hai) → tail aadhe se chota, 0.316 < 0.5 . Isliye Stochastic Gradient Descent ek galat-signed batch ka 32% chance tolerate karta hai: bahut saare steps mein mean drift jeet jaata hai. ✓
Worked example Negative target ke aas-paas ek window mein average error
Statement. Wahi gradient source (μ g = − 0.03 , σ g = 0.5 , n = 64 ). P ( − 0.04 ≤ g ˉ 64 ≤ − 0.02 ) nikalo.
Forecast: Yeh mean − 0.03 ke aas-paas ek symmetric window hai; expect karo ek modest area.
SE. SE = 0.0625 (jaise upar).
Yeh step kyun? Wahi sample-mean spread reuse hoti hai; dono edges isse divide honge.
Dono edges standardize karo — signs ka dhyan rakho.
Z lo = 0.0625 − 0.04 − ( − 0.03 ) = 0.0625 − 0.01 = − 0.16 ,
Z hi = 0.0625 − 0.02 − ( − 0.03 ) = 0.0625 + 0.01 = + 0.16 .
Yeh step kyun? Ek negative μ subtract karna yaani add karna hai — classic sign trap. Window Z mein symmetric hai kyunki woh μ ke aas-paas symmetric hai.
Area. Φ ( 0.16 ) − Φ ( − 0.16 ) = 0.564 − 0.436 = 0.127 .
Verify karo: 2Φ ( 0.16 ) − 1 = 2 ( 0.564 ) − 1 = 0.128 ≈ 0.127 (rounding). ✓ Symmetric window ne symmetric ± 0.16 Z's diye — sign handling sahi hai.
Worked example Ek "die" jo hamesha 4 dikhata hai
Statement. X hamesha 4 ke barabar hota hai (ek constant random variable). Ise n = 50 baar roll karo, average nikalo. X ˉ 50 ki distribution describe karo.
Forecast: Andar koi randomness nahi → bahar koi spread nahi. "Bell" ek point par collapse ho jaati hai.
Parameters. μ = E [ X ] = 4 , σ 2 = Var ( X ) = E [( X − 4 ) 2 ] = 0 , toh σ = 0 .
Yeh step kyun? Ek constant ki variance by definition zero hoti hai.
Standard error. SE = 50 0 = 0 .
Yeh step kyun? SE CLT bell ki puri width hai; yahan zero matlab bell ki koi bhi width nahi hai.
Degenerate limit interpret karo. SE = 0 hone par X ˉ 50 ki distribution bilkul bell nahi hoti: woh apni saari probability sirf value 4 par rakhti hai. Formally yeh ek degenerate (point-mass) distribution hai: P ( X ˉ 50 = 4 ) = 1 . Draw karne ke liye koi density curve nahi hai — bas x = 4 par probability 1 ka ek arrow khada hai. Aur Z = 0 X ˉ − 4 undefined hai, jo CLT ka yeh kehne ka ek polite tarika hai ki "standardize karne ke liye kuch nahi hai".
Verify karo: X ˉ 50 = 50 1 ( 4 + 4 + ⋯ + 4 ) = 4 with probability 1. Toh P ( X ˉ = 4 ) = 1 , ek point par baitha hua saara probability consistent hai. ✓ CLT ko 0 < σ 2 < ∞ chahiye; yeh woh edge hai jo yeh exclude karta hai.
n = 3 dice kyun abhi bhi bell nahi hai
Statement. Sirf n = 3 baar ek die roll karo. True P ( X ˉ 3 ≤ 1 ) ko CLT estimate se compare karo.
Forecast: X ˉ 3 ≤ 1 matlab teeno dice 1 dikhayein — genuinely rare. CLT (ek smooth bell) galat andaaza laga sakti hai kyunki true distribution abhi bhi lumpy hai.
True probability. X ˉ 3 ≤ 1 ke liye har die 1 hona zaroori hai: P = ( 1/6 ) 3 = 1/216 = 0.00463 .
Yeh step kyun? Chote n ke saath hum exactly compute kar sakte hain — ek fair yardstick.
CLT estimate. SE = 1.708/ 3 = 0.9863 ; Z = 0.9863 1 − 3.5 = − 2.535 ; Φ ( − 2.535 ) ≈ 0.0056 .
Yeh step kyun? Wahi machine, lekin n = 3 "large" se bahut door hai.
Compare karo. True 0.00463 vs CLT 0.0056 — same ballpark mein lekin noticeably off, aur CLT yeh nahi dekh sakta ki average discrete hai (sirf 1/3 ke multiples aate hain).
Verify karo: ( 1/6 ) 3 = 1/216 exactly. ✓ Lesson: bell ek large-n promise hai; chote n ke saath tails ke paas woh jhooth bolta hai. Isliye Confidence Intervals chote samples ke liye t -distribution par switch karte hain.
n ke explode hone par average kahan jaata hai?
Statement. Die ke liye, n → ∞ hone par X ˉ n aur SE ka kya hota hai?
Forecast: Average μ = 3.5 par exactly pahunchna chahiye; spread vanish ho jaani chahiye.
SE track karo. SE = n 1.708 → 0 as n → ∞ .
Yeh step kyun? SE bell ki puri width hai; ise watch karna limiting shape batata hai.
Consequence. Bell N ( 3.5 , SE 2 ) single point 3.5 par collapse ho jaati hai. Yahi exactly Law of Large Numbers hai: X ˉ n → μ .
Numeric feel. n = 100 par, SE = 0.1708 ; n = 10000 par, SE = 0.01708 — 100 × bada n gives 10 × tighter spread (100 = 10 ).
Verify karo: SE ( 10000 ) / SE ( 100 ) = 100/10000 = 0.1 . ✓ CLT (shape) aur LLN (destination) ek hi kahani hai: CLT kehta hai X ˉ n kaise zoom in karta hai — ek ever-narrowing bell ke through.
Worked example 36 dice ka total score
Statement. Maano S = ∑ i = 1 36 X i 36 dice ka sum hai. P ( S ≤ 120 ) nikalo.
Forecast: Expected total 36 × 3.5 = 126 hai, aur 120 usse neeche hai, isliye aadhe se kam. Andaaza ≈ 0.35 .
SUM ka mean aur variance. E [ S ] = n μ = 36 × 3.5 = 126 ; Var ( S ) = n σ 2 = 36 × 2.9167 = 105 , toh sd ( S ) = 105 = 10.247 .
Yeh step kyun? Sum average se alag scale karta hai: uska spread σ n hota hai, σ / n nahi. Yeh sahi karo nahi toh har Z galat hoga.
Standardize karo. Z = 10.247 120 − 126 = − 0.5855 ≈ − 0.59 .
Yeh step kyun? "S ≤ 120 " boundary ko standard normal par Z mein convert karta hai, step 1 se SUM ki apni standard deviation use karke.
Area (one-sided lower tail). P ( S ≤ 120 ) = Φ ( − 0.59 ) = 1 − Φ ( 0.59 ) = 1 − 0.7224 = 0.278 .
Yeh step kyun? 120 mean se neeche hai, isliye hum Z = − 0.59 tak left-tail area chahte hain; tabulated Φ ( 0.59 ) use karne ke liye symmetry se reflect karo.
Verify karo: Mean se consistency check: S /36 = 120/36 = 3.333 ; average machine use karte hue, SE = 1.708/6 = 0.2847 aur Z = 0.2847 3.333 − 3.5 = − 0.585 — step 2 se identical Z. ✓ Sum-route aur average-route agree karne chahiye, aur karte hain. Answer 0.278 forecast "≈ 0.35 " ballpark se match karta hai (thoda kam). ✓
Worked example "Within one standard error" quick-fire
Statement. Ek sensor ki readings ka unknown skew hai lekin finite μ , σ hai. Tum n = 400 readings lete ho. Ek colleague claim karta hai: "Sample mean truth ke ek standard error ke andar lagbhag do-tihai time land karta hai." CLT use karke unke claim ko verify karo, phir P ( ∣ X ˉ − μ ∣ ≤ 2 SE ) batao.
Forecast: "One SE" ⇒ ∣ Z ∣ ≤ 1 ; 68–95–99.7 rule kehta hai ≈ 68% . Toh colleague sahi hai. Two SE ⇒≈ 95% .
Z mein translate karo. ∣ X ˉ − μ ∣ ≤ SE matlab SE X ˉ − μ ≤ 1 , yani ∣ Z ∣ ≤ 1 .
Yeh step kyun? "One standard error" literally ∣ Z ∣ ≤ 1 ki definition hai — σ ya n ke saath koi arithmetic nahi chahiye. Yahi exam shortcut hai.
∣ Z ∣ ≤ 1 ke liye area. Φ ( 1 ) − Φ ( − 1 ) = 2Φ ( 1 ) − 1 = 2 ( 0.841 ) − 1 = 0.682 . Toh sample mean ek SE ke andar lagbhag 68% time land karta hai — colleague sahi hai.
Yeh step kyun? Two-sided ∣ Z ∣ ≤ 1 ko Φ -symmetry use karke ek single area mein convert karta hai.
∣ Z ∣ ≤ 2 ke liye area. P ( ∣ X ˉ − μ ∣ ≤ 2 SE ) = 2Φ ( 2 ) − 1 = 2 ( 0.977 ) − 1 = 0.954 , yani lagbhag 95% .
Yeh step kyun? Doosre half ka jawab usi two-sided rule se deta hai ∣ Z ∣ ≤ 2 ke saath.
Verify karo: 0.682 ≈ do-tihai → colleague confirmed. 0.954 ≈ 95% standard 95% interval half-width 1.96 SE se match karta hai jo hum Example 3 mein use kiya tha. ✓ Dhyan do ki answer n aur skew se independent hai — twist yeh hai ki tumhe sensor ka actual σ kabhi nahi chahiya tha.
Recall Quick self-test
n i.i.d. draws ke average ka spread hota hai ::: SE = σ / n (n ki tarah shrink karta hai)
95% confidence ke saath margin m ke andar aane ke liye n ≥ chahiye ::: ( 1.96 σ / m ) 2
n draws ke SUM ka standard deviation hota hai ::: σ n (grow karta hai, shrink nahi)
CLT fail karta hai jab ::: σ = 0 (degenerate) ya σ 2 = ∞ (infinite variance), ya n tails ke liye bahut chota ho
P ( ∣ Z ∣ ≤ 1 ) aur P ( ∣ Z ∣ ≤ 2 ) approximately hain ::: 0.68 aur 0.95
Mnemonic "Centre, Spread, Standardize, Read"
Har CLT problem same chaar beats ki hai: μ nikalo (Centre), SE nikalo (Spread), edges ko Z mein badlo (Standardize), Φ lookup karo (Read). Sirf Example 3 ise ulta chalata hai n ke liye solve karne ke liye.
Yeh bhi dekho: Central limit theorem · Normal Distribution · Confidence Intervals · Sample Size Calculation · Hypothesis Testing · Law of Large Numbers · Bootstrap Methods · Monte Carlo Methods