The Borel–Cantelli lemma (difficult direction)
ProvedFamousTheorems.measure_limsup_eq_onemathlibmeasure-theory
The second Borel\u2013Cantelli lemma. If the events are independent and then
so almost every point lies in infinitely many of them. Independence is essential here, unlike the first lemma: without it the conclusion fails outright, as the constant sequence with shows. Together the two lemmas give a sharp zero\u2013one dichotomy for independent events — divergence of the series forces the event to recur forever, convergence forbids it — which is a special case of Kolmogorov's zero\u2013one law. It is the engine behind results on recurrence of random walks and on the almost-sure behaviour of records. Formalization note. Independence is iIndepSet under a probability measure. The result is Mathlib's ProbabilityTheory.measure_limsup_eq_one.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
universe u_1 u_2 u_3 u_4 u_5 u_6 u_7 u_8 u_9 u_10 u_11 u_12 u_13 u_14 u_15 u_16 u_17 u_18 u_19 u_20 u_21 u_22 u_23 u_24 u_25
open Filter Set Topology DirectSum
theorem measure_limsup_eq_one :
∀ {Ω : Type u_1} {m0 : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω}
{s : ℕ → Set Ω},
(∀ (n : ℕ), MeasurableSet (s n)) → ProbabilityTheory.iIndepSet s μ → ∑' (n : ℕ), μ (s n) = ⊤ → μ (limsup s atTop) = 1 := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests; formalized in Mathlib. Proof here reduces to the corresponding Mathlib result.