4.9.3 · D4 · HinglishProbability Theory & Statistics

ExercisesDiscrete random variables — PMF, CDF

1,738 words8 min read↑ Read in English

4.9.3 · D4 · Maths › Probability Theory & Statistics › Discrete random variables — PMF, CDF


Level 1 — Recognition

Recall Solution L1·Q1

KYA check karte hain: sirf do rules.

  1. Har entry hai? Haan — sab non-negative hain. ✓
  2. Kya inка sum 1 hai? . ✓

Dono rules hold karte hain, toh haan, yeh ek legal PMF hai. Kyunki ek listed value nahi hai, wahan koi mass nahi baithta: .

Recall Solution L1·Q2

KYA karte hain: wali saari values ka mass sum karo.

  • . (Values hain .)
  • . (Values hain ; value nahi hai.)

Dhyan do ki flat hai aur ke beech: tak pahunchne se pehle collect karne ke liye kuch naya nahi hai.

Neeche staircase figure dekho — yahi is variable ka CDF hai.


Level 2 — Application

Recall Solution L2·Q1

KYUN normalization: total mass rule woh equation hai jo unknown ko pin down karti hai. Toh .

: values aur ka mass add karo: Complement se cross-check: . ✓

Recall Solution L2·Q2

KYUN do answers: bracket type decoration nahi hai — points positive mass carry karte hain, toh endpoint include ya exclude karna count change karta hai.

ko exclude karta hai, ko include karta hai → values :

ko include karta hai → values : Extra exactly hai, woh mass jo humne rakhna choose kiya.


Level 3 — Analysis

Recall Solution L3·Q1

KYUN jumps = mass: parent note ke according, — har vertical step ki height exactly wahan baithne wali probability hai. Flat pieces ka matlab koi mass nahi.

Staircase par jump karti hai:

  • par:
  • par:
  • par:
  • par:

Toh RV par live karta hai (nahi par — puri mein flat hai, toh wahan koi mass nahi) aur Sanity check: . ✓

Step heights recovery figure mein dikhaye gaye hain:

Recall Solution L3·Q2
  • = par jump = .
  • : values aur → sirf , toh . (CDF se: .)
  • = . (Values aur : . ✓)

Level 4 — Synthesis

Recall Solution L4·Q1

KYUN binomial: independent trials, har Head same ke saath; successes count karta hai. flips mein exactly Heads paane ke tarike hain.

Total check: . ✓

Recall Solution L4·Q2

KYUN Poisson: yeh "kitne independent rare events ek fixed window mein land karte hain" ke liye standard PMF hai, jo ek parameter mean count se governed hai. Numerically .


Level 5 — Mastery

Recall Solution L5·Q1

(a) Infinite tail ke saath Normalization. Values countably infinite hain, toh hum ek geometric series sum karte hain: ( for use kiya, yahan .) Toh aur .

(b) .

(c) Definition se .

  • , . Unka intersection exactly hai, toh .
  • .
Recall Solution L5·Q2

Proof. Events aur disjoint hain (koi value dono nahi ho sakti) aur unka union sab kuch hai jo kar sakta hai. Probability axioms se (dekho Probability Axioms), disjoint events jo cover karte hain unki probabilities 1 sum karti hain:

Apply. Die, par uniform: , toh (Directly check karo: values dete hain . ✓)


Recall Exercise skills ka one-line summary

PMF read/verify karo (rules) → CDF tak sum karo (staircase) → correct endpoints ke saath intervals read karo → mass recover karne ke liye jumps invert karo → named models se PMFs banao (Binomial, Poisson, geometric) → axioms se complement/conditional identities prove karo.

Connections

  • Parent: Discrete RVs — PMF, CDF — woh machinery jo yeh exercises drill karti hain.
  • Probability Axioms — normalization aur disjoint-union facts jo throughout use hote hain.
  • Binomial Distribution, Poisson Distribution — L4 mein named PMFs.
  • Conditional Probability — L5·Q1 mein ratio.
  • Expectation and Variance of Discrete RVs — PMF milne ke baad natural next step.
  • Continuous random variables — PDF, CDF — jahan endpoint subtleties khatam ho jaati hain kyunki .