What are sigma-algebras?

1. Formula
   Observation

   The handwritten symbol Ω is introduced in the definition and later used as the sample space for the coin-tossing example.

$\Omega$

A set; in the probability context it denotes the sample space.

Any non-empty set.

1. Formula
   Observation

   The handwritten calligraphic symbol $\mathcal{F}$ is written as a collection of subsets of $\Omega$ and is named the sigma-algebra on $\Omega$.

$\mathcal{F}$

A collection of subsets of $\Omega$ that satisfies the sigma-algebra axioms.

$\mathcal{F}\subseteq\mathcal{P}(\Omega)$.

1. Formula
   Observation

   In condition (ii), A is used as an arbitrary element of $\mathcal{F}$. In condition (iii), $A_1$,$A_2$,$\ldots$ are used as elements of a sequence in $\mathcal{F}$.

A

A set belonging to the collection $\mathcal{F}$.

$A\in\mathcal{F}$.

1. Formula
   Observation

   The complement notation $A^c$ appears in condition (ii) of the sigma-algebra definition.

$A^c$

The complement of A relative to $\Omega$.

$A^c=\Omega\setminus A$.

1. Formula
   Observation

   The indexed sets $A_1$,$A_2$,$\ldots$ appear in condition (iii) of the sigma-algebra definition.

$A_k$

The k-th set in a countable sequence of sets from $\mathcal{F}$.

$A_k\in\mathcal{F}$,$\quad k\in\mathbb{N}$.

1. Formula
   Observation

   The blackboard-bold symbol $\mathbb{P}$ is written as the measure component of a probability space triple.

$\mathbb{P}$

A probability measure assigning probabilities to sets in the sigma-algebra.

$\mathbb{P}$:\mathcal{F}$\to[0,1]$.

1. Formula
   Observation

   The handwritten $\mathcal{P}(\Omega)$ is defined as the power set, i.e. all subsets of $\Omega$.

$\mathcal{P}(\Omega)$

The power set of $\Omega$, the collection of all subsets of $\Omega$.

$\mathcal{P}(\Omega)$=\{S:S\subseteq\Omega\}.

1. Formula
   Observation

   The empty-set symbol $\emptyset$ appears in the trivial sigma-algebra example.

$\emptyset$

The empty set.

$\emptyset\subseteq\Omega$.

1. Formula
   Observation

   The symbol Ω is written repeatedly as the sample space in examples such as Ω = {HH, HT, TH, TT}, Ω = {H, TH, TTH, TTTH, ...}, and $Ω = {1,2,3,4,5,6}$.

2. Audio
   Observation

   The narration refers to Ω as the sample space or the collection of possible outcomes.

$\Omega$

Sample space, i.e. the set of all possible outcomes of a random experiment.

A nonempty set; in the examples it is finite or countably infinite.

1. Formula
   Observation

   The calligraphic symbol F appears in the probability-space triple (Ω,F,P) and in statements about which sets are allowed to be measured.

2. Audio
   Observation

   The speaker says that the collection F corresponds to the collection of sets we are allowed to measure or assign probabilities to.

$\mathcal{F}$

Sigma-algebra on Ω; the collection of events/sets that are allowed to be measured or assigned probabilities.

A collection of subsets of Ω satisfying the sigma-algebra axioms.

1. Formula
   Observation

   The symbol P appears in the triple (Ω,F,P) and in the displayed equation $P(Ω)=1$.

2. Audio
   Observation

   The narration describes assigning probabilities to sets in F.

$\mathbb{P}$

Probability measure on the measurable space (Ω,F).

Defined on sets in $\mathcal{F}$; takes values in [0,1].

1. Formula
   Observation

   The empty set symbol ∅ appears in the trivial sigma-algebra {∅, Ω}.

$\varnothing$

Empty set.

Subset of every set; here an element of a sigma-algebra on Ω.

1. Formula
   Observation

   The whiteboard writes: Given a set $\Omega$, a collection $\mathcal{F}$ of subsets of $\Omega$ is $a \sigma$-algebra on $\Omega$ if (i) $\Omega\in\mathcal{F}$; (ii) if $A\in\mathcal{F}$, then $A^c\in\mathcal{F}$; (iii) if $A_1$,$A_2$,$\ldots\in\mathcal{F}$, then $\bigcup_{k=1}^{\infty}A_k\in\mathcal{F}$.

2. Audio
   Observation

   The narrator reads the same three conditions and then paraphrases them in words.

A sigma-algebra on a set $\Omega$ is a collection $\mathcal{F}$ of subsets of $\Omega$ that contains $\Omega$ itself, is closed under complements relative to $\Omega$, and is closed under countable unions. The video also summarizes this verbally as a non-empty collection of subsets closed under taking complements and countable unions.

1. $\Omega$ is a set.

2. $\mathcal{F}$ is a collection of subsets of $\Omega$.

1. Formula
   Observation

   The whiteboard writes: a probability space is defined as a triple ($\Omega$,$\mathcal{F}$,$\mathbb{P}$) consisting of a set $\Omega$, $a \sigma$-algebra $\mathcal{F}$ on $\Omega$, and a measure $\mathbb{P}$:\mathcal{F}$\to[0,1]$ that assigns probabilities to the sets in $\mathcal{F}$.

2. Audio
   Observation

   The narrator states the same definition and explains that the sigma-algebra corresponds to the collection of sets we allow ourselves to measure or assign probabilities to.

A probability space is presented as the ordered triple ($\Omega$,$\mathcal{F}$,$\mathbb{P}$), where $\Omega$ is the underlying set, $\mathcal{F}$ is a sigma-algebra on $\Omega$, and $\mathbb{P}$ is a probability measure defined on $\mathcal{F}$ with values in [0,1].

1. $\mathcal{F}$ is a sigma-algebra on $\Omega$.

1. Definition of a sigma-algebra

1. Formula
   Observation

   The whiteboard writes \{$\emptyset$,$\Omega$\} and labels it the trivial $\sigma$-algebra.

2. Audio
   Observation

   The narrator says that given any set, the following are always sigma-algebras on that set, including the trivial sigma-algebra containing only the empty set and the set itself.

For any set $\Omega$, the collection \{$\emptyset$,$\Omega$\} is always a sigma-algebra on $\Omega$. It is called the trivial sigma-algebra because it contains only the empty set and the whole space.

1. $\Omega$ is a set.

1. Definition of a sigma-algebra

1. Formula
   Observation

   The whiteboard writes $\mathcal{P}(\Omega)$=\{$\text{all subsets of }\Omega$\} and labels it the power set.

2. Audio
   Observation

   The narrator says that the power set, containing all subsets of the set, is also always a sigma-algebra on that set.

For any set $\Omega$, the power set $\mathcal{P}(\Omega)$, which is the collection of all subsets of $\Omega$, is always a sigma-algebra on $\Omega$.

1. $\Omega$ is a set.

1. Definition of a sigma-algebra

1. Formula
   Observation

   The board writes 'When constructing a probability space (Ω,F,P)'.

2. Audio
   Observation

   The narration says, 'When constructing a probability space, the collection F corresponds to the collection of sets we are allowed to measure.'

A probability space is presented as the triple $(\Omega,\mathcal{F},\mathbb{P})$. Here $\Omega$ is the sample space, $\mathcal{F}$ is the collection of sets/events that are allowed to be measured or assigned probabilities, and $\mathbb{P}$ is the probability assignment. The clip emphasizes the role of $\mathcal{F}$ as the measurable collection inside the triple.

1. $\Omega$ is the sample space.

2. $\mathcal{F}$ is a collection of subsets of $\Omega$.

3. $\mathbb{P}$ assigns probabilities to sets in $\mathcal{F}$.

1. Formula
   Observation

   The board states: 'The requirement that F is a σ-algebra makes sure that we never leave F by means of the usual set operations.'

2. Audio
   Observation

   The speaker says the same sentence aloud.

The video defines the practical role of a sigma-algebra: requiring $\mathcal{F}$ to be a $\sigma$-algebra ensures closure under the usual set operations, so starting from measurable sets and applying those operations never produces a set outside $\mathcal{F}$. This is the central motivation for the structure in probability theory.

1. $\mathcal{F}$ is intended to be the collection of measurable sets/events.

2. Usual set operations include complement, finite union, and countable union as discussed in the clip.

1. Probability space as a triple (Ω,F,P)

1. Formula
   Observation

   The board writes: 'We want $Ω \in F$ to be able to demand $P(Ω)=1$.'

2. Audio
   Observation

   The narration says, 'We want omega itself to belong to the collection, to make sure it's non-empty and that the maximum probability is always one.'

One axiom/motivation shown is that the whole sample space should be measurable: $\Omega\in\mathcal{F}$. This allows the probability measure to assign the total probability $\mathbb{P}(\Omega)=1$, expressing certainty that some outcome in the sample space occurs.

1. $\Omega$ is the sample space.

2. $\mathbb{P}$ is the probability measure on $\mathcal{F}$.

1. Probability space as a triple (Ω,F,P)
2. Purpose of requiring F to be a sigma-algebra

1. Formula
   Observation

   The board writes: 'If we want to measure A, then typically we want to measure the probability that A does not occur, i.e. its complement.'

2. Audio
   Observation

   The speaker explains that if we want to measure A, we also want to measure the probability that A does not occur, namely its complement.

The clip motivates the complement axiom of a sigma-algebra: whenever an event $A$ is measurable, the event '$A$ does not occur' should also be measurable. In set notation this is the complement $A^c$, so $\mathcal{F}$ must be closed under taking complements.

1. $A\subseteq\Omega$.

2. $A^c$ is taken relative to $\Omega$.

1. Purpose of requiring F to be a sigma-algebra

1. Formula
   Observation

   The board writes: 'If we want to measure A and B, then typically we want to measure the probability that either occurs, i.e. A∪B.'

2. Audio
   Observation

   The narration says that if we want to measure two sets A and B, we typically want to measure the probability that either of the two occurs, i.e. their union.

The next operation motivated is union: if $A$ and $B$ are measurable events, then the event 'either $A$ or $B$ occurs' should also be measurable. This gives closure under finite unions, at least for two sets in the example.

1. $A,B\subseteq\Omega$.

2. The statement in the clip is illustrated for two sets; finite unions follow by iteration.

1. Purpose of requiring F to be a sigma-algebra

1. Formula
   Observation

   The board writes: 'Taking finite unions is not enough.' Then it gives the coin-toss example with Ω={H,TH,TTH,TTTH,...} and A={an even number of tosses until H}, followed by A=⋃_{$k=1$}^$\infty$ {H after 2k tosses}.

2. Audio
   Observation

   The speaker says finite unions are not always enough and explains that the event of needing an even number of tosses until heads is a countable union of individual outcomes.

The video argues that finite unions do not suffice for probability spaces with infinitely many outcomes. In the coin-tossing-until-heads example, the event 'an even number of tosses until H' is formed by collecting infinitely many individual outcomes, one for each even stopping time. Therefore a sigma-algebra must be closed under countable unions.

1. The sample space may be countably infinite.

2. Each singleton outcome is in the collection.

3. Countable unions of such sets must remain in the collection.

1. Closure under finite unions
2. Purpose of requiring F to be a sigma-algebra

1. Formula
   Observation

   The board writes: 'And yes, a σ-algebra is closed under countable intersections' and displays ⋂_{$k=1$}^$\infty A_k$ = (⋃_{$k=1$}^$\infty A_k^c$)^c.

2. Audio
   Observation

   The speaker says that a sigma-algebra is also closed under countable intersections, as those can be rewritten in terms of complements and countable unions.

Although the defining emphasis is on complements and countable unions, the clip states that countable intersections are also allowed. The justification shown is the De Morgan identity: a countable intersection equals the complement of the countable union of complements. Since a sigma-algebra is closed under complements and countable unions, it is therefore closed under countable intersections.

1. Each $A_k\in\mathcal{F}$.

2. $\mathcal{F}$ is closed under complements and countable unions.

1. Closure under complements
2. Why countable unions are required

1. Formula
   Observation

   The new page title is 'Finite and countable state spaces'. The board writes: 'If a σ-algebra is mainly introduced in order to keep track of which sets we are allowed to measure / assign probabilities to, then we typically want it to be large.'

2. Audio
   Observation

   The narration says that if a sigma-algebra is mainly introduced to keep track of which sets we are allowed to measure or assign probabilities to, then we typically want it to be large.

The second half of the clip shifts from abstract closure properties to a design principle: when the purpose of $\mathcal{F}$ is simply to record which events can be assigned probabilities, we usually prefer $\mathcal{F}$ to be as large as possible, especially in finite or countable sample spaces.

1. The sample space is being considered for probability assignment.

2. The motivation is measurability of desired events rather than technical restriction.

1. Purpose of requiring F to be a sigma-algebra

1. Formula
   Observation

   The three numbered conditions are written explicitly on the board.

2. Audio
   Observation

   The narrator reads the conditions and then restates them in words.

A collection $\mathcal{F}$ of subsets of $\Omega$ is a sigma-algebra on $\Omega$ exactly when it contains $\Omega$, is closed under complements, and is closed under countable unions.

1. $\Omega$ is a set.

2. $\mathcal{F}\subseteq\mathcal{P}(\Omega)$.

For every $A\in\mathcal{F}$ and every sequence $A_1$,$A_2$,$\ldots$ in $\mathcal{F}$.

1. Formula
   Observation

   The board lists \{$\emptyset$,$\Omega$\} and $\mathcal{P}(\Omega)$ under the sentence 'Given a set $\Omega$, the following are always $\sigma$-algebras on $\Omega$'.

2. Audio
   Observation

   The narrator says these are always sigma-algebras on that set.

For any set $\Omega$, both \{$\emptyset$,$\Omega$\} and $\mathcal{P}(\Omega)$ are sigma-algebras on $\Omega$.

1. $\Omega$ is a set.

For every set $\Omega$.

1. Formula
   Observation

   The board lists the requirements: $Ω\in F$, closure under complements, closure under unions, and the note that finite unions are not enough; it also displays the De Morgan identity for countable intersections.

2. Audio
   Observation

   The narration presents these as the reasons for requiring F to be a sigma-algebra.

1. The clip gives motivation and examples rather than a formal axiom list with full quantifiers.

A collection $\mathcal{F}$ of subsets of $\Omega$ is required to be a sigma-algebra so that it contains $\Omega$, is closed under complements, and is closed under countable unions; consequently it is also closed under countable intersections.

1. $\mathcal{F}$ is intended to be the collection of measurable sets in a probability space $(\Omega,\mathcal{F},\mathbb{P})$.

2. Complements are taken relative to $\Omega$.

For all $A,B\in\mathcal{F}$ and for all sequences $(A_k)_{k\ge1}$ in $\mathcal{F}$, the indicated operations remain in $\mathcal{F}$.

1. Formula
   Observation

   The displayed identity is ⋂_{$k=1$}^$\infty A_k$ = (⋃_{$k=1$}^$\infty A_k^c$)^c.

2. Audio
   Observation

   The speaker says countable intersections can be rewritten in terms of complements and countable unions.

For any sequence of sets $(A_k)_{k\ge1}$, $\bigcap_{k=1}^{\infty}A_k=\left(\bigcup_{k=1}^{\infty}A_k^c\right)^c$; hence closure under complements and countable unions implies closure under countable intersections.

1. Each $A_k$ is a subset of the same universe $\Omega$.

2. Complements are relative to $\Omega$.

For every sequence $(A_k)_{k=1}^{\infty}$.

1. Formula
   Observation

   The board states that if the sample space is discrete, i.e. finite or countable, then we typically want to assign probabilities to all individual outcomes, and a suitable sigma-algebra should contain all singletons {x} for $x\in Ω$.

2. Audio
   Observation

   The narration explicitly says this.

1. The claim is presented as a typical modeling preference, not as a theorem with proof in this clip.

If $\Omega$ is finite or countable and we want to assign probabilities to all individual outcomes, then a suitable sigma-algebra on $\Omega$ should contain every singleton $\{x\}$ with $x\in\Omega$.

1. $\Omega$ is discrete, i.e. finite or countable.

2. The goal is to assign probabilities to individual outcomes.

For all $x\in\Omega$.

1. Formula
   Observation

   Handwritten text states: 'Fact There is no function $\mu$ defined on all $A \subseteq [0,1]$ which satisfies (i)-(iii). (At least not if we assume the axiom of choice).'

There is no function $\mu$ defined on all subsets $A \subseteq [0,1]$ that simultaneously satisfies the length property, countable additivity, and translation invariance, assuming the axiom of choice.

1. Assume the axiom of choice.

2. $\Omega = [0,1]$

For all subsets $A \subseteq [0,1]$

1. Formula
   Observation

   Handwritten text states: 'In the continuous setting, the power set is not a suitable choice.'

In the continuous setting, the power set is not a suitable sigma-algebra for defining a uniform probability measure.

1. The setting is continuous (e.g., $\Omega = [0,1]$).

Universal

1. Formula
   Observation

   The board explicitly labels the statement as "Fact" and writes the full assertion about existence and uniqueness of $\mu$.

2. Audio
   Observation

   The speaker states the same existence-and-uniqueness claim in words.

There exists a unique probability measure $\mu$ : $\mathcal{B}([0,1]) \to [0,1]$ such that $\mu$((a,b]) = b-a for all $0 \leq a \leq b \leq 1$.

1. Work on the Borel sigma-algebra $\mathcal{B}([0,1])$.

2. Consider intervals of the form (a,b] with $0 \leq a \leq b \leq 1$.

There exists a unique $\mu$ such that for all a,b with $0 \leq a \leq b \leq 1$, the displayed equality holds.

1. Formula
   Observation

   The boxed sentence states that in the continuous setting the Borel sigma-algebra is the standard choice.

2. Audio
   Observation

   The speaker introduces it with "Because of this fact," linking it to the previous uniqueness statement.

In the continuous setting, the Borel sigma-algebra is the standard choice.

1. The context is the continuous setting.

2. The preceding fact about the unique measure on $\mathcal{B}([0,1])$ is being used as motivation.

General statement about standard practice in continuous probability.

1. Formula
   Observation

   The writing says assigning probabilities to all subsets of $\Omega$ is never a problem in the discrete setting but is a problem in the continuous setting.

2. Audio
   Observation

   The speaker states the same contrast.

Trying to assign probabilities to all subsets of a sample space $\Omega$ is never a problem in the discrete setting, but it is a problem in the continuous setting.

1. $\Omega$ is a sample space.

2. One distinguishes discrete from continuous settings.

Universal contrast between the discrete case and the continuous case.

1. Formula
   Observation

   The last line states that by restricting to sigma-algebras containing all sets we may want to measure, the problem is resolved.

2. Audio
   Observation

   The speaker repeats the resolution claim verbatim in substance.

By restricting ourselves to sigma-algebras containing all sets we may want to measure, the problem of assigning probabilities to all subsets in the continuous setting is resolved.

1. The ambient setting is continuous probability.

2. The selected sigma-algebra contains all sets one may want to measure.

Existential strategy: choose a sigma-algebra with the stated containment property.

1. Audio
   Observation

   The narrator introduces the experiment of tossing a coin twice, lists the outcomes, then compares the trivial sigma-algebra with the power set and concludes that in this example the former would be too small while the latter would be suitable.

2. Formula
   Observation

   The board writes $\Omega$=\{HH,HT,TH,TT\}, then \{$\emptyset$,$\Omega$\} and $\mathcal{P}(\Omega)$.

1. Expression

   $$\Omega=\{HH,HT,TH,TT\}$$
   Explanation

   The sample space for tossing a coin twice is written as the four ordered outcome pairs.

   Justification

   Directly stated in the example.

   Shown in the video
2. Expression

   $$\{\emptyset,\Omega\}$$
   Explanation

   This is the trivial sigma-algebra on $\Omega$.

   Justification

   It is one of the canonical sigma-algebras listed on the board.

   Shown in the video
3. Expression

   $$\mathcal{P}(\Omega)=\{\text{all subsets of }\Omega\}$$
   Explanation

   This is the full power set sigma-algebra on $\Omega$.

   Justification

   It is the other canonical sigma-algebra listed on the board.

   Shown in the video
4. Explanation

   The narrator argues that the trivial sigma-algebra would not allow probabilities to be assigned to meaningful events in this experiment, whereas the power set would be suitable.

   Justification

   This is the comparison made immediately after listing the two examples.

   Shown in the video

In the two-coin-toss example, the power set is the appropriate sigma-algebra, while the trivial sigma-algebra is too small for meaningful event probabilities.

1. Formula
   Observation

   The board writes ⋂_{$k=1$}^$\infty A_k$ = (⋃_{$k=1$}^$\infty A_k^c$)^c immediately after stating that a sigma-algebra is closed under countable intersections.

2. Audio
   Observation

   The speaker says these can be rewritten in terms of complements and countable unions.

1. Expression

   $$A_k\in\mathcal{F}\ \text{for each }k\ge1$$
   Explanation

   Start with a countable family of measurable sets.

   Justification

   Assumption from the sigma-algebra setting.

   Shown in the video
2. Expression

   $$A_k^c\in\mathcal{F}$$
   Explanation

   Take complements of each set.

   Justification

   Closure under complements, stated earlier in the clip.

   Shown in the video
3. Expression

   $$\bigcup_{k=1}^{\infty}A_k^c\in\mathcal{F}$$
   Explanation

   Form the countable union of the complements.

   Justification

   Closure under countable unions, motivated by the coin-toss example.

   Shown in the video
4. Expression

   $$\left(\bigcup_{k=1}^{\infty}A_k^c\right)^c\in\mathcal{F}$$
   Explanation

   Take the complement of that countable union.

   Justification

   Apply closure under complements again.

   Shown in the video
5. Expression

   $$\bigcap_{k=1}^{\infty}A_k=\left(\bigcup_{k=1}^{\infty}A_k^c\right)^c$$
   Explanation

   Recognize the left-hand side as the desired countable intersection.

   Justification

   De Morgan law for countable families of sets.

   Shown in the video

Therefore a sigma-algebra closed under complements and countable unions is also closed under countable intersections.

1. Formula
   Observation

   The board defines Ω={H,TH,TTH,TTTH,...}, then A={an even number of tosses until H}, and finally A=⋃_{$k=1$}^$\infty$ {H after 2k tosses}.

2. Audio
   Observation

   The speaker explains that the event of requiring an even number of tosses until heads is a countable union of individual outcomes.

1. Expression

   $$\Omega=\{H,TH,TTH,TTTH,\ldots\}$$
   Explanation

   List the possible outcomes of tossing until the first heads.

   Justification

   Definition of the sample space in the example.

   Shown in the video
2. Expression

   $$A=\{\text{an even number of tosses until }H\}$$
   Explanation

   Define the event of interest.

   Justification

   Stated on the board and in narration.

   Shown in the video
3. Expression

   $$A=\bigcup_{k=1}^{\infty}\{\text{H after }2k\text{ tosses}\}$$
   Explanation

   Rewrite A as the union of all singleton outcomes whose stopping time is even.

   Justification

   Each even stopping time corresponds to exactly one listed outcome, and there are infinitely many such outcomes.

   Shown in the video

The event A is not obtainable from finitely many outcomes alone; it requires a countable union, showing why finite unions are insufficient.

1. Formula
   Observation

   The page first states the fact about the unique measure $\mu$ and then boxes the conclusion that the Borel sigma-algebra is the standard choice.

2. Audio
   Observation

   The speaker explicitly connects them with "Because of this fact".

1. Expression

   $$\mu : \mathcal{B}([0,1]) \to [0,1], \quad \mu((a,b]) = b-a$$
   Explanation

   The clip presents a unique probability measure on the Borel sigma-algebra of the unit interval that agrees with ordinary interval length on half-open intervals.

   Justification

   Stated directly as a "Fact" on the board and in the narration.

   Shown in the video
2. Expression

   $$$$
   Explanation

   This measure is named Lebesgue measure and linked to the uniform distribution on [0,1].

   Justification

   Written immediately below the fact and spoken by the lecturer.

   Shown in the video
3. Expression

   $$$$
   Explanation

   Therefore, in continuous probability, the Borel sigma-algebra is taken as the standard measurable structure.

   Justification

   The lecturer introduces the boxed sentence with "Because of this fact", making it a motivational consequence rather than a formal proof.

   Shown in the video

The existence and natural interpretation of the unique length-preserving measure on $\mathcal{B}([0,1])$ is used to justify why the Borel sigma-algebra is the standard choice in the continuous setting.

1. Formula
   Observation

   The second page lays out the problem of all subsets, contrasts discrete and continuous cases, and ends with the restriction to sigma-algebras.

2. Audio
   Observation

   The narration follows the same order and states the resolution.

1. Expression

   $$$$
   Explanation

   Start from the observation that assigning probabilities to all subsets of a sample space $\Omega$ can cause problems.

   Justification

   Explicitly written and spoken at the beginning of the second page.

   Shown in the video
2. Expression

   $$$$
   Explanation

   Note that this is not a problem in the discrete setting, but it is a problem in the continuous setting.

   Justification

   Directly stated in the middle sentence on the board and in audio.

   Shown in the video
3. Expression

   $$$$
   Explanation

   Resolve the issue by restricting attention to sigma-algebras that still contain all sets one may want to measure.

   Justification

   Final sentence of the page and closing spoken line.

   Shown in the video

In continuous probability, one avoids the difficulties of measuring every subset by working inside a suitably chosen sigma-algebra.

1. Formula
   Observation

   The board writes: Example Consider the experiment of tossing a coin twice. The possible outcomes of the experiment are $\Omega$=\{HH,HT,TH,TT\}.

2. Audio
   Observation

   The narrator says: 'As an example, consider the experiment of tossing a coin twice. The possible outcomes of the experiment are the outcomes heads-heads, heads-tails, tails-heads, and tails-tails.'

Describe the sample space for the experiment of tossing a coin twice and identify standard sigma-algebras on it.

1. The experiment is tossing a coin twice.

2. The outcomes are denoted by H and T.

Write the sample space $\Omega$ and compare the trivial sigma-algebra with the power set sigma-algebra on $\Omega$.

1. Expression

   $$\Omega=\{HH,HT,TH,TT\}$$
   Explanation

   List all ordered outcomes of two coin tosses.

   Justification

   Each toss has two possibilities, H or T, so there are four ordered pairs.

   Shown in the video
2. Expression

   $$\{\emptyset,\Omega\}$$
   Explanation

   Identify the trivial sigma-algebra on $\Omega$.

   Justification

   The video states this is always a sigma-algebra on any set.

   Shown in the video
3. Expression

   $$\mathcal{P}(\Omega)=\{\text{all subsets of }\Omega\}$$
   Explanation

   Identify the power set sigma-algebra on $\Omega$.

   Justification

   The video states this is always a sigma-algebra on any set.

   Shown in the video
4. Explanation

   Compare suitability for assigning probabilities to meaningful events.

   Justification

   The narrator says the trivial sigma-algebra would be way too small, but the power set would be suitable.

   Shown in the video

$\Omega$=\{HH,HT,TH,TT\}; both \{$\emptyset$,$\Omega$\} and $\mathcal{P}(\Omega)$ are sigma-algebras on $\Omega$, and for this example the power set is the suitable choice.

The conclusion follows from the explicit comparison stated at the end of the clip.

1. Formula
   Observation

   The opening board shows 'Example Consider the experiment of tossing a coin twice. The possible outcomes of the experiment are Ω={HH,HT,TH,TT}.' It also lists {∅,Ω} as the trivial sigma-algebra and $P(Ω)$ as the power set, noting the former is too small and the latter suitable.

2. Audio
   Observation

   No separate audio explanation of this exact example is present in the provided clip; the information is visible on the board.

1. This example is visible at the start but is not developed verbally within the supplied audio segment.

Describe the sample space for tossing a coin twice and compare two sigma-algebras on it.

1. Experiment: toss a coin twice.

2. Outcomes are recorded as strings of H and T.

Identify Ω and compare the trivial sigma-algebra with the power set.

1. Expression

   $$\Omega=\{HH,HT,TH,TT\}$$
   Explanation

   List all ordered pairs of heads/tails outcomes.

   Justification

   Direct enumeration of the sample space.

   Shown in the video
2. Expression

   $$\{\varnothing,\Omega\}$$
   Explanation

   This is the trivial sigma-algebra on Ω.

   Justification

   Labeled on the board.

   Shown in the video
3. Expression

   $$\mathcal{P}(\Omega)=\{\text{all subsets of }\Omega\}$$
   Explanation

   This is the power set of Ω.

   Justification

   Labeled on the board.

   Shown in the video
4. Expression

   $$\text{the former would be too small, but the latter suitable}$$
   Explanation

   For this example, the trivial sigma-algebra is judged too small, while the power set is suitable.

   Justification

   Explicit board comment.

   Shown in the video

Ω={HH,HT,TH,TT}; the trivial sigma-algebra {∅,Ω} is too small for the example, while the power set 𝒫(Ω) is suitable.

The comparison is directly stated on the board.

1. Formula
   Observation

   The board writes 'Example Toss a coin until heads. The set of outcomes corresponds to Ω={H,TH,TTH,TTTH,...}. Let A={an even number of tosses until H}. A=⋃_{$k=1$}^$\infty$ {H after 2k tosses}.'

2. Audio
   Observation

   The speaker narrates this example to show that finite unions are not enough.

Show why the event 'an even number of tosses until heads' cannot be handled by finite unions alone.

1. Experiment: toss a coin until the first heads appears.

2. Outcomes are sequences ending in H, with all previous tosses T.

Represent the event A and identify the set operation needed.

1. Expression

   $$\Omega=\{H,TH,TTH,TTTH,\ldots\}$$
   Explanation

   Enumerate the possible stopping sequences.

   Justification

   Each outcome records how many tosses were needed before the first H.

   Shown in the video
2. Expression

   $$A=\{\text{an even number of tosses until }H\}$$
   Explanation

   Define the event of interest.

   Justification

   Stated on the board and in narration.

   Shown in the video
3. Expression

   $$A=\bigcup_{k=1}^{\infty}\{\text{H after }2k\text{ tosses}\}$$
   Explanation

   Collect all singleton outcomes with even stopping time.

   Justification

   There are infinitely many even numbers, so this is a countable union.

   Shown in the video

A is the countable union of the singleton events corresponding to stopping times 2,4,6,....

The board explicitly writes the countable-union representation.

1. Formula
   Observation

   The board writes 'Example The roll of a die. $Ω={1,2,3,4,5,6}$. A suitable σ-algebra in the discrete setting should contain all singletons, i.e. sets of the form {x} for $x\in Ω$.'

2. Audio
   Observation

   The speaker says the different outcomes are 1 to 6 and that these are outcomes we would like to assign probabilities to.

Identify the sample space for rolling a die and state what a suitable sigma-algebra should contain in this discrete setting.

1. Experiment: roll a standard die.

2. Outcomes are the face values.

Write Ω and specify the singleton requirement for the sigma-algebra.

1. Expression

   $$\Omega=\{1,2,3,4,5,6\}$$
   Explanation

   List the six possible outcomes.

   Justification

   Direct enumeration of the die faces.

   Shown in the video
2. Expression

   $$\{x\}\in\mathcal{F}\quad\text{for }x\in\Omega$$
   Explanation

   A suitable sigma-algebra should contain each singleton outcome.

   Justification

   Stated on the board and in narration for discrete sample spaces.

   Shown in the video

$Ω={1,2,3,4,5,6}$, and a suitable sigma-algebra should contain all singletons {x} for $x\in Ω$.

The requirement is explicitly written on the board.

1. Formula
   Observation

   Handwritten text states: 'Example The roll of a die. $\Omega$ = \{1, 2, 3, 4, 5, 6\}.'

Identify the sample space and appropriate sigma-algebra for rolling a standard six-sided die.

1. The experiment is rolling a fair six-sided die.

Define the sample space $\Omega$ and determine the standard sigma-algebra.

1. Expression

   $$\Omega = \{1, 2, 3, 4, 5, 6\}$$
   Explanation

   The sample space consists of the six possible outcomes of the die roll.

   Justification

   Direct observation of the possible results.

   Shown in the video
2. Expression

   $$\mathcal{P}(\Omega)$$
   Explanation

   Since $\Omega$ is finite, the standard sigma-algebra is the power set, containing all possible subsets of outcomes.

   Justification

   Application of the fact for discrete sample spaces.

   Shown in the video

$\Omega$ = \{1, 2, 3, 4, 5, 6\} and the sigma-algebra is $\mathcal{P}(\Omega)$.

The power set contains all singletons like \{1\}, \{2\}, etc., allowing probabilities to be assigned to individual outcomes.

1. Diagram
   Observation

   A title card reads 'What are $\sigma$-algebras?' and then handwritten introductory text appears line by line on a white background.

2. Audio
   Observation

   The narrator introduces sigma-algebras as central in measure theory and rigorous probability theory.

1. Title text

2. Handwritten introductory paragraph

1. The title is shown first.

2. Introductory sentences are written progressively below the title.

1. The background remains plain white.

2. The writing is handwritten in blue with some red emphasis.

This opening frames sigma-algebras as foundational objects in measure theory and probability.

1. Diagram
   Observation

   A new page headed 'The definition' shows the formal definition of a sigma-algebra with three numbered conditions, followed by a verbal summary.

2. Audio
   Observation

   The narrator reads the definition and then paraphrases it in words.

1. Heading 'The definition'

2. Three numbered conditions

3. Verbal summary sentence

1. The formal conditions are written one by one.

2. A summary sentence is added underneath.

1. The notation $\Omega$ and $\mathcal{F}$ stays consistent throughout the definition.

The visual layout separates the formal axioms from their plain-language interpretation.

1. Diagram
   Observation

   A page headed 'Why sigma-algebras?' writes the definition of a probability space as a triple and highlights the role of the sigma-algebra.

2. Audio
   Observation

   The narrator explains that the sigma-algebra corresponds to the collection of sets we allow ourselves to measure or assign probabilities to.

1. Triple ($\Omega$,$\mathcal{F}$,$\mathbb{P}$)

2. Highlighted phrase about measurable sets

1. The triple is written first.

2. An explanatory sentence about measurable sets is added below.

1. $\mathcal{F}$ remains the sigma-algebra component of the triple.

The board connects the abstract definition of a sigma-algebra to its use inside a probability space.

1. Diagram
   Observation

   A page headed 'Example' writes the two-coin-toss sample space and then lists two canonical sigma-algebras on a set.

2. Audio
   Observation

   The narrator gives the coin-toss example and compares the trivial sigma-algebra with the power set.

1. Sample space $\Omega$=\{HH,HT,TH,TT\}

2. Trivial sigma-algebra \{$\emptyset$,$\Omega$\}

3. Power set $\mathcal{P}(\Omega)$

1. The example statement is written.

2. The sample space is listed.

3. Two standard sigma-algebras are written beneath.

1. The same set $\Omega$ is used for both example sigma-algebras.

The example illustrates how different sigma-algebras can be placed on the same sample space and why size matters for modeling events.

1. Animation
   Observation

   The writing area clears and a new highlighted title appears: 'Finite and countable state spaces'.

2. Audio
   Observation

   The narration shifts from general sigma-algebra motivations to discrete sample spaces.

1. Old notes on sigma-algebra motivations

2. New title 'Finite and countable state spaces'

1. Previous handwritten content disappears.

2. A new section title is written and highlighted.

1. The presentation remains a handwritten whiteboard style.

2. The topic continues to concern sigma-algebras in probability.

The visual reset marks a conceptual shift from abstract closure properties to the special case of finite or countable sample spaces.

1. Diagram
   Observation

   The title 'Why σ-algebras?' is written and highlighted in yellow at the top of the page.

1. Title text 'Why σ-algebras?'

2. Yellow highlight

1. The title is introduced before the explanatory bullets.

1. The rest of the page is initially blank except for navigation marks.

The highlighted title frames the whole first section as a motivation for the sigma-algebra axioms.

1. Animation
   Observation

   A red line segment labeled 'A' is shown on a number line. An arrow points down with the label 'shift', and a new green line segment labeled '$A_r$' appears shifted to the right.

1. Red line segment labeled A

2. Green line segment labeled $A_r$

3. Number line

4. Downward arrow labeled 'shift'

1. The set A is translated horizontally by a distance r to form the set $A_r$.