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

Capacity-achieving output laws bound every row divergence

Statement

Let PX∗ attain C(W) and let Q∗:=PX∗W. If W(y∣x)>0, then Q∗(y)>0, and for every x∈X, D(W(⋅∣x)∥Q∗)≤C(W).

Facts & Assumptions

Given: A finite DMC W and an input law PX∗ attaining C(W).

[F1]

Finite DMC information capacity is attained: I(PX∗;W)=C(W) and PX∗ maximizes I(PX;W) over the input simplex.

[F2]

Finite entropy and mutual-information chain rules and Finite conditional entropy: I(PX;W)=H(QPX)−∑xPX(x)H(W(⋅∣x)).

[F3]

Finite discrete memoryless channels and Finite stochastic kernels and Finite distributions, entropy, divergence, and stochastic matrices: every channel row is a probability vector, and H(q)=−∑y:qy>0qyln⁡qy with 0ln⁡0=0.

[F4]

Finite Kullback–Leibler divergence: when supp⁡P⊆supp⁡Q, D(P∥Q)=∑y:P(y)>0P(y)ln⁡(P(y)/Q(y)) in the direction P to Q.

[F6]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: ln⁡ is strictly increasing and onto R on (0,∞), so ln⁡t→−∞ as t↓0.

Proof

1.1F1F2F3F5F6givenalgebra

Fix x∈X. Suppose some output reachable from x has zero Q∗ mass, and put a:=∑y:Q∗(y)=0W(y∣x)>0. For 0<t<1, let Pt:=(1−t)PX∗+tδx and Qt:=PtW=(1−t)Q∗+tW(⋅∣x). By [F2] and [F3], the conditional-entropy part of I(Pt;W)−I(PX∗;W) is linear in t. On coordinates with Q∗(y)>0, differentiability in [F5] bounds the total entropy change in absolute value by K1t for some finite K1 and all small t. For zero coordinates with W(y∣x)>0, the entropy contribution is exactly −tW(y∣x)ln⁡t−tW(y∣x)ln⁡W(y∣x). All terms other than −taln⁡t have absolute value at most K2t for a finite K2. Since −ln⁡t→+∞ by [F6], the information change is positive for sufficiently small t, contradicting maximality in [F1]. Every row therefore has support contained in supp⁡Q∗.

2.1F2F3F4F5step 1.1algebra

Now fix any x and use the same segment Pt=(1−t)PX∗+tδx. By step 1.1, Q∗ is positive on the support of W(⋅∣x), so the right derivative at t=0 is finite. Differentiating the entropy expression in [F2] with [F3] and [F5] gives ddtI(Pt;W)∣0+=−∑y:Q∗(y)>0(W(y∣x)−Q∗(y))ln⁡Q∗(y)−H(W(⋅∣x))+∑uPX∗(u)H(W(⋅∣u))=D(W(⋅∣x)∥Q∗)−C(W), where the +1 derivative terms cancel because both rows sum to one, and the last equality is [F2] and [F4].

3.1F1step 2.1algebra∎

Since PX∗ maximizes information and Pt is feasible for t≥0, the right derivative in step 2.1 is nonpositive. Hence D(W(⋅∣x)∥Q∗)≤C(W). The input x was arbitrary, proving the bound for all rows.

Depends on

Used by

Dependency tree · two levels

45 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