Goal: ek number aur ek random variable mein farq karo, aur definition sahi se padho.
Recall Solution L1.1
(a) Number. Koi bhi conditioning nahi — kisi bhi info ke bina ek single best guess.
(b) Number. Humne value Y=3 fix kar di, toh kuch bhi random nahi bacha; ye ek specific average hai.
(c) Random variable. Capital Y random rehta hai. Ye function g(Y)=E[X∣Y=y]y=Y hai, toh iski value Y ke saath badlati hai.
(d) Number.OuterE[⋅] (c) ke random variable ko saare Y ke upar average karta hai; Tower Rule se ye E[X] ke barabar hai.
Rule of thumb: lower-case y (ya koi fixed event) → number; capital Y andar ho → random variable.
Recall Solution L1.2
B given hone par, outcomes {2,4,6} hain, har ek ka conditional probability 31 hai.
E[X∣B]=2⋅31+4⋅31+6⋅31=32+4+6=312=4.
Ye sirf ordinary mean hai, lekin conditional distribution use karke compute kiya gaya (sirf even faces bachte hain).
Goal: Tower Rule aur "take out what is known" ko ek clean step mein apply karo.
Recall Solution L2.1
Y ko coin maano. Uske upar condition karo:
E[X∣Y=H]=3.5,E[X∣Y=T]=10.
Tower Rule, P(Y=H)=P(Y=T)=21 se weight karke:
E[X]=21(3.5)+21(10)=213.5=6.75.
Recall Solution L2.2
Jab Y known hai, Y2 ek constant hai aur bahar aa jaata hai:
E[Y2X∣Y]=Y2E[X∣Y]=Y2⋅3.5,
independence (X⊥Y) use karke E[X∣Y]=E[X]=3.5 likhte hain.
Expectations lo (Tower Rule):
E[Y2X]=3.5E[Y2].
Fair die ke liye, E[Y2]=612+22+⋯+62=691. Toh
E[Y2X]=3.5⋅691=27⋅691=12637≈53.083.
Recall Solution L2.3
[0,y] par uniform ka mean midpoint 20+y=2y hota hai, toh
E[X∣Y=y]=2y⟹E[X∣Y]=2Y.
Tower: E[X]=E[2Y]=21E[Y]=21⋅21=41.
Goal: wo conditioning variable choose karo jo ek messy problem ko easy banaye, aur mixed/continuous cases handle karo.
Recall Solution L3.1
Chosen p par condition karo. Success probability p wale geometric variable (first success) ka mean p1 hota hai:
E[N∣p=31]=3,E[N∣p=21]=2.
Tower Rule, equal weights 21:
E[N]=21(3)+21(2)=25=2.5.p par conditioning ne ek ugly mixture ko do textbook geometrics mein badal diya.
Recall Solution L3.2
N=n given hone par, expectation ki linearity se E[S∣N=n]=n⋅3.5 milta hai. Isliye E[S∣N]=3.5N.
Tower:
E[S]=E[3.5N]=3.5E[N]=3.5⋅3.5=12.25.
(Ye bilkul Wald's identity ki shape hai: E[S]=E[N]E[X] jab NXi's se independent ho.)
Recall Solution L3.3
Same midpoint reasoning: E[X∣Y=y]=2y, toh E[X∣Y]=2Y.
Ab E[Y]=20+2=1, toh
E[X]=E[2Y]=21⋅1=21.
Figure mein red line conditional-mean function y↦y/2 hai; Y ki range par iska height average karo (Y ki uniform density se weighted) toh E[X]=21 milta hai.
Goal: tower + take-out + variance decomposition combine karke ek non-obvious quantity tak pahuncho.
Recall Solution L4.1
Y known hota hai jab hum uske upar condition karte hain, toh use bahar nikalo:
E[XY∣Y]=YE[X∣Y]=Y⋅2Y=2Y2.
Tower:
E[XY]=E[2Y2]=21E[Y2].Y∼U(0,1) ke liye, E[Y2]=∫01y2dy=31. Isliye
E[XY]=21⋅31=61≈0.1667.
Recall Solution L4.2
Within-group term.[0,y] par uniform ka variance 12y2 hota hai, toh Var(X∣Y)=12Y2 aur
E[Var(X∣Y)]=121E[Y2]=121⋅31=361.Between-group term. Hamare paas E[X∣Y]=2Y hai, toh
Var(2Y)=41Var(Y)=41⋅121=481,[0,1] par uniform ke liye Var(Y)=12(1−0)2=121 use karke.
Add karo:Var(X)=361+481.
Common denominator 144: 1444+1443=1447≈0.04861.
Mean (Wald / tower).N=n given hone par, E[S∣N=n]=n⋅10, toh E[S∣N]=10N. Tower:
E[S]=10E[N]=10⋅4=40.Variance (Eve's Law).
Within-group: N=n given hone par, Xi independent hain, toh Var(S∣N=n)=n⋅25, yaani Var(S∣N)=25N. Isliye
E[Var(S∣N)]=25E[N]=25⋅4=100.
Between-group: E[S∣N]=10N, toh
Var(E[S∣N])=100Var(N)=100⋅4=400,
Poisson ke liye Var(N)=λ=4 use karke.
Add karo:
Var(S)=100+400=500.Sanity/degenerate check. Agar har customer exactly 10 kharchta (toh Var(Xi)=0), within-group term vanish ho jaata aur Var(S)=100Var(N)=400 — pure customer-count randomness. Humara extra 100 precisely spending randomness hai. Dono effects add hote hain, jaisa Eve's Law demand karta hai.
Recall Solution L5.2
Agar Y≡c hamesha hai, toh Y par condition karne se tumhe kuch naya nahi pata — har outcome mein already Y=c hai. Toh X ki conditional distribution uski unconditional distribution ke barabar hai:
E[X∣Y]=E[X∣Y=c]=E[X],
ek constant random variable. Phir
E[E[X∣Y]]=E[E[X]]=E[X],
kyunki ek constant ki expectation woh khud hoti hai. Tower Rule E[X]=E[X] identity mein collapse ho jaata hai — boundary case jahan "groups mein split karna" exactly ek group banata hai. Ye independence collapse rule ko mirror karta hai: ek constant har cheez se independent hota hai.
Recall Self-check: kaun sa tool kaun se kaam ke liye?
E[XY] given hai jahan Y conditioning variable hai — pehla move kya? ::: Take out what is known: E[XY∣Y]=YE[X∣Y], phir tower apply karo.
Compound sum S=∑1NXi, mean chahiye? ::: Tower / Wald: E[S]=E[N]E[X].
Compound sum, variance chahiye? ::: Eve's Law: E[N]Var(X)+Var(N)(E[X])2.
Conditioning variable ek constant hai — E[X∣Y] ka kya hota hai? ::: Ye E[X] ke barabar ho jaata hai; tower ek trivial identity ban jaati hai.
"Plain average of conditional means" kab valid hai? ::: Sirf jab saare P(Y=y) equal hon.