Math 2.0

Probability theory and stochastic processes Proof

Proof of the first Borel–Cantelli lemma

Builds on Boole's inequalityEventProbability space

Proof

We bound the limit superior by the tails of the convergent series.

  1. Let L=lim sup⁡nAn=⋂n≥1BnL = \limsup_{n} A_n = \bigcap_{n \ge 1} B_n, where Bn=⋃m≥nAmB_n = \bigcup_{m \ge n} A_m. Each BnB_n and LL are events, as countable unions and intersections of events.
  2. For each nn, L⊆BnL \subseteq B_n. So P(L)≤P(Bn)P(L) \le P(B_n), by the monotonicity of the measure PP on the probability space.
  3. By Boole's inequality, P(Bn)≤∑m=n∞P(Am)P(B_n) \le \sum_{m = n}^{\infty} P(A_m).
  4. Let s=∑m=1∞P(Am)s = \sum_{m=1}^{\infty} P(A_m), a finite number by hypothesis. The tail ∑m≥nP(Am)=s−∑m=1n−1P(Am)\sum_{m \ge n} P(A_m) = s - \sum_{m=1}^{n-1} P(A_m) tends to s−s=0s - s = 0 as n→∞n \to \infty.
  5. By steps 2 to 4, 0≤P(L)≤∑m≥nP(Am)0 \le P(L) \le \sum_{m \ge n} P(A_m) for each nn. Let n→∞n \to \infty to get P(L)=0P(L) = 0.
  6. Claim: ω∈L\omega \in L if and only if ω∈Am\omega \in A_m for infinitely many mm. If ω\omega lies in infinitely many AmA_m, then for each nn some m≥nm \ge n has ω∈Am\omega \in A_m, so ω∈Bn\omega \in B_n for all nn.
  7. Conversely, if ω\omega lies in only finitely many AmA_m, let NN exceed all these indices. Then ω∉BN\omega \notin B_N, so ω∉L\omega \notin L.
  8. By steps 5 to 7, the set of outcomes that lie in infinitely many AnA_n has probability 00. So almost surely only finitely many AnA_n occur.

Idea

An outcome that lies in infinitely many AnA_n lies, for every nn, in some AmA_m with m≥nm \ge n. The probability of that is at most the tail of a convergent series, which tends to 00.

Reading path

To understand this page from the ground up, read these 56 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof of the probability of the complement, Proof of Boole's inequality by disjoint pieces, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the monotonicity of probability, Proof that the reals are Archimedean from the completeness axiom.

  1. Construction of the reals from Cauchy sequences concept
  2. Element definition
  3. Integers object
  4. Ordered field definition
  5. Proposition concept
  6. Random experiment concept
  7. Rational numbers object
  8. Real numbers object
  9. Set bounded above definition
  10. Set definition
  11. Ring of integers statement
  12. Archimedean ordered field definition
  13. Disjunction definition
  14. Implication definition
  15. Predicate definition
  16. The reals form a field statement
  17. Supremum definition
  18. Ordered pair definition
  19. Union definition
  20. Sample space definition
  21. The rationals form a field statement
  22. Universal quantifier definition
  23. Completeness axiom statement
  24. Cartesian product definition
  25. Subset definition
  26. The rationals form an ordered field statement
  27. Binary relation definition
  28. Universal set definition
  29. Order on the reals definition
  30. Power set definition
  31. Antisymmetric relation definition
  32. Reflexive relation definition
  33. Transitive relation definition
  34. Complement definition
  35. Interval definition
  36. Preorder definition
  37. Sigma-algebra definition
  38. Partial order definition
  39. Event definition
  40. Total order definition
  41. Probability axioms concept
  42. Probability measure definition
  43. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  44. Probability space definition
  45. The reals form an ordered field statement
  46. Proof of the approximation property of the supremum proof
  47. Approximation property of the supremum statement
  48. Proof that the reals are Archimedean from the completeness axiom proof
  49. The reals are Archimedean statement
  50. Proof of the probability of the complement proof
  51. Probability of the complement statement
  52. Proof of the monotonicity of probability proof
  53. Monotonicity of probability statement
  54. Proof of Boole's inequality by disjoint pieces proof
  55. Boole's inequality statement
  56. Proof of the first Borel–Cantelli lemma proof

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Borel–Cantelli_lemma, Proof
About this page
TagZ51Z4CTP5J
URIm2://Z51Z4CTP5J
Kindproof
WritingW0 stub
MSC60F20
ProvesFirst Borel–Cantelli lemma
UsesBoole's inequality, Event, Probability space
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.