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.
Finite conditional mutual information
Definition
Let be a joint probability vector on finite alphabets and write for its marginal. It is the law of finite coordinate random elements on the canonical finite probability space from Finite probability spaces, outcome weights, events, and event probabilities and Random elements and real random variables. For each with , the conditional law and its marginals are probability vectors by Marginals and positive-mass conditionals of a finite joint law are probability vectors. Define conditional mutual information in nats by
using the finite KL convention of Finite distributions, entropy, divergence, and stochastic matrices, where . A positive conditional joint mass forces both conditional marginals to be positive, so each displayed KL term is finite. Zero-mass conditioning values contribute no term. The base- version replaces by inside the conditional KL sums.
Depends on
- Information units and logarithm-base convention
- Marginals and positive-mass conditionals of a finite joint law are probability vectors
- Finite distributions, entropy, divergence, and stochastic matrices
- Finite probability spaces, outcome weights, events, and event probabilities
- Random elements and real random variables
Used by
- Compress-forward and noisy-network-coding bounds for a finite relay channel Corollary
- Noisy-network-coding inner region for the finite two-way relay channel Corollary
- Finite directed information and causal conditioning Definition
- Finite-alphabet lossy source coding with decoder-only side information Definition
- Coarsening the conditioning variable can increase conditional mutual information Example
- The binary XOR MAC exposes the independent private-input law Example
- Conditional joint-typicality packing bound for finite alphabets Lemma
- Conditional mutual information is concave in the channel input law Lemma
- Conditional random-codebook covering for finite alphabets Lemma
- Conditional type packing bounds for source-indexed DM-MAC codebooks Lemma
- Likelihood-ratio network coding for finite or Euclidean multicast networks Lemma
- Cover-El Gamal-Salehi sufficient condition for correlated sources over a DM-MAC Theorem
- Cover-Leung inner bound for the two-user DM-MAC with feedback Theorem
- Finite conditional mutual information identities and equality Theorem
- Finite entropy and mutual-information chain rules Theorem
- Finite information quantities convert by the logarithm base Theorem
- Finite-alphabet Berger-Tung multiterminal lossy inner bound Theorem
- Finite-alphabet memoryless Wyner-Ziv theorem Theorem
- Independent-private-message DM-MAC capacity region Theorem
- Noisy network coding inner bound for finite multicast networks Theorem
- Perfect output feedback does not increase finite DMC capacity Theorem
- Physically degraded two-user DM broadcast capacity region Theorem
Dependency tree · two levels
17 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 first edition (standard reference, not scraped)
- Yury Polyanskiy and Yihong Wu, Information Theory: From Coding to Learning, author prepublication (standard reference, not scraped)