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-channel mutual information is concave in the input law
Statement
Let be finite nonempty sets and let be a row-stochastic channel. For an input probability vector , write for the mutual information under the joint law . Then is concave: for input laws and ,
Facts & Assumptions
Given: Finite nonempty input and output alphabets, a row-stochastic channel , two input laws , and .
Finite discrete memoryless channels: each row is a probability vector and the output law is .
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : if a function is continuous on and differentiable on , its secant slope equals its derivative at some interior point.
The logarithm grows more slowly than every positive real power: as , so extends continuously by .
Proof
Expanding the finite KL sum in [F1] under and grouping the finite terms gives Indeed, the logarithm of the joint-to-product ratio is on positive joint support; summing the first term gives the negative conditional entropy and summing the second gives the output entropy. Zero-mass coordinates contribute zero by [F1].
For , [F3] gives , since is strictly increasing by its positive derivative and the mean value theorem. If , apply [F4] to on and . The resulting derivative points satisfy , so the left secant slope is at least the right secant slope; rearranging is the concavity inequality for at . Thus is concave on .
For with one endpoint zero, replace that endpoint by a positive sequence tending to zero in the inequality of step 1.2 and use continuity from [F5]. Therefore is concave on . Summing the scalar concavity inequalities over coordinates proves that finite entropy is concave on each probability simplex.
Put . The output law satisfies , so step 2.1 gives . The conditional-entropy term in step 1.1 is linear in . Subtracting that linear term yields , as claimed.
Depends on
- Finite mutual information
- Finite discrete memoryless channels
- Finite distributions, entropy, divergence, and stochastic matrices
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The logarithm grows more slowly than every positive real power
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
Used by
Dependency tree · two levels
35 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)