Probability Spaces
A probability space lists every possible outcome, declares which collections of outcomes you may ask about, and assigns each one a size between 0 and 1.
Why Does This Exist?
Every probability calculation quietly assumes three things: the list of outcomes is complete, the question you asked is answerable, and the numbers add up. Skip any one and you get nonsense like probabilities above 1 or events with no assigned chance.
A probability space makes the three assumptions explicit as the triple . is the sample space of all outcomes. is the -algebra of legal events. is the probability measure. This page builds each piece with a two-coin model you can check by hand, grounding the probability foundations you already use.
The one idea you need first
An event is a set of outcomes. With one die roll, is the event "the roll is even". Probabilities attach to events, never to bare outcomes in the continuous case. This page defines exactly which sets qualify.
Think of It Like This
A library with a catalog rule
is every book in the building. is the catalog: the rule says if a shelf list is in the catalog, its complement is too, and any countable stack of lists can be merged into one catalog entry. You may only borrow through the catalog.
is the librarian's size stamp on each catalog entry: nonnegative, the whole building stamps 1, and disjoint entries add. A book that never made it into the catalog cannot be borrowed, no matter how loudly you ask. That is a non-measurable set: it exists, but the theory refuses to price it.
How It Actually Works
must satisfy three rules: it contains , it is closed under complements (if is legal, so is ), and it is closed under countable unions. must satisfy three more: , , and countable additivity, so for disjoint .
Why closure matters
Finite unions feel like enough until you take a limit. The event "heads eventually appear" is a countable union of finite-horizon events. Without countable closure it would fall outside and have no probability. Closure is what lets limits stay inside the theory.
Worked example
Two fair flips: . The power set has events, so can be all of them. Uniform gives each outcome . The event ("at least one head") has . Complement check: with , and . Union check: with , the sum of the parts.
Code
import itertools
omega = [''.join(r) for r in itertools.product('HT', repeat=2)]prob = {w: 1 / 4 for w in omega} # uniform over 4 outcomesevent = [w for w in omega if 'H' in w] # at least one headprint(len(omega), len(event)) # -> (4, 3)print(sum(prob[w] for w in event)) # -> 0.75Four outcomes, three in the event, total mass 0.75. The complement carries the remaining 0.25.
Watch Out For
Assuming every subset is an event
On finite the power set works, so people assume it always does. On uncountable like it does not: some subsets are non-measurable and admit no consistent probability. Assigning them one breaks additivity.
Fix: work with the Borel -algebra generated by intervals. If your event can be built from intervals with complements and countable unions, it is legal. Otherwise rephrase the question.
Adding probabilities of overlapping events
holds only when and are disjoint. With overlap you double-count the intersection. The general rule subtracts it: .
Symptom: union probabilities above 1 or above either part. Always ask whether the pieces overlap before adding.
The Quick Version
- A probability space is the triple : outcomes, legal events, and a size function.
- The -algebra is closed under complements and countable unions, which keeps limits answerable.
- The measure is nonnegative, totals 1, and adds over disjoint pieces, even infinitely many.
- Two fair flips give 4 outcomes, 16 events, and .
- Not every subset of an uncountable space is an event; build events from intervals.
- Add probabilities only for disjoint events, else subtract the overlap.