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.
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.
Depends on
- Conditional mutual information by a same-marginal product law
- The same-marginal conditional-product law is well-defined
- Finite KL divergence agrees with measurable-space KL
- Finite conditional mutual information
- Information units and logarithm-base convention
- Finite distributions, entropy, divergence, and stochastic matrices
- The Axiom of Choice
- 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
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
53 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 (standard reference, not scraped)
- Yury Polyanskiy and Yihong Wu, MIT 6.441 Information Theory, Chapter 2 §2.4 (standard reference, not scraped)