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.
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.
Depends on
- Measure-theoretic mutual information
- Conditional mutual information by a same-marginal product law
- Variational and finite-partition formulas for measurable-space KL
- Standard borel spaces have countable generating and measure determining algebras
- The same-marginal conditional-product law is well-defined
- The product of two probability kernels is a probability kernel
- The product sigma-algebra and its finite iterates
- Continuity from below for measures
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
42 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §5.5, Lemmas 5.5.5 and 5.5.7 (standard reference, not scraped)
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 3 §3.4 (standard reference, not scraped)