Pratidin
2026 · Statistics Optional Paper I · 7 marksMainsQuestion 1ai

Show that for n events A₁, A₂, ⋯, Aₙ
P(⋂ᵢ₌₁ⁿ Aᵢ) ≥ ∑ᵢ₌₁ⁿ P(Aᵢ) − (n − 1)

7 marks · directive: Show

Answer

The core of a good answer

Pass to complements: P(⋂Aᵢ) = 1 − P(⋃Aᵢᶜ) ≥ 1 − ∑P(Aᵢᶜ) = 1 − ∑[1 − P(Aᵢ)] = ∑P(Aᵢ) − (n − 1), using Boole's inequality for the union of the complements. This is Bonferroni's lower bound for an intersection.

An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work

What the question asks

A short proof is asked for. The cleanest route is De Morgan's law plus Boole's inequality (the union bound), which itself is proved by induction from P(A ∪ B) = P(A) + P(B) − P(A ∩ B) ≤ P(A) + P(B). The examiner wants each step justified, not just the final line.

Answer outline

Introduction

Let Aᵢᶜ denote the complement of Aᵢ. The idea is that the intersection fails only if at least one Aᵢ fails, and the probability of 'at least one failure' is at most the sum of the individual failure probabilities.

Step 1: Boole's inequality for unions

Step 2: De Morgan's law

Step 3: Apply Boole to the complements

Step 4: Alternative direct induction (optional)

Conclusion

The bound P(⋂Aᵢ) ≥ ∑P(Aᵢ) − (n − 1) holds for any events, independent or not. Check: if every P(Aᵢ) = 1 the bound gives 1, as it must.

Examples and data to cite

Facts

Facts to remember

Sources used for the explanation

Write a timed answer in the app