An outcome is a complete result
For two dice the outcomes are ordered pairs, not sums. Choosing the wrong granularity is the first and most damaging error.
A probability model is a set of outcomes and an assignment of probabilities to them. Almost every mistake in this course is a mistake about what the outcomes are.
Core ideas
Getting the sample space right is most of the work. The arithmetic that follows is Combinatorics and Counting.
For two dice the outcomes are ordered pairs, not sums. Choosing the wrong granularity is the first and most damaging error.
"The sum is 7" is the set of six pairs that sum to 7. Set operations from Sets, Relations, and Functions apply unchanged: ∪ is "or", ∩ is "and", complement is "not".
It is justified by symmetry of the physical situation, and it must be checked. Sums of two dice are not equally likely; pairs are.
The material
Outcomes, events, and the choice of granularity.
The sample space S is the set of all possible outcomes of an experiment. An outcome is one element of S; an event is a subset of S.
The outcomes must be mutually exclusive (no two happen together) and exhaustive (at least one happens), so that exactly one happens. Those are the two obligations a proof by cases carries in “Cases, Counterexamples, and Writing a Proof” in Logic and Proof — overlap nowhere, cover everything — and they fail in the same ways.
Model A: S is the 36 ordered pairs (1,1) through (6,6), all equally likely. Model B: S is the 11 sums 2, …, 12. Both are legitimate sample spaces; only in model A are the outcomes equally likely. A sum of 7 arises six ways and a sum of 2 arises one way.
That is the granularity trap, and it produced a famous error: Cardano and later gamblers computed dice probabilities from the sums and got them wrong. The fix is to keep outcomes fine enough that symmetry justifies equal likelihood.
Every identity from “Set Identities and Proofs” in Sets, Relations, and Functions therefore applies, and De Morgan is used constantly: "not (A or B)" is "neither A nor B", which is usually the easier event to count.
When the outcomes of a finite S are equally likely, P(E) = |E| / |S|. Every probability in this course's early lessons is this ratio, computed with Combinatorics and Counting's tools.
Flip three coins and ask for the probability of exactly two heads. Outcomes as ordered triples: 8 equally likely, of which HHT, HTH, THH qualify, so 3/8. Outcomes as "number of heads": four possibilities, but not equally likely — and answering 1/4 is the error the fine model prevents.
Interactive
Exact fractions, every outcome listed
Method
Outcomes first, and choose them fine enough.
As tuples if several things happen. Fine enough that symmetry makes them equally likely.
Exactly one outcome occurs. If two could occur together, the outcomes are not outcomes.
"At least one 6" is a specific set of pairs. Writing it out is what makes the count possible.
Combinatorics and Counting supplies the counting. The division is the only new step in this lesson.
S is the 36 ordered pairs, all equally likely.
A and B are mutually exclusive and A and C are not, even though all three have the same probability. Exclusivity is a fact about the sets, not about their sizes — and “Independence” shows that independence is a third, different property again.
For "draw two cards from a standard deck", write down what an outcome is, how many there are, and whether they are equally likely — before touching any event.
Something to change about this lesson? Write it down, tick it off when it is handled, and export the list when you want to act on it. Kept in this browser only: nothing is sent anywhere, and nobody is notified.
No recommendations yet for this lesson.