4.9.3 · D4Probability Theory & Statistics

Exercises — Discrete random variables — PMF, CDF

1,628 words7 min readBack to topic

Level 1 — Recognition

Recall Solution L1·Q1

WHAT we check: the two-and-only-two rules.

  1. Every entry ? Yes — are all non-negative. ✓
  2. Do they sum to 1? . ✓

Both rules hold, so yes, it is a legal PMF. Since is not a listed value, no mass sits there: .

Recall Solution L1·Q2

WHAT we do: sum all mass at values .

  • . (Values are .)
  • . (Values are ; the value is not.)

Notice is flat between and : nothing new to collect until you hit .

Look at the staircase figure below — it is the CDF of this variable.


Level 2 — Application

Recall Solution L2·Q1

WHY normalization: the total mass rule is the equation that pins down the unknown . So .

: add the mass at values and : Cross-check with the complement: . ✓

Recall Solution L2·Q2

WHY two answers: the bracket type is not decoration — points carry positive mass, so including or excluding an endpoint changes the count.

excludes , includes → values :

includes → values : The extra is exactly , the mass we chose to keep.


Level 3 — Analysis

Recall Solution L3·Q1

WHY jumps = mass: by the parent note, — the height of each vertical step is the probability sitting exactly there. Flat pieces mean no mass.

The staircase jumps at :

  • at :
  • at :
  • at :
  • at :

So the RV lives on (not is flat across , so no mass there) with Sanity check: . ✓

The step heights are shown in the recovery figure:

Recall Solution L3·Q2
  • = jump at = .
  • : values and → just , so . (Via CDF: .)
  • = . (Values and : . ✓)

Level 4 — Synthesis

Recall Solution L4·Q1

WHY binomial: independent trials, each Head with the same ; counts successes. The number of ways to get exactly Heads in flips is .

Check total: . ✓

Recall Solution L4·Q2

WHY Poisson: it is the standard PMF for "how many independent rare events land in a fixed window," governed by one parameter mean count. Numerically .


Level 5 — Mastery

Recall Solution L5·Q1

(a) Normalization with an infinite tail. The values are countably infinite, so we sum a geometric series: (Used for , here .) So and .

(b) .

(c) By definition .

  • , . Their intersection is exactly , so .
  • .
Recall Solution L5·Q2

Proof. The events and are disjoint (no value can be both) and their union is everything can do. By the probability axioms (see Probability Axioms), disjoint events that cover have probabilities summing to :

Apply. Die, uniform on : , so (Check directly: values give . ✓)


Recall One-line summary of the exercise skills

Read/verify a PMF (rules) → sum to a CDF (staircase) → read intervals with correct endpoints → invert jumps to recover mass → build PMFs from named models (Binomial, Poisson, geometric) → prove complement/conditional identities from the axioms.

Connections

  • Parent: Discrete RVs — PMF, CDF — the machinery these exercises drill.
  • Probability Axioms — normalization and disjoint-union facts used throughout.
  • Binomial Distribution, Poisson Distribution — the named PMFs in L4.
  • Conditional Probability — the ratio in L5·Q1.
  • Expectation and Variance of Discrete RVs — the natural next step once the PMF is in hand.
  • Continuous random variables — PDF, CDF — where the endpoint subtleties vanish because .