Fiveable

🎲Intro to Probabilistic Methods Unit 3 Review

QR code for Intro to Probabilistic Methods practice questions

3.2 Probability mass functions (PMFs)

3.2 Probability mass functions (PMFs)

Written by the Fiveable Content Team • Last updated August 2025
Written by the Fiveable Content Team • Last updated August 2025
🎲Intro to Probabilistic Methods
Unit & Topic Study Guides

Probability mass functions (PMFs) are key tools for understanding discrete random variables. They give us the probability of a variable taking on specific values, helping us calculate important probabilities and make predictions about discrete events.

PMFs have crucial properties like non-negativity and summing to one. These properties ensure PMFs accurately represent probability distributions. We can use PMFs to find expected values, variances, and other important measures for discrete random variables.

Probability Mass Functions

Definition and Notation

  • A probability mass function (PMF) is a function that gives the probability of a discrete random variable taking on a specific value
  • The PMF is denoted as P(X=x)P(X = x), where XX is the random variable and xx is a specific value that XX can take
  • For a discrete random variable XX, the PMF is defined for all possible values of XX
  • The PMF is also known as the probability function or the probability distribution of a discrete random variable (probability function, probability distribution)

Properties of PMFs

  • Non-negativity: A PMF must be non-negative for all possible values of the random variable XX, i.e., P(X=x)0P(X = x) ≥ 0 for all xx
    • This property ensures that probabilities are always between 0 and 1, inclusive
  • Summing to one: The sum of the PMF values for all possible values of XX must equal one, i.e., ΣP(X=x)=1Σ P(X = x) = 1 over all xx
    • This property ensures that the total probability of all possible outcomes is 1
  • The PMF of a discrete random variable XX uniquely determines its probability distribution, as it specifies the probability of each possible value of XX

Calculating Probabilities with PMFs

Evaluating PMFs

  • To calculate the probability of a discrete random variable XX taking on a specific value xx, evaluate the PMF at that value: P(X=x)P(X = x)
    • Example: If XX represents the number of heads in two coin flips and P(X=1)=0.5P(X = 1) = 0.5, then the probability of getting exactly one head in two coin flips is 0.5
  • The probability of XX taking on a value within a range can be calculated by summing the PMF values for all xx in that range: P(aXb)=ΣP(X=x)P(a ≤ X ≤ b) = Σ P(X = x) for axba ≤ x ≤ b
    • Example: If XX represents the number of defective items in a batch of 5, and P(X=0)=0.7P(X = 0) = 0.7, P(X=1)=0.2P(X = 1) = 0.2, and P(X=2)=0.1P(X = 2) = 0.1, then the probability of having at most one defective item is P(0X1)=P(X=0)+P(X=1)=0.7+0.2=0.9P(0 ≤ X ≤ 1) = P(X = 0) + P(X = 1) = 0.7 + 0.2 = 0.9
Definition and Notation, File:Discrete probability distribution illustration.png - Wikimedia Commons

Cumulative Distribution Function (CDF)

  • The cumulative distribution function (CDF) of a discrete random variable XX can be calculated using the PMF: F(x)=P(Xx)=ΣP(X=k)F(x) = P(X ≤ x) = Σ P(X = k) for all kxk ≤ x
    • The CDF gives the probability that the random variable XX takes on a value less than or equal to xx
    • Example: Using the previous example, the CDF for X1X ≤ 1 is F(1)=P(X1)=P(X=0)+P(X=1)=0.7+0.2=0.9F(1) = P(X ≤ 1) = P(X = 0) + P(X = 1) = 0.7 + 0.2 = 0.9

Validating PMFs

Non-negativity and Summing to One

  • A valid PMF must satisfy two conditions: non-negativity and summing to one
    • Non-negativity: The PMF must be non-negative for all possible values of the random variable XX, i.e., P(X=x)0P(X = x) ≥ 0 for all xx
    • Summing to one: The sum of the PMF values for all possible values of XX must equal one, i.e., ΣP(X=x)=1Σ P(X = x) = 1 over all xx
  • If a given function satisfies both conditions, it is a valid PMF; otherwise, it is not a valid PMF
    • Example: Let P(X=0)=0.3P(X = 0) = 0.3, P(X=1)=0.5P(X = 1) = 0.5, and P(X=2)=0.2P(X = 2) = 0.2. This is a valid PMF because all values are non-negative and they sum to 1
    • Example: Let P(X=0)=0.4P(X = 0) = 0.4, P(X=1)=0.7P(X = 1) = 0.7, and P(X=2)=0.1P(X = 2) = -0.1. This is not a valid PMF because P(X=2)P(X = 2) is negative and the values do not sum to 1

Properties of PMFs

Expected Value and Variance

  • The expected value (mean) of a discrete random variable XX can be calculated using its PMF: E(X)=ΣxP(X=x)E(X) = Σ x * P(X = x) over all xx
    • Example: If XX represents the number of heads in two coin flips, with P(X=0)=0.25P(X = 0) = 0.25, P(X=1)=0.5P(X = 1) = 0.5, and P(X=2)=0.25P(X = 2) = 0.25, then E(X)=00.25+10.5+20.25=1E(X) = 0 * 0.25 + 1 * 0.5 + 2 * 0.25 = 1
  • The variance of a discrete random variable XX can be calculated using its PMF: Var(X)=E(X2)[E(X)]2Var(X) = E(X^2) - [E(X)]^2, where E(X2)=Σx2P(X=x)E(X^2) = Σ x^2 * P(X = x) over all xx
    • Example: Using the previous example, E(X2)=020.25+120.5+220.25=0+0.5+1=1.5E(X^2) = 0^2 * 0.25 + 1^2 * 0.5 + 2^2 * 0.25 = 0 + 0.5 + 1 = 1.5, and Var(X)=1.512=0.5Var(X) = 1.5 - 1^2 = 0.5