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.
Conditional mutual-information chain rule and data processing for standard-Borel variables
Statement
Assume AC. Let take values in standard-Borel spaces. Then and also where these are equalities of extended nonnegative quantities. In particular, if the conditional law of given depends only on , then
Facts & Assumptions
Given: AC and standard-Borel variables with a joint law.
The Axiom of Choice: AC is required by the standard-Borel conditional-law and KL-chain-rule suppliers.
Standard Borel spaces and Finite products of standard Borel spaces are standard Borel: the finite product variables and their conditional laws remain standard Borel.
Mutual-information chain rule without subtracting infinities: for standard-Borel variables, as an equality in .
Conditional mutual information by a same-marginal product law: conditional mutual information is the KL divergence from the same-marginal conditionally independent product law; it vanishes when that law is the actual joint law.
KL chain rule for standard-Borel disintegrations: with a common conditioning marginal, joint KL is the integral of the conditional KLs.
Kullback–Leibler divergence is nonnegative: every KL divergence in the statement is nonnegative.
KL is invariant under a measurable bijection: permuting coordinates preserves KL, hence conditional mutual information is symmetric in its two unconditioned variables.
Proof
For -almost every , apply [F2] to the conditional law of given . It gives Integrate over ; by the conditional-KL definition [F3] and disintegration chain rule [F4], the three integrals are the corresponding conditional mutual informations given . This proves the first identity without subtracting extended values.
Exchange the roles of and in step 1.1 to obtain the second identity. The symmetry of conditional mutual information between the grouped variables follows from [F6].
Suppose the conditional law of given depends only on . Then and are conditionally independent given , so [F3] gives . The two chain-rule identities in steps 1.1 and 2.1 now give . Since by [F5], the claimed inequality follows.
Depends on
- The Axiom of Choice
- Standard Borel spaces
- Finite products of standard Borel spaces are standard Borel
- Conditional mutual information by a same-marginal product law
- KL chain rule for standard-Borel disintegrations
- Mutual-information chain rule without subtracting infinities
- Kullback–Leibler divergence is nonnegative
- KL is invariant under a measurable bijection
Used by
- Entropy estimates for complex Gaussian interference converses Lemma
- Gaussian superposition Han–Kobayashi region with nonunique decoding and rate moving Lemma
- Genie-aided outer bounds for the two-user Gaussian interference channel Lemma
- Likelihood-ratio network coding for finite or Euclidean multicast networks Lemma
- Cut-dependent Gaussian multicast gap to the cut-set bound Theorem
- Exact strong-interference region for the two-user Gaussian interference channel Theorem
- Noise-level noisy-network-coding inner bound for real Gaussian multicast networks Theorem
Dependency tree · two levels
74 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 (standard reference, not scraped)
- John Duchi, Lecture Notes on Statistics and Information Theory (standard reference, not scraped)