Course contentsShow
← Data Science
Lesson 118 of 2,1454. Discrete Probability DistributionsFree lesson

Probability Mass Functions (PMF)

Defining PMFs as functions that assign probabilities to each possible value of a discrete random variable.

Probability Mass Functions (PMF)

What You'll Learn

You'll learn how a Probability Mass Function assigns exact probabilities to each possible value a discrete random variable can take.

The Core Idea

Remember from the last lesson that a discrete random variable assigns numbers to outcomes (like the number of heads in three coin flips). But how do we know the probability of each possible value? That's where the Probability Mass Function (PMF) comes in.

A PMF is simply a function that tells you "what's the probability of getting exactly this value?" For every possible value your discrete random variable can take, the PMF gives you its probability.

Think of it like a vending machine menu: each button (possible value) has a price tag (probability) next to it. The PMF is that complete menu, showing all options and their associated probabilities.

Properties Every PMF Must Have

A valid PMF must satisfy two rules:

  1. All probabilities are between 0 and 1: Each value's probability must be non-negative and at most 1
  2. All probabilities sum to 1: When you add up the probabilities of all possible values, you get exactly 1 (certainty that something will happen)

Example: Rolling a Fair Die

If X is the number showing on a fair six-sided die:

  • P(X = 1) = 1/6
  • P(X = 2) = 1/6
  • P(X = 3) = 1/6
  • ...and so on

This list of value-probability pairs is the PMF. Notice: all probabilities are positive and sum to 1.

Key Takeaway: A Probability Mass Function (PMF) is a complete mapping from each possible value of a discrete random variable to its exact probability, where all probabilities are non-negative and sum to 1.