Probability Mass Function

Represent a discrete random variable’s law by the nonnegative singleton probabilities p(x)=P(X=x), whose sum over its countable support equals one.

Version

v2 · 2026-09-06 · History

Domain-specific #

2541

Origin domain

mathematics

Subdomain

probability theory

Aliases

Pmf, Discrete probability function, Discrete density with respect to counting measure

Core Idea

For a discrete random variable \(X\), its probability mass function is

\[ p_X(x)=\Pr(X=x). \]

It assigns a nonnegative probability to each possible value, is positive on at most a countable support, and sums to one. For any event \(B\) in the value space, \(\Pr(X\in B)=\sum_{x\in B}p_X(x)\). Measure-theoretically, it is the Radon–Nikodym density of the law of \(X\) with respect to counting measure.

The recognition invariant is discrete law + singleton probabilities + nonnegativity + countable summation to one.

Scope of Application

PMFs describe counts, categories, finite-state outcomes, discrete-time events, combinatorial random objects, contingency tables, queue lengths, and digitized observations. Bernoulli, binomial, geometric, Poisson, categorical, and many empirical discrete laws are specified by PMFs.

Countability is decisive. A mixed distribution can have atomic masses and a continuous component; listing the atom masses alone does not specify the entire mixed law.

Clarity

The support need not be a subset of the integers. It can be any finite or countable set whose singletons are measurable. If the variable is numerical, defining \(p_X\) on all real numbers with zeros off the support is convenient but not required.

The phrase “discrete density” is acceptable only when the reference measure is stated as counting measure.

Manages Complexity

A PMF compresses the full law into a lookup or formula from which events, moments, transforms, likelihoods, conditional probabilities, and simulations can be derived. Normalization and nonnegativity provide immediate validity checks.

For high-dimensional or large-support variables, direct tables become costly. Factorization, conditional independence, probability-generating functions, or sparse representations may manage the same mass without enumerating every state.

Abstract Reasoning

1. Identify the random variable and its value space.
2. Establish that its law is supported on a finite or countable set.
3. Compute each singleton probability.
4. Verify nonnegativity and total mass one.
5. Define the support as values with positive mass.
6. Sum masses for requested events.
7. Obtain marginals by summing over unused coordinates.
8. Compute expectations as \(\sum_xg(x)p_X(x)\) when the sum is defined.
9. Treat mixed or continuous components separately.

Knowledge Transfer

The portable structure is a normalized nonnegative weight function over countable alternatives. The proposed immediate parent is Probability Distribution.

Relationships to Other Abstractions

Current abstraction Probability Mass Function Domain-specific

Parents (1) — more general patterns this builds on

• Probability Mass Function is a kind of Probability Distribution Domain-specific

  Probability Distribution is the proposed immediate parent.

Hierarchy paths (5) — routes to 3 parentless roots

• Probability Mass Function → Probability Distribution → Random Variable → Function (Mapping)

Show alternative paths (4)

Neighborhood in Abstraction Space

Probability Mass Function sits in a sparse region of the domain-specific corpus (89^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Random Variable — 0.80
• Esscher transform — 0.80
• Tsallis Distribution Family — 0.79
• Empirical Measure — 0.79
• Cumulant — 0.79

Computed from structural-signature embeddings · 2026-09-08