The set of Cantelli is a theorem of probability theory , one of the branches of mathematics . It goes back to the Italian mathematician Francesco Paolo Cantelli and formulates a sufficient condition for the existence of the strong law of large numbers for certain sequences of real random variables . The Cantellian theorem is considered to be one of the first results of its kind.
Formulation of the sentence
The Cantellian sentence can be specified as follows:
A probability space and a sequence of random variables are given
(
Ω
,
A.
,
P
)
{\ displaystyle (\ Omega, {\ mathcal {A}}, \ operatorname {P})}
X
n
:
(
Ω
,
A.
,
P
)
→
R.
(
n
∈
N
)
{\ displaystyle X_ {n} \ colon (\ Omega, {\ mathcal {A}}, \ operatorname {P}) \ to \ mathbb {R} \; (n \ in \ mathbb {N})}
on this probability space.
Let the consequence be stochastically independent and with finite fourth moments :
E.
(
X
n
4th
)
<
∞
(
n
∈
N
)
{\ displaystyle \ operatorname {E} {\ bigl (} {X_ {n}} ^ {4} {\ bigr)} <{\ infty} \; (n \ in \ mathbb {N})}
.
In addition, let the central fourth moments be uniformly bounded upwards :
sup
n
∈
N
E.
(
(
X
n
-
E.
(
X
n
)
)
4th
)
<
∞
{\ displaystyle \ sup _ {n \ in \ mathbb {N}} \; {\ operatorname {E} {\ bigl (} {(X_ {n} - \ operatorname {E} (X_ {n}))} ^ {4} {\ bigr)}} <{\ infty}}
.
Then it is sufficient to result - almost certainly the convergence
P
{\ displaystyle \ operatorname {P}}
lim
n
→
∞
1
n
∑
j
=
1
n
(
X
j
-
E.
(
X
j
)
)
=
0
{\ displaystyle \ lim _ {n \ to \ infty} {{\ frac {1} {n}} \ sum _ {j = 1} ^ {n} {{\ bigl (} X_ {j} - {\ operatorname {E} (X_ {j})} {\ bigr)}}} = 0}
and with it the strong law of large numbers.
Proof of the Širjaev theorem
You bet for
j
∈
N
{\ displaystyle j \ in \ mathbb {N}}
Y
j
=
X
j
-
E.
(
X
j
)
{\ displaystyle Y_ {j} = X_ {j} - {\ operatorname {E} (X_ {j})}}
and continue for
n
∈
N
{\ displaystyle n \ in \ mathbb {N}}
S.
n
=
∑
j
=
1
n
Y
j
{\ displaystyle S_ {n} = \ sum _ {j = 1} ^ {n} {Y_ {j}}}
such as
C.
=
sup
n
∈
N
E.
(
Y
n
4th
)
{\ displaystyle C = \ sup _ {n \ in \ mathbb {N}} \; {\ operatorname {E} {\ bigl (} {Y_ {n}} ^ {4} {\ bigr)}}}
Then is for
n
∈
N
{\ displaystyle n \ in \ mathbb {N}}
(0)
E.
(
Y
n
)
=
0
=
E.
(
S.
n
)
{\ displaystyle \ quad \ operatorname {E} {(Y_ {n})} = 0 = \ operatorname {E} {(S_ {n})}}
and consequently it has to be shown that
(1)
lim
n
→
∞
S.
n
n
=
0
(
P
-pretty sure
)
{\ displaystyle \ quad \ lim _ {n \ to \ infty} {\ frac {S_ {n}} {n}} = 0 \; (\ operatorname {P} {\ mathrm {\ text {-almost sure}} })}
applies.
If one now takes into account the conclusion mentioned in the last section of the article on the Borel-Cantelli lemma and the Chebyshev-Markov inequality , one sees that the convergence of the series is sufficient
(2)
∑
n
=
1
∞
E.
(
S.
n
4th
)
n
4th
{\ displaystyle \ quad \ sum _ {n = 1} ^ {\ infty} {\ frac {\ operatorname {E} {({S_ {n}} ^ {4}})} {n ^ {4}}} }
to prove.
To do this, the terms of the series (2) are evaluated using the polynomial theorem .
It is namely:
(3) .
S.
n
4th
=
(
Y
1
+
...
+
Y
n
)
4th
=
∑
k
1
+
...
+
k
n
=
4th
4th
!
k
1
!
⋅
...
⋅
k
n
!
⋅
Y
1
k
1
⋅
Y
2
k
2
⋯
Y
n
k
n
{\ displaystyle \ quad {S_ {n}} ^ {4} = {(Y_ {1} + \ ldots + Y_ {n})} ^ {4} = \ sum _ {k_ {1} + \ ldots + k_ {n} = 4} {{\ frac {4!} {k_ {1}! \ cdot \ ldots \ cdot k_ {n}!}} \ cdot {Y_ {1}} ^ {k_ {1}} \ cdot {Y_ {2}} ^ {k_ {2}} \ cdots {Y_ {n}} ^ {k_ {n}}}}
When forming the expected values for (3), only those summands are important for which the exponents or occur exclusively in the associated ones .
Y
j
{\ displaystyle Y_ {j}}
2
{\ displaystyle 2}
4th
{\ displaystyle 4}
Because in all other cases there is at least one with exponent and because of the linearity of the expected value, the independence requirement and because of (0) in the expected value of (3) only the summands with even exponents make a positive contribution.
Y
j
{\ displaystyle Y_ {j}}
1
{\ displaystyle 1}
So you have
(4) .
E.
(
S.
n
4th
)
=
∑
j
=
1
n
E.
(
Y
j
4th
)
+
∑
i
,
j
=
1
,
...
,
n
i
<
j
4th
!
2
!
⋅
2
!
⋅
E.
(
Y
i
2
)
⋅
E.
(
Y
j
2
)
{\ displaystyle \ quad \ operatorname {E} {({S_ {n}} ^ {4})} = \ sum _ {j = 1} ^ {n} {\ operatorname {E} {({Y_ {j} } ^ {4})}} \; + \; \ sum _ {i, j = 1, \ ldots, n \ atop \; \ i <j} {{\ frac {4!} {2! \ Cdot 2 !}} \ cdot \ operatorname {E} {({Y_ {i}} ^ {2})} \ cdot \ operatorname {E} {({Y_ {j}} ^ {2})}}}
With (4) and applying the assumption and Lyapunov's inequality, the following chain of inequalities results :
(5)
E.
(
S.
n
4th
)
≤
n
⋅
C.
+
6th
⋅
∑
i
,
j
=
1
,
...
,
n
i
<
j
E.
(
Y
i
4th
)
1
2
⋅
E.
(
Y
j
4th
)
1
2
≤
n
⋅
C.
+
6th
⋅
∑
i
,
j
=
1
,
...
,
n
i
<
j
C.
1
2
⋅
C.
1
2
=
n
⋅
C.
+
6th
⋅
n
⋅
(
n
-
1
)
2
⋅
C.
=
(
3
⋅
n
2
-
2
⋅
n
)
⋅
C.
<
3
⋅
n
2
⋅
C.
.
{\ displaystyle \ quad {\ begin {aligned} \ operatorname {E} {({S_ {n}} ^ {4})} & \ leq n \ cdot C \; + \; 6 \ cdot \ sum _ {i , j = 1, \ ldots, n \ atop \; \ i <j} {{\ operatorname {E} {({Y_ {i}} ^ {4})}} ^ {\ frac {1} {2} } \ cdot {\ operatorname {E} {({Y_ {j}} ^ {4})}} ^ {\ frac {1} {2}}} \ leq n \ cdot C \; + \; 6 \ cdot \ sum _ {i, j = 1, \ ldots, n \ atop \; \ i <j} {{C} ^ {\ frac {1} {2}} \ cdot {C} ^ {\ frac {1} {2}}} \\ & = n \ cdot C \; + \; 6 \; \ cdot {\ frac {n \ cdot {(n-1)}} {2}} \ cdot C = (3 \ cdot n ^ {2} -2 \ cdot n) \ cdot C <3 \ cdot n ^ {2} \ cdot C. \ end {aligned}}}
The chain of inequalities (5) draws in consideration of the convergence of the zeta-series part, the chain of inequalities
(6)
∑
n
=
1
∞
E.
(
S.
n
4th
)
n
4th
≤
3
⋅
C.
⋅
∑
n
=
1
∞
1
n
2
=
3
⋅
C.
⋅
π
2
6th
<
∞
{\ displaystyle \ quad \ sum _ {n = 1} ^ {\ infty} {\ frac {\ operatorname {E} {({S_ {n}} ^ {4}})} {n ^ {4}}} \ leq 3 \ cdot C \ cdot \ sum _ {n = 1} ^ {\ infty} {\ frac {1} {n ^ {2}}} = 3 \ cdot C \ cdot {\ frac {\ pi ^ { 2}} {6}} <{\ infty}}
after itself and thus also (2) .
◻
{\ displaystyle \ Box}
literature
References and comments
↑ TO Širjaev: Probability. 1988, pp. 379-380
↑ For a real random variable , its expected value is designated.
ξ
{\ displaystyle \ xi}
E.
(
ξ
)
{\ displaystyle \ operatorname {E} {\ bigl (} \ xi {\ bigr)}}
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">