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.

Finite-channel mutual information is concave in the input law

Statement

Let X,Y be finite nonempty sets and let V(y∣x) be a row-stochastic channel. For an input probability vector P, write IP(V) for the mutual information under the joint law P(x)V(y∣x). Then P↦IP(V) is concave: for input laws P0,P1 and λ∈[0,1], IλP0+(1−λ)P1(V)≥λIP0(V)+(1−λ)IP1(V).

Facts & Assumptions

Given: Finite nonempty input and output alphabets, a row-stochastic channel V, two input laws P0,P1, and λ∈[0,1].

[F1]

Finite mutual information and Finite distributions, entropy, divergence, and stochastic matrices: I(X;Y)=D(PXY∥PX⊗PY) and H(q)=−∑y:qy>0qyln⁡qy, with 0ln⁡0=0.

[F2]

Finite discrete memoryless channels: each row V(⋅∣x) is a probability vector and the output law is PV.

[F5]

The logarithm grows more slowly than every positive real power: tln⁡t→0 as t↓0, so g extends continuously by g(0)=0.

Proof

1.1F1F2algebra

Expanding the finite KL sum in [F1] under P(x)V(y∣x) and grouping the finite terms gives IP(V)=H(PV)−∑xP(x)H(V(⋅∣x)). Indeed, the logarithm of the joint-to-product ratio is ln⁡V(y∣x)−ln⁡(PV)(y) on positive joint support; summing the first term gives the negative conditional entropy and summing the second gives the output entropy. Zero-mass coordinates contribute zero by [F1].

1.2F3F4

For 0<s<t≤1, [F3] gives g′(s)=−ln⁡s−1>−ln⁡t−1=g′(t), since ln⁡ is strictly increasing by its positive derivative and the mean value theorem. If 0<u<v<w≤1, apply [F4] to g on [u,v] and [v,w]. The resulting derivative points satisfy ξ1<ξ2, so the left secant slope is at least the right secant slope; rearranging is the concavity inequality for g at v. Thus g is concave on (0,1].

2.1F1F5step 1.2algebra

For u,w∈[0,1] with one endpoint zero, replace that endpoint by a positive sequence tending to zero in the inequality of step 1.2 and use continuity from [F5]. Therefore g is concave on [0,1]. Summing the scalar concavity inequalities over coordinates proves that finite entropy H(q)=∑yg(qy) is concave on each probability simplex.

3.1step 1.1step 2.1givenalgebra∎

Put Pλ=λP0+(1−λ)P1. The output law satisfies PλV=λ(P0V)+(1−λ)(P1V), so step 2.1 gives H(PλV)≥λH(P0V)+(1−λ)H(P1V). The conditional-entropy term in step 1.1 is linear in P. Subtracting that linear term yields IPλ(V)≥λIP0(V)+(1−λ)IP1(V), as claimed.

Depends on

Used by

Dependency tree · two levels

35 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