Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Constrained DMC information capacity is attained, nondecreasing, and concave

Statement

Let W be a finite DMC, c:X→[0,∞) a finite letter cost, and Γ≥cmin⁡. The feasible set {PX:cˉ(PX)≤Γ} is nonempty and compact, and CI(Γ) from Average-cost fixed-length codes and operational DMC capacity is attained with 0≤CI(Γ)≤ln⁡∣X∣. The function Γ↦CI(Γ) is nondecreasing and concave on [cmin⁡,∞). If Γ>cmin⁡, then for every maximizing law PX∗ the laws PX,ϵ:=(1−ϵ)PX∗+ϵδxmin⁡,0<ϵ<1, have cost strictly below Γ whenever PX∗ has cost Γ, and I(PX,ϵ;W)→CI(Γ) as ϵ↓0.

Facts & Assumptions

Given: A finite DMC W, a finite cost c, and a budget Γ≥cmin⁡.

[F1]

Finite DMC with a nonnegative input cost and feasible budget and Finite probability vectors: X is finite and nonempty, cmin⁡ is attained, and cˉ(PX)=∑xPX(x)c(x) is linear in PX.

[F2]

Average-cost fixed-length codes and operational DMC capacity: CI(Γ)=sup⁡cˉ(PX)≤ΓI(PX;W).

[F3]

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, I(PX;W)=H(PXW)−∑xPX(x)H(W(⋅∣x)).

[F4]

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 0≤H≤ln⁡m. finite entropy is continuous and concave on each probability simplex.

[F5]

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: a nonempty closed bounded subset of finite-dimensional Euclidean space is compact, and every continuous real-valued function on it attains its maximum.

[F6]

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

1.1F1F3F4F5F6givenalgebra

The probability simplex on X is closed and bounded in R∣X∣. The feasible subset is closed because PX↦cˉ(PX) is linear and continuous; it is nonempty because δxmin⁡ has cost cmin⁡≤Γ. Hence it is compact by [F5]. The output law PXW is linear in PX, so [F3]–[F4] show that PX↦I(PX;W) is continuous. Nonnegativity of mutual information follows from [F6] applied to the joint law and product marginals. Also I(PX;W)=H(PX)−H(X∣Y)≤H(PX) by [F3], since conditional entropy is a sum of nonnegative terms. Concavity in [F4] gives H(PX)≤ln⁡∣X∣: the uniform vector is the average of the finitely many coordinate permutations of PX, all of which have the same entropy. Thus the objective lies in [0,ln⁡∣X∣], and [F5] proves its supremum is finite and attained.

2.1F1F2F3F4step 1.1algebra

If Γ0≤Γ1, the feasible set at Γ0 is contained in the one at Γ1, proving monotonicity. For 0≤θ≤1, let P0,P1 attain CI(Γ0),CI(Γ1). The mixture Pθ=θP0+(1−θ)P1 has cost at most θΓ0+(1−θ)Γ1. By [F3]–[F4], mutual information is concave in PX: the output entropy is concave and the conditional entropy term is linear. Therefore CI(θΓ0+(1−θ)Γ1)≥θCI(Γ0)+(1−θ)CI(Γ1).

3.1F1F3step 1.1givenalgebracases∎

Suppose Γ>cmin⁡ and PX∗ attains CI(Γ). If cˉ(PX∗)=Γ, choose a minimum-cost symbol xmin⁡ from the finite alphabet. Then cˉ(PX,ϵ)=(1−ϵ)Γ+ϵcmin⁡<Γ for every ϵ>0. Since PX,ϵ→PX∗ and the mutual-information objective is continuous by step 1.1, I(PX,ϵ;W)→CI(Γ). If PX∗ already has strict cost, no approximation is needed.

Depends on

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