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 entropy and mutual-information chain rules
Statement
For finite with a joint pmf,
and
In particular, . All terms are finite.
Facts & Assumptions
Given: A joint probability vector on finite alphabets.
Finite conditional entropy: , with zero-mass conditioning values omitted.
Marginals and positive-mass conditionals of a finite joint law are probability vectors: conditional pmfs are formed by division by positive marginal mass and are probability vectors.
Proof
Fix with and write , ; for define . By [F4], these are pmfs and on positive support. On that support both factors are positive, so the product law [F6] gives . For every , . Thus the terms involving sum to , and the remaining terms are , exactly by [F5]. Weighting this equality by and summing over positive-mass using [F1] proves . Zero atoms are omitted from the displayed logarithmic sums.
Every positive joint atom has positive marginals by [F4]; applying the quotient and product laws [F6] to [F2] gives . Grouping the finite sums by , using [F4] to know the marginals, and applying [F5] yields . Also, [F1] and on positive support give . Thus , and exchanging gives the other form. All sums are finite.
Apply step 1.1 and [F3] to get . By step 1.2, and . Therefore . Every entropy is a finite sum, so no extended-real subtraction occurs.
Depends on
- Finite conditional entropy
- Finite mutual information
- Finite conditional mutual information
- Finite conditional mutual information identities and equality
- Marginals and positive-mass conditionals of a finite joint law are probability vectors
- Finite distributions, entropy, divergence, and stochastic matrices
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
Used by
- Compress-forward and noisy-network-coding bounds for a finite relay channel Corollary
- Fano bound for erasure and out-of-alphabet estimates Corollary
- Noisy-network-coding inner region for the finite two-way relay channel Corollary
- Strict asymptotic separation need not give zero finite-block error Counterexample
- A correlated binary source is sent uncoded over an adder MAC Example
- A degraded binary erasure wiretap channel Example
- A finite information-bottleneck privacy model Example
- A finite-alphabet source-channel rate budget Example
- Capacity of the binary erasure channel Example
- Capacity of the binary symmetric channel Example
- Cost-constrained capacity of a binary identity channel with feedback Example
- Independent and deterministic finite information Example
- Lossless Wyner-Ziv endpoint is the Slepian-Wolf rate Example
- The binary XOR MAC exposes the independent private-input law Example
- Weak secrecy does not imply strong secrecy Example
- An average-cost DMC block input has mutual information at most n C_I(Gamma) Lemma
- Capacity-achieving output laws bound every row divergence Lemma
- Cardinality bound for the finite Wyner-Ziv auxiliary Lemma
- Conditional mutual information is concave in the channel input law Lemma
- Conditional type packing bounds for source-indexed DM-MAC codebooks Lemma
- Constrained DMC information capacity is attained, nondecreasing, and concave Lemma
- Convexity, monotonicity, and continuity of finite Wyner-Ziv rate Lemma
- Finite DMC information capacity is attained Lemma
- Finite-IID rate-distortion mutual-information converse Lemma
- Likelihood-ratio network coding for finite or Euclidean multicast networks Lemma
- Mutual information splits into directed information and feedback Lemma
- Stationary block rate-distortion limit and endpoint continuity Lemma
- Strong-interference information inequalities tensorize over product code inputs Lemma
- The finite wiretap auxiliary has cardinality at most |X| Lemma
- The n-letter mutual information of a DMC is at most nC Lemma
- Additive entanglement-assisted classical capacity formula Theorem
- Average-cost capacity formula for a finite DMC Theorem
- Binary Hamming rate-distortion function Theorem
- Capacity region of a finite two-user interference channel under strong interference Theorem
- Causal feedback does not increase finite DMC capacity under average cost Theorem
- Cut-set outer bound for causal and full-feedback relay channels Theorem
- Data processing for a finite Markov chain, with equality condition Theorem
- Finite-alphabet Berger-Tung multiterminal lossy inner bound Theorem
- Finite-alphabet Fano inequality Theorem
- Finite-alphabet memoryless rate-distortion coding theorem Theorem
…and 13 more results.
Dependency tree · two levels
18 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)