Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generated
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 W be a finite DMC. For each ρ>0 and input law P, define E0,cc(ρ,P):=inf⁡V: V(⋅∣x)≪W(⋅∣x){∑xP(x)D(V(⋅∣x)∥W(⋅∣x))+ρIP(V)}, where V ranges over row-stochastic channels on the same alphabets, IP(V) is the mutual information of P(x)V(y∣x), and terms with P(x)=0 are omitted. At ρ=0, set E0,cc(0,P)=0. Then max⁡PE0,cc(ρ,P)=max⁡PE0(ρ,P), with E0 from Gallager, random-coding, expurgated, and sphere-packing functions. This equality holds for every ρ>0 and is after optimizing over P; it is not asserted for each fixed P. At ρ=0, both sides are zero under the stated conventions.

Facts & Assumptions

Given: A finite DMC W, a parameter ρ>0, and the finite KL and mutual-information conventions.

[F1]

One-letter Gallager and expurgated exponent functions: E0(ρ,P)=−ln⁡∑y(∑xP(x)W(y∣x)1/(1+ρ))1+ρ.

[F2]

Finite mutual information: IP(V) is D(PVXY∥P⊗PVY).

[F3]

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.

[F4]

For a nonempty subset of Rn with n≥1, 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.

[F5]

Real powers for positive bases, with the zero-base positive-exponent convention and Continuity and derivatives of positive-base real powers: for t>0, ta=exp⁡(aln⁡t) and (ta)′=ata−1; for a>0, the zero-base convention is 0a=0.

[F7]

Absolute real powers are Borel measurable and convex: for every p≥1, t↦∣t∣p is continuous and convex on R.

[F8]

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.

Proof

1.1F1F3givenalgebracases

Put α=(1+ρ)−1∈(0,1) and, for an output law Q, set Zx(Q)=∑yW(y∣x)αQ(y)1−α. If Zx(Q)>0, define Rx(y)=W(y∣x)αQ(y)1−α/Zx(Q). Expanding the finite sums gives for every Vx≪Wx with finite D(Vx∥Q) D(Vx∥Wx)+ρD(Vx∥Q)=(1+ρ)D(Vx∥Rx)−(1+ρ)ln⁡Zx(Q). By [F3], the minimum over Vx is −(1+ρ)ln⁡Zx(Q)=−α−1ln⁡Zx(Q). If Zx(Q)=0, every such objective with positive P(x) is infinite, matching the extended value of this expression.

1.2F1F4F7F9givenalgebra

Define Sy(P)=∑xP(x)W(y∣x)α and Ψ(P)=∑ySy(P)1/α. Then [F1] gives E0(ρ,P)=−ln⁡Ψ(P). Since 1/α=1+ρ>1, [F7] shows that each summand Sy(P)1/α is continuous and convex as a function of P; 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 ∑xP(x)=1, and bounded because every coordinate lies in [0,1]. By [F4] it is compact, so Ψ attains a minimum at some P∗. For every input law at least one coordinate of P is positive, and that row of W has a positive entry; hence at least one Sy(P)>0 and Ψ(P)>0. Also, for every r>0, tr→0 as t↓0: given ε>0, take δ=ε1/r; if 0<t<δ, strict monotonicity of ln⁡ and exp⁡ gives tr<ε. Write Sy=Sy(P∗), Ψ∗=Ψ(P∗)>0, T={y:Sy>0}, and q∗(y)=Sy1/α/Ψ∗ on T, with q∗(y)=0 outside T.

2.1F2F3step 1.1algebra

For any V and output law Q, expansion of finite KL gives ∑xP(x)D(Vx∥Q)=IP(V)+D(PVY∥Q)≥IP(V), with equality at Q=PVY by [F2–F3]. Taking the joint infimum over V,Q and applying step 1.1 row by row therefore yields E0,cc(ρ,P)=inf⁡Q∑x:P(x)>0P(x)fx(Q),fx(Q):=−α−1ln⁡Zx(Q), with fx(Q)=+∞ when Zx(Q)=0. Coordinates with P(x)=0 are omitted, so no 0⋅∞ term is used.

2.2F1F5F6step 1.2algebra

Put Tx=∑yW(y∣x)αSyρ. For each x, move from P∗ toward the point mass δx along Pt=(1−t)P∗+tδx, so Sy(Pt)=Sy+t(W(y∣x)α−Sy). If Sy>0, [F5]–[F6] give the derivative of Sy(Pt)1/α at t=0 as α−1Syρ(W(y∣x)α−Sy). If Sy=0, the term equals t1/αW(y∣x), whose right derivative at zero is zero because 1/α−1=ρ>0 and the endpoint limit in step 1.2 applies. Therefore the right derivative of Ψ(Pt) at zero is α−1(Tx−Ψ∗), using ∑ySy1/α=Ψ∗. The minimum at t=0 makes this right derivative nonnegative, so Tx≥Ψ∗. Also ∑xP∗(x)Tx=∑ySy1+ρ=Ψ∗. Since every Tx≥Ψ∗ and this weighted average equals Ψ∗, equality holds whenever P∗(x)>0. Substitution into Zx(q∗)=Ψ∗−(1−α)Tx gives Zx(q∗)≥Ψ∗α, with equality for every active input. Thus fx(q∗)≤−ln⁡Ψ∗ for all x, with equality on supp⁡P∗.

3.1step 2.1step 2.2algebra

Applying step 2.1 with the particular output law q∗ gives, for every P, E0,cc(ρ,P)≤∑xP(x)fx(q∗)≤−ln⁡Ψ∗=max⁡P′E0(ρ,P′). Therefore max⁡PE0,cc(ρ,P)≤max⁡PE0(ρ,P).

3.2F5F6F8F9F10step 1.2step 2.2

On [0,∞), the power t1−α is continuous by the endpoint estimate in step 1.2 and concave: on (0,∞) the second derivative of −t1−α is (1−α)αt−1−α>0, so [F5], [F6], and [F8] make −t1−α convex there; continuity extends the concavity inequality to zero. Thus each Zx(Q) is concave. The function −ln⁡z is decreasing and convex on (0,∞), since ln⁡ is increasing by [F9] and (−ln⁡z)′′=z−2>0 by [F5], [F6], [F8], and [F10]. Consequently fx(Q)=−α−1ln⁡Zx(Q) is convex wherever Zx(Q)>0: concavity of Zx, monotonicity of −ln⁡, and convexity of −ln⁡ give the convex-combination inequality directly. Hence F(Q)=∑x:P∗(x)>0P∗(x)fx(Q) is convex on its finite domain. For y∈T, differentiating at the positive point q∗ and using Zx(q∗)=Ψ∗α for active x from step 2.2 gives ∂F∂Q(y)(q∗)=−1−ααΨ∗αSy∑x:P∗(x)>0P∗(x)W(y∣x)αΨ∗α=−ρ. For any strictly positive probability vector Q on T, let g(t)=F((1−t)q∗+tQ). It is convex, and g+′(0)=∑y∈T(−ρ)(Q(y)−q∗(y))=0. Convexity gives (g(t)−g(0))/t≤g(1)−g(0) for 0<t<1; letting t↓0 yields F(Q)≥F(q∗). If Q has zero coordinates on T but F(Q)<∞, then every active Zx(Q)>0; apply the result to Qt=(1−t)Q+tq∗ and let t↓0, using continuity of the finite sums and logarithms on positive Zx(Q). If F(Q)=+∞, the inequality is immediate. Thus F(Q)≥F(q∗) for every probability vector supported on T.

4.1step 2.2step 3.2casesalgebra

For a general output law Q, let c=Q(T). If c=0, every active row has Zx(Q)=0 and F(Q)=+∞. If c>0, normalize QT=Q(⋅∣T). Every active row is supported on T, so Zx(Q)=c1−αZx(QT) and fx(Q)=fx(QT)−ρln⁡c≥fx(QT). Step 3.2 then gives F(Q)≥F(q∗). Since active inputs satisfy fx(q∗)=−ln⁡Ψ∗, step 2.1 yields E0,cc(ρ,P∗)=F(q∗)=−ln⁡Ψ∗=max⁡PE0(ρ,P).

5.1step 3.1step 4.1algebra∎

Step 4.1 gives max⁡PE0,cc(ρ,P)≥E0,cc(ρ,P∗)=max⁡PE0(ρ,P), while step 3.1 gives the reverse inequality. This proves the globally optimized identity and establishes no pointwise-in-P equality.

Depends on

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