Revision notes

Chapter 14 Probability: Foundation

The key points, rules to remember, tables and diagrams from all 5 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

Events: subsets of a sample space and their types

Common sample spaces
ExperimentSample spaceNumber of outcomes
Toss a coin once{H, T}2
Toss a coin twice{HH, HT, TH, TT}4
Toss a coin three times{HHH, HHT, HTH, THH, HTT, THT, TTH, TTT}8
Roll a die{1, 2, 3, 4, 5, 6}6
Roll two diceAll ordered pairs (a, b), a and b from 1 to 636

Any subset E of a sample space S is called an event. The event E occurs if the actual outcome ω belongs to E (ω ∈ E); otherwise E does not occur.

Types of events in a sample space S

  • Impossible event
    • The empty set φ
    • No outcome makes it happen
    • Die: a number greater than 6
  • Sure event
    • The whole sample space S
    • Every outcome makes it happen
    • Die: a number less than 7
  • Simple (elementary) event
    • Exactly one sample point
    • A space of n points has n simple events
    • Die: {4}
  • Compound event
    • More than one sample point
    • Die: an even number, {2, 4, 6}
  • An event is a subset of the sample space; it occurs when the outcome lies in it.
  • φ is the impossible event and S the sure event.
  • Simple events have one sample point; compound events have more than one.
Read the full lesson

Lesson 2

Algebra of events: complement, union, intersection, mutually exclusive and exhaustive events

The algebra of events
WordsSet notationMeaning
not AA′ = S − AOutcomes not in A
A or BA ∪ BA happens, or B happens, or both
A and BA ∩ BBoth A and B happen
A but not BA − B = A ∩ B′A happens and B does not

Events A and B are mutually exclusive if they cannot occur together, that is, A ∩ B = φ.

Events E₁, E₂, …, Eₙ are exhaustive if E₁ ∪ E₂ ∪ … ∪ Eₙ = S: at least one of them must occur whenever the experiment is performed.

Mutually exclusive versus exhaustive

  • Mutually exclusive
    • No overlap: Eᵢ ∩ Eⱼ = φ
    • At most one occurs
    • May leave outcomes uncovered
  • Exhaustive
    • Union is S
    • At least one occurs
    • May overlap
  • Both
    • No overlap and union is S
    • Exactly one occurs
    • Splits S into pieces
  • not A = A′, A or B = A ∪ B, A and B = A ∩ B, A but not B = A − B.
  • Mutually exclusive: A ∩ B = φ. Exhaustive: union is S.
  • An event and its complement are always mutually exclusive and exhaustive.
Read the full lesson

Lesson 3

The axiomatic approach to probability

A valid assignment gives each outcome a number between 0 and 1, with all the numbers adding up to 1. The probability of an event is the sum of the probabilities of its outcomes.

Assignmentω₁ω₂ω₃ω₄Valid?
(a)0.10.20.30.4Yes: all in [0, 1], sum 1
(b)0.50.500Yes: zeros are allowed, sum 1
(c)0.60.30.2−0.1No: a negative value
(d)0.30.30.30.3No: sum is 1.2

For equally likely outcomes: P(E) = n(E)/n(S) = (number of outcomes favourable to E)/(total number of outcomes).

Finding a probability with equally likely outcomes

  1. List or count S n(S) outcomes, all equally likely
  2. Identify E Write the event as a subset of S
  3. Count E n(E) favourable outcomes
  4. Divide P(E) = n(E)/n(S)
  • Axioms: P(E) ≥ 0, P(S) = 1, additivity for mutually exclusive events.
  • P(φ) = 0 follows from the axioms.
  • Valid assignment: each value in [0, 1], total 1.
  • Equally likely outcomes: P(E) = n(E)/n(S).
Read the full lesson

Lesson 4

Addition rule and the probability of 'not A'

Addition rule: P(A ∪ B) = P(A) + P(B) − P(A ∩ B). If A and B are mutually exclusive, P(A ∪ B) = P(A) + P(B).

P(not A) = P(A′) = 1 − P(A).

Rules built from the axioms

  • Or
    • P(A ∪ B) = P(A) + P(B) − P(A ∩ B)
  • Not
    • P(A′) = 1 − P(A)
  • But not
    • P(A − B) = P(A) − P(A ∩ B)
  • Neither
    • P(A′ ∩ B′) = 1 − P(A ∪ B)
  • Exactly one
    • P(A ∪ B) − P(A ∩ B)
  • P(A ∪ B) = P(A) + P(B) − P(A ∩ B): subtract the overlap once.
  • P(A′) = 1 − P(A); 'at least one' = 1 − P(none).
  • P(A − B) = P(A) − P(A ∩ B); exactly one = P(A ∪ B) − P(A ∩ B).
  • Any result outside [0, 1] signals inconsistent data.
Read the full lesson

Lesson 5

Probability problems using counting

Counting outcomes for probability

  • Order does not matter
    • Selections, committees, hands of cards
    • Use combinations: ⁿCᵣ = n!/(r!(n − r)!)
  • Order matters
    • Arrangements, queues, words, passwords
    • Use permutations: ⁿPᵣ = n!/(n − r)!
  • Several independent stages
    • Multiply the counts (fundamental principle)

Count the sample space and the event in the same way (both with order, or both without), then P(E) = n(E)/n(S).

Patterns in counting problems
Problem typeCount of STypical shortcut
Draw r balls or cards togetherⁿCᵣMultiply combinations for each colour or kind
Committee from groupsⁿCᵣ'At least one' = 1 − 'none'
Arrange letters or peoplen!Fix positions first, arrange the rest
Two particular people togethern!Glue them: (n − 1)! × 2!
  • Use combinations when order does not matter and permutations when it does, the same way for S and E.
  • Split an event into mutually exclusive cases and add, or use the complement.
  • Know the composition of a pack of cards: 4 suits of 13, 26 red, 26 black, 12 face cards.
Read the full lesson

Privacy · Terms · Refunds · Delivery