Skip to content
Glacius

Builds on algebra

Probability

Work with uncertainty, distributions, and the evidence that changes what you believe.

Start with sample spaces 55 lessons · 13 units
Explore bayes' rule

Inside this subject

Read at your own pace
01Events and probability6 lessons
  1. 01
    Sample spaces

    Specify outcomes fine enough to describe a finite experiment.

  2. 02
    Events

    Represent an event as a subset of a sample space.

  3. 03
    Probability assignments

    Check a finite probability assignment for nonnegativity and unit total.

  4. 04
    Event probabilities

    Compute an event probability by summing disjoint outcome masses.

  5. 05
    Union probabilities

    Compute a two-event union probability with overlap correction.

  6. 06
    Disjoint events

    Determine whether two events are mutually exclusive.

02Conditioning and Bayes5 lessons
  1. 01
    Conditional probability

    Compute an event probability within a positive-probability conditioning event.

  2. 02
    Probability multiplication

    Compute an intersection using a conditional probability.

  3. 03
    Partitions

    Verify that a collection of events partitions the sample space.

  4. 04
    Total probability

    Compute an event probability across an exhaustive disjoint case split.

  5. 05
    Bayes' rule

    Reverse a conditional probability using a prior and total evidence probability.

03Independence and evidence3 lessons
  1. 01
    Base rates

    Explain a posterior result using the prevalence of the hypothesized event.

  2. 02
    Event independence

    Check independence using the product condition.

  3. 03
    Conditional independence

    Check independence within a stated conditioning event.

04Random variables and mass4 lessons
  1. 01
    Random variables

    Define a numerical random variable on a finite sample space.

  2. 02
    Probability mass functions

    Construct a discrete random variable's probability mass function.

  3. 03
    Cumulative distributions

    Compute a discrete cumulative distribution at a threshold.

  4. 04
    Reading probabilities from a CDF

    Compute P(a < X ≤ b) by subtracting supplied CDF values at the endpoints.

05Expectation and spread7 lessons
  1. 01
    Expected values

    Compute a finite random variable's expectation.

  2. 02
    Expected transformed values

    Compute the expectation of a function of a discrete random variable.

  3. 03
    Linearity of expectation

    Compute the expectation of a linear combination without assuming independence.

  4. 04
    Indicator variables

    Use an event indicator's expectation to compute a count's expected value.

  5. 05
    Variance

    Compute variance as expected squared deviation from the mean.

  6. 06
    Standard deviation

    Express spread in the original variable's units.

  7. 07
    Variance under scaling

    Compute variance after a scalar shift and scale.

06Discrete distributions1 lessons
  1. 01
    Bernoulli trials

    Model a binary outcome with a Bernoulli distribution.

07Densities and continuous moments1 lessons
  1. 01
    Reading density curves

    Interpret a supplied area under a continuous density curve as an interval probability.

08Continuous distribution families3 lessons
  1. 01
    Normal distributions

    Identify a normal model's location and scale parameters.

  2. 02
    Standardization

    Convert a normal threshold to standard-normal units.

  3. 03
    Normal probabilities

    Compute a normal interval probability from a supplied standard-normal CDF.

09Joint mass and reference distributions6 lessons
  1. 01
    Joint mass functions

    Construct a joint discrete distribution over paired values.

  2. 02
    Discrete marginals

    Marginalize a joint mass table over one variable.

  3. 03
    Conditional mass functions

    Compute a conditional distribution from a joint mass table.

  4. 04
    Independent variables

    Check factorization of a discrete joint distribution into its marginals.

  5. 05
    Chi-squared distributions

    Identify a chi-squared variable as a sum of squared independent standard-normal variables.

  6. 06
    Student’s t distributions

    Interpret a supplied standard-normal to scaled-chi-squared ratio as a t variable under independence.

10Dependence and conditional means5 lessons
  1. 01
    Joint expectations

    Compute an expectation of a function using a finite joint table.

  2. 02
    Covariance

    Compute covariance from a joint distribution.

  3. 03
    Variance of sums

    Compute variance of a sum with a supplied covariance.

  4. 04
    Conditional expectation

    Compute a conditional mean from a conditional mass function.

  5. 05
    Total expectation

    Recover an unconditional mean by averaging conditional means.

11Random vectors2 lessons
  1. 01
    Total variance

    Decompose variance into within-case and between-case components.

  2. 02
    Covariance matrices

    Assemble the covariance matrix of a finite random vector.

12Repeated random behavior8 lessons
  1. 01
    IID samples

    Check the identical-distribution and independence assumptions in a sampling story.

  2. 02
    Sample mean variability

    Compute the variance of an IID sample mean with finite variance.

  3. 03
    Markov's inequality

    Bound a nonnegative variable's upper tail from its mean.

  4. 04
    Chebyshev's inequality

    Bound a deviation probability using finite variance.

  5. 05
    Law of large numbers

    Interpret convergence of an IID sample average under a stated finite-variance assumption.

  6. 06
    Central limit theorem

    Form a normal approximation for a standardized IID sum with finite positive variance.

  7. 07
    CLT limitations

    Diagnose a normal approximation undermined by the sampling assumptions or heavy tails.

  8. 08
    Monte Carlo estimation

    Estimate an expectation with a supplied set of independent simulated draws.

13Information4 lessons
  1. 01
    Surprisal

    Compute the information associated with a positive-probability event.

  2. 02
    Entropy

    Compute entropy of a finite probability distribution.

  3. 03
    Cross-entropy

    Compute expected negative log probability under a supplied target distribution.

  4. 04
    KL divergence

    Compute a finite-distribution KL divergence with valid support handling.