Skip to content

Universality of the Uniform and CDF Realizability

Theorem

Let F ⁣:R→[0,1]F\colon\mathbb{R}\to[0,1] be nondecreasing and right-continuous, with lim⁡x→−∞F(x)=0\displaystyle\lim_{x\to-\infty}F(x)=0 and lim⁡x→∞F(x)=1\displaystyle\lim_{x\to\infty}F(x)=1. Let U∼Unif⁡(0,1)U\sim\operatorname{Unif}(0,1) and define Q(u)=inf⁡{x ⁣:F(x)≥u}Q(u)=\inf\{x\colon F(x)\ge u\} for 0<u<10<u<1. Then X=Q(U)X=Q(U) satisfies

P(X≤x)=F(x)for every x.\mathbb{P}(X\le x)=F(x)\quad\text{for every }x.

Thus every function satisfying the CDF conditions is realizable as a distribution, and a uniform input can generate that distribution. The construction allows jumps and flat portions of FF.


Interpretation

A uniform draw selects a probability level; the quantile function converts it into an outcome. This both proves that valid CDFs describe genuine random variables and provides inverse transform simulation.

An S-shaped CDF with equally spaced probabilities on the vertical axis mapped across and down to quantiles on the horizontal axis, which bunch together where the curve is steep.

The equally spaced probability levels map to quantiles x=Q(u)x=Q(u). These quantiles are closer together where FF is steep, illustrating how a uniform input produces the target distribution.

The uniform distribution on (0,1)(0,1) assigns probability vv to the interval (0,v](0,v]. The quantile construction turns {Q(U)≤x}\{Q(U)\le x\} into {U≤F(x)}\{U\le F(x)\}, so that probability becomes F(x)F(x).


Key Results

  • The monotonicity, right-continuity, and endpoint-limit conditions are necessary and sufficient for a function to be a CDF.
  • For 0<u<10<u<1, Q(u)≤xQ(u)\le x exactly when u≤F(x)u\le F(x), so P(Q(U)≤x)=P(U≤F(x))=F(x)\mathbb{P}(Q(U)\le x)=\mathbb{P}(U\le F(x))=F(x).
  • Conversely, if XX has a continuous CDF FF, then F(X)∼Unif⁡(0,1)F(X)\sim\operatorname{Unif}(0,1); this direction is the probability integral transform. It fails when FF has jumps, because F(X)F(X) then takes some values with positive probability.

Examples

  • For the step CDF F(x)=0F(x)=0 when x<cx<c and F(x)=1F(x)=1 when x≥cx\ge c, Q(u)=cQ(u)=c and the construction gives X=cX=c almost surely, that is, with probability 11.
  • For F(x)=0F(x)=0 when x<0x<0 and F(x)=1−e−2xF(x)=1-\mathrm{e}^{-2x} when x≥0x\ge0, the construction gives X=−log⁡(1−U)/2∼Exp⁡(2)X=-\log(1-U)/2\sim\operatorname{Exp}(2).

Prerequisites

Sources

Aliases: CDF realizability Keywords: probability integral transform, inverse transform sampling, inverse transformation method, Smirnov transform, inverse transform method, Universality of the Uniform, Realizability of a CDF Symbols: infinity, real numbers

Last updated: 17 October 2026 21:53