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.
Gallager and expurgated input-law maxima are attained
Statement
For a finite DMC , the functions for each and for each , defined in One-letter Gallager and expurgated exponent functions, are finite and continuous on the input probability simplex. Consequently, each attains a finite maximum there. At , for every .
Facts & Assumptions
Given: A finite DMC , its finite nonempty alphabets, a real in one of the stated ranges, and an input law .
One-letter Gallager and expurgated exponent functions: for , is the negative logarithm of the finite sum of powers and ; for , is times the logarithm of the finite sum of , with for .
Finite discrete memoryless channels: each row is a probability vector.
Real powers for positive bases, with the zero-base positive-exponent convention, Continuity and derivatives of positive-base real powers, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, and The exponential function is strictly increasing: is continuous for when is fixed, for , and and are strictly increasing inverses.
A composite of continuous functions is continuous, with no side hypothesis of the kind the composition of limits needs and Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function apply to real functions whose domains are subsets of . Continuity with respect to the vector is established directly below using the Euclidean norm.
Finite probability vectors and For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: the input simplex is nonempty, closed, and bounded in finite-dimensional Euclidean space, hence compact; every continuous real-valued function on it attains its maximum and minimum.
Proof
For any fixed , the convention in [F3] extends continuously to : given , put . If , monotonicity of gives , so monotonicity of yields ; at the value is zero. Thus every positive real power used in [F1] is continuous on .
For every , by [F2]. Thus the inner sum in satisfies The last inequality follows from . Write , , , and . For input laws , their coordinates lie in , so Thus is continuous on the simplex. At each , scalar continuity of at supplies a tolerance such that and imply . Taking proves continuity of directly, without applying [F4] on a vector domain.
Fix and set and . Since the fixed coefficients in lie in , . At a fixed and for , step 1.1 supplies, for each of the finitely many , a scalar tolerance such that with implies . Taking and summing proves . For every input law , some has ; since row sums to one, some has , giving and hence . Scalar logarithm continuity at , followed by the just-proved continuity estimate for , therefore gives continuity of the real-valued . At , the sum is , so .
The finite probability vectors form the nonempty simplex by [F5]. It is nonempty because a point mass belongs to it; each coordinate lies in , so it is bounded; and the coordinate inequalities are closed half-spaces while the sum equation is a closed affine hyperplane, so is closed. Heine–Borel makes compact, and steps 1.2 and 2.1 show that each objective is continuous and real-valued on it. The extreme-value assertion in [F5] therefore gives an attained finite maximum for every stated .
Depends on
- One-letter Gallager and expurgated exponent functions
- Finite discrete memoryless channels
- Finite probability vectors
- 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
- Real powers for positive bases, with the zero-base positive-exponent convention
- Continuity and derivatives of positive-base real powers
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- The exponential function is strictly increasing
- A composite of continuous functions is continuous, with no side hypothesis of the kind the composition of limits needs
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
Used by
Dependency tree · two levels
47 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, complete author-hosted textbook (standard reference, not scraped)
- MIT 6.441 Information Theory, Lecture 11, Spring 2010 (standard reference, not scraped)