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.
Globally optimized constant-composition and Gallager functions agree
Statement
Let be a finite DMC. For each and input law , define where ranges over row-stochastic channels on the same alphabets, is the mutual information of , and terms with are omitted. At , set . Then with from Gallager, random-coding, expurgated, and sphere-packing functions. This equality holds for every and is after optimizing over ; it is not asserted for each fixed . At , both sides are zero under the stated conventions.
Facts & Assumptions
Given: A finite DMC , a parameter , and the finite KL and mutual-information conventions.
Finite Kullback–Leibler divergence and Finite KL divergence is nonnegative with equality exactly at equal laws: finite KL is support-aware, nonnegative, and vanishes exactly at equal probability vectors.
For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: every nonempty closed bounded subset of finite-dimensional Euclidean space is compact, and each continuous real-valued function on it attains its minimum and maximum.
Real powers for positive bases, with the zero-base positive-exponent convention and Continuity and derivatives of positive-base real powers: for , and ; for , the zero-base convention is .
The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with and Sums, scalar multiples, products and quotients: , , , and when : the scalar chain and product rules apply to the differentiable power and logarithm formulas on positive arguments.
Absolute real powers are Borel measurable and convex: for every , is continuous and convex on .
A twice-differentiable function on an open interval is convex if and only if its second derivative is nonnegative: a twice-differentiable function on an open interval is convex when its second derivative is nonnegative.
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm and The exponential function is strictly increasing: and are strictly increasing inverses on their positive domains.
Proof
Put and, for an output law , set . If , define . Expanding the finite sums gives for every with finite By [F3], the minimum over is . If , every such objective with positive is infinite, matching the extended value of this expression.
Define and . Then [F1] gives . Since , [F7] shows that each summand is continuous and convex as a function of ; hence is continuous and convex on the input simplex. The simplex is nonempty because it contains a point mass, closed as the intersection of finitely many coordinate half-spaces with the affine equation , and bounded because every coordinate lies in . By [F4] it is compact, so attains a minimum at some . For every input law at least one coordinate of is positive, and that row of has a positive entry; hence at least one and . Also, for every , as : given , take ; if , strict monotonicity of and gives . Write , , , and on , with outside .
For any and output law , expansion of finite KL gives with equality at by [F2–F3]. Taking the joint infimum over and applying step 1.1 row by row therefore yields with when Coordinates with are omitted, so no term is used.
Put . For each , move from toward the point mass along , so . If , [F5]–[F6] give the derivative of at as . If , the term equals , whose right derivative at zero is zero because and the endpoint limit in step 1.2 applies. Therefore the right derivative of at zero is , using . The minimum at makes this right derivative nonnegative, so . Also . Since every and this weighted average equals , equality holds whenever . Substitution into gives , with equality for every active input. Thus for all , with equality on .
Applying step 2.1 with the particular output law gives, for every , Therefore .
On , the power is continuous by the endpoint estimate in step 1.2 and concave: on the second derivative of is , so [F5], [F6], and [F8] make convex there; continuity extends the concavity inequality to zero. Thus each is concave. The function is decreasing and convex on , since is increasing by [F9] and by [F5], [F6], [F8], and [F10]. Consequently is convex wherever : concavity of , monotonicity of , and convexity of give the convex-combination inequality directly. Hence is convex on its finite domain. For , differentiating at the positive point and using for active from step 2.2 gives For any strictly positive probability vector on , let . It is convex, and . Convexity gives for ; letting yields . If has zero coordinates on but , then every active ; apply the result to and let , using continuity of the finite sums and logarithms on positive . If , the inequality is immediate. Thus for every probability vector supported on .
For a general output law , let . If , every active row has and . If , normalize . Every active row is supported on , so and . Step 3.2 then gives . Since active inputs satisfy , step 2.1 yields .
Step 4.1 gives , while step 3.1 gives the reverse inequality. This proves the globally optimized identity and establishes no pointwise-in- equality.
Depends on
- Gallager, random-coding, expurgated, and sphere-packing functions
- One-letter Gallager and expurgated exponent functions
- Finite discrete memoryless channels
- Finite mutual information
- Finite Kullback–Leibler divergence
- Finite KL divergence is nonnegative with equality exactly at equal laws
- Real powers for positive bases, with the zero-base positive-exponent convention
- Continuity and derivatives of positive-base real powers
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- 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
- The exponential function is strictly increasing
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
- A twice-differentiable function on an open interval is convex if and only if its second derivative is nonnegative
- Absolute real powers are Borel measurable and convex
- 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
Used by
Dependency tree · two levels
68 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 22 §22.4* (standard reference, not scraped)
- MIT 6.441 Information Theory, Lecture 11, Spring 2010 (standard reference, not scraped)