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.
Measure-Theoretic Information and Conditioning
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Computational foundations: factorization, KL, and optimization
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Finite-Alphabet Entropy and Divergence
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Markov Kernels and Markov Chains
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Quantum Communication and Fingerprinting
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page develops finite-alphabet conditional entropy for general standard-Borel observations, law entropy as self-mutual information, general mutual information as joint relative entropy, and conditional mutual information through the same-marginal conditional-product law. It proves kernel measurability, finite-partition and variational formulas, the KL chain rule, mutual-information chain rules, zero-information equality conditions, and finite-quantization limits. All divergences are directional extended nonnegative quantities; no proof subtracts infinities, and conditioning variables are retained in the quantization theorem. A separate remark distinguishes law entropy from differential entropy. The controlling source is IT02 in research/plan-information-theory-track.md; no separate pair-specific design section governs this page.
3 · Logical flowchart
4 · Definitions, theorems and proofs
KL is invariant under a measurable bijection
Statement
Let be a measurable bijection with measurable inverse. For probability measures P,Q on E, let be their push-forwards. Then
Facts & Assumptions
Given: AC, the measurable isomorphism , and probability measures P,Q on E.
AC supplies the Radon–Nikodym density in the absolutely continuous branch of KL. The Axiom of Choice
KL is outside absolute continuity; under absolute continuity it is the integral of the log Radon–Nikodym density. Kullback–Leibler divergence
Push-forward integration satisfies for every nonnegative measurable g, and for integrable signed g. Change of variables for expectation
Proof
Given: The hypotheses in the Statement.
If , choose E_0 with . Since is measurable, is measurable; then . Both divergences are by [F1].
If , let . [given] The function is measurable. For every B in F, so s is a Radon–Nikodym density of with respect to . By [F2], the push-forward integral identity applies separately to the nonnegative functions and ; the negative-part integrals are finite by [F1]. Therefore including the case where the positive-part integral is .
The product of two probability kernels is a probability kernel
Statement
Let , , and be measurable spaces, and let and be probability kernels. For each , let be the finite product probability on . Then is a probability kernel.
Facts & Assumptions
Given: The spaces and probability kernels in the Statement.
Every kernel section is a measure; each event evaluation is measurable, and probability-kernel sections have total mass one. Measure kernel and probability kernel
For probability measures, the finite product measure exists uniquely and satisfies . For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
Rectangles form a pi-system generating the product sigma-algebra, and a lambda-system containing them contains that sigma-algebra. The product sigma-algebra and its finite iterates Dynkin's pi-lambda theorem
Given: The hypotheses in the Statement.
Proof
For fixed , [F2] gives the probability measure . [F2, given] If and , then which is a measurable function of z by the two kernel assumptions in [F1]. Also for every z.
Let be the class of product-measurable for which is measurable. Step 1.1 shows every rectangle belongs to , and the whole product does as well. If , then , so . If are pairwise disjoint members, then by countable additivity, a pointwise limit of measurable functions. Thus is a lambda-system.
Rectangles are a pi-system generating , so [F3] implies . Every section is a probability by step 1.1; hence z↦ is the claimed probability kernel. All constructions are pointwise and use no choice axiom.
Measure-theoretic mutual information
Definition
Let and be measurable spaces and let be a probability measure on . Its marginals are and . The product probability exists by the finite product-measure theorem. For the absolutely continuous branch , assume AC as required by Kullback–Leibler divergence; the non-absolutely-continuous branch below remains . Define the measure-theoretic mutual information of the joint law by For random elements with joint law , write . The logarithm convention is the natural logarithm, so finite values are in nats as fixed by Information units and logarithm-base convention. The divergence is directional in its two law arguments and is when .
This definition uses only the joint law, not a choice of density or a difference of entropy quantities.
The same-marginal conditional-product law is well-defined
Statement
Assume AC. Let be random elements with standard-Borel value spaces, and let and be supplied conditional laws of and given . The product kernels form a probability kernel. The joint law exists uniquely on the product sigma-algebra and does not depend on the chosen versions of . It has marginal and conditional law for given .
Facts & Assumptions
Given: AC, standard-Borel random elements , and regular conditional laws given .
AC supplies the existence and simultaneous almost-everywhere uniqueness interfaces for standard-Borel regular conditional laws. The Axiom of Choice
The product of two supplied probability kernels is a probability kernel, with rectangle evaluations . The product of two probability kernels is a probability kernel
A probability measure and a probability kernel define a unique joint probability law with the iterated-integral formula. A prior and model kernel define a joint law
Conditional laws of the same standard-Borel random element agree as measures outside one null set. Simultaneous ae uniqueness of regular conditional distributions
Measurable rectangles generate the product sigma-algebra and determine a probability measure by the pi-lambda theorem. The product sigma-algebra and its finite iterates Dynkin's pi-lambda theorem
Proof
Given: The hypotheses in the Statement.
By [F1], is a probability kernel into the standard-Borel product of the X and Y spaces. Apply [F2] with base law and kernel M. It gives a unique probability law R and the displayed rectangle formula; taking and equal to their whole value spaces gives for every measurable , so its Z marginal is . The same rectangle identity is the conditional-law identity for M given Z.
Let be alternative versions. By [F3], there are P_Z-null sets such that for and for . Their product measures agree for every outside . Thus the two joint laws have the same rectangle values for every measurable C,A,B; [F4] then makes the laws equal. This establishes version independence.
Variational and finite-partition formulas for measurable-space KL
Statement
Let be probability measures on one measurable space. For bounded measurable real , put Then Equivalently, for every finite measurable partition of the whole space, where and a term with is . The result includes singular and infinite-divergence cases.
Facts & Assumptions
Given: AC and probability measures on a common measurable space.
AC is the hypothesis used by the Radon–Nikodym definition of measurable-space KL. The Axiom of Choice
If , then ; if with density , then , whose negative part is finite. Kullback–Leibler divergence
KL divergence between probability measures is nonnegative. Kullback–Leibler divergence is nonnegative
On a finite alphabet, measurable-space KL equals the finite sum with the same support conventions. Finite KL divergence agrees with measurable-space KL
Dominated convergence and monotone convergence apply to the stated finite or nonnegative integrals. Dominated convergence Monotone convergence for the integral
Proof
Given: AC and probability measures .
First suppose and . For bounded measurable , let and define by . Then is a probability equivalent to , and . Taking logarithms and integrating under gives . By [F2], . If or , this upper bound is automatic.
If , choose a measurable with . For , and . Thus the bounded-function supremum is in the singular case.
Suppose , let , and set on , with on ; the latter set is P-null. Define , taking on . The negative part of is integrable by [F1]; its clipped negative parts converge by [F4], while the clipped positive parts increase to and converge in integral by [F4]. Hence , including value . Pointwise, Q-a.e. and , so [F4] gives . Therefore and the bounded-function supremum is at least the divergence.
Fix a finite measurable partition and put , . For constants , the simple function has . If some , this expression is unbounded above by taking . Otherwise its supremum over the is : the upper bound follows by applying [F2] to the finite probability vector with masses proportional to , and the lower bound follows by taking when and on cells with . The cases do not affect either sum.
Every bounded measurable is uniformly approximated by finite-valued measurable simple functions. If , then and , so . Thus the supremum over bounded functions equals the supremum over simple functions. Step 2.2 identifies the latter with the supremum over finite partitions; step 2.1 identifies it with . No step subtracts infinite quantities.
Finite-alphabet conditional entropy given an observation
Definition
Let take values in a finite nonempty set and let take values in a standard-Borel space . Let be a conditional law of given , so that is a regular conditional distribution given . Define with and natural logarithms. The finite entropy convention is that of Finite distributions, entropy, divergence, and stochastic matrices. Each evaluation is measurable. The explicit argument in Kullback–Leibler divergence proves extends continuously to zero and is bounded by on ; hence the finite entropy integrand is measurable and bounded by . The result is independent of the supplied version without a choice axiom: the finite supplied singleton family determines probability measures on by finite additivity. Apply the supplied-determining-family argument in Conditional law given a random element to two supplied kernels . Outside the finite union of their singleton-evaluation discrepancy sets, which is a measurable -null set, all probabilities and agree. Their entropy integrands therefore agree almost everywhere, proving equality of the integrals. This uses supplied kernels, not a theorem asserting their existence.
This definition permits a non-finite observation Y; only the target alphabet S is finite. If Y is finite, then for each positive-mass y the conditional-law identity gives , so . Evaluating the integral as a finite weighted sum therefore gives exactly the convention of Finite conditional entropy, by Expectation agrees with the published finite weighted sum.
Law entropy as self-mutual information
Definition
For a random element with law , assume AC on the absolutely continuous branch , as in Measure-theoretic mutual information; the other branch has value without that premise. Define its law entropy by where is the joint law of the diagonal pair . This is an extended nonnegative quantity in nats and depends only on the law of X.
Conditional mutual information by a same-marginal product law
Definition
Assume AC. Let X,Y,Z be random elements with standard-Borel value spaces and write for the joint law of in that coordinate order. Let and be regular conditional laws of X and Y given Z=z. Let R be the probability law on the same product space whose rectangle values are Its existence, uniqueness, and independence of the versions K,L are established in The same-marginal conditional-product law is well-defined. Define the conditional mutual information by The reference R has the same Z marginal as the joint law and makes X,Y independent conditionally on Z. The logarithm is natural, so finite values are measured in nats under Information units and logarithm-base convention. The definition is a divergence between full probability laws; it does not subtract two possibly infinite entropies.
Conditional KL is measurable for supplied kernels
Statement
Let K,L be probability kernels from a measurable space into a standard-Borel space . Then is -measurable, with allowed. Consequently the integral used to define conditional KL is well-defined.
Facts & Assumptions
Given: AC, the kernels K,L, and the standard-Borel target .
AC supplies the countable generating algebra for standard-Borel E and the Radon–Nikodym density in measurable-space KL. The Axiom of Choice
A standard-Borel space has a countable algebra generating its sigma-algebra and determining finite measures. Standard borel spaces have countable generating and measure determining algebras
For a probability kernel, integration of a nonnegative product-measurable function is measurable in the base variable; signed integrals are measurable when the positive and negative parts are finite. Measurability of integration against a kernel
For probability laws P,Q, KL equals the supremum of over bounded measurable real g. Variational and finite-partition formulas for measurable-space KL
Proof
Given: AC and probability kernels K,L into E.
Let for arbitrary probability measures P,Q on E. [given, choose] For the algebra in [F1], the class of measurable approximable in -measure by members of is a sigma-algebra: complements preserve symmetric-difference measure, finite unions preserve approximation, and a countable union is approximated by first truncating the union using finiteness of and then approximating that finite union. It contains , so it is all of . Hence any bounded measurable real function can be approximated in by bounded simple functions from a countable family of rational-valued simple functions on . On a fixed bound , the functional is continuous under approximation, because is Lipschitz on and . Thus [F3] gives The family is countable and does not depend on P,Q.
For fixed , the functions and are measurable by [F2], applying it to positive and negative parts for the first function. If , then , so its logarithm is measurable. Therefore each candidate is measurable.
Apply the identity in step 1.1 to and for each fixed z. Then , a countable supremum of measurable functions by step 2.1. This proves measurability and makes its nonnegative integral against any supplied base probability well-defined.
Conditional KL for supplied probability kernels
Definition
Let and be standard-Borel spaces, let be a probability measure on , and let be supplied probability kernels. Define their conditional KL divergence with base by The integrand is measurable by Conditional KL is measurable for supplied kernels, so this is a well-defined nonnegative extended integral. No absolute-continuity assumption is imposed on individual fibers; a singular fiber has divergence . Changing supplied kernel versions on a -null set does not change the integral.
Law entropy and differential entropy are different quantities
Remark
For a probability law with Lebesgue density on , its differential entropy, when the integral is defined, is This density-based quantity is not the law entropy of Law entropy as self-mutual information. Differential entropy may be finite or negative even when law entropy is infinite; the uniform law on is a basic example. No identity between the two is used in this page.
Finite-alphabet conditional entropy is version-invariant and obeys its chain rule
Statement
Assume AC. Let take values in finite nonempty sets and in a standard-Borel space. Conditional entropy as defined in Finite-alphabet conditional entropy given an observation is unchanged when any supplied regular conditional law is replaced by another version. Moreover, All three quantities are finite; the identity is an additive finite-sum identity.
Facts & Assumptions
Given: The random elements and hypotheses in the Statement.
AC is required for the stated regular conditional law existence and simultaneous uniqueness interfaces. The Axiom of Choice
is the integral of the finite Shannon entropy of a conditional probability vector; the value of at zero is zero. Finite-alphabet conditional entropy given an observation Finite distributions, entropy, divergence, and stochastic matrices
Two regular conditional distributions of a standard-Borel-valued variable agree as probability measures outside one measurable null set. Simultaneous ae uniqueness of regular conditional distributions
A joint law on standard-Borel factors disintegrates through a supplied regular conditional law, and the integral identity extends from rectangles to nonnegative product-measurable functions. Disintegration of a joint law on standard borel spaces
A finite product of standard-Borel spaces is standard Borel. Finite products of standard Borel spaces are standard Borel
Proof
Given: AC and the stated finite-valued random elements and standard-Borel conditioning variable.
If two versions of the conditional law of given are supplied, [F2] gives one -null set outside which their probability measures agree. Every atom probability, and hence the finite entropy sum in [F1], then agrees pointwise outside that set. Integrating gives the same . The same argument applies to and to .
Choose regular conditional laws of given and of given ; they exist by [A1, F3], since and are standard Borel by [F4]. Write , , and for the chosen versions. The function is itself a conditional law of given , so [F2] makes it agree almost everywhere with the version used in . For each and measurable in the value space of , the two disintegrations [F3] give Both integrands are bounded and measurable. Testing the sets where one exceeds the other by at least , for each , shows almost everywhere; because the alphabets are finite, one null set works for every .
Outside that null set, if then every , so the row contributes zero to the conditional entropy. If , then for every . On positive entries, ; multiplying by and summing over the finite alphabets gives
Integrate the finite conditional identity from step 2.1 with respect to . The disintegration identity [F3] identifies the last integral with and the other terms with their definitions. By the bound in [F1], each conditional entropy is bounded by its finite alphabet size divided by , so all integrals are finite and no subtraction of infinite quantities occurs. Step 1.1 proves the accompanying version-independence assertion.
Self-mutual-information entropy on countable and non-atomic laws
Statement
Assume AC. Let X have a probability law P on a standard-Borel space. Let be its set of atoms. Then S is countable. If and its atom masses are , the law entropy from Law entropy as self-mutual information is with value allowed. If , then .
Facts & Assumptions
Given: AC and a standard-Borel probability law P.
AC is assumed for the Radon–Nikodym law-entropy interface, the countable determining algebra in [F2], and the countable union of finite atom sets in step 1.1. The Axiom of Choice
Law entropy is the KL divergence of the diagonal joint law of from . Law entropy as self-mutual information Measure-theoretic mutual information
A standard-Borel space has a countable algebra separating points, and each singleton is Borel because points are closed in its Polish presentation. The diagonal is the intersection, over the algebra, of measurable sets . Standard Borel spaces Polish spaces are separable completely metrizable spaces Standard borel spaces have countable generating and measure determining algebras The product sigma-algebra and its finite iterates
The product probability has the rectangle formula and section-integral formula on product-measurable sets. The product measure of two sigma-finite measure spaces For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique Measurability of integration against a kernel
For a finite law, Shannon entropy is the sum with . Finite distributions, entropy, divergence, and stochastic matrices
For every positive real , there is an integer with . For every in a complete ordered field there is a natural with
Increasing limits of nonnegative measurable functions pass through their integrals. Monotone convergence for the integral
Proof
Given: AC and the standard-Borel probability law P.
For each positive integer n, there are at most n atoms with mass at least , since any n+1 distinct such atoms would have total mass greater than one. For each atom of mass , choose n with by [F5]; thus S is a countable union of finite sets and is countable.
Suppose and enumerate the distinct atoms as with masses . By [F2], each singleton is measurable, so the function that equals at and zero elsewhere is measurable. For each finite , let ; these functions increase to . The rectangle formula gives . Hence for every measurable , [F6] gives Thus is the Radon–Nikodym density. Since , on the -full set of diagonal atoms; the partial sums increase to there. Another application of [F6] gives the KL integral , including an infinite sum.
Suppose . The set is measurable, where by [F2]. The diagonal joint law assigns C mass . Its product-measure section at is empty; at it is , whose P-mass is zero. By [F3], . Hence and [F1] gives .
The two cases and exhaust all probability laws. Step 1.2 gives the nonnegative countable sum, which agrees on every finite subset with the finite Shannon formula [F4]; step 2.1 gives infinite divergence when there is positive non-atomic mass.
Zero information is exactly independence
Statement
Assume AC. Let X,Y,Z be standard-Borel random elements. Then if and only if (independence). Also if and only if X and Y are conditionally independent given in the sense of Conditional independence given a sigma-algebra.
Facts & Assumptions
Given: AC and standard-Borel random elements X,Y,Z with their joint law.
AC is inherited from KL, standard-Borel regular conditional laws, and the conditional-independence convention. The Axiom of Choice
KL divergence is nonnegative and equals zero exactly when the two probability laws agree. Kullback–Leibler divergence is nonnegative
is the KL divergence of the joint law from its same-Z-marginal conditional-product law R. Conditional mutual information by a same-marginal product law
Conditional independence given means almost surely for all bounded measurable real f,g. Conditional independence given a sigma-algebra
Equality of conditional-expectation versions is characterized by their integrals on every conditioning event. Conditional expectation given a sigma algebra
Conditional dominated convergence passes bounded pointwise limits through conditional expectations. Conditional fatou and dominated convergence
Measurable rectangles generate the finite product sigma-algebra and determine probability measures by pi-lambda. The product sigma-algebra and its finite iterates Dynkin's pi-lambda theorem
Proof
Given: The hypotheses in the Statement.
By [F2] and [F1], exactly when , which is the stated independence condition.
By [F3] and [F1], exactly when the joint law of equals the conditional-product reference law R.
Suppose , using the coordinate order of [F3]. For all measurable A,B,C the rectangle formula for R gives By the regular conditional law identities, and are versions of the two conditional expectations in [F4]. The displayed identity says their product is the conditional-expectation version of by [F5]. Thus [F4] holds for indicators. Linearity gives it for bounded simple functions; bounded measurable functions follow by bounded simple approximation and [F6]. Conversely, [F4] applied to indicators gives the same rectangle identity, so and R agree on every rectangle . These rectangles determine the probability law by [F7], hence .
Mutual information is recovered by finite coordinate quantizations
Statement
A finite quantizer on a measurable space is a measurable map into a finite set. Assume AC. Let X,Y,Z be standard-Borel random elements. Choose sequences of finite quantizers on X and on Y whose generated sigma-algebras increase to the full sigma-algebras of their respective spaces. Then and Such sequences exist by countable generation of standard-Borel sigma-algebras. In the conditional formula, Z remains unchanged.
Facts & Assumptions
Given: AC, standard-Borel X,Y,Z, and finite quantizer sequences as in the Statement.
AC supplies the standard-Borel countable generating algebras and conditional laws. The Axiom of Choice
Every standard-Borel space has a countable generating algebra. Standard borel spaces have countable generating and measure determining algebras
KL is the supremum of its variational functional over bounded measurable functions. Variational and finite-partition formulas for measurable-space KL
Mutual information is joint KL against the product of marginals. Measure-theoretic mutual information
Conditional mutual information is KL against the same-marginal conditional-product law, which is version-independent. Conditional mutual information by a same-marginal product law The same-marginal conditional-product law is well-defined
A finite measure is continuous from below on increasing measurable sets. Continuity from below for measures
Proof
Given: The hypotheses in the Statement.
Let be any increasing sequence of sub-sigma-algebras generating , and let for probability measures on . The union is an algebra. The class of approximable in -measure by a set in is a sigma-algebra: complements preserve the symmetric-difference measure, finite unions preserve approximation, and for a countable union one first truncates it using continuity from below [F5] of the finite measure , then approximates the finite union. Hence every set in is approximable. Approximating bounded measurable functions first by simple functions and then their level sets gives bounded -measurable functions converging in , with one containing each finite simple approximation. The approximants may be clipped to the same bound M. On that bound, [F2]'s variational functional is continuous under approximation: is Lipschitz on , and the exponential integral is bounded below by . By [F2] applied to and their restrictions to each , the supremum over all bounded -measurable functions is . These test classes increase, so the restricted divergences increase; the approximation shows their supremum equals the unrestricted variational supremum . Hence .
By [F1], countable generating algebras exist; their first-n finite Boolean subalgebras yield increasing finite quantizers by labeling their atoms. For the quantizers in the Statement, the same generated-sigma property is assumed, so in either case increases to the product sigma-algebra of . Under the map , the push-forward of is , as is checked on rectangles of the finite output sets. Since consists exactly of preimages of output events, every bounded measurable test function on that sigma-algebra factors through the finite output map. Therefore its restricted KL equals the KL of the push-forward laws, which by [F3] is . Applying step 1.1 proves the ordinary mutual-information limit.
For the conditional statement, put . These sigma-algebras increase to the full product sigma-algebra of because the entire Z sigma-algebra is retained. A bounded -measurable simple function factors through : each level set is the preimage of a measurable output set, and finitely many output sets can be made disjoint without changing their preimages. Uniform simple approximation extends this factorization to all bounded variational test functions. Hence the KL restricted to equals the KL between the push-forward joint and reference laws. Under the same map, the push-forward of the reference law in [F4] has, given Z=z, the product of the push-forward kernels and : on a rectangle its mass is . By rectangle uniqueness, this is exactly the conditional-product reference law for the quantized variables. Step 1.1 therefore gives the conditional limit.
Steps 2.1 and 2.2 establish both limits. The proof quantizes X and Y only; it makes no claim that coarsening Z decreases conditional mutual information.
KL chain rule for standard-Borel disintegrations
Statement
Let be standard-Borel spaces, let be probability measures on E, and let be probability kernels. Let and be the joint probability laws defined by for product-measurable . Then as an equality in . In particular, when , the joint KL is the conditional KL from Conditional KL for supplied probability kernels.
Facts & Assumptions
Given: AC, standard-Borel spaces E,F, probability measures on E, and supplied probability kernels K,L into F.
AC is required for the Radon–Nikodym densities and the countable determining algebra. The Axiom of Choice
A probability measure and a probability kernel define a joint probability law with the section-integral formula for every product-measurable set and nonnegative function. A prior and model kernel define a joint law
The conditional KL integrand is measurable and its base integral is well-defined. Conditional KL for supplied probability kernels Conditional KL is measurable for supplied kernels
Under AC, an absolutely continuous finite positive measure has a finite-valued nonnegative measurable Radon–Nikodym representative, unique almost everywhere, and integrating that density recovers the measure on every measurable set. A sigma-finite positive measure has a nonnegative Radon–Nikodym density version A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density Integrating against a Radon-Nikodym derivative recovers integration against the measure
A standard-Borel target has a countable algebra generating its sigma-algebra and determining finite measures. Standard borel spaces have countable generating and measure determining algebras
A nonnegative function with finite integral is finite almost everywhere, and one with zero integral vanishes almost everywhere. A nonnegative measurable function with finite integral is finite almost everywhere A nonnegative measurable function has integral exactly when it vanishes almost everywhere
In the absolutely continuous case, if then the negative part of the log-density has integral for probability laws; the positive part may be infinite. Kullback–Leibler divergence
If , then for every nonnegative measurable . Integrating against a density agrees with integrating the product
Borel composition and the pointwise arithmetic operations used here preserve measurability. Composition with a Borel measurable outer map preserves measurability Arithmetic and lattice operations preserve measurability whenever they are defined
Proof
Given: The hypotheses in the Statement.
If , choose A with . Then by [F1], so . Both and are . Now suppose but . If , [F5] implies for -almost every x, hence there by [F6]. For any product-measurable C with , [F1] and [F5] give for -almost every x, hence for -almost every x. On the intersection with the conditional absolute-continuity set, , and then [F1] gives , a contradiction. Thus and the identity holds in this case too.
It remains to consider . Then , since whenever , and [F1] gives . Choose finite-valued nonnegative measurable representatives and by [F3]. In particular, For each B in the countable determining algebra of [F4] and every measurable A in E, [F1] and [F3] give The two integrands are measurable and nonnegative, and their integrals over E are finite. Their equality on every A therefore makes them equal -almost everywhere. Intersect the corresponding measurable conull sets over the countable algebra to obtain T. Since , the set has full -measure. Let for and ; this is Borel on . The first projection is measurable because . Define By [F8], is finite-valued, nonnegative and product-measurable; it equals for and zero elsewhere. For each the preceding identities give The algebra contains F, so the right-hand measure has total mass one. Measure determination [F4] extends the equality to every measurable B: is a Radon–Nikodym representative of with respect to for every . No conditional identity outside the -full set S is needed.
For product-measurable C, let , which is measurable by [F1]. The fiber identity from step 1.2 and the joint-law formula for Q give where [F7] justifies the change from to its density . Thus the globally measurable nonnegative function is a Radon–Nikodym density of P with respect to Q; uniqueness in [F3] gives Q-almost everywhere, hence P-almost everywhere because . Moreover, , and . Intersecting these conull sets with shows that are all strictly positive and finite on one P-full set. Therefore there; on the exceptional zero sets use the zero log-density convention of [F6]. By [F6], the negative part of under is at most , and for -almost every x the negative part of under is at most ; integrating the latter bound over the probability base is finite. Hence both sides can be integrated by adding their positive and negative parts separately, with finite negative parts and no ambiguity. The section formula [F1] now gives The right side is a sum of extended nonnegative divergences, so this equality includes the infinite cases.
Mutual-information chain rule without subtracting infinities
Statement
Assume AC. For standard-Borel random elements X,Y,Z, The right side is a sum in . This chain rule is asserted as an equality of extended nonnegative quantities; no difference of possibly infinite entropies or divergences occurs.
Facts & Assumptions
Given: AC and standard-Borel random elements X,Y,Z on one probability space.
AC is required for the Radon–Nikodym divergences and standard-Borel conditional laws. The Axiom of Choice
Mutual information is the KL divergence of a joint law from the product of its marginals. Measure-theoretic mutual information
Conditional mutual information is the KL divergence from the same-Z-marginal conditionally independent product law. Conditional mutual information by a same-marginal product law
For disintegrated joint laws, KL equals the marginal KL plus the average conditional KL, as an extended sum. KL chain rule for standard-Borel disintegrations
The same-marginal conditional-product law exists, has the stated rectangle formula, and is independent of kernel versions. The same-marginal conditional-product law is well-defined
Standard-Borel joint laws admit the regular conditional distributions and disintegration identities used below. Disintegration of a joint law on standard borel spaces
The product of supplied probability kernels is a probability kernel, and KL is invariant under a measurable coordinate bijection. The product of two probability kernels is a probability kernel KL is invariant under a measurable bijection
Proof
Given: The hypotheses in the Statement.
Let be a regular conditional law of X given Z and let on . In the coordinate order , Q has Z marginal and conditional law for . On every rectangle , the law formed from this base and kernel has mass so it equals Q by rectangle uniqueness.
Apply [F3] to the joint law of and Q using their common Z marginal. With denoting the conditional law of given Z=z, this gives The formula is an extended sum of nonnegative KL values.
For -almost every z, disintegrate the two measures in step 2.1 over Y. Their Y marginals are and , while their conditional X laws are and , respectively. [F3] gives Applying [F3] with the common Y marginal identifies the last integral as .
Integrate step 3.1 over . The first term becomes , which equals by the measurable coordinate swap [F6]. Applying [F3] with the common Z marginal of the joint law and its conditional-product reference shows that the second term integrates to as defined in [F2]. All terms are nonnegative KL divergences, so their extended sum is well-defined even when one or more are infinite.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §5.2
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 3 §3.1
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §§2.2 and 2.6
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §5.3
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §§5.2–5.5
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §§2.1–2.4
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 2 §2.1
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §§5.3 and 5.5
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §§2.4 and 2.6
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §5.2, Theorem 5.2.1
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 3 §3.4, Theorem 3.7
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 5 §5.1, Theorem 5.1.1
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 2 §2.5 and Chapter 5 §5.5
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §5.5
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §2.4
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §2.6
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 1 and Chapter 5 §5.5
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapters 1 and 5 §5.5
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §2.4, Theorem 2.5
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §5.5, Lemmas 5.5.5 and 5.5.7
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 3 §3.4
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §5.3, Lemmas 5.3.1–5.3.2 and Theorem 5.3.2
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §2.2