Properties of conditional probability
Once conditional probability is defined, it turns out to obey the same rules as an ordinary probability measure — just measured relative to instead of the whole sample space . 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.
Conditional probability satisfies the same three axioms as an ordinary probability function — non-negativity with , additivity over unions, and the complement rule — because it is just probability measured on the reduced sample space .
The core idea
Let be the sample space and an event with . Three properties describe how behaves.
Whole space. Conditioning on turns itself into the "new" certain event, so both and get probability when conditioned on :
Addition law under conditioning. For any two events and of ,
where: the subtracted term corrects for outcomes counted twice, exactly as in the ordinary addition rule. If and are mutually exclusive (), the correction vanishes and .
Complement. For any event ,
where: is the complement of in , and — the conditioning event — never changes; only gets complemented. These three properties together say precisely that satisfies the same axioms as an ordinary probability function, just measured relative to instead of : it is non-negative, assigns to the certain event (now or ), 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 ." A useful consequence for numerical problems: for events conditioned on ,
with equality exactly when and do not overlap within . The figure below shows why: inside the reduced sample space , the pieces of and either sit apart (equality, mutually exclusive) or overlap (strict inequality, needing the correction term).
The goal is to show, starting only from the definition and the ordinary addition rule of probability, that conditional probability obeys the same addition law as unconditional probability, so that for any events , and any conditioning event with .
Step 1. Apply the definition of conditional probability to the union event. By definition, .
Step 2. Distribute the intersection with over the union. Set theory gives , so the numerator becomes .
Step 3. Apply the ordinary addition rule to that numerator. For any two (unconditional) events and , , and .
Step 4. Divide every term by 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 , confirming that behaves like a full probability measure on the reduced space .
Worked example
In a group of 100 students, 60 like Cricket (), 45 like Football (), and 30 like both. A student is picked at random and is known to like Cricket. Find , the probability the student does not like Football, given the student likes Cricket.
Step 1. Set up the probabilities. , , .
Step 2. Find 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 be "the sum is 8," be "the first die is even," and be "the first die shows 5." Sum occurs for , so . Within , gives so , and gives so . Since and cannot both hold (first die cannot be even and equal to 5), they are mutually exclusive, so the addition law gives — which matches direct counting of the 4 outcomes out of the 5 in .
Common traps
- Applying the addition law without subtracting the intersection term when the events are not mutually exclusive — the correction is easy to forget.
- Misapplying the complement property to the wrong event: , not or — only is complemented, stays fixed.
- Forgetting always, so trivially — a degenerate case that still gets tested.
- Using these properties when , 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 — 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 is defined by dividing every probability by the fixed number , and division by a constant preserves addition and subtraction. Once you see , every set-theory identity for unions, intersections and complements carries straight through — you're just doing ordinary probability on the smaller "world" instead of .
Do I have to prove the addition law every time, or can I just quote it?
In CBSE exams you can quote 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?
is a special, slightly odd case: since always, — it says "given that B happened, the chance B didn't happen is zero," which is just consistency, not new information. 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 , and conditioned on , you'd use the three-event addition rule with all pairwise and triple intersection corrections, each divided through by , 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.