In the theory of probability, the Glivenko–Cantelli theorem, named after Valery Ivanovich Glivenko and Francesco Paolo Cantelli, determines the asymptotic behaviour of the empirical distribution function as the number of independent and identically distributed observations grows. 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.
Assume that
X
1
,
X
2
,
…
are independent and identically-distributed random variables in
R
with common cumulative distribution function
F
(
x
)
. The empirical distribution function for
X
1
,
…
,
X
n
is defined by
F
n
(
x
)
=
1
n
∑
i
=
1
n
I
(
−
∞
,
X
i
]
(
x
)
,
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, that is,
F
n
converges to
F
pointwise. Glivenko and Cantelli strengthened this result by proving uniform convergence of
F
n
to
F
.
Theorem
∥
F
n
−
F
∥
∞
=
sup
x
∈
R
|
F
n
(
x
)
−
F
(
x
)
|
⟶
0
almost surely.
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
)
=
E
(
1
X
1
≤
x
)
. 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. See asymptotic properties of the empirical distribution function for this and related results.
One can generalize the empirical distribution function by replacing the set
(
−
∞
,
x
]
by an arbitrary set C from a class of sets
C
to obtain an empirical measure indexed by sets
C
∈
C
.
P
n
(
C
)
=
1
n
∑
i
=
1
n
I
C
(
X
i
)
,
C
∈
C
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
↦
P
n
f
=
∫
S
f
d
P
n
=
1
n
∑
i
=
1
n
f
(
X
i
)
,
f
∈
F
.
Then it becomes an important property of these classes that the strong law of large numbers holds uniformly on
F
or
C
.
Consider a set
S
with a sigma algebra of Borel subsets A and a probability measure P. For a class of subsets,
C
⊂
{
C
:
C
is measurable subset of
S
}
and a class of functions
F
⊂
{
f
:
S
→
R
,
f
is measurable
}
define random variables
∥
P
n
−
P
∥
C
=
sup
c
∈
C
|
P
n
(
C
)
−
P
(
C
)
|
∥
P
n
−
P
∥
F
=
sup
f
∈
F
|
P
n
f
−
P
f
|
where
P
n
(
C
)
is the empirical measure,
P
n
f
is the corresponding map, and
E
f
=
∫
S
f
d
P
=
P
f
, assuming that it exists.
Definitions
A class
C
is called a Glivenko–Cantelli class (or GC class) with respect to a probability measure P if any of the following equivalent statements is true.
The Glivenko–Cantelli classes of functions are defined similarly.
A class is called a universal Glivenko–Cantelli class if it is a GC class with respect to any probability measure P on (S,A).
A class is called uniformly Glivenko–Cantelli if the convergence occurs uniformly over all probability measures P on (S,A):
Theorem (Vapnik and Chervonenkis, 1968)
A class of sets
C
is uniformly GC if and only if it is a Vapnik–Chervonenkis class.
Let
S
=
R
and
C
=
{
(
−
∞
,
t
]
:
t
∈
R
}
. The classical Glivenko–Cantelli theorem implies that this class is a universal GC class. Furthermore, by Kolmogorov's theorem,
sup
P
∈
P
(
S
,
A
)
∥
P
n
−
P
∥
C
∼
n
−
1
/
2
, that is
C
is uniformly Glivenko–Cantelli class.
Let P be a nonatomic probability measure on S and
C
be a class of all finite subsets in S. Because
A
n
=
{
X
1
,
…
,
X
n
}
∈
C
,
P
(
A
n
)
=
0
,
P
n
(
A
n
)
=
1
, we have that
∥
P
n
−
P
∥
C
=
1
and so
C
is not a GC class with respect to P.
