This is a compactness result for sequences of distribution functions . It says that we can always extract a convergent subsequence, but the limit may fail to be a distribution function. In general it is only a right-continuous, non-decreasing function with values in [ 0 , 1 ] [0, 1] [ 0 , 1 ] . Recovering a distribution function as the limit requires the tightness condition .
Theorem
Let { F n } n ≥ 1 \{F_n\}_{n \ge 1} { F n } n ≥ 1 be a sequence of distribution functions. Then there exists a subsequence { F n m } m ≥ 1 \{F_{n_m}\}_{m \ge 1} { F n m } m ≥ 1 and a right-continuous, non-decreasing function F F F such that
lim m → ∞ F n m ( y ) = F ( y ) \lim_{m \to \infty} F_{n_m}(y) = F(y) m → ∞ lim F n m ( y ) = F ( y ) for all y y y at which F F F is continuous.
The argument has three pieces: a diagonal extraction to pin down the limit on the rationals, a right-continuous extension to all of R \mathbb{R} R , and a sandwich argument at continuity points.
Diagonal extraction over the rationals
Let { q k } k ≥ 1 \{q_k\}_{k \ge 1} { q k } k ≥ 1 be an enumeration of Q \mathbb{Q} Q . Each F n F_n F n is a distribution function, so F n ( q k ) ∈ [ 0 , 1 ] F_n(q_k) \in [0, 1] F n ( q k ) ∈ [ 0 , 1 ] for every n n n and k k k (see property 2 ).
For q 1 q_1 q 1 , the sequence { F n ( q 1 ) } n ≥ 1 \{F_n(q_1)\}_{n \ge 1} { F n ( q 1 ) } n ≥ 1 is bounded in [ 0 , 1 ] [0,1] [ 0 , 1 ] . By the Bolzano–Weierstrass theorem, there is a subsequence { F n 1 , j } j ≥ 1 \{F_{n_{1,j}}\}_{j \ge 1} { F n 1 , j } j ≥ 1 such that
F n 1 , j ( q 1 ) → G ( q 1 ) ∈ [ 0 , 1 ] . F_{n_{1,j}}(q_1) \to G(q_1) \in [0,1]. F n 1 , j ( q 1 ) → G ( q 1 ) ∈ [ 0 , 1 ] .
For q 2 q_2 q 2 , apply Bolzano–Weierstrass again to { F n 1 , j ( q 2 ) } j ≥ 1 \{F_{n_{1,j}}(q_2)\}_{j \ge 1} { F n 1 , j ( q 2 ) } j ≥ 1 to extract a further subsequence { F n 2 , j } j ≥ 1 \{F_{n_{2,j}}\}_{j \ge 1} { F n 2 , j } j ≥ 1 with F n 2 , j ( q 2 ) → G ( q 2 ) F_{n_{2,j}}(q_2) \to G(q_2) F n 2 , j ( q 2 ) → G ( q 2 ) .
Continue inductively. The diagonal subsequence F n m : = F n m , m F_{n_m} := F_{n_{m,m}} F n m := F n m , m is, from index m m m onwards, a subsequence of { F n k , j } j ≥ 1 \{F_{n_{k,j}}\}_{j \ge 1} { F n k , j } j ≥ 1 for every k ≤ m k \le m k ≤ m . Therefore
F n m ( q k ) → m → ∞ G ( q k ) for every q k ∈ Q . —(1.1) F_{n_m}(q_k) \xrightarrow{m \to \infty} G(q_k) \qquad \text{for every } q_k \in \mathbb{Q}. \quad\textcolor{gray}{\text{---(1.1)}} F n m ( q k ) m → ∞ G ( q k ) for every q k ∈ Q . —(1.1)
G G G is non-decreasing on Q \mathbb{Q} Q
For rationals q < q ′ q < q' q < q ′ , monotonicity of each F n m F_{n_m} F n m (see property 1 ) gives
F n m ( q ) ≤ F n m ( q ′ ) . F_{n_m}(q) \le F_{n_m}(q'). F n m ( q ) ≤ F n m ( q ′ ) .
Passing to the limit in ( 1.1 ) (1.1) ( 1.1 ) , G ( q ) ≤ G ( q ′ ) G(q) \le G(q') G ( q ) ≤ G ( q ′ ) .
Right-continuous extension to R \mathbb{R} R
Define
F ( y ) : = inf { G ( q ) : q ∈ Q , q > y } for y ∈ R . F(y) := \inf \{ G(q) : q \in \mathbb{Q}, \ q > y \} \qquad \text{for } y \in \mathbb{R}. F ( y ) := inf { G ( q ) : q ∈ Q , q > y } for y ∈ R .
Non-decreasing. If y 1 ≤ y 2 y_1 \le y_2 y 1 ≤ y 2 , then { q ∈ Q : q > y 2 } ⊆ { q ∈ Q : q > y 1 } \{q \in \mathbb{Q} : q > y_2\} \subseteq \{q \in \mathbb{Q} : q > y_1\} { q ∈ Q : q > y 2 } ⊆ { q ∈ Q : q > y 1 } , so the infimum over the smaller set is at least as large. Hence F ( y 1 ) ≤ F ( y 2 ) F(y_1) \le F(y_2) F ( y 1 ) ≤ F ( y 2 ) .
Right-continuous. Fix y y y and ϵ > 0 \epsilon > 0 ϵ > 0 . By definition of the infimum, there is a rational q ∗ > y q^* > y q ∗ > y with G ( q ∗ ) < F ( y ) + ϵ G(q^*) < F(y) + \epsilon G ( q ∗ ) < F ( y ) + ϵ . For any y ′ ∈ ( y , q ∗ ) y' \in (y, q^*) y ′ ∈ ( y , q ∗ ) , every rational q > q ∗ q > q^* q > q ∗ also satisfies q > y ′ q > y' q > y ′ , so the infimum defining F ( y ′ ) F(y') F ( y ′ ) is taken over a set containing q ∗ q^* q ∗ :
F ( y ′ ) ≤ G ( q ∗ ) < F ( y ) + ϵ . F(y') \le G(q^*) < F(y) + \epsilon. F ( y ′ ) ≤ G ( q ∗ ) < F ( y ) + ϵ .
Combined with monotonicity (F ( y ) ≤ F ( y ′ ) F(y) \le F(y') F ( y ) ≤ F ( y ′ ) ), we get F ( y ) ≤ F ( y ′ ) < F ( y ) + ϵ F(y) \le F(y') < F(y) + \epsilon F ( y ) ≤ F ( y ′ ) < F ( y ) + ϵ for all y ′ ∈ ( y , q ∗ ) y' \in (y, q^*) y ′ ∈ ( y , q ∗ ) . Letting y ′ ↓ y y' \downarrow y y ′ ↓ y gives right-continuity at y y y .
Values lie in [ 0 , 1 ] [0,1] [ 0 , 1 ] since G G G does.
Convergence at continuity points
Let y y y be a continuity point of F F F and fix ϵ > 0 \epsilon > 0 ϵ > 0 .
Upper sandwich. By definition of F ( y ) F(y) F ( y ) , pick a rational q ′ > y q' > y q ′ > y with
G ( q ′ ) < F ( y ) + ϵ . —(1.2) G(q') < F(y) + \epsilon. \quad\textcolor{gray}{\text{---(1.2)}} G ( q ′ ) < F ( y ) + ϵ . —(1.2)
Lower sandwich. Continuity at y y y gives some y 0 < y y_0 < y y 0 < y with F ( y 0 ) > F ( y ) − ϵ F(y_0) > F(y) - \epsilon F ( y 0 ) > F ( y ) − ϵ . Pick any rational q ∈ ( y 0 , y ) q \in (y_0, y) q ∈ ( y 0 , y ) . Since q > y 0 q > y_0 q > y 0 is rational, G ( q ) G(q) G ( q ) appears in the infimum defining F ( y 0 ) F(y_0) F ( y 0 ) , so F ( y 0 ) ≤ G ( q ) F(y_0) \le G(q) F ( y 0 ) ≤ G ( q ) , giving
G ( q ) ≥ F ( y 0 ) > F ( y ) − ϵ . —(1.3) G(q) \ge F(y_0) > F(y) - \epsilon. \quad\textcolor{gray}{\text{---(1.3)}} G ( q ) ≥ F ( y 0 ) > F ( y ) − ϵ . —(1.3)
Now squeeze F n m ( y ) F_{n_m}(y) F n m ( y ) between rational evaluations. Since q < y < q ′ q < y < q' q < y < q ′ and each F n m F_{n_m} F n m is non-decreasing,
F n m ( q ) ≤ F n m ( y ) ≤ F n m ( q ′ ) . F_{n_m}(q) \le F_{n_m}(y) \le F_{n_m}(q'). F n m ( q ) ≤ F n m ( y ) ≤ F n m ( q ′ ) .
Taking lim inf \liminf lim inf and lim sup \limsup lim sup as m → ∞ m \to \infty m → ∞ and using ( 1.1 ) (1.1) ( 1.1 ) :
G ( q ) ≤ lim inf m → ∞ F n m ( y ) ≤ lim sup m → ∞ F n m ( y ) ≤ G ( q ′ ) . G(q) \le \liminf_{m \to \infty} F_{n_m}(y) \le \limsup_{m \to \infty} F_{n_m}(y) \le G(q'). G ( q ) ≤ m → ∞ lim inf F n m ( y ) ≤ m → ∞ lim sup F n m ( y ) ≤ G ( q ′ ) .
Combining with ( 1.2 ) (1.2) ( 1.2 ) and ( 1.3 ) (1.3) ( 1.3 ) :
F ( y ) − ϵ < lim inf m → ∞ F n m ( y ) ≤ lim sup m → ∞ F n m ( y ) < F ( y ) + ϵ . F(y) - \epsilon < \liminf_{m \to \infty} F_{n_m}(y) \le \limsup_{m \to \infty} F_{n_m}(y) < F(y) + \epsilon. F ( y ) − ϵ < m → ∞ lim inf F n m ( y ) ≤ m → ∞ lim sup F n m ( y ) < F ( y ) + ϵ .
Since ϵ > 0 \epsilon > 0 ϵ > 0 was arbitrary, lim m → ∞ F n m ( y ) = F ( y ) \lim_{m \to \infty} F_{n_m}(y) = F(y) lim m → ∞ F n m ( y ) = F ( y ) .
The function F F F produced above is non-decreasing, right-continuous, and bounded between 0 0 0 and 1 1 1 , but mass can escape to infinity along the subsequence. Consider F n F_n F n the distribution function of a point mass at n n n :
F n ( y ) = 1 { y ≥ n } . F_n(y) = \mathbb{1}_{\{y \ge n\}}. F n ( y ) = 1 { y ≥ n } .
For every fixed y ∈ R y \in \mathbb{R} y ∈ R , F n ( y ) → 0 F_n(y) \to 0 F n ( y ) → 0 as n → ∞ n \to \infty n → ∞ , so the limit is F ≡ 0 F \equiv 0 F ≡ 0 . This F F F is right-continuous and non-decreasing, but does not satisfy property 2 of a distribution function (lim y → ∞ F ( y ) = 1 \lim_{y \to \infty} F(y) = 1 lim y → ∞ F ( y ) = 1 ). It is not a weak limit in the usual sense, because there is no random variable whose distribution function is F F F .
The tightness condition is exactly what rules out this kind of mass leakage and upgrades Helly’s conclusion to weak convergence.