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 — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- BY arbitrary dependence and BH PRDS
- Compactness
- 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
- Filters and Ultrafilters
- 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 Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measure-Theoretic Information and Conditioning
- 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
- Rⁿ as a Normed Space; Vector-Valued Functions
- 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 Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- 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 ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These worked examples compute self-information entropy and differential entropy for the uniform law, mutual information for a deterministic finite copy, conditional mutual information before and after coarsening the conditioning variable, and the effect of changing a regular conditional kernel on a null fiber. Each example states its probability law and computes the relevant divergence with the same support conventions as the A page.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A finite deterministic copy has mutual information equal to entropy
Statement
Assume AC for the measurable-space KL interface. Let be Bernoulli with and , and set . Then where means the finite Shannon entropy of the probability vector of X and .
Facts & Assumptions
Given: AC, , and the finite-valued random variables X and Y.
AC is needed by the general measurable-space KL definition through its Radon–Nikodym density. The Axiom of Choice
Mutual information is KL of the joint law against the product of its marginals. Measure-theoretic mutual information
The finite MI convention is the joint KL against the product of the marginal pmfs, and the measurable-space KL equals this finite sum on a finite alphabet. Finite mutual information Finite KL divergence agrees with measurable-space KL Information units and logarithm-base convention
Finite Shannon entropy is with . Finite distributions, entropy, divergence, and stochastic matrices
A finite set with the discrete metric is complete and separable, hence Polish; its Borel sigma-algebra is discrete and therefore standard Borel. Polish spaces are separable completely metrizable spaces Separability: the existence of an at most countable dense subset Standard Borel spaces
Proof
Given: The hypotheses in the Statement.
On , define if and otherwise; distinct endpoints force at least one of the two intermediate distances to be 1, so the triangle inequality holds. For a Cauchy sequence, tolerance forces all sufficiently late terms to be equal, so the metric is complete. The finite set itself is a finite dense subset, and radius- balls are singletons, so the topology is discrete. By the definitions in [F4], this is a Polish presentation of the discrete sigma-algebra, which is therefore standard Borel. If or , X and Y are the same constant almost surely; their joint law and the product of their marginals are the same point mass. Thus [F1] gives a finite-alphabet mutual information, [F2] gives , and [F3] gives the same entropy.
Suppose . The joint law of has masses at and at , and zero elsewhere. The product law has masses at and at . By [F1]–[F2], The last quantity is by [F3].
The endpoint cases in step 1.1 and the interior case in step 2.1 exhaust and establish the claimed identity throughout.
Coarsening the conditioning variable can increase conditional mutual information
Statement
Assume AC. Let X be a fair bit and let . Set and let W be constant. Then Thus replacing Z by its coarsening W can increase conditional mutual information.
Facts & Assumptions
Given: AC, X uniform on , , , and constant W.
AC is required for measurable-space KL and standard-Borel conditional laws. The Axiom of Choice
Conditional mutual information is KL between the joint law and the same-conditioning-marginal conditional-product law. Conditional mutual information by a same-marginal product law The same-marginal conditional-product law is well-defined
Finite discrete spaces are standard Borel, finite CMI uses the conditional-product KL convention, and measurable-space KL on finite alphabets is the finite probability-vector sum. Standard Borel spaces Polish spaces are separable completely metrizable spaces Separability: the existence of an at most countable dense subset Finite conditional mutual information Finite KL divergence agrees with measurable-space KL Information units and logarithm-base convention Finite products of standard Borel spaces are standard Borel
The finite KL and entropy conventions use natural logarithms and ignore zero-mass terms. Finite distributions, entropy, divergence, and stochastic matrices
Proof
Given: The hypotheses in the Statement.
For a finite value set S, define for and 1 otherwise; distinct endpoints force at least one intermediate distance to be 1, so the triangle inequality holds. Tolerance makes every Cauchy sequence eventually constant, hence the metric is complete; S is itself finite and dense, and radius- balls are singletons, so the topology is discrete. By the definitions in [F2], each such space is standard Borel; its finite products are standard Borel by the finite-product supplier. Given , the pair is the point , and its two conditional marginals are point masses at i and j. Their product is the point mass at , so it agrees with the conditional joint law at every Z-value of positive probability. The conditional-product reference law therefore equals the joint law of . By [F1], its KL divergence, and hence , is zero.
The variable W has one value. The joint law of has mass at and at . The conditional marginals given W are both uniform on ; their product reference law assigns mass to each of the four pairs at w. Therefore [F1]–[F3] give
The map from Z to W is constant and thus coarsens the conditioning information. The two computed values satisfy , so this example rules out a general data-processing claim that coarsening the conditioning variable decreases conditional mutual information.
Changing a conditional kernel on a null fiber leaves information unchanged
Statement
Assume AC. Let Z be uniform on the Borel unit interval and let X=Y=0 almost surely, with finite value space . The regular conditional kernels may be replaced by , for , and . The pointwise conditional KL between the conditional joint law of and the product of these marginal kernels changes from zero everywhere to at , but its -integral and remain zero.
Facts & Assumptions
Given: AC (and hence countable choice), the uniform Borel probability on , and almost surely.
Countable choice is required by the interval-volume formula used for and its null singleton; AC is inherited by the KL definitions. The Axiom of Countable Choice () The Axiom of Choice
and finite discrete spaces are standard Borel; the product of the two finite target spaces is also standard Borel. The unit interval with its Borel structure is standard Borel Standard Borel spaces Polish spaces are separable completely metrizable spaces Separability: the existence of an at most countable dense subset Finite products of standard Borel spaces are standard Borel
Under countable choice, Lebesgue measure is countably additive, so its Borel restriction is a measure. Borel subsets are Lebesgue measurable; the restriction to has mass one, the singleton has uniform measure zero, and its complement has measure one. Lebesgue measurable sets, the family , and the restricted set function Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume Assuming countable choice, every Borel subset of is Lebesgue measurable A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included
Supplied regular conditional distributions that agree outside a conditioning-null set give the same same-marginal conditional-product law; conditional mutual information is its KL from the joint law, and KL of equal probability laws is zero by the unit density. The same-marginal conditional-product law is well-defined Conditional mutual information by a same-marginal product law Kullback–Leibler divergence
Conditional KL is the integral of the measurable pointwise kernel divergence. Conditional KL is measurable for supplied kernels Conditional KL for supplied probability kernels
For finite laws, KL is the atomwise sum with divergence when the first law charges an atom the reference law misses. Finite KL divergence agrees with measurable-space KL Finite distributions, entropy, divergence, and stochastic matrices Information units and logarithm-base convention
Proof
Given: The hypotheses in the Statement.
By [F2], the restriction is a probability and . On each finite target set, define distance 0 on equal points and 1 on distinct points; distinct endpoints force at least one intermediate distance to be 1, so the triangle inequality holds. Tolerance makes every Cauchy sequence eventually constant; the whole finite set is dense, and radius- balls are singletons, so the space is complete and discrete, hence Polish and standard Borel by [F1]. The product target is standard Borel by the finite-product supplier in [F1]. For any Borel and , replacing by changes only at , a null point. Thus both K and K' satisfy the conditional-law integral identity for X given Z; the constant kernel L satisfies it for Y, and satisfies it for . These kernels are measurable because their only nonconstant set of values is the Borel singleton .
Let be a conditional law of given Z. With the original kernels, for every z, so the pointwise KL is zero. With the alternative kernels, the product is at z=0 and for z>0. By [F5], because the first law charges and the reference gives it mass zero; for z>0 the divergence is zero. Thus the pointwise integrands differ only at a null point, and both conditional-KL integrals in [F4] are zero.
The joint law and the conditional-product reference law built from K,L agree. K' equals K -almost everywhere, so [F3] says the reference law built from K',L' is the same law. Consequently both versions give .
The uniform law has infinite self-information entropy and zero differential entropy
Statement
Assume AC (and hence countable choice). Let be Lebesgue measure restricted to the Borel unit interval , and let be the identity random element on that probability space. Its law entropy is , whereas its differential entropy is .
Facts & Assumptions
Given: AC (and hence countable choice) and for Borel .
AC is used by the self-information KL definition; it implies the countable choice required by the box-volume formula. The Axiom of Choice The Axiom of Countable Choice ()
Borel sets are Lebesgue measurable; Lebesgue measure is a measure, and every one-dimensional box with finite endpoints, including a degenerate closed interval, has measure its length under countable choice. Lebesgue measurable sets, the family , and the restricted set function Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume Assuming countable choice, every Borel subset of is Lebesgue measurable A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included
The Borel unit interval is standard Borel. The unit interval with its Borel structure is standard Borel
For a standard-Borel law, self-information entropy is infinite whenever its atomic set has probability less than one. Law entropy as self-mutual information Self-mutual-information entropy on countable and non-atomic laws
Differential entropy for a Lebesgue density is , with ; the nonnegative Lebesgue integral of the zero function is zero. Law entropy and differential entropy are different quantities The nonnegative Lebesgue integral
Proof
Given: The hypotheses in the Statement.
Define for Borel . By [F1], these sets are Lebesgue measurable and the restricted measure is countably additive; the box formula gives , so P is a probability. For each , the degenerate interval has measure . Thus every singleton has P-mass zero, and the atomic set is empty.
The identity map on has law P, and its value space is standard Borel by [F2]. Since , [F3] gives .
Extending the density by zero outside gives . On the interval , and off the interval the integrand is zero by the convention in [F4]. Thus is the zero function on ; its integral is zero by [F4], so the differential entropy is .
Sources
- Robert M. Gray, Entropy and Information Theory, corrected author-hosted first edition, Chapter 5 §5.5
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 2 §2.1
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §2.4
- 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, Chapters 1 and 5 §5.5