4.9.5 · Maths › Probability Theory & Statistics
Intuition Ek saans mein badi baat
Ek random variable X ke paas infinitely many "moments" hote hain — E [ X ] , E [ X 2 ] , E [ X 3 ] , … — aur ye sab uski poori shape ko encode karte hain (center, spread, skew, tails). Itni lambi infinite list uthake chalna bakwaas hai. MGF saare moments ko ek single function M X ( t ) mein pack kar deta hai, aur tum koi bhi moment ==differentiating and setting t = 0 == se wapas nikal sakte ho. Ye ek "generating machine" hai: crank ghao (d t d ), moment bahar aata hai.
Definition Moment Generating Function
Ek random variable X ke liye, MGF hai
M X ( t ) = E [ e tX ]
ye sabhi real t ke liye defined hai jo 0 ke aaspaas kisi open interval mein hain jahan expectation finite ho.
Discrete: M X ( t ) = ∑ x e t x p ( x )
Continuous: M X ( t ) = ∫ − ∞ ∞ e t x f ( x ) d x
Agar M X ( t ) 0 ki neighbourhood mein exist karta hai, toh X ki distribution iske dwara uniquely determined hoti hai.
Trick hai e tX ki Taylor series . Ise scratch se derive karo:
e tX = ∑ n = 0 ∞ n ! ( tX ) n = 1 + tX + 2 ! t 2 X 2 + 3 ! t 3 X 3 + ⋯
Dono taraf expectation lo (E ki linearity se):
M X ( t ) = E [ e tX ] = 1 + tE [ X ] + 2 ! t 2 E [ X 2 ] + 3 ! t 3 E [ X 3 ] + ⋯
kyun kaam karta hai
Is power series mein t n ka coefficient hai n ! E [ X n ] . Lekin power series mein t n ka coefficient YE BHI hota hai: n ! M X ( n ) ( 0 ) . Coefficients match karne se E [ X n ] = M X ( n ) ( 0 ) force ho jaata hai. Exponential aisa hi designed hai ki t ki har power exactly ek moment ko "tag" karti hai.
Toh:
M X ( 0 ) = 1 hamesha (ye hai E [ e 0 ] = E [ 1 ] ). Hamesha pehle yahi check karo.
M X ′ ( 0 ) = E [ X ] (mean).
M X ′′ ( 0 ) = E [ X 2 ] , isliye Var ( X ) = M X ′′ ( 0 ) − ( M X ′ ( 0 ) ) 2 .
Worked example Example 1 — Exponential
( λ )
f ( x ) = λ e − λ x , x ≥ 0 .
M X ( t ) = ∫ 0 ∞ e t x λ e − λ x d x = λ ∫ 0 ∞ e − ( λ − t ) x d x = λ − t λ , t < λ .
t < λ kyun? Integral tabhi converge karta hai jab exponent − ( λ − t ) negative ho, yaani λ − t > 0 . Ye wahi "neighbourhood of 0" hai jo finite hai.
M X ′ ( t ) = ( λ − t ) 2 λ ⇒ M X ′ ( 0 ) = λ 1 = E [ X ] . ✓ (known mean se match karta hai)
M X ′′ ( t ) = ( λ − t ) 3 2 λ ⇒ M X ′′ ( 0 ) = λ 2 2 = E [ X 2 ] .
Var = λ 2 2 − λ 2 1 = λ 2 1 . ✓
Worked example Example 2 — Bernoulli
( p ) phir Binomial( n , p )
Bernoulli: X ∈ { 0 , 1 } , P ( 1 ) = p .
M X ( t ) = e t ⋅ 0 ( 1 − p ) + e t ⋅ 1 p = ( 1 − p ) + p e t = 1 − p + p e t .
Ye step kyun: bas dono values par e t x p ( x ) sum karo.
M X ′ ( t ) = p e t ⇒ M X ′ ( 0 ) = p = E [ X ] ✓.
Binomial = n independent Bernoullis ka sum, toh Property 2 se:
M Bin ( t ) = ( 1 − p + p e t ) n .
Ye payoff kyun hai: humne binomial pmf ko haath bhi nahi lagaya; parts ke MGFs multiply karne se poora turant mil gaya.
Worked example Example 3 — Normal
( μ , σ 2 ) (famous wala)
Standard Z ∼ N ( 0 , 1 ) se shuru karo:
M Z ( t ) = ∫ − ∞ ∞ e t z 2 π 1 e − z 2 /2 d z .
Square complete kyun karte hain? Exponents combine karo: t z − 2 z 2 = − 2 1 ( z 2 − 2 t z ) = − 2 1 ( ( z − t ) 2 − t 2 ) . Toh
M Z ( t ) = e t 2 /2 = 1 ( it’s a N ( t , 1 ) density ) ∫ − ∞ ∞ 2 π 1 e − ( z − t ) 2 /2 d z = e t 2 /2 .
Ab X = μ + σ Z , Property 1 lagao (a = σ , b = μ ):
M X ( t ) = e μ t M Z ( σ t ) = exp ( μ t + 2 1 σ 2 t 2 ) .
Check: M X ′ ( 0 ) = μ , M X ′′ ( 0 ) = μ 2 + σ 2 ⇒ Var = σ 2 . ✓
M X ( t ) = E [ e tX ] , toh mean t = 1 par hai."
Kyun sahi lagta hai: e 1 ⋅ X = e X lagta hai ki "average X " dena chahiye.
Fix: moments derivatives at t = 0 se aate hain, t = 1 plug karne se nahi. Variable t ek bookkeeping dummy hai, X ki koi value nahi. t = 0 set karna har derivative par ek moment isolate karta hai.
Common mistake "Har random variable ka ek MGF hota hai."
Kyun sahi lagta hai: har variable ke moments hote hain... kabhi kabhi.
Fix: M X ( t ) 0 ke aaspaas ek interval mein finite hona chahiye. Heavy-tailed variables (jaise Cauchy, ya Lognormal t > 0 ke liye) ka E [ e tX ] = ∞ hota hai — koi MGF nahi. Isliye hi characteristic function E [ e i tX ] (hamesha exist karta hai) zyada bhaari tool hai.
M X + Y = M X ⋅ M Y kisi bhi X , Y ke liye."
Kyun sahi lagta hai: algebra automatic lagta hai.
Fix: iske liye independence chahiye. E [ e tX e t Y ] = E [ e tX ] E [ e t Y ] tabhi split hota hai jab X ⊥ Y .
M X ( 0 ) = 1 verify karna bhool jaana."
Kyun takleef deta hai: algebra mein ghalti often M X ( 0 ) = 1 bana deti hai. Kyunki M X ( 0 ) = E [ 1 ] = 1 hamesha hota hai, ye tumhari computation par ek free sanity check hai.
20% jo 80% value deta hai:
Mean/variance compute karo bina integrals ghiste hue — bas differentiate karo.
Ek distribution identify karo uska MGF pehchaan ke (uniqueness).
Independents ke sum ki distribution nikalo (MGFs multiply karo).
Limit theorems prove karo (CLT proof: dikhao ki MGFs e t 2 /2 par converge karte hain).
Recall Feynman: ek 12-saal ke bachche ko explain karo
Socho X ek mystery shape hai jo clay se bani hai. Ise describe karne ke liye tum facts list karte: uska middle kahan hai, kitna wide hai, kitna tedha — ye moments hain. Inhe ek ek karke likhna slow hai. MGF ek magic box hai: tum ise ek dial number t dete ho, aur ye secretly SAARE facts ek saath store kar leta hai, folded together. Fact number n nikaalte ke liye, tum "dial n baar hilate ho" (n derivatives lete ho) aur phir dial wapas zero par set karte ho. Exactly woh ek fact bahar aa jaata hai, clean. Bonus magic: agar tum do independent shapes ko jod do, toh jodi hui shape ka box sirf do boxes multiplied hai — isliye mathematicians isse pyaar karte hain.
"M oments G enerate F rom D ifferentiating at 0 ."
Aur shape rule: D erivative-at-0 = moment; M ultiply MGFs = (independent) variables add karo.
Pun: MGF = "Moment Genie's Formula" — ise rago (d t d ) n baar, wish n milegi.
Definition of the MGF of X ? M X ( t ) = E [ e tX ] , t = 0 ke aaspaas ek interval mein finite.
How do you get the n -th moment from the MGF? E [ X n ] = M X ( n ) ( 0 ) , n -th derivative t = 0 par evaluate ki gayi.
Why does e tX generate moments? Its Taylor series ∑ n ! t n X n hai; E lene se t n ka coefficient E [ X n ] / n ! ban jaata hai.
What is M X ( 0 ) for every random variable? 1 , kyunki E [ e 0 ] = E [ 1 ] = 1 — ise sanity check ki tarah use karo.
MGF of Y = a X + b ? M Y ( t ) = e b t M X ( a t ) .
MGF of X + Y when X ⊥ Y ? M X + Y ( t ) = M X ( t ) M Y ( t ) (multiplication, independence chahiye).
Variance in terms of the MGF? Var ( X ) = M X ′′ ( 0 ) − ( M X ′ ( 0 ) ) 2 .
MGF of Exponential( λ ) and its domain? M X ( t ) = λ − t λ for t < λ .
MGF of Normal( μ , σ 2 ) ? M X ( t ) = exp ( μ t + 2 1 σ 2 t 2 ) .
MGF of Binomial( n , p ) and why? ( 1 − p + p e t ) n , kyunki ye n independent Bernoulli MGFs ka product hai jo multiply kiye gaye.
Why might an MGF not exist? Agar E [ e tX ] = ∞ 0 ke paas ho (heavy tails, jaise Cauchy); tab characteristic function use karo.
What does uniqueness of MGF give you? Agar do MGFs 0 ke aaspaas ek interval par agree karte hain, toh dono distributions identical hain.
Probability Distributions — har named distribution ka ek signature MGF hota hai.
Expectation and Variance — MGF derivatives inhe directly recover karte hain.
Characteristic Function — E [ e i tX ] wala cousin jo hamesha exist karta hai.
Central Limit Theorem — MGFs ke e t 2 /2 par convergence se prove hota hai.
Independence (Probability) — multiplication rule ke peeche yahi condition hai.
Taylor Series — wo engine jo moments ko "bahar girne" deta hai.
Cumulant Generating Function — ln M X ( t ) , cumulants generate karta hai.
property, needs independence
convolution to multiplication
M_X t = sum t^n E X^n over n!
Shift and scale e^bt M_X at
Sum of independents product of MGFs
Uniqueness identifies distribution