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

Distribution and Density Functions (Rigorous)

Graduate Depth 79 in the knowledge graph I know this Set as goal
217topics build on this
369prerequisites beneath it
See this on the map →
Random Variables as Measurable FunctionsThe Borel Sigma-AlgebraCharacteristic FunctionsJoint Distributions and Marginals (Rigorous)
distributions density cdf

Core Idea

The cumulative distribution function F(x) = P(X ≤ x) uniquely determines the distribution of X. A probability density function f is the Radon-Nikodym derivative when the distribution is absolutely continuous with respect to Lebesgue measure. Distributions may also be purely singular or have atoms.

Explainer

From your prerequisite on random variables as measurable functions, you know that a random variable X is a measurable map X: (Ω, ℱ) → (ℝ, ℬ(ℝ)), and you've worked with the Borel σ-algebra ℬ(ℝ). The distribution of X is the pushforward measure μ_X defined by μ_X(B) = P(X ∈ B) = P(X⁻¹(B)) for Borel sets B ⊆ ℝ. Everything you want to know about X — probabilities, expectations, quantiles — is encoded in μ_X. Crucially, μ_X is a probability measure on (ℝ, ℬ(ℝ)), so it inherits all the properties of measures: countable additivity, σ-finiteness on ℝ, and so on.

The cumulative distribution function F(x) = P(X ≤ x) = μ_X((−∞, x]) is a convenient scalar summary of the distribution. Its properties follow directly from measure theory: F is non-decreasing (measures of nested sets are nested), right-continuous (by the continuity-from-above property of measures), and satisfies F(−∞) = 0, F(+∞) = 1. Conversely, any function with these three properties is the CDF of some random variable. The key structural fact is that F uniquely determines μ_X — there is a one-to-one correspondence between CDFs satisfying these properties and probability measures on ℝ. This is why CDFs are the universal language for describing distributions.

A probability density function arises when the distribution is absolutely continuous with respect to Lebesgue measure λ. Absolute continuity μ_X ≪ λ means: whenever a Borel set has Lebesgue measure zero, it also has μ_X-measure zero. When this holds, the Radon-Nikodym theorem guarantees a unique (up to a.e. equivalence) measurable function f such that μ_X(B) = ∫_B f dλ for all Borel B. This function f is the PDF, and it equals F'(x) almost everywhere. The Radon-Nikodym framing is the rigorous version of the intuitive statement "probability = area under the density curve" — you are literally saying that the probability measure is absolutely continuous with respect to length (Lebesgue measure), and the derivative f is the density of probability per unit length.

Not all distributions have PDFs. A discrete distribution concentrates all its mass on a countable set of points: P(X = xₖ) = pₖ > 0 for a countable collection. Such a distribution is singular with respect to Lebesgue measure — it is entirely supported on a set of Lebesgue measure zero — so no Radon-Nikodym density exists. A stranger beast is the purely singular continuous distribution, whose CDF is continuous (no atoms) but is constant almost everywhere. The Cantor distribution is the canonical example: its CDF is the Devil's staircase, which increases from 0 to 1 entirely on the Cantor set (measure zero), so its "density" would have to be zero almost everywhere but still integrate to 1 — a contradiction, so no density exists. The full Lebesgue decomposition theorem says every distribution uniquely decomposes into an absolutely continuous part (has a PDF), a discrete part (atoms), and a singular continuous part.

Understanding the Radon-Nikodym perspective matters because it unifies otherwise disparate formulas. The PDF formula P(a < X ≤ b) = ∫_ab f(x) dx and the PMF formula P(X = k) = pₖ are not really two different things — they are both special cases of P(X ∈ B) = ∫_B dμ_X, one where μ_X is absolutely continuous (use Radon-Nikodym to get f) and one where μ_X is a sum of point masses. Characteristic functions, the joint distribution theory that builds on this topic, and all of measure-theoretic probability depend on fluency with this framework.

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 10Number Bonds to 10Addition 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 (0s, 1s, 2s, 5s, 10s)Multiplication 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 LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementCartesian Products and RelationsPartial OrdersBinary RelationsEquivalence RelationsInjective, Surjective, and Bijective FunctionsCardinality and CountabilitySigma-Algebras and Measurable SetsThe Borel Sigma-AlgebraProbability Spaces (Measure-Theoretic Definition)Random Variables as Measurable FunctionsDistribution and Density Functions (Rigorous)

Longest path: 80 steps · 369 total prerequisite topics

Prerequisites (2)

Leads To (2)