Intuition The one idea of this whole topic
Learning that something is true shrinks your world to only the outcomes where it holds, and probability is just counting the good fraction of whatever world you are standing in . Conditional probability re-does that count inside the smaller, updated world.
Before you can read a single line like P ( A ∣ B ) = P ( B ) P ( A ∩ B ) , you must earn every mark on the page: the letters, the bar, the cap, the fraction, the whole idea of "probability". This page builds them one at a time, from nothing, in the order they lean on each other. Nothing is used before it is drawn.
This is the foundations page for Conditional probability (read it in Hinglish here ).
Everything starts with the set of things that could happen. Roll a die: it could land 1, 2, 3, 4, 5, or 6. That full collection of possibilities is the sample space .
Definition Sample space and outcome
An outcome is one single thing that can happen (one die face, one email). The sample space , written with the Greek capital letter Ω ("omega"), is the box that holds all possible outcomes.
Picture : the big rectangle in the figure above. Every dot inside is one outcome.
Why we need it : probability is a fraction of this box . With no box, "fraction" means nothing.
The symbol Ω is not scary — it is literally just a name for "the whole rectangle".
We rarely care about one outcome. We care about groups: "the roll is even", "the email is spam". A group of outcomes is an event .
We name events with capital letters: A , B , D (disease), S (spam). A letter is just a label pinned to a region.
Now we can say what P means. P is a machine: feed it a region, it hands back a number between 0 and 1 telling you what fraction of the box that region covers .
Definition Probability of an event
P ( A ) is the fraction of the box Ω taken up by region A .
0 ≤ P ( A ) ≤ 1 , P ( Ω ) = 1
P ( A ) = 0 → the region is empty (impossible).
P ( A ) = 1 → the region is the whole box (certain).
Picture : shaded-area ÷ total-area in the figure above.
Why the bar-less number matters : it is our baseline belief, before any extra news arrives.
P ( ) as "how much of the box"
Whenever you see P ( something ) , translate it to "what share of the rectangle is shaded?" That single habit makes every later formula obvious.
Two events can overlap. "Spam" and "contains the word free" share some emails. That shared region has its own symbol.
A ∩ B
A ∩ B (say "A and B") is the region where both events happen at once — the overlap of the two blobs.
Picture : the amber lens in the middle of the figure below.
Why : conditional probability is fundamentally about "of the outcomes in B, how many are also in A" — and that "also in A" part lives exactly in the overlap.
The symbol ∩ looks like a little cap or bridge joining the two — it "caps" what they have in common.
The parent note uses ¬ D ("not disease") and ¬ A . This is just the rest of the box .
This is the heart of the whole chapter, and its picture is the payoff.
When we learn "B happened", we throw away the whole box except B . B becomes our new rectangle. We then re-measure A inside that new box .
Definition Conditional probability
P ( A ∣ B )
P ( A ∣ B ) (say "probability of A given B ") is the fraction of the shrunken world B that also lies in A .
P ( A ∣ B ) = P ( B ) P ( A ∩ B ) ( requires P ( B ) > 0 )
Numerator P ( A ∩ B ) : the overlap — the "good part" that is inside both .
Denominator P ( B ) : the size of the new box we now live in (this is the shrinking).
Picture : see the two-panel figure below — the box literally collapses onto B .
P ( B ) ?
Inside the new world, B must be certain — it has to fill up to probability 1 again. To force P ( B ) back up to 1 we divide everything by P ( B ) . That is exactly what the denominator does: it renormalizes the shrunken box.
Common mistake The bar is not symmetric
P ( A ∣ B ) and P ( B ∣ A ) shrink into different boxes (B vs A ), so they are generally different numbers . The parent's medical example lives or dies on this: "test-positive given sick" ≠ "sick given test-positive". They are linked only through Bayes-Theorem .
The definition whispers P ( B ) > 0 . Here is why, with no hand-waving.
Common mistake Conditioning on the impossible
If P ( B ) = 0 , the region B is empty — there is no box left to stand in , and P ( B ) P ( A ∩ B ) = 0 0 is undefined.
Picture : you cannot ask "what fraction of an empty room is red" — there is no room.
Rule : you may only condition on events you believe can happen.
The parent's Law of Total Probability uses ∑ . It just means "add these all up".
∑ i = 1 n x i
i = 1 ∑ n x i means x 1 + x 2 + ⋯ + x n — a compact command to add every term as the counter i walks from 1 to n .
Picture : slicing the box into non-overlapping tiles B 1 , B 2 , … and adding the area each tile contributes to A .
Why here : an event A can be reached through several separate doors (B 1 , … , B n ). Since the doors don't overlap, total area = sum of the pieces — no double counting. This is the engine behind Law-of-Total-Probability .
Rearranging the bar formula gives P ( A ∩ B ) = P ( A ∣ B ) ⋅ P ( B ) . The dot ⋅ is ordinary multiplication.
Intuition Why multiply, not add?
To be in the overlap you must clear two gates in sequence : first land in B (a fraction P ( B ) of the box), then land in A within that already-shrunk world (a fraction P ( A ∣ B ) of it). Taking a fraction of a fraction is multiplication. This chaining generalizes to the Chain-Rule-of-Probability .
A and B are independent when learning B leaves A 's probability untouched:
P ( A ∣ B ) = P ( A ) ⟺ P ( A ∩ B ) = P ( A ) ⋅ P ( B ) .
Picture : the shrunken box has the same red-fraction as the full box — shrinking told you nothing new.
Why it earns a name : it is the special, simple case that lets Naive Bayes multiply probabilities freely.
Probability P of a region
Intersection A and B overlap
Conditional P of A given B
Law of Total Probability sum
Bayes Theorem flip the bar
Independence bar changes nothing
Chain Rule multiply restrictions
Conditional Probability full topic
Onward links once these are solid: Bayes-Theorem , Law-of-Total-Probability , Independence , Chain-Rule-of-Probability , and applications in Naive-Bayes-Classifier , Hidden-Markov-Models , Bayesian-Inference , Mutual-Information .
Cover the right side and answer out loud before revealing.
What does Ω stand for? The sample space — the box holding every possible outcome.
What is an "event" as a picture? A region (blob) drawn inside the box Ω .
How do you read P ( A ) in area terms? The fraction of the box Ω that region A covers.
What region is A ∩ B ? The overlap where both A and B happen at once.
What does ¬ A mean and what sums to 1? Everything outside A ; and P ( A ) + P ( ¬ A ) = 1 .
Read P ( A ∣ B ) in plain words. The fraction of the shrunken world B that also lies in A .
Why divide by P ( B ) in the conditional formula? To renormalize — force the new box B back up to probability 1.
When is P ( A ∣ B ) undefined and why? When P ( B ) = 0 ; there is no box left to stand in (0/0 ).
Why multiply (not add) in P ( A ∩ B ) = P ( A ∣ B ) P ( B ) ? You clear two sequential gates; taking a fraction of a fraction is multiplication.
State independence two equivalent ways. P ( A ∣ B ) = P ( A ) , equivalently P ( A ∩ B ) = P ( A ) P ( B ) .