Skip to content
Probability, Statistics and Financial Data / Discrete Random Variables

Conditioning and Independence for Discrete Random Variables

"Given that this name has already downgraded once, what's the distribution of further downgrades?" is a conditional-PMF question. "Are order-arrival counts on two different venues independent?" is an independence-of-random-variables question. This note completes the discrete-random-variable toolkit by restating Probability Foundations's conditioning and independence machinery in random-variable notation: the conditional PMF given an event or given another random variable, the sequential construction of a joint PMF via conditioning (the multiplication rule, restated), the total probability formula for PMFs (a divide-and-conquer route to a marginal), and independence of random variables — including the algebraically useful fact that independence makes E[XY]=E[X]E[Y]\mathbb{E}[XY]=\mathbb{E}[X]\mathbb{E}[Y], in sharp contrast to Joint PMFs's linearity-of-expectation result, which needed no such assumption.
Learning objectives. By the end of this note you should be able to:
  • define and compute the conditional PMF of XX given an event AA, and given a value of another random variable YY;
  • build a joint PMF sequentially from conditional PMFs, and recover a marginal PMF via the total probability formula;
  • state the definition of independence of two random variables and verify it (or its failure) from a joint PMF;
  • prove that independence implies E[XY]=E[X]E[Y]\mathbb{E}[XY]=\mathbb{E}[X]\mathbb{E}[Y], and explain why the converse can fail.

In this lesson

  1. Conditioning a random variable on an event
  2. Conditioning on another random variable
  3. Independence of random variables

Before you start

The full lesson, with worked examples and exercise solutions, is for members.

Read the full lesson

New to SelfMadeQuant.com? See membership options or browse the Probability, Statistics and Financial Data syllabus.