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.

Gallager and expurgated input-law maxima are attained

Statement

For a finite DMC W, the functions P↦E0(ρ,P) for each ρ≥0 and P↦E0x(ρ,P) for each ρ≥1, 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 ρ=0, E0(0,P)=0 for every P.

Facts & Assumptions

Given: A finite DMC W, its finite nonempty alphabets, a real ρ in one of the stated ranges, and an input law P.

[F1]

One-letter Gallager and expurgated exponent functions: for ρ≥0, E0 is the negative logarithm of the finite sum of powers 1/(1+ρ) and 1+ρ; for ρ≥1, E0x is −ρ times the logarithm of the finite sum of P(x)P(x′)B(x,x′)1/ρ, with 0a=0 for a>0.

[F2]

Finite discrete memoryless channels: each row W(⋅∣x) is a probability vector.

[F5]

Finite probability vectors and 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: 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

1.1F1F3algebrachoose

For any fixed a>0, the convention in [F3] extends t↦ta continuously to t=0: given ϵ>0, put δ=exp⁡((ln⁡ϵ)/a)>0. If 0<t<δ, monotonicity of ln⁡ gives aln⁡t<ln⁡ϵ, so monotonicity of exp⁡ yields 0<ta<ϵ; at t=0 the value is zero. Thus every positive real power used in [F1] is continuous on [0,∞).

1.2F1F2F3F4givenalgebrachoose

For every x, B(x,x)=∑yW(y∣x)=1 by [F2]. Thus the inner sum in E0x satisfies ∑x,x′P(x)P(x′)B(x,x′)1/ρ≥∑xP(x)2≥1∣X∣>0. The last inequality follows from ∣X∣∑xP(x)2−(∑xP(x))2=∑x<x′(P(x)−P(x′))2≥0. Write d=∣X∣, cxx′=B(x,x′)1/ρ, C=∑x,x′cxx′>0, and T(P)=∑x,x′cxx′P(x)P(x′). For input laws P,Q, their coordinates lie in [0,1], so ∣T(P)−T(Q)∣≤∑x,x′cxx′(∣P(x)−Q(x)∣+∣P(x′)−Q(x′)∣)≤2C∥P−Q∥2. Thus T is continuous on the simplex. At each P, scalar continuity of ln⁡ at T(P)≥1/d supplies a tolerance η>0 such that ∣t−T(P)∣<η and t>0 imply ρ∣ln⁡t−ln⁡T(P)∣<ϵ. Taking ∥P−Q∥2<η/(2C) proves continuity of E0x(ρ,P)=−ρln⁡T(P) directly, without applying [F4] on a vector domain.

2.1F1F2F3step 1.1step 1.2algebrachoose

Fix ρ>0 and set Ay(P)=∑xP(x)W(y∣x)1/(1+ρ) and S(P)=∑yAy(P)1+ρ. Since the fixed coefficients in Ay lie in [0,1], ∣Ay(P)−Ay(Q)∣≤d∥P−Q∥2. At a fixed P and for ϵ>0, step 1.1 supplies, for each of the finitely many y, a scalar tolerance ηy>0 such that ∣t−Ay(P)∣<ηy with t≥0 implies ∣t1+ρ−Ay(P)1+ρ∣<ϵ/∣Y∣. Taking ∥P−Q∥2<min⁡yηy/d and summing proves ∣S(P)−S(Q)∣<ϵ. For every input law P, some x has P(x)>0; since row W(⋅∣x) sums to one, some y has W(y∣x)>0, giving Ay(P)>0 and hence S(P)>0. Scalar logarithm continuity at S(P), followed by the just-proved continuity estimate for S, therefore gives continuity of the real-valued E0(ρ,P)=−ln⁡S(P). At ρ=0, the sum is ∑y∑xP(x)W(y∣x)=1, so E0(0,P)=0.

3.1F5step 1.2step 2.1∎

The finite probability vectors form the nonempty simplex Δ={P:P(x)≥0,∑xP(x)=1} by [F5]. It is nonempty because a point mass belongs to it; each coordinate lies in [0,1], 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

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