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.
Constrained DMC information capacity is attained, nondecreasing, and concave
Statement
Let be a finite DMC, a finite letter cost, and . The feasible set is nonempty and compact, and from Average-cost fixed-length codes and operational DMC capacity is attained with . The function is nondecreasing and concave on . If , then for every maximizing law the laws have cost strictly below whenever has cost , and as .
Facts & Assumptions
Given: A finite DMC , a finite cost , and a budget .
Finite DMC with a nonnegative input cost and feasible budget and Finite probability vectors: is finite and nonempty, is attained, and is linear in .
Single-letter information capacity of a finite DMC, Finite mutual information, Finite conditional entropy, and Finite entropy and mutual-information chain rules: for the induced finite joint law, .
Finite-simplex entropy is continuous and concave and Finite distributions, entropy, divergence, and stochastic matrices: finite entropy is continuous and concave on each probability simplex, with . finite entropy is continuous and concave on each probability simplex.
For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: a nonempty closed bounded subset of finite-dimensional Euclidean space is compact, and every continuous real-valued function on it attains its maximum.
Finite KL divergence is nonnegative with equality exactly at equal laws: finite KL divergence is nonnegative and equals zero only for identical probability vectors.
Proof
The probability simplex on is closed and bounded in . The feasible subset is closed because is linear and continuous; it is nonempty because has cost . Hence it is compact by [F5]. The output law is linear in , so [F3]–[F4] show that is continuous. Nonnegativity of mutual information follows from [F6] applied to the joint law and product marginals. Also by [F3], since conditional entropy is a sum of nonnegative terms. Concavity in [F4] gives : the uniform vector is the average of the finitely many coordinate permutations of , all of which have the same entropy. Thus the objective lies in , and [F5] proves its supremum is finite and attained.
If , the feasible set at is contained in the one at , proving monotonicity. For , let attain . The mixture has cost at most . By [F3]–[F4], mutual information is concave in : the output entropy is concave and the conditional entropy term is linear. Therefore .
Suppose and attains . If , choose a minimum-cost symbol from the finite alphabet. Then for every . Since and the mutual-information objective is continuous by step 1.1, . If already has strict cost, no approximation is needed.
Depends on
- Finite DMC with a nonnegative input cost and feasible budget
- Average-cost fixed-length codes and operational DMC capacity
- Single-letter information capacity of a finite DMC
- Finite probability vectors
- Finite mutual information
- Finite conditional entropy
- Finite distributions, entropy, divergence, and stochastic matrices
- Finite entropy and mutual-information chain rules
- Finite KL divergence is nonnegative with equality exactly at equal laws
- For a nonempty subset of $\mathbb{R}^n$ with $n\ge1$, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent
- Finite-simplex entropy is continuous and concave
Used by
Dependency tree · two levels
33 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 20 §20.1 (standard reference, not scraped)
- Yury Polyanskiy, MIT 6.441 Information Theory, Chapter 17 §17.1, Proposition 17.1 (standard reference, not scraped)