Lesson overview | Previous part | Next part

Radon-Nikodym Theorem: Part 3: Core Theory

3. Core Theory

Core Theory develops the part of radon-nikodym theorem 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 Radon-Nikodym theorem statement

Radon-Nikodym theorem statement belongs to the canonical scope of Radon-Nikodym Theorem. 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: absolute continuity, singularity, Radon-Nikodym derivatives, change of measure, Lebesgue decomposition, likelihood ratios, and ML density ratios. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$\int f\,dP=\int f\frac{dP}{dQ}\,dQ.$$

Operational definition.

Absolute continuity $P\ll Q$ means $Q$-null sets are also $P$-null. Under sigma-finiteness, Radon-Nikodym gives a density $dP/dQ$.

Worked reading.

If $Q$ is a proposal distribution and $P$ is a target distribution, then $dP/dQ$ is the exact importance weight when $P\ll Q$.

Three examples of radon-nikodym theorem statement:

1. Gaussian density with respect to Lebesgue measure.
2. Categorical probabilities with respect to counting measure.
3. Policy likelihood ratio in off-policy evaluation.

Two non-examples clarify the boundary:

1. A point mass treated as having Lebesgue density.
2. A target distribution with support outside the proposal support.

Proof or verification habit for radon-nikodym theorem statement:

The theorem is an existence result for a measurable derivative that reconstructs one measure by integration against another.

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, radon-nikodym theorem statement 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.

This is the rigorous foundation for densities, likelihood ratios, importance sampling, and KL divergence.

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: Before dividing densities, verify the denominator measure dominates the numerator measure.

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 Proof sketch via Hilbert-space or decomposition intuition

Proof sketch via Hilbert-space or decomposition intuition belongs to the canonical scope of Radon-Nikodym Theorem. 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: absolute continuity, singularity, Radon-Nikodym derivatives, change of measure, Lebesgue decomposition, likelihood ratios, and ML density ratios. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$D_{\mathrm{KL}}(P\Vert Q)=\int \log\left(\frac{dP}{dQ}\right)dP\quad\text{when }P\ll Q.$$

Operational definition.

Proof sketch via Hilbert-space or decomposition intuition is part of the canonical scope of Radon-Nikodym Theorem: absolute continuity, singularity, Radon-Nikodym derivatives, change of measure, Lebesgue decomposition, likelihood ratios, and ML density ratios.

Worked reading.

Begin with the measurable objects, identify the measure, then state which integral or probability claim is being made.

Three examples of proof sketch via hilbert-space or decomposition intuition:

1. A finite synthetic example.
2. A probability model used in ML.
3. A measurable transformation of model outputs.

Two non-examples clarify the boundary:

1. An undefined probability claim.
2. A density written without a base measure.

Proof or verification habit for proof sketch via hilbert-space or decomposition intuition:

The proof habit is to reduce the claim to measurable sets, simple functions, or finite partitions before passing to limits.

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, proof sketch via hilbert-space or decomposition intuition 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.

The AI role is to make probabilistic modeling assumptions explicit rather than hidden in notation.

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 measurable space, the measure, and the map.

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 Change-of-measure formula

Change-of-measure formula belongs to the canonical scope of Radon-Nikodym Theorem. 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: absolute continuity, singularity, Radon-Nikodym derivatives, change of measure, Lebesgue decomposition, likelihood ratios, and ML density ratios. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$P\ll Q\quad\Longleftrightarrow\quad Q(A)=0\Rightarrow P(A)=0.$$

Operational definition.

Change of measure rewrites an integral under one measure as a weighted integral under another measure.

Worked reading.

When $P\ll Q$, $\mathbb{E}_P[f]=\mathbb{E}_Q[f(dP/dQ)]$. Importance sampling is this identity estimated by samples from $Q$.

Three examples of change-of-measure formula:

1. Importance-weighted validation under distribution shift.
2. KL divergence via log density ratio.
3. Off-policy policy-gradient correction.

Two non-examples clarify the boundary:

1. Using weights where the proposal misses target support.
2. Taking a likelihood ratio without naming both measures.

Proof or verification habit for change-of-measure formula:

First prove the identity for indicators, extend to simple functions, then use monotone and signed integration.

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, change-of-measure formula 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.

Density-ratio methods are everywhere in modern ML: VI, RLHF corrections, domain adaptation, off-policy evaluation, and calibration.

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: State the target measure, proposal measure, and derivative.

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 Lebesgue decomposition theorem

Lebesgue decomposition theorem belongs to the canonical scope of Radon-Nikodym Theorem. 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: absolute continuity, singularity, Radon-Nikodym derivatives, change of measure, Lebesgue decomposition, likelihood ratios, and ML density ratios. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$P(A)=\int_A \frac{dP}{dQ}\,dQ.$$

Operational definition.

Lebesgue decomposition theorem is part of the canonical scope of Radon-Nikodym Theorem: absolute continuity, singularity, Radon-Nikodym derivatives, change of measure, Lebesgue decomposition, likelihood ratios, and ML density ratios.

Worked reading.

Begin with the measurable objects, identify the measure, then state which integral or probability claim is being made.

Three examples of lebesgue decomposition theorem:

1. A finite synthetic example.
2. A probability model used in ML.
3. A measurable transformation of model outputs.

Two non-examples clarify the boundary:

1. An undefined probability claim.
2. A density written without a base measure.

Proof or verification habit for lebesgue decomposition theorem:

The proof habit is to reduce the claim to measurable sets, simple functions, or finite partitions before passing to limits.

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, lebesgue decomposition 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.

The AI role is to make probabilistic modeling assumptions explicit rather than hidden in notation.

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 measurable space, the measure, and the map.

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 Chain rule for derivatives $\frac{dP}{dR}=\frac{dP}{dQ}\frac{dQ}{dR}$

Chain rule for derivatives $\frac{dP}{dR}=\frac{dP}{dQ}\frac{dQ}{dR}$ belongs to the canonical scope of Radon-Nikodym Theorem. 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: absolute continuity, singularity, Radon-Nikodym derivatives, change of measure, Lebesgue decomposition, likelihood ratios, and ML density ratios. The mathematical habit is to name the space, the sigma algebra, the measure, and the map before writing probabilities or expectations.

$$\int f\,dP=\int f\frac{dP}{dQ}\,dQ.$$

Operational definition.

Change of measure rewrites an integral under one measure as a weighted integral under another measure.

Worked reading.

When $P\ll Q$, $\mathbb{E}_P[f]=\mathbb{E}_Q[f(dP/dQ)]$. Importance sampling is this identity estimated by samples from $Q$.

Three examples of chain rule for derivatives $\frac{dp}{dr}=\frac{dp}{dq}\frac{dq}{dr}$:

1. Importance-weighted validation under distribution shift.
2. KL divergence via log density ratio.
3. Off-policy policy-gradient correction.

Two non-examples clarify the boundary:

1. Using weights where the proposal misses target support.
2. Taking a likelihood ratio without naming both measures.

Proof or verification habit for chain rule for derivatives $\frac{dp}{dr}=\frac{dp}{dq}\frac{dq}{dr}$:

First prove the identity for indicators, extend to simple functions, then use monotone and signed integration.

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, chain rule for derivatives $\frac{dp}{dr}=\frac{dp}{dq}\frac{dq}{dr}$ 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.

Density-ratio methods are everywhere in modern ML: VI, RLHF corrections, domain adaptation, off-policy evaluation, and calibration.

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: State the target measure, proposal measure, and derivative.

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.