STAT 101
M03 · L01
Module 3

What is Probability?

Probability is the mathematical language of uncertainty. It turns vague intuitions about chance into precise, consistent numbers.

01 / 13
STAT 101
M03 · L01
Building blocks

Experiments & Outcomes

A random experiment is any process whose result cannot be predicted with certainty. The sample space Ω lists every possible outcome.

Coin flip
Ω = {H, T}
Die roll
Ω = {1…6}
02 / 13
STAT 101
M03 · L01
What we care about

Events

An event is any subset of the sample space — a collection of outcomes we want to assign a probability to.

Example
“Roll an even number” = A = {2, 4, 6} ⊂ Ω
03 / 13
STAT 101
M03 · L01
Set operations on events

Union, Intersection, Complement

  • A ∪ B — A or B (or both) occur
  • A ∩ B — A and B both occur
  • Ac — A does not occur
  • Disjoint — A ∩ B = ∅, cannot overlap
04 / 13
STAT 101
M03 · L01
Three schools of thought

What Does Probability Mean?

  • Classical — ratio of favorable to equally-likely outcomes
  • Frequentist — long-run relative frequency
  • Bayesian — degree of belief, updated by evidence
05 / 13
STAT 101
M03 · L01
When all outcomes are equal

Classical Probability

When every outcome is equally likely, probability is simply the ratio of favorable outcomes to total outcomes.

Classical formula
P(A) = \dfrac{|A|}{|\Omega|}
06 / 13
STAT 101
M03 · L01
Repeating infinitely

Frequentist View

Flip a coin a million times. The fraction of heads converges to 0.5. Probability is a property of a repeatable process, not a single trial.

Long-run frequency
P(A) = \lim_{n \to \infty} \frac{n_A}{n}
07 / 13
STAT 101
M03 · L01
Beliefs updated by evidence

Bayesian View

Probability measures degree of belief. It can be assigned to any uncertain proposition — even one-time events — and updated as evidence arrives.

Bayesian mantra
Prior belief + evidence → updated belief (posterior)
08 / 13
STAT 101
M03 · L01
The foundation (1933)

Kolmogorov’s Axioms

  • Axiom 1 — P(A) ≥ 0 for any event A
  • Axiom 2 — P(Ω) = 1 (something must happen)
  • Axiom 3 — P(A ∪ B) = P(A) + P(B) if A ∩ B = ∅
What follows
All of probability theory is derived from just these three rules
09 / 13
STAT 101
M03 · L01
Core rules

Complement & Addition

Two rules you will use in almost every probability calculation:

Complement rule
P(A^c) = 1 - P(A)
Addition rule
P(A \cup B) = P(A) + P(B) - P(A \cap B)
10 / 13
STAT 101
M03 · L01
Counting methods

Permutations & Combinations

Classical probability requires counting outcomes. Order matters → permutations. Order irrelevant → combinations.

Permutations
n! / (n−k)!
Combinations
n! / k!(n−k)!
11 / 13
STAT 101
Knowledge Check

Check what stuck

Four questions from this lesson. Answer to see why — the explanation appears whether you were right or wrong. Nothing is scored or saved.

Question 1 of 0
Score 0/0

12 / 13
STAT 101
Summary
Recap

What you learned

Sample spaces, events, three interpretations, Kolmogorov’s axioms, the complement and addition rules, and counting methods — the complete foundation of probability.

13 / 13