Probability spaces: outcomes, events, and counting
A sample space, a family of events, and a rule for assigning probabilities — then every conditional quantity is just subset arithmetic.
Roll two dice and there are thirty-six ordered outcomes, all equally likely. Ask "what is the chance the total is at least nine?" and you have crossed from arithmetic into probability. The whole subject starts here: name the possible outcomes, collect the ones you care about into an event, and count.
Probability is counting when symmetry decides
When every outcome is equally likely, the probability of an event is just the number of outcomes inside it divided by the total. No formula is needed — the formula is a shortcut for the counting. That is why combinatorics and probability are taught together.
Paint outcomes into event A and event B below. Every probability — union, intersection, conditional, independence — updates from the cell counts.
Two dice, 36 outcomes — paint event A and event B, read the probabilities
- P(A)
- 0.278
- P(B)
- 0.167
- P(A ∩ B)
- 0.111
- P(A ∪ B)
- 0.333
- P(A | B)
- 0.667
- P(A)·P(B)
- 0.046
- independence
- dependent: intersection differs from the product
With 36 equally likely cells, every probability is just a cell count divided by 36 — no formula needed. Notice that conditioning on B shrinks the universe from 36 cells to the B cells, which is exactly P(A | B) = P(A ∩ B) / P(B). Try making A and B independent by hand, or make B a single cell so P(A | B) collapses to 0 or 1.
The formal setup
A probability space is a triple :
- is the sample space — the set of all possible outcomes. For two dice, .
- is a collection of events, each a subset of , closed under complement and countable union.
- is a function from events to satisfying three axioms: ; for every event; and for disjoint events , .
Everything else is derived. For instance, follows from and being disjoint and covering . The addition rule
corrects for the double-counting of the overlap — set it side by side with the widget's readouts.
Conditional probability and independence
Conditioning on means restricting attention to the outcomes in and re-normalizing:
In the widget, is the fraction of B-cells that are also A-cells. Two events are independent when conditioning changes nothing:
Independence is a statement about the probability measure, not about the sets: mutually exclusive events with positive probability are strongly dependent, because knowing one occurred rules the other out.
Disjoint is not independent
Disjoint (mutually exclusive) means , so and, if both have positive probability, they are dependent. Independence means the opposite: equals the product. Conflating the two is one of the most common errors on exams and in code.
Illustrative vs real
The widget uses two fair dice so the outcomes are visually countable. Real sample spaces are uncountable (all possible sensor readings, all possible sentences), where you cannot list outcomes and instead specify the measure through densities. The set algebra and conditioning rules carry over unchanged; only the counting gets replaced by integration.
Check yourself
Eduspheria wiki · Mathematics for AI, Probability
0 / 5 answered
From the exam paper
Modeled on NITJ AI-501, End-Sem December 2024
0 / 5 answered
Where next: random variables — turning outcomes into numbers so we can compute with them.