Probability: a reasoned summary

A compact reference for modelling uncertainty, updating information and recognising the main probability distributions.

Events and axioms

The sample space Ω contains all possible outcomes; an event is a subset AΩ. A probability satisfies non-negativity, P(Ω)=1, and countable additivity for disjoint events.

P(Ac)=1P(A)P(AB)=P(A)+P(B)P(AB)
“Favourable cases over possible cases” only applies to finite, equally likely outcomes.

Counting

Order matters

Permutations: n!. Ordered selections of k: n!(nk)!.

Order does not matter

Combinations: (nk)=n!k!(nk)!.

Repetition allowed

Sequences of length k over n choices: nk.

Conditional probability and Bayes

P(A|B)=P(AB)P(B)P(H|E)=P(E|H)P(H)P(E)

Events A and B are independent exactly when P(AB)=P(A)P(B). Independence is not the same as mutual exclusivity.

Random variables, expectation and variance

A random variable is a function X:Ω. Discrete variables have a probability mass function; continuous variables have a density. Both have the cumulative distribution function FX(x)=P(Xx).

Var(X)=𝔼[X2]𝔼[X]2

Expectation is linear. Variances add for independent variables; in general the covariance term must be included.

Explore variance, standard deviation and distributions interactively →

Key distributions

DistributionUseMean / variance
Bernoulli Ber(p)One success/failure trialp/p(1p)
Binomial Bin(n,p)Successes in independent trialsnp/np(1p)
Poisson Pois(λ)Event countsλ/λ
Exponential Exp(λ)Waiting times1λ/1λ2
Normal N(μ,σ2)Errors and sums of many effectsμ/σ2

Law of large numbers and central limit theorem

The law of large numbers says that the sample mean converges to the population mean. The central limit theorem says that, under standard assumptions, its standardised fluctuations approach a normal distribution. These are related but distinct statements.

Before university, be comfortable translating verbal problems into events, checking independence, applying total probability and Bayes, and computing expectation and variance.