How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Relative Entropy Variational, Chain, and Conditioning Rules
Statement
Assume AC. Let be probability measures on one measurable space and use as defined in Relative Entropy of Probability Measures. Then where is the set of bounded real measurable functions. In particular . If is measurable, then .
For standard-Borel spaces , probability reference measures , and a joint probability with finite , let be the conditional law supplied by Conditional density formula. Then More generally, for random variables taking values in standard-Borel spaces , with for a measurable , and a probability reference on , the conditional increments satisfy whenever .
Facts & Assumptions
Given: AC, probability measures, standard-Borel observation spaces where conditioning is used, and the exact finite-region relative entropy definition.
AC supplies Radon–Nikodym densities on these finite measure spaces (The Axiom of Choice, A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density). The kernel construction and event identities of Conditional density formula require no AC when the joint density and filler probability are supplied; only its conditional-expectation class convention assumes AC. Here the filler for a conditional law on is the already supplied .
For , is nonnegative, , unique almost everywhere, and (Relative Entropy of Probability Measures).
A joint density on a product of sigma-finite probability spaces produces an everywhere conditional probability kernel by dividing by its finite positive marginal density; zero and infinite marginal fibers are filled without division (Conditional density formula).
Nonnegative product-measurable functions have measurable section integrals and Tonelli iterated-integral equality (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).
Dominated and monotone convergence justify the bounded truncation limits in the entropy integrals (Dominated convergence, Monotone convergence for the integral).
Natural logarithms turn products into sums and (The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).
Proof
Given: The hypotheses and exact definitions in Facts & Assumptions.
For with density , the negative part of is integrable because for ; the density definition is therefore unambiguous. Also for , so . If , the defined value is .
For bounded , let have density relative to . When and , the density logarithm identity gives by step 1.1. Thus every variational test is at most ; the same upper bound is immediate if . If , choose a measurable -null set with and use : then and .
In the remaining case , let and set , taking on . Then and , so [F4] gives . The negative part of is bounded by , and its positive part increases to ; hence [F4] gives , including when the positive entropy part is infinite. Combining this with step 2.1 proves the variational identity.
If is measurable, every bounded test on the target pulls back to the bounded test on the source, and while . Taking suprema in step 3.1 proves the restriction inequality.
Finiteness of gives a joint density and its conditional kernel by [F2]. Pushing forward by and using step 4.1 gives finite , so [F2] supplies the corresponding conditional kernel for as well. Thus all conditional densities and references in this clause are defined. For a conditioning observation , applying the variational identity pointwise to the conditional density shows where the tests range over bounded measurable functions of . The upper bound follows from step 2.1 for each conditional law; the reverse bound follows by using the jointly measurable bounded truncations of from step 3.1 and then [F3]–[F4]. When is a measurable function of , every test depending on is an admissible test depending on with the same objective value, since the normalizer still depends only on . Thus ; nonnegativity is step 1.1 applied conditionally.
Suppose has density relative to . Put . By [F3], is a density for . Where , [F2] supplies the conditional density relative to ; elsewhere use its supplied filler. On the full -measure set of finite positive , and -almost everywhere. Integrating this identity, with nonnegative conditional entropies and finite total entropy, gives the displayed chain rule. If a restriction entropy is infinite, step 4.1 makes the joint entropy infinite as well, so no subtraction of two infinite terms is used.
Steps 1.1, 2.1 and 3.1 prove nonnegativity and the variational identity, step 4.1 proves restriction monotonicity, step 5.2 proves the product chain rule, and step 5.1 proves monotonicity under additional conditioning.
Depends on
The Axiom of Choice
Relative Entropy of Probability Measures
Standard Borel spaces
A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density
Conditional density formula
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Dominated convergence
Monotone convergence for the integral
The natural logarithm as the inverse of the exponential function
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm