Probability and Statistics 1 (Summer 2026)

This course covers a number of topics around randomness. The first half will be dedicated to Probability theory, the second half to Statistics.

Prerequisites: "Discrete Mathematics", Analysis 1 (essential). Linear algebra 1 & 2, Analysis 2, Combinatorics & Graphs 1 (recommended).

Organisational remarks

The exam will be written. To attend the exam, a zápočet (course credit) is necessary. It has to be obtained through tutorials assigned to this lecture (see below). Old zápočets, or zápočets acquired at parallel Czech tutorials are not valid.

Reading materials:

Tutorials

The tutorials will be held by Joonas Kisel , William Stowe , and myself .

Syllabus

  • Lecture 1 (18.2): Notes lecture 1
    Introduction. Two interpretations of probability. Probability theory vs Statistics. Problems with the naïve approach: Bertrand's paradox, Vitali sets (both non-examinable).
    Probability spaces, Kolmogoroff's axioms. Examples: uniform and geometric distributions. Basic properties of probability measures (monotonicity, inclusion-exclusion, continuity, union bound).
    Further references: [RS] Lecture 1. [MIT] Lecture 1. Wikipedia: Bertrand's paradox, Vitali set (see also this video).
  • Lecture 2 (25.2): Notes lecture 2
    Conditional probability, independence of two events. Operations with conditional probabilities: chain rule, the law of total probability. Application: Gambler's ruin. Bayes theorem and its interpretation. Independence for a family of events (vs pairwise independence).
    Further references: [RS] Lectures 1 and 2, [MIT] Lecture 2 and [MIT] Lecture 3