Prerequisites & Notation

Before You Begin

Chapter 1 is the starting point for the entire book β€” it has no prerequisites within the library. The material below should feel familiar from undergraduate study. If any item feels shaky, spend thirty minutes reviewing it before proceeding: the rest of the book builds on these foundations.

  • Set notation: ∈\in, βŠ†\subseteq, βˆͺ\cup, ∩\cap, AcA^c, βˆ…\emptyset

    Self-check: Can you write down De Morgan's law from memory and check it with a small example?

  • Elementary logic: and, or, not, implication

    Self-check: Can you translate 'not (A and B)' into set notation?

  • Sums of geometric and telescoping series

    Self-check: Do you know βˆ‘k=0∞rk=1/(1βˆ’r)\sum_{k=0}^{\infty} r^k = 1/(1-r) for ∣r∣<1|r| < 1?

  • Counting: factorials, binomial coefficients

    Self-check: Can you compute (525)\binom{52}{5} without a calculator (leaving it as a formula)?

  • Basic proof technique: induction

    Self-check: Can you prove the binomial theorem by induction?

Notation for This Chapter

Symbols introduced in this chapter. The notation follows Kolmogorov's original conventions, which are essentially universal in modern probability.

SymbolMeaningIntroduced
Ξ©\OmegaSample space β€” the set of all possible outcomes of an experiments01
Ο‰\omegaA single outcome (sample point), Ο‰βˆˆΞ©\omega \in \Omegas01
A,B,CA, B, CEvents β€” subsets of Ξ©\Omegas01
F\mathcal{F}Sigma-algebra β€” the collection of measurable eventss02
2Ξ©2^\OmegaPower set of Ξ©\Omega β€” all subsets of Ξ©\Omegas02
B(R)\mathcal{B}(\mathbb{R})Borel sigma-algebra on R\mathbb{R}s02
(Ξ©,F,P)(\Omega, \mathcal{F}, \mathbb{P})Probability space β€” the central mathematical object of this chapters03
P(A)\mathbb{P}(A)Probability of event AAs03
n!n!Factorial: n(nβˆ’1)β‹―2β‹…1n(n-1)\cdots 2\cdot 1, with 0!=10! = 1s04
(nk)\binom{n}{k}Binomial coefficient: n!/(k!(nβˆ’k)!)n!/(k!(n-k)!)s04
(nk1,…,kr)\binom{n}{k_1,\ldots,k_r}Multinomial coefficient: n!/(k1!β‹―kr!)n!/(k_1!\cdots k_r!)s04