Lesson overview | Previous part | Next part

Sigma Algebras: Part 3: Core Theory

3. Core Theory

Core Theory develops the part of sigma algebras specified by the approved Chapter 24 table of contents. The treatment is measure-theoretic and AI-facing: every concept is tied to probability, expectation, density, or learning systems.

3.1 Closure under complements and countable unions

Closure under complements and countable unions belongs to the canonical scope of Sigma Algebras. Here the point is not to repeat introductory probability, but to expose the measurable structure that makes the probability statement valid.

Working scope for this subsection: measurable spaces, generated sigma algebras, Borel sets, product sigma algebras, measurable maps, and AI observability. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$\mathcal{B}(\mathbb{R}^n)=\sigma\bigl(\{\text{open subsets of }\mathbb{R}^n\}\bigr).$$

Operational definition.

A sigma algebra is a collection of subsets closed under complements and countable unions. It is the list of events for which the model agrees that probability, integration, and observation are meaningful.

Worked reading.

On a finite universe, a generator such as a model flag partitions examples into visible cells. The generated sigma algebra contains every union of those cells, because any observable event must be expressible from the available information.

Three examples of closure under complements and countable unions:

1. All subsets of a finite dataset.
2. Borel sets generated by open intervals in $\mathbb{R}$.
3. Events determined by the first $n$ tokens of a sequence.

Two non-examples clarify the boundary:

1. A collection closed under finite unions but not countable unions.
2. A feature filter whose inverse image is not in the source sigma algebra.

Proof or verification habit for closure under complements and countable unions:

Most sigma algebra proofs use closure and minimality: show a family is closed, then use intersection of all eligible closed families to prove generated objects exist.

set question        -> is the subset measurable?
function question   -> are inverse images measurable?
integral question   -> is the function measurable and integrable?
density question    -> is absolute continuity satisfied?
ML question         -> which measure defines the population claim?

In AI systems, closure under complements and countable unions matters because probability language is constantly compressed into informal notation. Measure theory expands the notation so support, observability, null sets, and convergence assumptions are visible.

In AI, sigma algebras describe what information a model, evaluator, or monitoring system can distinguish.

Practical checklist:

• Name the measurable space before naming the probability.
• Identify whether the object is a set, function, measure, distribution, or derivative of measures.
• Check whether equality is pointwise, almost everywhere, or distributional.
• Check whether limits are moved through integrals and which theorem justifies the move.
• For density ratios, check support and absolute continuity before dividing.
• For ML claims, distinguish population measure, empirical measure, model measure, and proposal measure.

Local diagnostic: Ask which subsets of examples are observable from the features or logs.

The notebook version of this subsection uses finite spaces, step functions, empirical measures, or simple density ratios. These toy cases keep the objects visible while preserving the exact logic used in continuous ML models.

The learner should leave this subsection able to translate between the compact ML notation and the full measure-theoretic statement.

A useful way to study this subsection is to keep three layers separate:

1. Semantic layer: what real-world question is being asked?
2. Measurable layer: which event, function, or measure represents that question?
3. Computational layer: which sum, integral, sample average, or ratio estimates it?

For example, the semantic question may be whether a guardrail fails on a class of prompts. The measurable layer is an event in the prompt space. The computational layer is an empirical estimate under a validation or red-team distribution. Mixing these layers is how many probability arguments become ambiguous.

The same discipline applies to generative models. A generator is a measurable transformation of latent randomness. The generated distribution is the pushforward measure. A likelihood, density, or divergence is only meaningful after the target space, base measure, and support relation are clear.

When reading ML papers, silently expand phrases like "sample from the model," "take expectation over data," and "density ratio" into this measure-theoretic checklist. This turns informal notation into a statement that can be checked.

This is the level of precision needed for high-stakes evaluation, off-policy learning, variational inference, and theoretical generalization arguments.

A final question to ask is whether the claim would still be meaningful if the dataset were infinite, the model output lived in a function space, or the event being queried were defined by a limiting process. Measure theory is what keeps the answer honest.

3.2 Countable intersections and De Morgan laws

Countable intersections and De Morgan laws belongs to the canonical scope of Sigma Algebras. Here the point is not to repeat introductory probability, but to expose the measurable structure that makes the probability statement valid.

Working scope for this subsection: measurable spaces, generated sigma algebras, Borel sets, product sigma algebras, measurable maps, and AI observability. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$X:(\Omega,\mathcal{F})\to(\mathcal{X},\mathcal{G})\text{ is measurable iff }X^{-1}(B)\in\mathcal{F}\text{ for every }B\in\mathcal{G}.$$

Operational definition.

A sigma algebra is a collection of subsets closed under complements and countable unions. It is the list of events for which the model agrees that probability, integration, and observation are meaningful.

Worked reading.

On a finite universe, a generator such as a model flag partitions examples into visible cells. The generated sigma algebra contains every union of those cells, because any observable event must be expressible from the available information.

Three examples of countable intersections and de morgan laws:

1. All subsets of a finite dataset.
2. Borel sets generated by open intervals in $\mathbb{R}$.
3. Events determined by the first $n$ tokens of a sequence.

Two non-examples clarify the boundary:

1. A collection closed under finite unions but not countable unions.
2. A feature filter whose inverse image is not in the source sigma algebra.

Proof or verification habit for countable intersections and de morgan laws:

Most sigma algebra proofs use closure and minimality: show a family is closed, then use intersection of all eligible closed families to prove generated objects exist.

set question        -> is the subset measurable?
function question   -> are inverse images measurable?
integral question   -> is the function measurable and integrable?
density question    -> is absolute continuity satisfied?
ML question         -> which measure defines the population claim?

In AI systems, countable intersections and de morgan laws matters because probability language is constantly compressed into informal notation. Measure theory expands the notation so support, observability, null sets, and convergence assumptions are visible.

In AI, sigma algebras describe what information a model, evaluator, or monitoring system can distinguish.

Practical checklist:

• Name the measurable space before naming the probability.
• Identify whether the object is a set, function, measure, distribution, or derivative of measures.
• Check whether equality is pointwise, almost everywhere, or distributional.
• Check whether limits are moved through integrals and which theorem justifies the move.
• For density ratios, check support and absolute continuity before dividing.
• For ML claims, distinguish population measure, empirical measure, model measure, and proposal measure.

Local diagnostic: Ask which subsets of examples are observable from the features or logs.

The notebook version of this subsection uses finite spaces, step functions, empirical measures, or simple density ratios. These toy cases keep the objects visible while preserving the exact logic used in continuous ML models.

The learner should leave this subsection able to translate between the compact ML notation and the full measure-theoretic statement.

A useful way to study this subsection is to keep three layers separate:

1. Semantic layer: what real-world question is being asked?
2. Measurable layer: which event, function, or measure represents that question?
3. Computational layer: which sum, integral, sample average, or ratio estimates it?

For example, the semantic question may be whether a guardrail fails on a class of prompts. The measurable layer is an event in the prompt space. The computational layer is an empirical estimate under a validation or red-team distribution. Mixing these layers is how many probability arguments become ambiguous.

The same discipline applies to generative models. A generator is a measurable transformation of latent randomness. The generated distribution is the pushforward measure. A likelihood, density, or divergence is only meaningful after the target space, base measure, and support relation are clear.

When reading ML papers, silently expand phrases like "sample from the model," "take expectation over data," and "density ratio" into this measure-theoretic checklist. This turns informal notation into a statement that can be checked.

This is the level of precision needed for high-stakes evaluation, off-policy learning, variational inference, and theoretical generalization arguments.

A final question to ask is whether the claim would still be meaningful if the dataset were infinite, the model output lived in a function space, or the event being queried were defined by a limiting process. Measure theory is what keeps the answer honest.

3.3 Smallest generated sigma algebra proof idea

Smallest generated sigma algebra proof idea belongs to the canonical scope of Sigma Algebras. Here the point is not to repeat introductory probability, but to expose the measurable structure that makes the probability statement valid.

Working scope for this subsection: measurable spaces, generated sigma algebras, Borel sets, product sigma algebras, measurable maps, and AI observability. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$\mathcal{F}\subseteq 2^{\Omega},\quad \Omega\in\mathcal{F},\quad A\in\mathcal{F}\Rightarrow A^c\in\mathcal{F},\quad A_n\in\mathcal{F}\Rightarrow \bigcup_{n=1}^{\infty}A_n\in\mathcal{F}.$$

Operational definition.

A sigma algebra is a collection of subsets closed under complements and countable unions. It is the list of events for which the model agrees that probability, integration, and observation are meaningful.

Worked reading.

On a finite universe, a generator such as a model flag partitions examples into visible cells. The generated sigma algebra contains every union of those cells, because any observable event must be expressible from the available information.

Three examples of smallest generated sigma algebra proof idea:

1. All subsets of a finite dataset.
2. Borel sets generated by open intervals in $\mathbb{R}$.
3. Events determined by the first $n$ tokens of a sequence.

Two non-examples clarify the boundary:

1. A collection closed under finite unions but not countable unions.
2. A feature filter whose inverse image is not in the source sigma algebra.

Proof or verification habit for smallest generated sigma algebra proof idea:

Most sigma algebra proofs use closure and minimality: show a family is closed, then use intersection of all eligible closed families to prove generated objects exist.

set question        -> is the subset measurable?
function question   -> are inverse images measurable?
integral question   -> is the function measurable and integrable?
density question    -> is absolute continuity satisfied?
ML question         -> which measure defines the population claim?

In AI systems, smallest generated sigma algebra proof idea matters because probability language is constantly compressed into informal notation. Measure theory expands the notation so support, observability, null sets, and convergence assumptions are visible.

In AI, sigma algebras describe what information a model, evaluator, or monitoring system can distinguish.

Practical checklist:

• Name the measurable space before naming the probability.
• Identify whether the object is a set, function, measure, distribution, or derivative of measures.
• Check whether equality is pointwise, almost everywhere, or distributional.
• Check whether limits are moved through integrals and which theorem justifies the move.
• For density ratios, check support and absolute continuity before dividing.
• For ML claims, distinguish population measure, empirical measure, model measure, and proposal measure.

Local diagnostic: Ask which subsets of examples are observable from the features or logs.

The notebook version of this subsection uses finite spaces, step functions, empirical measures, or simple density ratios. These toy cases keep the objects visible while preserving the exact logic used in continuous ML models.

The learner should leave this subsection able to translate between the compact ML notation and the full measure-theoretic statement.

A useful way to study this subsection is to keep three layers separate:

1. Semantic layer: what real-world question is being asked?
2. Measurable layer: which event, function, or measure represents that question?
3. Computational layer: which sum, integral, sample average, or ratio estimates it?

For example, the semantic question may be whether a guardrail fails on a class of prompts. The measurable layer is an event in the prompt space. The computational layer is an empirical estimate under a validation or red-team distribution. Mixing these layers is how many probability arguments become ambiguous.

The same discipline applies to generative models. A generator is a measurable transformation of latent randomness. The generated distribution is the pushforward measure. A likelihood, density, or divergence is only meaningful after the target space, base measure, and support relation are clear.

When reading ML papers, silently expand phrases like "sample from the model," "take expectation over data," and "density ratio" into this measure-theoretic checklist. This turns informal notation into a statement that can be checked.

This is the level of precision needed for high-stakes evaluation, off-policy learning, variational inference, and theoretical generalization arguments.

A final question to ask is whether the claim would still be meaningful if the dataset were infinite, the model output lived in a function space, or the event being queried were defined by a limiting process. Measure theory is what keeps the answer honest.

3.4 Product sigma algebras for vectors and sequences

Product sigma algebras for vectors and sequences belongs to the canonical scope of Sigma Algebras. Here the point is not to repeat introductory probability, but to expose the measurable structure that makes the probability statement valid.

Working scope for this subsection: measurable spaces, generated sigma algebras, Borel sets, product sigma algebras, measurable maps, and AI observability. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$\sigma(\mathcal{C})=\bigcap\{\mathcal{F}:\mathcal{F}\text{ is a sigma algebra and }\mathcal{C}\subseteq\mathcal{F}\}.$$

Operational definition.

A sigma algebra is a collection of subsets closed under complements and countable unions. It is the list of events for which the model agrees that probability, integration, and observation are meaningful.

Worked reading.

On a finite universe, a generator such as a model flag partitions examples into visible cells. The generated sigma algebra contains every union of those cells, because any observable event must be expressible from the available information.

Three examples of product sigma algebras for vectors and sequences:

1. All subsets of a finite dataset.
2. Borel sets generated by open intervals in $\mathbb{R}$.
3. Events determined by the first $n$ tokens of a sequence.

Two non-examples clarify the boundary:

1. A collection closed under finite unions but not countable unions.
2. A feature filter whose inverse image is not in the source sigma algebra.

Proof or verification habit for product sigma algebras for vectors and sequences:

Most sigma algebra proofs use closure and minimality: show a family is closed, then use intersection of all eligible closed families to prove generated objects exist.

set question        -> is the subset measurable?
function question   -> are inverse images measurable?
integral question   -> is the function measurable and integrable?
density question    -> is absolute continuity satisfied?
ML question         -> which measure defines the population claim?

In AI systems, product sigma algebras for vectors and sequences matters because probability language is constantly compressed into informal notation. Measure theory expands the notation so support, observability, null sets, and convergence assumptions are visible.

In AI, sigma algebras describe what information a model, evaluator, or monitoring system can distinguish.

Practical checklist:

• Name the measurable space before naming the probability.
• Identify whether the object is a set, function, measure, distribution, or derivative of measures.
• Check whether equality is pointwise, almost everywhere, or distributional.
• Check whether limits are moved through integrals and which theorem justifies the move.
• For density ratios, check support and absolute continuity before dividing.
• For ML claims, distinguish population measure, empirical measure, model measure, and proposal measure.

Local diagnostic: Ask which subsets of examples are observable from the features or logs.

The notebook version of this subsection uses finite spaces, step functions, empirical measures, or simple density ratios. These toy cases keep the objects visible while preserving the exact logic used in continuous ML models.

The learner should leave this subsection able to translate between the compact ML notation and the full measure-theoretic statement.

A useful way to study this subsection is to keep three layers separate:

1. Semantic layer: what real-world question is being asked?
2. Measurable layer: which event, function, or measure represents that question?
3. Computational layer: which sum, integral, sample average, or ratio estimates it?

For example, the semantic question may be whether a guardrail fails on a class of prompts. The measurable layer is an event in the prompt space. The computational layer is an empirical estimate under a validation or red-team distribution. Mixing these layers is how many probability arguments become ambiguous.

The same discipline applies to generative models. A generator is a measurable transformation of latent randomness. The generated distribution is the pushforward measure. A likelihood, density, or divergence is only meaningful after the target space, base measure, and support relation are clear.

When reading ML papers, silently expand phrases like "sample from the model," "take expectation over data," and "density ratio" into this measure-theoretic checklist. This turns informal notation into a statement that can be checked.

This is the level of precision needed for high-stakes evaluation, off-policy learning, variational inference, and theoretical generalization arguments.

A final question to ask is whether the claim would still be meaningful if the dataset were infinite, the model output lived in a function space, or the event being queried were defined by a limiting process. Measure theory is what keeps the answer honest.

3.5 Pullback sigma algebras from observations

Pullback sigma algebras from observations belongs to the canonical scope of Sigma Algebras. Here the point is not to repeat introductory probability, but to expose the measurable structure that makes the probability statement valid.

Working scope for this subsection: measurable spaces, generated sigma algebras, Borel sets, product sigma algebras, measurable maps, and AI observability. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$\mathcal{B}(\mathbb{R}^n)=\sigma\bigl(\{\text{open subsets of }\mathbb{R}^n\}\bigr).$$

Operational definition.

A sigma algebra is a collection of subsets closed under complements and countable unions. It is the list of events for which the model agrees that probability, integration, and observation are meaningful.

Worked reading.

On a finite universe, a generator such as a model flag partitions examples into visible cells. The generated sigma algebra contains every union of those cells, because any observable event must be expressible from the available information.

Three examples of pullback sigma algebras from observations:

1. All subsets of a finite dataset.
2. Borel sets generated by open intervals in $\mathbb{R}$.
3. Events determined by the first $n$ tokens of a sequence.

Two non-examples clarify the boundary:

1. A collection closed under finite unions but not countable unions.
2. A feature filter whose inverse image is not in the source sigma algebra.

Proof or verification habit for pullback sigma algebras from observations:

Most sigma algebra proofs use closure and minimality: show a family is closed, then use intersection of all eligible closed families to prove generated objects exist.

set question        -> is the subset measurable?
function question   -> are inverse images measurable?
integral question   -> is the function measurable and integrable?
density question    -> is absolute continuity satisfied?
ML question         -> which measure defines the population claim?

In AI systems, pullback sigma algebras from observations matters because probability language is constantly compressed into informal notation. Measure theory expands the notation so support, observability, null sets, and convergence assumptions are visible.

In AI, sigma algebras describe what information a model, evaluator, or monitoring system can distinguish.

Practical checklist:

• Name the measurable space before naming the probability.
• Identify whether the object is a set, function, measure, distribution, or derivative of measures.
• Check whether equality is pointwise, almost everywhere, or distributional.
• Check whether limits are moved through integrals and which theorem justifies the move.
• For density ratios, check support and absolute continuity before dividing.
• For ML claims, distinguish population measure, empirical measure, model measure, and proposal measure.

Local diagnostic: Ask which subsets of examples are observable from the features or logs.

The notebook version of this subsection uses finite spaces, step functions, empirical measures, or simple density ratios. These toy cases keep the objects visible while preserving the exact logic used in continuous ML models.

The learner should leave this subsection able to translate between the compact ML notation and the full measure-theoretic statement.

A useful way to study this subsection is to keep three layers separate:

1. Semantic layer: what real-world question is being asked?
2. Measurable layer: which event, function, or measure represents that question?
3. Computational layer: which sum, integral, sample average, or ratio estimates it?

For example, the semantic question may be whether a guardrail fails on a class of prompts. The measurable layer is an event in the prompt space. The computational layer is an empirical estimate under a validation or red-team distribution. Mixing these layers is how many probability arguments become ambiguous.

The same discipline applies to generative models. A generator is a measurable transformation of latent randomness. The generated distribution is the pushforward measure. A likelihood, density, or divergence is only meaningful after the target space, base measure, and support relation are clear.

When reading ML papers, silently expand phrases like "sample from the model," "take expectation over data," and "density ratio" into this measure-theoretic checklist. This turns informal notation into a statement that can be checked.

This is the level of precision needed for high-stakes evaluation, off-policy learning, variational inference, and theoretical generalization arguments.

A final question to ask is whether the claim would still be meaningful if the dataset were infinite, the model output lived in a function space, or the event being queried were defined by a limiting process. Measure theory is what keeps the answer honest.