Neeche ki sab cheez ek hi set of symbols use karti hai, toh unhe ek baar plain words mein naam de lete hain:
"Standardize" karne ka geometrically kya matlab hai — lavender curve sample mean Xˉn hai jo apne true centre μ=50 ke paas standard error ke barabar spread ke saath rehta hai; coral curve wahi cheez hai mean subtract karne aur standard error se divide karne ke baad, slide hokar centre 0 aur spread 1 par aa jaati hai. Upar aur neeche ke do axes value-for-value line up karte hain:
Level 2 se pehle yeh figure padho: standardize karna bas ek slide hai (mean subtract karo) aur phir ek squeeze (standard error se divide karo). Neeche tum jo bhi z-value compute karte ho woh coral axis par standard-error units mein ek doori measure kar raha hai.
Handy Φ values jo throughout use hoti hain (shape memorize karo, digits nahi):
z
Φ(z)
z
Φ(z)
0.50
0.6915
1.645
0.9500
1.00
0.8413
1.96
0.9750
1.28
0.8997
2.00
0.9772
1.41
0.9207
2.33
0.9901
Recall
P(Z>z)=1−Φ(z) kyun hota hai?
Bell ke neeche total area 1 hai. Φ(z)z ke baayein taraf ka area hai. Jo left mein nahi hai woh right mein hai, toh right-tail area 1−Φ(z) hai. ::: P(Z>z)=1−P(Z≤z)=1−Φ(z).
CLT ko teen cheezein chahiye: independent, identically distributed, aur finite variance (σ2<∞).
(a) ✅ Dice rolls i.i.d. hain σ2=1235<∞ ke saath. 200 ka mean beautifully normal hai.
(b) ❌ Cauchy distribution ka koi finite mean nahi aur infinite variance hai. Recipe toot jaati hai — Cauchy draws ka average khud Cauchy hai, kabhi settle nahi karta. Yeh classic CLT counterexample hai.
(c) ✅ Heights i.i.d. hain finite variance ke saath, toh Xˉ40 approximately normal hai (aur n=40>30, rule of thumb se comfortably aage).
Recall Solution
Sample mean Xˉ64: centre =μ=10, standard error =nσ=644=84=0.5.
Sum S: centre =nμ=64⋅10=640, spread =σn=4⋅8=32.
Dhyaan do average ka spread (0.5) ek single value ke spread (4) se aath guna chhota hai — yahi 1/64=1/8 kaam kar raha hai.
Standard error =nσ=10010=1. Boundary 52 ko standardize karo:
z=σ/nXˉn−μ=152−50=2.00.
Ab "greater than" ko table lookup mein convert karo. Table Φ(z)=P(Z≤z) deti hai — baayein taraf ka area. Hum z=2 ke daayein taraf ka area chahte hain, jo poore minus left part hai (total area 1 hai):
P(Xˉ100>52)=P(Z>2.00)=1−Φ(2.00)=1−0.9772=0.0228.
Lagbhag 2.3% chance ki 100 draws ka average 52 se zyada hoga. (Yahan koi symmetry assume nahi ki gayi — bas "left area + right area = 1.")
Recall Solution
E[S]=nμ=100⋅3.5=350; SD(S)=σn=1.7078100=17.078.
z=σnS−nμ=17.078330−350=−1.171.
Negativez ke liye hum bell ki 0 ke baare mein mirror symmetry use karte hain: −1.171 par left-tail area +1.171 par right-tail area ke barabar hai, yaani Φ(−1.171)=1−Φ(1.171). Isliye
P(S<330)=Φ(−1.171)=1−Φ(1.171)≈1−0.8792=0.1208.
Lagbhag 12% chance ki 100-roll total 330 se neeche hoga. (Yahan symmetry use ki gayi hai, aur explicitly state ki gayi hai, kyunki table sirf positive z list karta hai.)
Recall Solution
Bell curve par ek central 95% region har taraf z=1.96 standard errors tak jaata hai (isliye z0.025=1.96: yeh har tail mein 2.5% chhodta hai). Toh
c=1.96×(standard error)=1.96×1=1.96.
Isliye Xˉ100 lagbhag 95% time (48.04,51.96) mein land karta hai. Yahi Confidence Intervals ka seed hai.
Continuity correction — yeh kahan se aata hai. Count X sirf whole number ho sakta hai, isliye iska probability isolated spikes 0,1,2,… par rehta hai. Un spikes ko area ke roop mein draw karne ke liye (taaki ek smooth curve unhe approximate kar sake), hum har integer k ko [k−0.5,k+0.5] span karte ek bar mein widen karte hain — width 1 ka rectangle jiska area P(X=k) ke barabar hai. Smooth normal curve phir in bars ke tops se match ki jaati hai. Kyunki event {X≤50}k=50 par poori bar include karta hai, iska area us bar ke right edge, 50.5 tak jaata hai — 50 tak nahi. Figure dekho: 50 par butter-coloured bar poori tarah shaded region ke andar hai, aur lavender dashed line uske right edge par baith raha hai.
z=6.480750.5−60=−1.466.P(X≤50)≈Φ(−1.466)=1−Φ(1.466)≈1−0.9287=0.0713.
Bars-versus-curve picture jo +0.5derive karti hai (har discrete spike width-1 bar ban jaata hai; curve bar tops track karti hai):
Recall Solution
Kyunki Var(∑(Xi−μ))=nσ2 aur ek random variable ko n se divide karne se uska variance n2 se divide ho jaata hai:
Var(Wn)=n2nσ2=nσ2n→∞0.
Spread zero ho jaata hai — Wn→0, ek single point. Yahi Law of Large Numbers hai, bell curve nahi. n se divide karna "bahut zyada squash" karta hai. Non-degenerate spread rakhne ke liye tumhe n se divide karna hoga, kyunki yahi sum ke standard deviation ki n growth ko exactly cancel karta hai. Yeh Goldilocks scaling hai.
Recall Solution
Pehle, "skewness" ka matlab kya hai. Skewness ek single number hai jo lopsidedness measure karta hai — ek tail doosre se kitni lambi hai. Iska formula standardized third moment hai:
γ=E[(σX−μ)3].
Ek symmetric distribution ka γ=0 hota hai (left aur right cube mein cancel ho jaate hain); ek right-skewed ka γ>0 hota hai (lamba right tail cube ko average par positive banata hai). Fair coin ka Bernoulli(0.5) ka γ=0 hai; exponential ka γ=2 hai.
Ab jawab: skewed wala (exponential) ko bada n chahiye. CLT ka limit pehle do moments se aage sab kuch throw away karta hai, lekin finiten ke liye bachi hui skewness bell ko distort karti hai. Approximation error nγ ki tarah shrink karta hai (Berry–Esseen flavour), toh bada γ same closeness tak pahunchne ke liye bada n demand karta hai. Symmetric input (γ=0) fast converge karta hai; exponential ka γ=2 ise slow banata hai. Exactly kab kai small independent (necessarily identical nahi) pieces ka sum normal jaata hai, yeh Lindeberg–Feller Condition pin down karta hai.
95% margin of error hai z0.025⋅nσ=1.96⋅n12. Require karo ki yeh ≤2 ho:
1.96⋅n12≤2⇒n≥21.96⋅12=11.76⇒n≥11.762=138.3.Upar round karo (data bahut kam nahi ho sakta): n=139. Dhyaan do: margin 2 se 1 karne ke liye tumhe n do guna bada chahiye, yaani 4× data — "1/n diminishing returns."
Recall Solution
Har mean approximately normal hai:
Var(XˉA)=nAσA2=5036=0.72,Var(XˉB)=nBσB2=8081=1.0125.Independent quantities ke variances difference ke liye bhi add hote hain (subtract karne se wobble mein help nahi milti):
Var(D)=0.72+1.0125=1.7325,SD(D)=1.7325=1.3162.
Yeh standard deviation ek two-sample z-test ka engine hai.
Recall Solution
Equal true means ke under, D 0 par centred hai SD(D)=1.3162 ke saath. Standardize karo:
z=1.31623−0=2.279.
Two-sided 5% cutoff hai ∣z∣>1.96. Kyunki 2.279>1.96, observed gap surprising hai — hum 5% level par "means equal" reject karenge. (Two-sided p-value ≈2(1−Φ(2.279))≈0.0226.)
Variance ko E[X2]=∫1∞x2⋅x32dx=∫1∞2x−1dx=[2lnx]1∞=∞ chahiye. Diverge karta hai. ❌
Kyunki σ2=∞ hai, classical (finite-variance) CLT apply nahi hota. Sample mean 2 par converge karta hai (mean exist karta hai, toh LLN hold karta hai), lekin iske fluctuations Gaussian nahi hain aur 1/n ki tarah shrink nahi karte — yeh ek heavy-tailed stable law follow karte hain. Moral: "mean hai" kaafi nahi hai; tumhe finite variance chahiye.
Recall Solution
Pehle, notation o(⋅) ("little-o") par ek baat. g(s)=o(s2) likhna matlab hai gs→0 par s2 se strictly faster shrink karta hai, yaani g(s)/s2→0. Yeh "terms jo limit mein matter karne ke liye bahut chhote hain" ke liye ek bookkeeping tag hai — yahan, second moment ke baad sab kuch.
Scaling n−a ke saath, characteristic function ka Taylor expansion 0 ke paas deta hai
φY(t/na)=1−2n2at2+o(n−2a),
toh
φZn(t)=(1−2n2at2+⋯)n.
Limit (1+ncn)n→ec ke finite aur non-zero hone ke liye hamen bracket ke correction ko (constant)/n ki tarah behave karna hoga, yaani n2a=n, isliye 2a=1, toh a=21.
Agar a>21: exponent →0, φ→1, limit ek point mass hai (over-squashed → LLN).
Agar a<21: correction blow up karta hai, φ→0, koi proper limit nahi (under-squashed → diverges).
Sirf a=21e−t2/2 par land karta hai, standard-normal fingerprint. Yahi n ka CF-level reason hai.
Recall Solution
Sum ka centre: nμ=2500⋅(−0.05)=−125.
Sum ka spread: σn=1.10⋅2500=1.10⋅50=55.
Boundary 0 ko z=σnS−nμ use karke standardize karo:
z=550−(−125)=55125=2.2727.
Hum right-tail area chahte hain (ahead hona matlab S>0), toh total minus left:
P(S>0)=P(Z>2.2727)=1−Φ(2.2727)≈1−0.9885=0.0115.
2500 plays ke baad ahead hone ka lagbhag 1.2% chance. Tiny per-play edge, kai plays se multiply hokar aur mean ke relative n scaling se shrunk, losing almost certain bana deta hai. Isliye casinos profit karte hain: CLT aggregate ko negative mean ke around concentrate karta hai.
Recall Poore page ke liye one-line self-check
Ek average standardize karne ke liye, deviation ko kis se divide karo? ::: standard error σ/n se — kabhi akele σ se nahi.