Introduction to Stats · Chapter 3 · Probability Topics
Every rule the rest of this chapter uses is stated in a handful of words and symbols — experiment, sample space, event, OR, AND, complement, conditional. This section is where they get their exact meanings.
bookSHelf · Introduction to Statistics · §3.1 · a self-paced section
Outline — by the end of this section you will be able to
§3.1.1 — Experiments, Outcomes, and Sample Spaces
Before probability can be a number, it needs a vocabulary. This subsection supplies the three terms that name what you do, what happens, and where you record it.
An experiment is the procedure — flip a coin, roll a die, draw a card.
The sample space is every possible outcome, listed once each, and an event is any subset of it you care about.
§3.1.1 — the first term
Definition 3.1.1 — Experiment
An experiment is a planned operation carried out under controlled conditions. If the result is not predetermined, the experiment is called a chance experiment.
Flipping one fair coin twice is an experiment. So is rolling a die, drawing a card, or selecting one student at random from a roster. The word does not mean a laboratory — it means a procedure you could repeat, whose result you cannot call in advance.
§3.1.1 — the second term
Definition 3.1.2 — Outcome
An outcome is a result of an experiment.
Every flip, roll, or draw produces exactly one outcome — the specific thing that happened, not the list of things that could have.
§3.1.1 — the third term
Definition 3.1.3 — Sample Space
The sample space of an experiment is the set of all possible outcomes. The uppercase letter S denotes the sample space.
There are three standard ways to display a sample space: list the outcomes, draw a tree diagram, or draw a Venn diagram. If you flip one fair coin, S={H,T} — two outcomes, and the set of them is the sample space.
Definition 3.1.3: the sample space of two coin flips — every possible result appears in S exactly once.
Insight Note — the sample space is the whole board
Everything that can happen has to appear in S somewhere, exactly once.
If you can describe a result that is not in your list, your list is not the sample space yet.
§3.1.1 — naming a question about the outcome
Definition 3.1.4 — Event
An event is any combination of outcomes — that is, any subset of the sample space. Uppercase letters such as A and B represent events. The probability of an event A is written P(A).
The word combination is doing real work: an event does not have to be a single outcome. An event is a question you ask about the result — the answer is yes for some outcomes and no for the others.
Definition 3.1.4: an event is a subset of the sample space — the outcomes that answer yes are the event.
Your turn — a four-wedge spinner
Try It Now 3.1.1
You spin a spinner with four equal wedges labelled 1, 2, 3, 4. (a) Write the sample space S. (b) Let A be the event the spinner lands on an odd number. (c) Let B be the event it lands on a number greater than 4.
(a) S={1,2,3,4}. (b) The odd labels are 1 and 3, so A={1,3}. (c) No label is greater than 4, so B={ } — the empty set is still a legitimate event; it just never happens.
§3.1.2 — Probability and the Law of Large Numbers
Once you can name outcomes and events, the next question is how likely each one is. This subsection defines probability itself, the shortcut that works when outcomes are equally likely, and the law that explains why the shortcut works at all.
§3.1.2 — the long-run definition
Definition 3.1.5 — Probability of an Outcome
The probability of any outcome is the long-term relative frequency of that outcome. Probabilities are between zero and one, inclusive.
P(A)=0 means A can never happen; P(A)=1 means A always happens. Flip a coin 20 times, then 2,000, then 20,000, tracking the fraction of heads — it wanders early and settles onto 0.5.
Definition 3.1.5: every probability is a position on one line from 0 to 1.
§3.1.2 — when counting is enough
Definition 3.1.6 — Equally Likely
Equally likely means that each outcome of an experiment occurs with equal probability.
When every outcome is equally likely, computing a probability becomes counting:
P(A)=number of outcomes in Snumber of outcomes in AToss a fair dime and nickel together: S={HH,HT,TH,TT}. Let A be exactly one head — HT and TH qualify, so P(A)=42=0.5.
Definition 3.1.6: a fair die — six faces, six identical probabilities.
§3.1.2 — why the counting shortcut is trustworthy
Definition 3.1.7 — Law of Large Numbers
As the number of repetitions of an experiment increases, the relative frequency obtained tends to become closer and closer to the theoretical probability.
The outcomes do not arrange themselves into a pattern to make this happen. Each trial is as unpredictable as the last — what changes is that the accumulated fraction has more trials underneath it, so any one strange run matters less.
Definition 3.1.7: the running fraction of heads settles onto 0.5 as the flips pile up.
Context Pause — why the long run is the whole point
A single flip tells you nothing about whether a coin is fair.
An insurance company cannot predict which house will burn, but it can predict what fraction will, and it prices policies off that fraction. Probability is a statement about many trials, not about the next one.
Your turn — is 16 rolls enough to judge?
Try It Now 3.1.2
A fair, eight-sided die has faces 1–8. Let A be rolling a number less than 3. (a) Find P(A). (b) Marisol rolls 16 times and gets a qualifying number only once, and concludes the die is unfair. Is her conclusion supported?
(a) A={1,2}, so P(A)=82=0.25. (b) We'd expect about (0.25)(16)=4 qualifying rolls; she got 1. That's a gap, but 16 trials is far too few — the law of large numbers makes no promise about 16 rolls, only about the long run.
Try it in rāSHio
Open rāSHio and choose File → Random Numbers… to generate a column of a few hundred whole numbers from 1 to 2, treating 1 as heads.
Read the running share of heads down the column: it lurches over the first handful of draws, then tightens onto 0.5. Generate a short column and a long one and compare — the long one is not more random, it is just further along.
§3.1.2 — reading it off the panel
Figure 3.1.1: generating a column of random whole numbers in rāSHio — File → Random Numbers….
§3.1.3 — When the Outcomes Are Not Equally Likely
Dividing by the size of S only works when every outcome is equally likely. This subsection names what it means for that condition to fail.
§3.1.3 — when outcomes are not equally likely
Definition 3.1.8 — Biased
A coin, die, or other chance device is biased when its outcomes are not equally likely — that is, when at least one outcome occurs with a different probability than another.
Two math professors had their students test the Belgian one-euro coin. In 250 trials, heads came up 56% of the time and tails 44% — though 250 trials is not many, and more repetitions would be needed to draw a firm conclusion.
Definition 3.1.8: the Belgian euro coin came out 56/44 over 250 trials, not the 50/50 a fair coin predicts.
Insight Note — a biased die still has a sample space
Bias does not change what can happen, only how often. S={1,2,3,4,5,6} either way.
What breaks is the shortcut of dividing by 6 — you now need the individual probabilities, which later sections give you tools for.
Your turn — a three-color carnival spinner
Try It Now 3.1.3
Devon's spinner has red taking half the circle, blue and green splitting the rest evenly. (a) Write S. (b) Devon claims P(red)=31 — why is that wrong? (c) Find each probability.
(a) S={red,blue,green}. (b) Dividing by 3 assumes the three colors are equally likely, and they are not. (c) Probability follows area: P(red)=21, P(blue)=P(green)=41.
§3.1.4 — OR, AND, and the Complement
Once you can name single events, you need a way to combine them. Three combinations cover almost everything: one event or the other, both at once, and everything an event leaves out.
§3.1.4 — either one, or both
Definition 3.1.9 — “OR” Event
An outcome is in A OR B if it is in A, in B, or in both. Also written A∪B (union). Unlike everyday English, mathematics includes the overlap.
Let A={1,2,3,4,5}, B={4,5,6,7,8}. Then A∪B={1,2,3,4,5,6,7,8} — 4 and 5 are not listed twice; a set records what is in it, not how many ways an element got there.
Definition 3.1.9: A OR B covers both circles, and the overlap is shaded once, not twice.
§3.1.4 — only the overlap
Definition 3.1.10 — “AND” Event
An outcome is in A AND B if it is in both A and B at the same time. Also written A∩B (intersection).
Using the same two sets from Definition 3.1.9, A∩B={4,5} — only the elements that appear in both lists.
Definition 3.1.10: A AND B is only the lens — the outcomes in both sets at the same time.
§3.1.4 — everything an event leaves out
Definition 3.1.11 — Complement
The complement of event A, denoted A′, consists of all outcomes NOT in A. Because every outcome is in A or A′ and never both,
P(A)+P(A′)=1Let S={1,…,6}, A={1,2,3,4}. Then A′={5,6}, and 64+62=1.
Definition 3.1.11: A and its complement tile the whole sample space, so their probabilities add to 1.
Insight Note — the complement is the cheap route
“At least one” problems are usually miserable to count directly and easy to count backwards.
The complement of “at least one head” is “no heads at all”, which is a single outcome. Subtract from 1 and you are done.
Your turn — union, intersection, complement
Try It Now 3.1.4
Let S={1,…,10}, A={2,4,6,8,10}, B={1,2,3,4,5}. Find (a) A OR B and its probability, (b) A AND B and its probability, (c) B′ and its probability.
(a) A∪B={1,2,3,4,5,6,8,10}, P=108=0.8. (b) A∩B={2,4}, P=102=0.2. (c) B′={6,7,8,9,10}, P=105=0.5 — check: 0.5+0.5=1.
§3.1.5 — Conditional Probability
Sometimes you learn something before you have to make a judgement. Conditional probability is how that extra information gets built into the number.
§3.1.5 — conditioning shrinks the sample space
Definition 3.1.12 — Conditional Probability
P(A∣B) is the probability A occurs given that B already has. Conditioning reduces the sample space to B:
P(A∣B)=P(B)P(A AND B),P(B)>0Roll a die: let A be 2-or-3, B be even, so B={2,4,6}. Inside B, only 2 qualifies, so P(A∣B)=31 — by the formula, 3/61/6=31 too.
Definition 3.1.12: conditioning on B discards the outcomes outside B, so the denominator drops from 6 to 3.
Context Pause — a test result is a condition
A screening test that is positive does not tell you the probability of having the disease — it tells you the probability given a positive test.
Confusing P(A∣B) with P(A) is one of the most expensive mistakes in medicine and law, and it is the whole reason this notation exists.
Your turn — why the two answers differ
Try It Now 3.1.5
A fair die is rolled. A = roll greater than 3, B = roll is odd. (a) Find P(A). (b) Find P(A∣B). (c) Why do the two answers differ?
(a) A={4,5,6}, P(A)=21. (b) B={1,3,5}; only 5 also satisfies A, so P(A∣B)=31. (c) Knowing the roll is odd removes 4 and 6, two of the three faces that made A true.
§3.1.6 — Understanding Terminology and Symbols
“Of all the women, the probability a student has short hair” names the reduced sample space: P(short hair∣woman).
“The probability a student is a woman and has short hair” is computed over everyone: P(woman AND short hair).
Those two sentences describe different numbers, and the only difference in the English is a handful of small words. When it is already clear the process is “rolling a die,” P(rolling a 1) shortens to P(1).
Your turn — every symbol, off one sample space
Try It Now 3.1.6
S is all ordered pairs (1–3, 1–4). A = sum is even, B = first number is prime. Find S, A, B, P(A), P(B), A AND B, A OR B, their probabilities, A′, P(A′), and both conditionals.
12 pairs total. P(A)=126=21, P(B)=128=32. P(A AND B)=31, P(A OR B)=65. P(A′)=21, and P(A)+P(A′)=1. P(A∣B)=84=21, P(B∣A)=64=32 — not equal.
§3.1.6 — a full worked pass
Example 3.1.1 — Reading Every Symbol Off One Sample Space
S = whole numbers 1 to 19. A = even numbers, B = numbers greater than 13. Find every quantity from Try It Now 3.1.6, for this S.
19 outcomes. P(A)=199, P(B)=196. A AND B={14,16,18}, P=193; P(A OR B)=1912. P(A′)=1910, summing to 1. P(A∣B)=21, P(B∣A)=31 — not equal: the reduced sample space differs each way.
Try it in rāSHio
Open rāSHio and choose Calculators → Probability to check the answers above without redoing the arithmetic. Enter the sample-space size and each event count, and the panel returns the AND together with both conditional values.
The point is not to skip the counting — that is the skill this section teaches — but to check the overlap before you use it in P(A OR B)=P(A)+P(B)−P(A AND B), where subtracting it is the step most often missed.
§3.1.6 — reading it off the panel
Figure 3.1.2: checking the intersection and the conditional probabilities in rāSHio — Calculators → Probability.
Your turn — ten numbers, ten questions
Try It Now 3.1.7
A number is chosen from 1–10. T=5, A=more than 6, B=odd, C=composite, D=multiple of 3. Find S, each event, A′, A∣B, B∣A, A OR B, A OR B′, and every probability.
P(T)=101, P(A)=52, P(B)=21, P(A′)=53, P(A∣B)=52, P(B∣A)=21, P(A OR B)=107, P(A OR B′)=107 — two different events, same probability. P(C)=21, P(D)=103.
§3.1.6 — eleven events, one die
Example 3.1.2 — Naming Eleven Events on One Die
A fair die is rolled. T=two, A=even, B=less than four, N=prime, I=seven (impossible). Find every event, its complement, both conditionals, AND, OR, OR-with-complement, and every probability.
P(T)=P(A)=P(B)=P(A′)=21 or 61 as fits; P(A∣B)=P(B∣A)=31; P(A AND B)=61; P(A OR B)=65; P(A OR B′)=32; P(N)=21; and P(I)=0 — a six-sided die has no seven, so I is the empty set.
Your turn — a two-way table
Try It Now 3.1.8 — Table 3.1.1
| Tea | Coffee | |
|---|---|---|
| Men | 22 | 26 |
| Women | 16 | 36 |
100 people. M=man, W=woman, T=tea, C=coffee.
Find P(M), P(W), P(T), P(C), P(M AND T), P(W AND C), P(M OR W), P(M′), and the conditionals.
Margins: 0.48, 0.52, 0.38, 0.62. Cells: P(M AND T)=0.22, P(W AND C)=0.36. P(M OR W)=1, P(M′)=0.52. P(T∣M)=4822≈0.4583, P(C∣W)=5236≈0.6923.
§3.1.6 — reading probabilities off a table
Example 3.1.3 — Table 3.1.2
| Right-handed | Left-handed | |
|---|---|---|
| Males | 43 | 9 |
| Females | 44 | 4 |
100 people, by sex assigned at birth and handedness.
M=male, F=female, R=right-handed, L=left-handed. Find the margins, the AND cells, the OR unions, P(M′), and the conditionals.
P(M)=0.52, P(F)=0.48, P(R)=0.87, P(L)=0.13. P(M AND R)=0.43. P(R∣M)=5243≈0.8269, P(L∣F)=484≈0.0833 — the same cell, 4, divided by two different reduced sample spaces.
Key Terminology — the vocabulary this section put to work
experiment — a planned operation carried out under controlled conditions; a chance experiment's result is not predetermined.
outcome — a single result of an experiment.
sample space — the set of all possible outcomes, denoted S.
event — any combination of outcomes; a subset of the sample space.
probability — the long-term relative frequency of an outcome, between 0 and 1 inclusive.
equally likely — every outcome occurs with the same probability.
law of large numbers — as repetitions increase, observed relative frequency approaches theoretical probability.
biased — a device whose outcomes are not equally likely.
union (OR event) — A∪B, the outcome is in A, in B, or in both.
intersection (AND event) — A∩B, the outcome is in both at once.
complement — A′, the outcome is not in A; P(A)+P(A′)=1.
conditional probability — P(A∣B), the probability of A on the reduced sample space B.
§3.1 — conclusions
Every probability question is built from the same small kit: an experiment produces outcomes in a sample space S; an event is a subset of S; OR, AND, and complement combine events; and conditioning shrinks S to whatever you already know.
The counting shortcut P(A)=∣S∣∣A∣ needs equally likely outcomes — check that before you use it. And read conditioning language carefully: “of all the …” is not the same claim as “… and …”.
Next: §3.2 — Independent and Mutually Exclusive Events, where these same OR and AND values decide whether two events affect each other at all.