Kisi bhi Greek letter se pehle, hume woh object samajhna hai jise baaki sab describe karte hain.
Picture yeh sochiye: ek machine hai jisme ek lever hai. Usse kheencho aur ek number bahar aata hai. Aapko pehle se nahi pata kaun sa number aayega, lekin aapko rules pata hain ki har number kitna likely hai.
Ek die roll: X∈{1,2,3,4,5,6}, sab equally likely.
Ek coin jisme heads ke liye 1 aur tails ke liye 0 flag hai: X∈{0,1} — yeh Bernoulli building block hai.
Topic ko yeh kyun chahiye: CLT ek statement hai bahut saari aisi machines ke baare mein, isliye pehle ek ko naam dena zaroori hai.
Outputs ko average karne se pehle hume yeh batana hoga ki har output kitna likely hai.
Machine ke do flavours hain, aur dono apni likelihood alag tarike se store karte hain:
Picture: ek PMF spikes (bars) ki ek row hoti hai jinki heights ka sum 1 hota hai; ek PDF ek smooth curve hoti hai jiska total shaded area 1 hota hai.
Topic ko yeh kyun chahiye: baad ke har formula mein outputs ko unki likelihood se weight kiya jaata hai, isliye hume "likelihood" ka matlab fix karna hai — aur note karna hai ki yeh dono discrete aur continuous machines ke liye kaam karta hai.
Picture: mean probability picture ka balance point hai — woh jagah jahan bars (ya curve ke neeche ka area) ek pencil tip par balance karein.
Tool E[⋅] kyun, na ki sirf "meri data ka average"?Data ka average ek aisa number hai jo har baar sample karne par badal jaata hai. E[X] woh sachchi fixed target hai — machine ki ek property, kisi ek sample ki nahi. CLT poori tarah is baare mein hai ki noisy data-average is fixed μ ke around kaise nachhta hai.
Mean batata hai machine kahan centre karti hai. Yeh nahi batata ki outputs kitne wild hain.
Picture: σ probability picture ka typical "arm span" hai — ek single output aksar balance point se kitna dur jaata hai.
Topic ko yeh kyun chahiye: CLT require karta hai ki σ2finite aur positive ho. Agar spread infinite ho (jaise Cauchy Distribution mein), toh poora theorem collapse ho jaata hai — mean kabhi settle nahi hota.
Yeh chaar-letter tag classical CLT ka load-bearing assumption hai. Pehle counter n fix karo:
Picture: identical, alag-alag wired machines ki ek row, har ek ko ek baar pull kiya — koi bhi do machines wire se connected nahi.
Topic ko yeh kyun chahiye: independence wahi cheez hai jo proof mein expectations ke product ko factor karne deti hai (dekho Characteristic Functions), aur variances ko add hone deti hai. "Identically distributed" thoda relax karo toh aapko Lindeberg–Feller Condition chahiye.
Ab woh crucial fact jo parent note assert karta hai, Section 3 ke do variance rules se build hota hai:
Picture: jaise aap zyada machines use karte ho, average ka histogram tight hokar μ ke around aa jaata hai — uska arm span 1/n ki tarah shrink hota hai.
n itna important kyun hai: kyunki spread shrink hoti hai (yeh Law of Large Numbers hai) lekin sirf slowly, hum sirf μ subtract nahi kar sakte — hume ek zero-par-shrink hoti cheez milegi. Hume exactly is standard error se rescale karna hoga taaki ek stable, non-trivial shape mile. Yahi woh Standard Error hai jo topic mein har jagah aata hai.
Words mein: mera sample average sach se kitne standard errors dur hai?
Topic ko yeh kyun chahiye: CLT jo limit prove karta hai woh ek fixed shape hai, isliye hume μ aur σ (jo har problem mein alag hote hain) strip karne hote hain. Zn woh stripped, universal version hai.
Khud ko tick do sirf tab agar aap yeh out loud answer kar sako:
Capital X ka kya matlab hai lowercase x se alag?
X random variable (machine) hai; x ek specific value hai jo usne produce ki.
P(X=x) kya measure karta hai, aur PMF vs PDF kya hai?
P likelihood hai 0 aur 1 ke beech; PMF discrete values ke liye P(X=x) deta hai, PDF ek aisi height deta hai jiska area continuous ke liye probability hai.
E[X] plain words mein kya hai, aur continuous X ke liye aap isse kaise compute karte ho?
Long-run average μ; isse ∫xf(x)dx ke roop mein compute karo (integral discrete sum ki jagah leta hai).
Variance mein deviations ko square kyun karte hain?
Sign khatam karne ke liye aur kyunki squared spreads independent variables ke liye add hote hain.
Woh do variance rules batao jo σ2/n paane ke liye use hote hain.
Scaling Var(cX)=c2Var(X) aur adding Var(X+Y)=Var(X)+Var(Y) independent variables ke liye.
n kya hai?
Pull ki gayi machines / averaged outputs ki sankhya, ek whole number jise CLT infinity ki taraf bhejna hai.
"i.i.d." ke do hisse kya hain?
Identically distributed (same machine) aur independent (koi bhi pull doosre ko affect nahi karta).
Var(Xˉn)=σ2/n kyun hai?
Sum ka variance nσ2 hai; mean woh sum hai 1/n se multiply kiya hua, aur scaling constant ko square karti hai: (1/n)2⋅nσ2=σ2/n.
Standard error kya hai aur n kyun?
σ/n, sample mean ka SD; sum ka SD n ki tarah badhta hai, isliye yahi sahi rescaler hai.
Zn kya measure karta hai?
Sample average sach mean μ se kitne standard errors dur baitha hai.
Φ(z) kya hai?
z ke left taraf standard bell ka area, yaani P(Z≤z).
dN(0,1) actually kya claim karta hai?
Zn ki distribution ki shape standard bell ke kareeb aati hai — yeh nahi ki raw data normal ban jaati hai.