A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Probability Mass Functions and Discrete Distributions

College Depth 58 in the knowledge graph ☐ I know this ☆ Set as goal
3,005topics build on this
267prerequisites beneath it
See this on the map →
Random Variables: Definition and Classification→→Cumulative Distribution FunctionsDistribution Functions and Moments+4 more
pmf discrete

Core Idea

The PMF p(x)=P(X=x) of a discrete random variable assigns probability to each value in its range. Valid PMFs satisfy p(x)≥0 and ∑p(x)=1. The PMF completely characterizes the distribution and enables computing probabilities of events as sums of point probabilities.

Explainer

You already know that a random variable is a function that maps outcomes of an experiment to numbers. A probability mass function (PMF) is simply the rule that tells you how much probability weight each number in the range receives. Think of it as a probability budget: you have a total of 1.0 to spend, and the PMF specifies exactly how much goes to each possible outcome.

Consider a fair six-sided die. The random variable X gives the number rolled. The PMF is p(1) = p(2) = p(3) = p(4) = p(5) = p(6) = 1/6. Each value gets an equal share of the budget, and the shares sum to exactly 1. The key insight distinguishing discrete distributions from continuous ones is that here each individual value carries nonzero probability — you can meaningfully ask "what is P(X = 3)?" and get a real answer, 1/6. With a continuous random variable, any single point has probability zero.

The two validity conditions — nonnegativity (p(x) ≥ 0 for all x) and normalization (∑p(x) = 1 over all x in the range) — are the only constraints a PMF must satisfy. These mirror the axioms of probability you've already internalized: probabilities can't be negative, and the total probability of all outcomes is 1. A PMF is just a concrete bookkeeping device that encodes those axioms for a specific discrete random variable.

Once you have the PMF, computing event probabilities is mechanical: just add up the point probabilities of all outcomes in the event. For example, if p(1) = 0.1, p(2) = 0.3, p(3) = 0.4, p(4) = 0.2, then P(X ≤ 2) = p(1) + p(2) = 0.4. This additive structure is what makes discrete distributions tractable. The PMF is also the foundation for the two quantities you'll study next: the expected value (a weighted average of the values, weighted by their probabilities) and the variance (a weighted average of the squared deviations from the mean). Both reduce to sums over the PMF, so a thorough understanding of the PMF now pays dividends immediately.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Making 10 as an Addition Strategy → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts Through 10 → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Opposites and Additive Inverses → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → Function Notation Review → Random Variables: Definition and Classification → Probability Mass Functions and Discrete Distributions

Longest path: 59 steps · 267 total prerequisite topics

Prerequisites (1)

Leads To (6)