Part 3

19 min read6 headingsSplit lesson page

Lesson overview | Previous part | Next part

Lebesgue Integration: Part 3: Core Theory

3. Core Theory

Core Theory develops the part of lebesgue integration 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 Monotone Convergence Theorem

Monotone Convergence Theorem belongs to the canonical scope of Lebesgue Integration. 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: simple functions, nonnegative integrals, signed integrals, convergence theorems, almost-everywhere equality, and ML expectations. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

f=f^+-f^-,\qquad \int f\,d\mu=\int f^+\,d\mu-\int f^-\,d\mu.

Operational definition.

Convergence theorems say when limits, sums, and integrals can be exchanged without changing the value.

Worked reading.

If losses $L_n$ increase pointwise to $L$ , monotone convergence gives $\lim_n\int L_n\,dP=\int L\,dP$ . If losses are dominated by an integrable envelope, dominated convergence handles nonmonotone limits.

Object	Measure-theoretic role	AI interpretation
$\Omega$	Underlying outcome space	Hidden randomness behind data, sampling, initialization, or generation
$\mathcal{F}$	Measurable events	Observable filters, logged events, queryable dataset subsets
$\mu$ or $P$	Measure or probability	Data-generating law, empirical measure, proposal distribution, policy law
$X$	Measurable map	Feature extractor, tokenizer, embedding, model score, random variable
$\int f\,d\mu$	Weighted aggregation	Expected loss, calibration metric, ELBO term, importance-weighted estimate

Three examples of monotone convergence theorem:

Taking a model-size limit inside expected loss.
A Monte Carlo estimator with an integrable envelope.
Swapping expectation and coordinate sum for nonnegative losses.

Two non-examples clarify the boundary:

Unbounded losses with no domination.
Pointwise convergence used as if it implied expectation convergence.

Proof or verification habit for monotone convergence theorem:

The proof strategy is approximation: simple functions from below for MCT, lower semicontinuity for Fatou, and domination plus positive/negative splitting for DCT.

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, monotone convergence theorem 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.

These theorems are the quiet assumptions behind many learning-theory and stochastic-optimization derivations.

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: Name the convergence theorem and verify its hypotheses before moving limits through expectations.

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.

Compact ML notation	Expanded measure-theoretic reading
$x\sim P$	A random element has law $P$ on a measurable space
$\mathbb{E}_{P}[L]$	Lebesgue integral of measurable loss under $P$
$p(x)$	Density with respect to a specified base measure
$p(x)/q(x)$	Radon-Nikodym derivative when domination holds
train/test shift	Two probability measures on a shared measurable space

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

Semantic layer: what real-world question is being asked?
Measurable layer: which event, function, or measure represents that question?
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.

Reading move	Question to ask
"sample"	From which probability measure?
"event"	Is it in the sigma algebra?
"feature"	Is the feature map measurable?
"expectation"	Is the integrand integrable?
"density"	With respect to which base measure?
"ratio"	Does absolute continuity hold?

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 Fatou's Lemma

Fatou's Lemma belongs to the canonical scope of Lebesgue Integration. Here the point is not to repeat introductory probability, but to expose the measurable structure that makes the probability statement valid.

f_n\uparrow f\quad\Rightarrow\quad \int f_n\,d\mu\uparrow\int f\,d\mu.

Operational definition.

Convergence theorems say when limits, sums, and integrals can be exchanged without changing the value.

Worked reading.

Object	Measure-theoretic role	AI interpretation
$\Omega$	Underlying outcome space	Hidden randomness behind data, sampling, initialization, or generation
$\mathcal{F}$	Measurable events	Observable filters, logged events, queryable dataset subsets
$\mu$ or $P$	Measure or probability	Data-generating law, empirical measure, proposal distribution, policy law
$X$	Measurable map	Feature extractor, tokenizer, embedding, model score, random variable
$\int f\,d\mu$	Weighted aggregation	Expected loss, calibration metric, ELBO term, importance-weighted estimate

Three examples of fatou's lemma:

Taking a model-size limit inside expected loss.
A Monte Carlo estimator with an integrable envelope.
Swapping expectation and coordinate sum for nonnegative losses.

Two non-examples clarify the boundary:

Unbounded losses with no domination.
Pointwise convergence used as if it implied expectation convergence.

Proof or verification habit for fatou's lemma:

The proof strategy is approximation: simple functions from below for MCT, lower semicontinuity for Fatou, and domination plus positive/negative splitting for DCT.

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, fatou's lemma 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.

These theorems are the quiet assumptions behind many learning-theory and stochastic-optimization derivations.

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: Name the convergence theorem and verify its hypotheses before moving limits through expectations.

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

Compact ML notation	Expanded measure-theoretic reading
$x\sim P$	A random element has law $P$ on a measurable space
$\mathbb{E}_{P}[L]$	Lebesgue integral of measurable loss under $P$
$p(x)$	Density with respect to a specified base measure
$p(x)/q(x)$	Radon-Nikodym derivative when domination holds
train/test shift	Two probability measures on a shared measurable space

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

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

Reading move	Question to ask
"sample"	From which probability measure?
"event"	Is it in the sigma algebra?
"feature"	Is the feature map measurable?
"expectation"	Is the integrand integrable?
"density"	With respect to which base measure?
"ratio"	Does absolute continuity hold?

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

3.3 Dominated Convergence Theorem

Dominated Convergence Theorem belongs to the canonical scope of Lebesgue Integration. Here the point is not to repeat introductory probability, but to expose the measurable structure that makes the probability statement valid.

\int s\,d\mu=\sum_{k=1}^{m}a_k\mu(A_k)\quad\text{for }s=\sum_{k=1}^{m}a_k\mathbb{1}_{A_k}.

Operational definition.

Convergence theorems say when limits, sums, and integrals can be exchanged without changing the value.

Worked reading.

Object	Measure-theoretic role	AI interpretation
$\Omega$	Underlying outcome space	Hidden randomness behind data, sampling, initialization, or generation
$\mathcal{F}$	Measurable events	Observable filters, logged events, queryable dataset subsets
$\mu$ or $P$	Measure or probability	Data-generating law, empirical measure, proposal distribution, policy law
$X$	Measurable map	Feature extractor, tokenizer, embedding, model score, random variable
$\int f\,d\mu$	Weighted aggregation	Expected loss, calibration metric, ELBO term, importance-weighted estimate

Three examples of dominated convergence theorem:

Taking a model-size limit inside expected loss.
A Monte Carlo estimator with an integrable envelope.
Swapping expectation and coordinate sum for nonnegative losses.

Two non-examples clarify the boundary:

Unbounded losses with no domination.
Pointwise convergence used as if it implied expectation convergence.

Proof or verification habit for dominated convergence theorem:

The proof strategy is approximation: simple functions from below for MCT, lower semicontinuity for Fatou, and domination plus positive/negative splitting for DCT.

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, dominated convergence theorem 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.

These theorems are the quiet assumptions behind many learning-theory and stochastic-optimization derivations.

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: Name the convergence theorem and verify its hypotheses before moving limits through expectations.

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

Compact ML notation	Expanded measure-theoretic reading
$x\sim P$	A random element has law $P$ on a measurable space
$\mathbb{E}_{P}[L]$	Lebesgue integral of measurable loss under $P$
$p(x)$	Density with respect to a specified base measure
$p(x)/q(x)$	Radon-Nikodym derivative when domination holds
train/test shift	Two probability measures on a shared measurable space

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

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

Reading move	Question to ask
"sample"	From which probability measure?
"event"	Is it in the sigma algebra?
"feature"	Is the feature map measurable?
"expectation"	Is the integrand integrable?
"density"	With respect to which base measure?
"ratio"	Does absolute continuity hold?

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

3.4 Almost everywhere equality

Almost everywhere equality belongs to the canonical scope of Lebesgue Integration. Here the point is not to repeat introductory probability, but to expose the measurable structure that makes the probability statement valid.

\int f\,d\mu=\sup\left\{\int s\,d\mu:0\le s\le f,\ s\text{ simple}\right\}.

Operational definition.

Convergence theorems say when limits, sums, and integrals can be exchanged without changing the value.

Worked reading.

Object	Measure-theoretic role	AI interpretation
$\Omega$	Underlying outcome space	Hidden randomness behind data, sampling, initialization, or generation
$\mathcal{F}$	Measurable events	Observable filters, logged events, queryable dataset subsets
$\mu$ or $P$	Measure or probability	Data-generating law, empirical measure, proposal distribution, policy law
$X$	Measurable map	Feature extractor, tokenizer, embedding, model score, random variable
$\int f\,d\mu$	Weighted aggregation	Expected loss, calibration metric, ELBO term, importance-weighted estimate

Three examples of almost everywhere equality:

Taking a model-size limit inside expected loss.
A Monte Carlo estimator with an integrable envelope.
Swapping expectation and coordinate sum for nonnegative losses.

Two non-examples clarify the boundary:

Unbounded losses with no domination.
Pointwise convergence used as if it implied expectation convergence.

Proof or verification habit for almost everywhere equality:

The proof strategy is approximation: simple functions from below for MCT, lower semicontinuity for Fatou, and domination plus positive/negative splitting for DCT.

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, almost everywhere equality 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.

These theorems are the quiet assumptions behind many learning-theory and stochastic-optimization derivations.

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: Name the convergence theorem and verify its hypotheses before moving limits through expectations.

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

Compact ML notation	Expanded measure-theoretic reading
$x\sim P$	A random element has law $P$ on a measurable space
$\mathbb{E}_{P}[L]$	Lebesgue integral of measurable loss under $P$
$p(x)$	Density with respect to a specified base measure
$p(x)/q(x)$	Radon-Nikodym derivative when domination holds
train/test shift	Two probability measures on a shared measurable space

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

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

Reading move	Question to ask
"sample"	From which probability measure?
"event"	Is it in the sigma algebra?
"feature"	Is the feature map measurable?
"expectation"	Is the integrand integrable?
"density"	With respect to which base measure?
"ratio"	Does absolute continuity hold?

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

3.5 Tonelli and Fubini preview

Tonelli and Fubini preview belongs to the canonical scope of Lebesgue Integration. Here the point is not to repeat introductory probability, but to expose the measurable structure that makes the probability statement valid.

f=f^+-f^-,\qquad \int f\,d\mu=\int f^+\,d\mu-\int f^-\,d\mu.

Operational definition.

Convergence theorems say when limits, sums, and integrals can be exchanged without changing the value.

Worked reading.

Object	Measure-theoretic role	AI interpretation
$\Omega$	Underlying outcome space	Hidden randomness behind data, sampling, initialization, or generation
$\mathcal{F}$	Measurable events	Observable filters, logged events, queryable dataset subsets
$\mu$ or $P$	Measure or probability	Data-generating law, empirical measure, proposal distribution, policy law
$X$	Measurable map	Feature extractor, tokenizer, embedding, model score, random variable
$\int f\,d\mu$	Weighted aggregation	Expected loss, calibration metric, ELBO term, importance-weighted estimate

Three examples of tonelli and fubini preview:

Taking a model-size limit inside expected loss.
A Monte Carlo estimator with an integrable envelope.
Swapping expectation and coordinate sum for nonnegative losses.

Two non-examples clarify the boundary:

Unbounded losses with no domination.
Pointwise convergence used as if it implied expectation convergence.

Proof or verification habit for tonelli and fubini preview:

The proof strategy is approximation: simple functions from below for MCT, lower semicontinuity for Fatou, and domination plus positive/negative splitting for DCT.

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, tonelli and fubini preview 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.

These theorems are the quiet assumptions behind many learning-theory and stochastic-optimization derivations.

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: Name the convergence theorem and verify its hypotheses before moving limits through expectations.

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

Compact ML notation	Expanded measure-theoretic reading
$x\sim P$	A random element has law $P$ on a measurable space
$\mathbb{E}_{P}[L]$	Lebesgue integral of measurable loss under $P$
$p(x)$	Density with respect to a specified base measure
$p(x)/q(x)$	Radon-Nikodym derivative when domination holds
train/test shift	Two probability measures on a shared measurable space

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

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

Reading move	Question to ask
"sample"	From which probability measure?
"event"	Is it in the sigma algebra?
"feature"	Is the feature map measurable?
"expectation"	Is the integrand integrable?
"density"	With respect to which base measure?
"ratio"	Does absolute continuity hold?

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

Lebesgue Integration: Part 3 - Core Theory

Lebesgue Integration: Part 3: Core Theory

3. Core Theory

3.1 Monotone Convergence Theorem

3.2 Fatou's Lemma

3.3 Dominated Convergence Theorem

3.4 Almost everywhere equality

3.5 Tonelli and Fubini preview

Test this lesson

Which module does this lesson belong to?

Which section is covered in this lesson content?

Which term is most central to this lesson?

What is the best way to use this lesson for real learning?