NDA Maths · Probability
Bounds on Probability
The inequalities that constrain probabilities — Fréchet and Boole bounds, the min/max of unions and intersections, and the identity-statement traps.
Why this matters
This is the chapter's advanced corner — only 11 questions, but they are mostly MODERATE/HARD and almost always phrased as "which of the following statements are correct". The marks come from knowing that P(A), P(B) and P(A and B) cannot be chosen freely: the intersection has a forced floor, the union has a ceiling, and several plausible-looking identities are subtly wrong. Learn the four bounds and the exactly-one trap and this section becomes quick, defensible marks rather than guesswork.
Concept 1 of 3
Fréchet and Boole bounds
Intuition
Definition
For any two events (all from and the addition rule):
- Intersection (Fréchet): .
- Union: .
- Boole's inequality: the upper union bound .
Bounds on intersection and union
- lower bound — the forced overlap when the sum exceeds 1 (else 0)
- upper bound — the overlap can't exceed the smaller event
Worked example
- Lower bound: .
- Upper bound: .
- So .
Practice this conceptself-check · 4 quick reps
Try it yourself
Practice — Level 1 (4 reps)
Quick reps to lock in the method. Try each, then check.
- 1.. Minimum ?
- 2.. Maximum ?
- 3.. Minimum ?
- 4.. Maximum ?
From the bank · past-year question
[Q101 · Sep · 2021]
The intersection floor only bites when the sum exceeds 1
The union floor is , not
Concept 2 of 3
Minimum and maximum of combined probabilities
Intuition
Definition
Minimum ; maximum . Minimum ; maximum . Because , a constraint on the union and intersection bounds their sum directly.
Linking identity
- useto bound from bounds on the union and intersection (and vice-versa)
Worked example
- Both extremes occur at maximum overlap ( pushed as far inside as possible).
- Minimum union: .
- Maximum intersection: .
Practice this conceptself-check · 4 quick reps
Try it yourself
Practice — Level 1 (4 reps)
Quick reps to lock in the method. Try each, then check.
- 1.. Minimum ?
- 2.. Maximum ?
- 3.. ?
- 4.. Minimum ?
From the bank · past-year question
[Q120 · Apr · 2021]
Minimum union = max of the two probabilities, maximum union = their sum (capped at 1)
Convert via
Concept 3 of 3
Identity-statement traps ("which are correct?")
Intuition
Definition
Reliable identities: (subtract the overlap from the SAME event); ; ; and if then . The classic planted error writes "exactly one" with a single (that is the union) instead of .
Exactly one vs union
- the exactly-one excludes the overlap TWICE; the union keeps it once
Worked example
- (1) Correct — splits into and , so .
- (2) Correct — this is the addition rule.
- (3) Incorrect — exactly one is ; statement (3) is actually the formula for the union.
Practice this conceptself-check · 4 quick reps
Try it yourself
Practice — Level 1 (4 reps)
Quick reps to lock in the method. Try each, then check.
- 1.in terms of ?
- 2.. ?
- 3.. ?
- 4.If , is ?
From the bank · past-year question
[Q102 · Apr · 2018]
"Exactly one" subtracts the overlap TWICE
, not
Summary — formulas & gotchas at a glance
A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.
Formulas (3)
- Fréchet and Boole bounds
Bounds on intersection and union
- Minimum and maximum of combined probabilities
Linking identity
- Identity-statement traps ("which are correct?")
Exactly one vs union
Watch out for (6)
- The intersection floor only bites when the sum exceeds 1→ Fréchet and Boole bounds
- The union floor is , not→ Fréchet and Boole bounds
- Minimum union = max of the two probabilities, maximum union = their sum (capped at 1)→ Minimum and maximum of combined probabilities
- Convert via→ Minimum and maximum of combined probabilities
- "Exactly one" subtracts the overlap TWICE→ Identity-statement traps ("which are correct?")
- , not→ Identity-statement traps ("which are correct?")
Mastery check — 5 interleaved questions
Try each one before clicking. Questions are interleaved across the concepts above, not grouped — interleaving sharpens transfer.
[Q114 · Sep · 2019]
[Q111 · Apr · 2024]
[Q118 · Apr · 2018]
[Q112 · Apr · 2024]
[Q103 · Apr · 2020]
Drill every past-year question on this subtopic
11 questions from the bank — paginated, with cart and Word-export support.