Probability Is Area
When people hear "probability," they usually think of formulas first — counting cases, dividing into fractions. But there's a far more intuitive way to see it: as area. Imagine spreading every possible outcome out on a single board. That whole board is the sample space, and its area is 1 — that is, 100%, because whatever happens must happen somewhere on this board. Then any event becomes some region of the board, and the probability of that event is the area that region takes up. Take up half and the probability is 0.5; take up a quarter and it's 0.25. On this single picture, nearly every rule of probability — unions and intersections, complements, conditional probability, independence — comes down to adding, subtracting, and slicing areas. Instead of memorizing formulas, you just look at areas. In this lesson you'll draw that board yourself and handle probability as area.
First, make the board. The collection of every possible outcome is called the sample space, usually written Ω. Roll two dice and the outcomes run from (1,1) to (6,6) — 36 of them. Each cell is one outcome, and since all are equally likely, each has probability 136. Add up all 36 cells and you get 1, because something must come up. But outcomes aren't always countable. Like picking any real number between 0 and 1, the outcomes can be continuous. Then we view the sample space not as cells but as a whole region, like the unit square. Tap the tabs to compare the two cases. Countable or continuous, the core is the same: Ω is the board holding every possible outcome, and the probability of the whole thing is always 1. This "the whole is 1" is the starting point of every calculation.
Now the event. An event is the collection of outcomes we care about — something like "the two dice sum to 7." On the board, an event is simply a region. And the probability of that event is the area that region takes up out of the whole board. Since we set the total area to 1, the area of the region is the probability. Drag the corner to change the size of event A. If A covers half the board, P(A) is 0.5; if it covers only a quarter, 0.25. You can check it with dots. Scatter many random points on the board, and the fraction landing inside A approaches A's area. This is the Monte Carlo method, the actual way computers compute hard probabilities. Seeing probability as "area," or "the fraction of points that land in a region," turns an abstract number into a visible area.
If events are regions, then combining events is combining regions. Place two events A and B overlapping and press the buttons. A "or" B, the union A∪B, is the area of the two regions joined. But you mustn't count the overlap twice, so P(A∪B) = P(A) + P(B) − P(A∩B), subtracting the overlap once. A "and" B, the intersection A∩B, is the area where the two regions overlap — the case where both happen at once. "Not" A, the complement Aᶜ, is what's left of the whole board after removing A, so P(Aᶜ) = 1 − P(A). The "or, and, not" that confuse you in words are, in the picture, simply joining, overlapping, and cutting out regions. Venn diagrams aren't there for nothing — the logic of probability is really the geometry of area.
Now the most confusing yet most powerful idea: conditional probability. "The probability that A happens, given that we know B happened" is written P(A|B). In the picture it's dead easy. The information that B happened shrinks our entire world down to B. Outside B didn't happen, so we sweep it off the stage entirely. Flip the toggle and you'll see the outside of B darken as the board shrinks to B. Within this reduced new world B, A takes up only the part A∩B. So P(A|B) = area(A∩B)area(B), dividing the intersection by the new whole, B. All that changed is the denominator, from 1 (all of Ω) to P(B). Conditional probability is "re-taking the whole as B and re-measuring the probability." When new information arrives, shrink the sample space and recompute — this is the seed of Bayesian reasoning and all of statistical learning.
Finally, independence. Two events are independent when knowing one happened doesn't change the probability of the other: P(A|B) = P(A). The information B tells you nothing about A. Let's build it as a picture. Split the board with a vertical line and call the left strip A; then P(A) is the width of that strip. Split it with a horizontal line and call the bottom strip B; then P(B) is the height of that strip. Drag the two lines. The region where A and B both happen, A∩B, is the bottom-left rectangle, and its area is width times height — that is, P(A) × P(B). This is the heart of independence: P(A∩B) = P(A) · P(B). You just multiply. Because horizontal and vertical don't interfere with each other at all, the intersection's area is simply the product of the two sides. When one side doesn't affect the other — like two coin tosses, or the failures of two unrelated parts — the probabilities simply multiply. Independence is the most welcome assumption there is, finishing a probability calculation in a single multiplication.