Glivenko–Cantelli theorem

The left diagram illustrates Glivenko–Cantelli theorem for uniform distributions. The right diagram illustrates the Donsker–Skorokhod–Kolmogorov theorem

The same diagram for normal distributions

In the theory of probability, the Glivenko–Cantelli theorem (sometimes referred to as the Fundamental Theorem of Statistics), named after Valery Ivanovich Glivenko and Francesco Paolo Cantelli, describes the asymptotic behaviour of the empirical distribution function as the number of independent and identically distributed observations grows. Specifically, the empirical distribution function converges uniformly to the true distribution function almost surely.

The uniform convergence of more general empirical measures becomes an important property of the Glivenko–Cantelli classes of functions or sets. The Glivenko–Cantelli classes arise in Vapnik–Chervonenkis theory, with applications to machine learning. Applications can be found in econometrics making use of M-estimators.

Statement

Assume that $X_1,X_2,\dots$ are independent and identically distributed random variables in $ℝ$ with common cumulative distribution function $F(x)$. The empirical distribution function for $X_1,\dots ,X_n$ is defined by

$F_n(x)=\frac{1}{n}\sum _{i=1}^n{I}_{[X_i,\mathrm{\infty })}(x)=\frac{1}{n}\left|\{i\mid X_i\le x,1\le i\le n\}\right|$

where $I_C$ is the indicator function of the set $C.$ For every (fixed) $x,$ $F_n(x)$ is a sequence of random variables which converge to $F(x)$ almost surely by the strong law of large numbers. Glivenko and Cantelli strengthened this result by proving uniform convergence of $F_n$ to $F.$

Theorem

$\Vert F_n-F{\Vert }_{\mathrm{\infty }}=\underset{x\in ℝ}{\sup }|F_n(x)-F(x)|⟶0$ almost surely.Template:Rp

This theorem originates with Valery Glivenko and Francesco Cantelli, in 1933.

Remarks

• If $X_n$ is a stationary ergodic process, then $F_n(x)$ converges almost surely to $F(x)=𝔼\left[1_{X_1\le x}\right].$ The Glivenko–Cantelli theorem gives a stronger mode of convergence than this in the iid case.
• An even stronger uniform convergence result for the empirical distribution function is available in the form of an extended type of law of the iterated logarithm.Template:Rp See asymptotic properties of the empirical distribution function for this and related results.

Proof

For simplicity, consider a case of continuous random variable $X$. Fix $-\mathrm{\infty }=x_0<x_1<\cdots <x_{m-1}<x_m=\mathrm{\infty }$ such that $F(x_j)-F(x_{j-1})=\frac{1}{m}$ for $j=1,\dots ,m$. Now for all $x\in ℝ$ there exists $j\in \{1,\dots ,m\}$ such that $x\in [x_{j-1},x_j]$.

$\begin{array}{cc}{F}_n(x)-F(x)& \le F_n(x_j)-F(x_{j-1})=F_n(x_j)-F(x_j)+\frac{1}{m},\\ F_n(x)-F(x)& \ge F_n(x_{j-1})-F(x_j)=F_n(x_{j-1})-F(x_{j-1})-\frac{1}{m}.\end{array}$

Therefore,

$\Vert F_n-F{\Vert }_{\mathrm{\infty }}=\underset{x\in ℝ}{\sup }|F_n(x)-F(x)|\le \underset{j\in \{1,\dots ,m\}}{\max }|F_n(x_j)-F(x_j)|+\frac{1}{m}.$

Since $\underset{j\in \{1,\dots ,m\}}{\max }|F_n(x_j)-F(x_j)|\to 0\text{ a.s.}$ by strong law of large numbers, we can guarantee that for any positive $\epsilon$ and any integer $m$ such that $1/m<\epsilon$, we can find $N$ such that for all $n\ge N$, we have $\underset{j\in \{1,\dots ,m\}}{\max }|F_n(x_j)-F(x_j)|\le \epsilon -1/m\text{ a.s.}$. Combined with the above result, this further implies that $\Vert F_n-F{\Vert }_{\mathrm{\infty }}\le \epsilon \text{ a.s.}$, which is the definition of almost sure convergence.

Empirical measures

One can generalize the empirical distribution function by replacing the set $(-\mathrm{\infty },x]$ by an arbitrary set C from a class of sets $𝒞$ to obtain an empirical measure indexed by sets $C\in 𝒞.$

$P_n(C)=\frac{1}{n}\sum _{i=1}^n{I}_C(X_i),C\in 𝒞$

Where $I_C(x)$ is the indicator function of each set $C$.

Further generalization is the map induced by $P_n$ on measurable real-valued functions f, which is given by

$f\mapsto P_{n}f=\underset{S}{\int }fd{P}_n=\frac{1}{n}\sum _{i=1}^{n}f(X_i),f\in ℱ.$

Then it becomes an important property of these classes whether the strong law of large numbers holds uniformly on $ℱ$ or $𝒞$.

Glivenko–Cantelli class

Consider a set $𝒮$ with a sigma algebra of Borel subsets Template:Mvar and a probability measure $\mathbb{P}.$ For a class of subsets,

$𝒞\subset \{C:C\text{ is measurable subset of }𝒮\}$

and a class of functions

$ℱ\subset \{f:𝒮\to ℝ,f\text{ is measurable}\}$

define random variables

$\Vert {\mathbb{P}}_n-\mathbb{P}{\Vert }_{𝒞}=\underset{C\in 𝒞}{\sup }|{\mathbb{P}}_n(C)-\mathbb{P}(C)|$

$\Vert {\mathbb{P}}_n-\mathbb{P}{\Vert }_{ℱ}=\underset{f\in ℱ}{\sup }|{\mathbb{P}}_{n}f-\mathbb{P}f|$

where ${\mathbb{P}}_n(C)$ is the empirical measure, ${\mathbb{P}}_{n}f$ is the corresponding map, and

$\mathbb{P}f=\underset{𝒮}{\int }f\mathrm{d}\mathbb{P},$ assuming that it exists.

Definitions

• A class $𝒞$ is called a Glivenko–Cantelli class (or GC class, or sometimes strong GC class) with respect to a probability measure Template:Mvar if

$\Vert {\mathbb{P}}_n-\mathbb{P}{\Vert }_{𝒞}\to 0$ almost surely as $n\to \mathrm{\infty }.$

• A class $𝒞$ is a weak Glivenko-Cantelli class with respect to Template:Mvar if it instead satisfies the weaker condition

$\Vert {\mathbb{P}}_n-\mathbb{P}{\Vert }_{𝒞}\to 0$ in probability as $n\to \mathrm{\infty }.$

• A class is called a universal Glivenko–Cantelli class if it is a GC class with respect to any probability measure $\mathbb{P}$ on $(𝒮,A)$.

• A class is a weak uniform Glivenko–Cantelli class if the convergence occurs uniformly over all probability measures $\mathbb{P}$ on $(𝒮,A)$: For every $\epsilon >0$,

$\underset{\mathbb{P}\in \mathbb{P}(𝒮,A)}{\sup }\mathrm{Pr}(\Vert {\mathbb{P}}_n-\mathbb{P}{\Vert }_{𝒞}>\epsilon )\to 0$ as $n\to \mathrm{\infty }.$

• A class is a (strong) uniform Glivenko-Cantelli class if it satisfies the stronger condition that for every $\epsilon >0$,

$\underset{\mathbb{P}\in \mathbb{P}(𝒮,A)}{\sup }\mathrm{Pr}(\underset{m\ge n}{\sup }\Vert {\mathbb{P}}_m-\mathbb{P}{\Vert }_{𝒞}>\epsilon )\to 0$ as $n\to \mathrm{\infty }.$

Glivenko–Cantelli classes of functions (as well as their uniform and universal forms) are defined similarly, replacing all instances of $𝒞$ with $ℱ$.

The weak and strong versions of the various Glivenko-Cantelli properties often coincide under certain regularity conditions. The following definition commonly appears in such regularity conditions:

• A class of functions $ℱ$ is image-admissible Suslin if there exists a Suslin space $\mathrm{\Omega }$ and a surjection $T:\mathrm{\Omega }\to ℱ$ such that the map $(x,y)\mapsto [T(y)](x)$ is measurable $𝒳\times \mathrm{\Omega }$.

• A class of measurable sets $𝒞$ is image-admissible Suslin if the class of functions $\{{\mathrm{𝟏}}_C\mid C\in 𝒞\}$ is image-admissible Suslin, where ${\mathrm{𝟏}}_C$ denotes the indicator function for the set $C$.

Theorems

The following two theorems give sufficient conditions for the weak and strong versions of the Glivenko-Cantelli property to be equivalent.

Theorem (Talagrand, 1987)

Let $ℱ$ be a class of functions that is integrable $\mathbb{P}$, and define ${ℱ}_0=\{f-\mathbb{P}f\mid f\in ℱ\}$. Then the following are equivalent:

• $ℱ$ is a weak Glivenko-Cantelli class and ${ℱ}_0$ is dominated by an integrable function
• $ℱ$ is a Glivenko-Cantelli class

Theorem (Dudley, Giné, and Zinn, 1991)

Suppose that a function class $ℱ$ is bounded. Also suppose that the set ${ℱ}_0=\{f-\inf f\mid f\in ℱ\}$ is image-admissible Suslin. Then $ℱ$ is a weak uniform Glivenko-Cantelli class if and only if it is a strong uniform Glivenko-Cantelli class.

The following theorem is central to statistical learning of binary classification tasks.

Theorem (Vapnik and Chervonenkis, 1968)

Under certain consistency conditions, a universally measurable class of sets $𝒞$ is a uniform Glivenko-Cantelli class if and only if it is a Vapnik–Chervonenkis class.

There exist a variety of consistency conditions for the equivalence of uniform Glivenko-Cantelli and Vapnik-Chervonenkis classes. In particular, either of the following conditions for a class $𝒞$ suffice:

• $𝒞$ is image-admissible Suslin.
• $𝒞$ is universally separable: There exists a countable subset ${𝒞}_0$ of $𝒞$ such that each set $C\in 𝒞$ can be written as the pointwise limit of sets in ${𝒞}_0$.

Examples

• Let $S=ℝ$ and $𝒞=\{(-\mathrm{\infty },t]:t\in ℝ\}$. The classical Glivenko–Cantelli theorem implies that this class is a universal GC class. Furthermore, by Kolmogorov's theorem,

$\underset{P\in 𝒫(S,A)}{\sup }\Vert P_n-P{\Vert }_{𝒞}\sim n^{-1/2}$, that is $𝒞$ is uniformly Glivenko–Cantelli class.

• Let P be a nonatomic probability measure on S and $𝒞$ be a class of all finite subsets in S. Because $A_n=\{X_1,\dots ,X_n\}\in 𝒞$, $P(A_n)=0$, $P_n(A_n)=1$, we have that $\Vert P_n-P{\Vert }_{𝒞}=1$ and so $𝒞$ is not a GC class with respect to P.

See also

• Donsker's theorem
• Dvoretzky–Kiefer–Wolfowitz inequality – strengthens the Glivenko–Cantelli theorem by quantifying the rate of convergence.

Further reading

• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book