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

Distribution Functions and Densities (Rigorous)

Graduate Depth 79 in the knowledge graph I know this Set as goal
228topics build on this
412prerequisites beneath it
See this on the map →
Random Variables as Measurable FunctionsRiemann Integral via Darboux SumsConvergence in DistributionExpectation (Measure-Theoretic)+3 more
distributions densities measure-theory

Core Idea

The cumulative distribution function (CDF) F(x) = P(X ≤ x) is right-continuous, non-decreasing, and uniquely determines the distribution of a random variable. A probability density function (pdf) is a measurable function f ≥ 0 where P(X ∈ A) = ∫ₐ f(x) dx with respect to Lebesgue measure. The Radon-Nikodym theorem guarantees densities exist when distributions are absolutely continuous with respect to Lebesgue measure.

Explainer

You already know that a random variable X is a measurable function from a probability space (Ω, ℱ, P) to ℝ. The cumulative distribution function F(x) = P(X ≤ x) translates this abstract object into a concrete function on ℝ. Every probability about X can be recovered from F: P(a < X ≤ b) = F(b) − F(a), and P(X = a) = F(a) − F(a⁻), where F(a⁻) = lim_{x↑a} F(x) is the left-hand limit. Because X is a measurable function, the set {ω : X(ω) ≤ x} is always in ℱ and has a well-defined probability — so F(x) is well-defined for all x ∈ ℝ.

Three properties characterize every CDF. (1) F is non-decreasing: as x grows, the event {X ≤ x} can only get larger, so its probability can only stay the same or increase. (2) F has the correct limits: F(x) → 0 as x → −∞ (the event {X ≤ x} shrinks to the empty set) and F(x) → 1 as x → +∞ (the event approaches all of Ω). (3) F is right-continuous: F(x) = lim_{t↓x} F(t). Right-continuity is a convention choice — left-continuous CDFs would also work — but the right-continuous version aligns with the ≤ in the definition P(X ≤ x) and ensures point masses appear as jump discontinuities whose sizes equal P(X = a) = F(a) − F(a⁻). Any function satisfying these three properties is the CDF of some random variable.

A probability density function (pdf) is a non-negative measurable function f such that P(X ∈ A) = ∫_A f(x) dx for every measurable set A. When a density exists, F(x) = ∫_{−∞}^x f(t) dt, and the Darboux-sum integral you know from your prerequisites gives F'(x) = f(x) wherever f is continuous — the CDF and pdf are related by differentiation and integration. The rigorous question — when does a density exist? — is answered by the Radon-Nikodym theorem: a density exists if and only if the distribution of X is absolutely continuous with respect to Lebesgue measure, meaning P(X ∈ A) = 0 whenever A has Lebesgue measure zero. Intuitively, a continuous distribution spreads probability diffusely rather than concentrating it at isolated points.

Not all distributions have densities. The Lebesgue decomposition theorem states that any distribution decomposes uniquely into three parts: a discrete component (point masses, like a PMF), an absolutely continuous component (has a density), and a singular continuous component — distributed over a set of Lebesgue measure zero with no point masses and no density, like the Cantor distribution. This rigorous framework extends the intuitive "probability histogram" picture into a mathematically complete theory that handles pathological distributions and forms the foundation for measure-theoretic expectation, joint distributions, and characteristic functions.

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 Functions and Densities (Rigorous)

Longest path: 80 steps · 412 total prerequisite topics

Prerequisites (2)

Leads To (5)