Probability on measurable spaces

Connect events, random variables, expectation, independence, and convergence through a rigorous probability framework.

10 published lessons1 module296 min of guided study
  1. 01
    Probability on measurable spacesadvanced · 10 lessons

Follow the path or begin with a question. Every lesson is open.

Your notebook0 of 10 lessons completed

Your place, at your pace. Progress is optional and saved only in this browser when available.

Inside this module

Each lesson includes an interactive lab

Probability on measurable spaces

Connect events, random variables, expectation, independence, and convergence through a rigorous probability framework.

  1. 01

    Probability spaces and random elements

    Build a probability model by specifying outcomes, measurable questions, and a normalized measure before introducing random observations.

    30 min
  2. 02

    Distributions as pushforward measures

    Transport probabilities through measurable maps, compute transformed laws, and distinguish marginal distributions from joint information.

    30 min
  3. 03

    Independence and product probabilities

    Recognize independence as factorization of measurable information, build product laws, and distinguish mutual independence from pairwise tests.

    30 min
  4. 04

    Expectation, integrability, and legitimate limit exchanges

    Define expectations through positive and negative parts, connect moment assumptions to tail behavior, and choose the right convergence theorem.

    30 min
  5. 05

    Borel–Cantelli lemmas and tail events

    Turn probability bounds into almost-sure eventual statements and distinguish summable errors from independent repeated opportunities.

    30 min
  6. 06

    Modes of probabilistic convergence

    Distinguish pathwise, probabilistic, moment, and distributional limits, and test the implications using rare events.

    28 min
  7. 07

    Characteristic functions and convolution

    Encode probability laws with bounded complex exponentials and turn independent sums into products.

    28 min
  8. 08

    Laws of large numbers

    Explain why averages stabilize, distinguish weak and strong laws, and identify when dependence or nonintegrability defeats averaging.

    28 min
  9. 09

    Weak convergence and the Portmanteau theorem

    Translate weak convergence into usable statements about events while respecting boundaries, atoms, and unbounded observables.

    28 min
  10. 10

    Central limit theorems and tightness

    Explain Gaussian fluctuations, the role of normalization and characteristic functions, and why tightness alone does not imply a central limit theorem.

    34 min
All mathematics modules