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.
Capacity-achieving output laws bound every row divergence
Statement
Let attain and let . If , then , and for every ,
Facts & Assumptions
Given: A finite DMC and an input law attaining .
Finite DMC information capacity is attained: and maximizes over the input simplex.
Finite discrete memoryless channels and Finite stochastic kernels and Finite distributions, entropy, divergence, and stochastic matrices: every channel row is a probability vector, and with .
Finite Kullback–Leibler divergence: when , in the direction to .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: is strictly increasing and onto on , so as .
Proof
Fix . Suppose some output reachable from has zero mass, and put . For , let and . By [F2] and [F3], the conditional-entropy part of is linear in . On coordinates with , differentiability in [F5] bounds the total entropy change in absolute value by for some finite and all small . For zero coordinates with , the entropy contribution is exactly . All terms other than have absolute value at most for a finite . Since by [F6], the information change is positive for sufficiently small , contradicting maximality in [F1]. Every row therefore has support contained in .
Now fix any and use the same segment . By step 1.1, is positive on the support of , so the right derivative at is finite. Differentiating the entropy expression in [F2] with [F3] and [F5] gives , where the derivative terms cancel because both rows sum to one, and the last equality is [F2] and [F4].
Since maximizes information and is feasible for , the right derivative in step 2.1 is nonpositive. Hence . The input was arbitrary, proving the bound for all rows.
Depends on
- Single-letter information capacity of a finite DMC
- Finite DMC information capacity is attained
- Finite discrete memoryless channels
- Finite stochastic kernels
- Finite probability vectors
- Finite Kullback–Leibler divergence
- Finite mutual information
- Finite conditional entropy
- Finite distributions, entropy, divergence, and stochastic matrices
- The natural logarithm as the inverse of the exponential function
- Finite entropy and mutual-information chain rules
- 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$
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
Used by
- A CAID's information-density variance equals its conditional dispersion Lemma
- DMC minimum and maximum dispersion are attained Lemma
- Uniform concentration around the capacity output divergence bound Lemma
- Finite-DMC information deficit controls squared distance to the CAID set Theorem
- Nondegenerate normal approximation for finite unconstrained DMCs Theorem
- Strong converse for finite-alphabet DMCs Theorem
Dependency tree · two levels
45 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
- Yury Polyanskiy and Yihong Wu, Information Theory: From Coding to Learning, Chapter 19 §19.1 and Chapter 22 §22.1 (standard reference, not scraped)
- MIT 6.441 Information Theory, Lecture 8, channel capacity and maximizing capacity (standard reference, not scraped)