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 ClassificationCumulative 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Making 10 as an Addition StrategyAddition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts Through 10Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineOpposites and Additive InversesAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsFunction Notation ReviewRandom Variables: Definition and ClassificationProbability Mass Functions and Discrete Distributions

Longest path: 59 steps · 267 total prerequisite topics

Prerequisites (1)

Leads To (6)