Properties of conditional probability

Once conditional probability P(A∣B)P(A\mid B) is defined, it turns out to obey the same rules as an ordinary probability measure — just measured relative to BB instead of the whole sample space SS. This is why every trick you already know for probability (the addition rule, the complement rule) has a direct conditional twin, and why fluency here pays off immediately in the multiplication theorem, total probability theorem and Bayes' theorem that follow later in the chapter. This article collects the three standard properties CBSE Class 12 expects: the whole-space property, the addition law under conditioning, and the complement property. Each is stated, then justified, then used on a concrete worked example so the abstract statements stay tied to numbers you can check by hand — and each property reappears, unannounced, inside the multiplication theorem and Bayes' theorem later in the chapter, so it is worth internalising now rather than memorising as an isolated fact.

The core insight

Conditional probability P(⋅∣B)P(\cdot \mid B) satisfies the same three axioms as an ordinary probability function — non-negativity with P(S∣B)=1P(S\mid B)=1, additivity over unions, and the complement rule — because it is just probability measured on the reduced sample space BB.

The core idea

Let SS be the sample space and BB an event with P(B)≠0P(B) \neq 0. Three properties describe how P(⋅∣B)P(\cdot \mid B) behaves.

Whole space. Conditioning on BB turns BB itself into the "new" certain event, so both SS and BB get probability 11 when conditioned on BB:

P(S∣B)=1,P(B∣B)=1.P(S\mid B) = 1, \qquad P(B\mid B) = 1.

Addition law under conditioning. For any two events AA and CC of SS,

P((A∪C)∣B)=P(A∣B)+P(C∣B)−P((A∩C)∣B),P\big((A\cup C)\mid B\big) = P(A\mid B) + P(C\mid B) - P\big((A\cap C)\mid B\big),

where: the subtracted term corrects for outcomes counted twice, exactly as in the ordinary addition rule. If AA and CC are mutually exclusive (A∩C=∅A\cap C = \varnothing), the correction vanishes and P((A∪C)∣B)=P(A∣B)+P(C∣B)P\big((A\cup C)\mid B\big) = P(A\mid B) + P(C\mid B).

Complement. For any event AA,

P(A′∣B)=1−P(A∣B).P(A' \mid B) = 1 - P(A\mid B).

where: A′A' is the complement of AA in SS, and BB — the conditioning event — never changes; only AA gets complemented. These three properties together say precisely that P(⋅∣B)P(\cdot \mid B) satisfies the same axioms as an ordinary probability function, just measured relative to BB instead of SS: it is non-negative, assigns 11 to the certain event (now SS or BB), and adds up correctly over unions. That is why every standard identity of probability — addition rule, complement rule, and beyond — carries over automatically the moment you replace "probability of an event" with "probability of an event given BB." A useful consequence for numerical problems: for events A1,A2A_1, A_2 conditioned on BB,

P((A1∪A2)∣B)≤P(A1∣B)+P(A2∣B),P\big((A_1 \cup A_2)\mid B\big) \le P(A_1\mid B) + P(A_2\mid B),

with equality exactly when A1A_1 and A2A_2 do not overlap within BB. The figure below shows why: inside the reduced sample space BB, the pieces of A1A_1 and A2A_2 either sit apart (equality, mutually exclusive) or overlap (strict inequality, needing the correction term).

Figure
Reduced sample space B with two events A1 and A2 shown once disjoint and once overlapping
Inside the reduced sample space B mutually exclusive: equality holds A1 A2 overlapping: strict inequality A1 A2 P(A1 union A2 given B) = P(A1 given B) + P(A2 given B) minus the overlap
Derivation AThe addition law for conditional probability

The goal is to show, starting only from the definition P(A∣B)=P(A∩B)P(B)P(A\mid B) = \dfrac{P(A\cap B)}{P(B)} and the ordinary addition rule of probability, that conditional probability obeys the same addition law as unconditional probability, so that P((A∪C)∣B)=P(A∣B)+P(C∣B)−P((A∩C)∣B)P\big((A\cup C)\mid B\big) = P(A\mid B) + P(C\mid B) - P\big((A\cap C)\mid B\big) for any events AA, CC and any conditioning event BB with P(B)≠0P(B)\neq 0.

Step 1. Apply the definition of conditional probability to the union event. By definition, P((A∪C)∣B)=P((A∪C)∩B)P(B)P\big((A\cup C)\mid B\big) = \dfrac{P\big((A\cup C)\cap B\big)}{P(B)}.

Step 2. Distribute the intersection with BB over the union. Set theory gives (A∪C)∩B=(A∩B)∪(C∩B)(A\cup C)\cap B = (A\cap B) \cup (C\cap B), so the numerator becomes P((A∩B)∪(C∩B))P\big((A\cap B)\cup(C\cap B)\big).

Step 3. Apply the ordinary addition rule to that numerator. For any two (unconditional) events A∩BA\cap B and C∩BC\cap B, P((A∩B)∪(C∩B))=P(A∩B)+P(C∩B)−P((A∩B)∩(C∩B))P\big((A\cap B)\cup(C\cap B)\big) = P(A\cap B) + P(C\cap B) - P\big((A\cap B)\cap(C\cap B)\big), and (A∩B)∩(C∩B)=A∩C∩B(A\cap B)\cap(C\cap B) = A\cap C\cap B.

Step 4. Divide every term by P(B)P(B) and recognise each piece as a conditional probability. P\big((A\cup C)\mid B\big) = \frac{P(A\cap B)}{P(B)} + \frac{P(C\cap B)}{P(B)} - \frac{P(A\cap C\cap B)}{P(B)} = P(A\mid B) + P(C\mid B) - P\big((A\cap C)\mid B\big). This is exactly the ordinary addition rule with every probability now conditioned on BB, confirming that P(⋅∣B)P(\cdot\mid B) behaves like a full probability measure on the reduced space BB.

Worked example

In a group of 100 students, 60 like Cricket (CC), 45 like Football (FF), and 30 like both. A student is picked at random and is known to like Cricket. Find P(F′∣C)P(F' \mid C), the probability the student does not like Football, given the student likes Cricket.

Step 1. Set up the probabilities. P(C)=60100=0.6P(C) = \tfrac{60}{100} = 0.6, P(F)=45100=0.45P(F) = \tfrac{45}{100} = 0.45, P(C∩F)=30100=0.3P(C\cap F) = \tfrac{30}{100} = 0.3.

Step 2. Find P(F∣C)P(F\mid C) from the definition. P(F\mid C) = \frac{P(C\cap F)}{P(C)} = \frac{0.3}{0.6} = 0.5.

Step 3. Apply the complement property. P(F' \mid C) = 1 - P(F\mid C) = 1 - 0.5 = \mathbf{0.5}. This matches direct counting: of the 60 Cricket-lovers, 30 also like Football, so exactly 30 — half — do not.

Competitive stretch

Two dice are thrown; let BB be "the sum is 8," A1A_1 be "the first die is even," and A2A_2 be "the first die shows 5." Sum =8= 8 occurs for (2,6),(3,5),(4,4),(5,3),(6,2)(2,6),(3,5),(4,4),(5,3),(6,2), so P(B)=536P(B) = \tfrac{5}{36}. Within BB, A1A_1 gives (2,6),(4,4),(6,2)(2,6),(4,4),(6,2) so P(A1∣B)=35P(A_1\mid B) = \tfrac{3}{5}, and A2A_2 gives (5,3)(5,3) so P(A2∣B)=15P(A_2\mid B) = \tfrac{1}{5}. Since A1A_1 and A2A_2 cannot both hold (first die cannot be even and equal to 5), they are mutually exclusive, so the addition law gives P((A1∪A2)∣B)=35+15=4/5P\big((A_1\cup A_2)\mid B\big) = \tfrac{3}{5}+\tfrac{1}{5} = \mathbf{4/5} — which matches direct counting of the 4 outcomes (2,6),(4,4),(6,2),(5,3)(2,6),(4,4),(6,2),(5,3) out of the 5 in BB.

Common traps

  • Applying the addition law without subtracting the intersection term when the events are not mutually exclusive — the correction −P((A∩C)∣B)-P((A\cap C)\mid B) is easy to forget.
  • Misapplying the complement property to the wrong event: P(A′∣B)=1−P(A∣B)P(A'\mid B) = 1 - P(A\mid B), not 1−P(A∣B′)1 - P(A\mid B') or 1−P(A′∣B′)1 - P(A'\mid B') — only AA is complemented, BB stays fixed.
  • Forgetting P(B∣B)=1P(B\mid B) = 1 always, so P(B′∣B)=0P(B'\mid B) = 0 trivially — a degenerate case that still gets tested.
  • Using these properties when P(B)=0P(B) = 0, where conditional probability is undefined.
  • Treating the addition law as new content to memorize separately from the ordinary addition rule, instead of seeing it as the same identity divided through by P(B)P(B) — remembering the reason it holds makes it far harder to misquote under exam pressure.

Ask the tutor: Want to see all three properties combined in one multi-part problem, or need help spotting which property a given question is testing? Ask the AI tutor for a guided walkthrough.

Why does conditioning on B just reuse the ordinary addition and complement rules instead of needing new formulas?

Because P(⋅∣B)P(\cdot\mid B) is defined by dividing every probability by the fixed number P(B)P(B), and division by a constant preserves addition and subtraction. Once you see P(A∣B)=P(A∩B)/P(B)P(A\mid B) = P(A\cap B)/P(B), every set-theory identity for unions, intersections and complements carries straight through — you're just doing ordinary probability on the smaller "world" BB instead of SS.

Do I have to prove the addition law every time, or can I just quote it?

In CBSE exams you can quote P((A∪C)∣B)=P(A∣B)+P(C∣B)−P((A∩C)∣B)P\big((A\cup C)\mid B\big) = P(A\mid B) + P(C\mid B) - P\big((A\cap C)\mid B\big) directly as a standard property. The derivation is worth understanding once, since it explains why it's true and helps you recall the formula correctly under exam pressure, but you won't usually be asked to re-derive it from scratch unless the question explicitly says "prove."

What's the difference between P(B' given B) and P(A' given B)? And does the addition law extend to three events?

P(B′∣B)P(B'\mid B) is a special, slightly odd case: since P(B∣B)=1P(B\mid B) = 1 always, P(B′∣B)=1−1=0P(B'\mid B) = 1 - 1 = 0 — it says "given that B happened, the chance B didn't happen is zero," which is just consistency, not new information. P(A′∣B)P(A'\mid B) is the useful general case: it tells you the chance some other event A fails, given B is known to have happened, and is what the complement property is really for. As for extending to three events — the same logic works: for events AA, CC and DD conditioned on BB, you'd use the three-event addition rule with all pairwise and triple intersection corrections, each divided through by P(B)P(B), exactly as in the two-event derivation above. CBSE typically tests only the two-event version, but the pattern generalises if a JEE-style question ever stacks more events together.

Before this

Where this leads