The Borel–Cantelli lemmas are results in probability theory that determine whether events in an infinite sequence occur infinitely often. The first lemma states that if the sum of their probabilities is finite, then only finitely many occur with probability one. The second states that, for independent events, a divergent sum implies that infinitely many occur with probability one. Named after Émile Borel and Francesco Paolo Cantelli, the lemmas are fundamental tools for proving almost-sure convergence and describing the long-term occurrence of rare events.
Events occurring infinitely often
Let be a probability space, and let be events. The event that infinitely many occur is
It is commonly abbreviated as and called the limit superior of the sequence of events:
An outcome belongs to this event if, however far along the sequence one starts, at least one later event occurs. Its complement is
the event that only finitely many occur.
The statements concern the number of occurrences along an entire infinite sequence, not whether any particular event occurs. “Only finitely many almost surely” does not impose a deterministic upper bound on that number: different outcomes may have arbitrarily large, but finite, numbers of occurrences.
First Borel–Cantelli lemma
For any sequence of events,
No independence assumption is required. Thus a summable sequence of event probabilities guarantees that the events eventually stop occurring almost surely.
Proof by a tail bound
For every positive integer , countable subadditivity gives
Since is contained in every such union,
The tails of a convergent series tend to zero, proving the result.
The same argument provides a useful finite-tail estimate:
Interpretation through the number of occurrences
Define the extended nonnegative random variable
where is the indicator function of . By monotone convergence,
A nonnegative random variable with finite expectation cannot be infinite on a set of positive probability. Consequently, summability implies almost surely.
Second Borel–Cantelli lemma
If are mutually independent, then
Together, the two lemmas give the dichotomy
when the events are independent.
Proof using independence
Fix . For , independence gives
Using for ,
Every tail of the divergent sum also diverges, so the right-hand side tends to zero. Continuity of probability for decreasing events yields
Taking the countable union over shows that the probability of only finitely many occurrences is zero.
Pairwise independence is sufficient
Although mutual independence is standard in the statement, pairwise independence already suffices for the divergence conclusion.
For fixed , write
Pairwise independence makes the covariances between distinct indicators vanish. Therefore,
By Chebyshev’s inequality, whenever ,
If the probability sum diverges, this bound tends to zero. As in the preceding proof, every tail contains an occurrence almost surely, establishing infinitely many occurrences.
Why the dependence assumption matters
A divergent sum of probabilities alone does not determine the probability of infinitely many occurrences.
Repeating a single event
Let for every , with . Then
Thus
which can be any value in . Repeating the same event produces no new independent opportunities for occurrence.
Decreasing events with divergent probability sum
Let have the uniform distribution on , and set
Then , so the probability sum diverges. Nevertheless, for every , the inequality eventually fails. Hence
This example also shows why infinite expected total count does not imply infinitely many occurrences with positive probability. Here the count is finite almost surely but has infinite expectation.
Examples and applications
Independent trials with decreasing success probabilities
Suppose independent trials have success events with
The convergence criterion for this series gives
In the second case, individual success probabilities approach zero, but the cumulative supply of independent opportunities is still sufficient for infinitely many successes.
Proving almost-sure convergence
Let and be real-valued random variables. If, for every ,
then almost surely.
Indeed, the first lemma says that deviations exceeding any fixed tolerance occur only finitely often. It is enough to check the countable family , . Intersecting the resulting probability-one events ensures that every such tolerance is eventually satisfied.
This is a standard bridge from quantitative probability bounds to pathwise convergence. Independence of the is unnecessary when the required summability bounds hold.
The converse is false. With uniform on , let
Then almost surely, but for ,
Extracting an almost-surely convergent subsequence
If in probability, a subsequence converges almost surely.
Choose increasing indices such that
Such indices exist by convergence in probability. Since the upper bounds form a convergent geometric series, the first lemma implies that
eventually almost surely. Thus almost surely.
A route to a strong law of large numbers
The lemmas often supply the final step in proofs of the strong law of large numbers. For example, let be independent and identically distributed, with mean and finite fourth central moment. Set . Independence and centering give
Consequently, for each , there is a finite constant , independent of , such that
These bounds are summable, so the first lemma proves almost-sure convergence of the sample averages.
The fourth-moment assumption is sufficient for this short proof, not necessary for the general strong law for independent, identically distributed variables.
Measure-theoretic form and scope
The first lemma extends directly to measure theory. If is any measure space and measurable sets satisfy
then
The proof uses the same tail-union estimate and does not require to be finite.
The second lemma is more sensitive to dependence. There are extensions based on conditional probabilities or controlled intersections, but divergence of the unconditional probability sum alone is insufficient. The practical distinction is therefore between a summability conclusion valid for arbitrary events and a divergence conclusion requiring additional structure.