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

The finite wiretap auxiliary has cardinality at most |X|

Statement

For every finite joint law PUX on a finite wiretap channel with input alphabet X, where U−X−(Y,Z) means PUXYZ(u,x,y,z)=PUX(u,x)W(y,z∣x), there is another finite auxiliary U~ with ∣U~∣≤∣X∣ whose value of I(U~;Y)−I(U~;Z) is at least I(U;Y)−I(U;Z). Consequently

sup⁡PU,X: U−X−(Y,Z)[I(U;Y)−I(U;Z)]

is a maximum and may be restricted to ∣U∣≤∣X∣. For each input law q, the single-letter objective q↦Iq(X;Y)−Iq(X;Z) is continuous on the finite probability simplex.

Facts & Assumptions

Given: A finite wiretap channel, a finite auxiliary U, and a joint law PUX with the stated Markov factorization.

[F1]

Finite discrete memoryless wiretap channel and code model: the input alphabet and both output alphabets are finite; conditional on X, the marginals Y and Z use the finite DMCs WY and WZ.

[F2]

Finite mutual information: mutual information is the finite joint-law KL sum in nats.

[F3]

Finite entropy and mutual-information chain rules: I(A;B)=H(B)−H(B∣A) for finite variables.

[F4]

Finite distributions, entropy, divergence, and stochastic matrices: H(p)=−∑pi>0piln⁡pi with 0ln⁡0=0.

[F5]

The natural logarithm is bounded above by its positive argument minus one: for t≥1, 0≤ln⁡t≤t−1.

[F7]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space attains its maximum.

Proof

1.1F1F2F3F4F5givencasesalgebra

If m:=∣X∣=1, then X is constant and both mutual informations in the objective are zero, so ∣U~∣=1 suffices. Assume m≥2. For a probability vector q on X, let F(q):=Iq(X;Y)−Iq(X;Z). By [F2]–[F4] and the finite entropy identity in [F3], F(q)=H(qWY)−H(qWZ)−∑xq(x)(H(WY(⋅∣x))−H(WZ(⋅∣x))). The maps q↦qWY and q↦qWZ are finite linear maps. On 0<t≤1, set s=t−1/2≥1; [F5] gives 0≤−tln⁡t=2tln⁡s≤2t. Hence −tln⁡t extends continuously to t=0 with value 0, so finite entropy and F are continuous on the simplex Δ(X).

2.1F1F2F3step 1.1algebra

Write λu=PU(u)>0, qu=PX∣U=u, and qˉ=PX=∑uλuqu, omitting zero-mass u. The chain rule [F3] gives I(U;Y)−I(U;Z)=F(qˉ)−∑uλuF(qu). Indeed, expanding the right side by the entropy formula in step 1.1 leaves H(Y)−∑uλuH(Y∣U=u)−H(Z)+∑uλuH(Z∣U=u); the linear conditional-on-X terms cancel because qˉ=∑uλuqu, and the remaining expression is the left side.

3.1F1step 2.1chooseconstructalgebra

Suppose the current posterior mixture has k>m positive weights. The k vectors (qu(x1),…,qu(xm−1),1) lie in Rm, so there are coefficients cu, not all zero, with ∑ucu=0 and ∑ucuqu(xj)=0 for j<m. Since each qu sums to one, the same relation holds for the last coordinate xm. The coefficients include both signs. Therefore the weights λu+tcu remain nonnegative on a bounded interval [t−,t+] with t−<0<t+; at either endpoint at least one weight is zero, while the total weight and posterior average stay fixed. The average G(t)=∑u(λu+tcu)F(qu) is affine in t, so at least one endpoint has G(t)≤G(0): otherwise zero, a convex combination of t− and t+, would have a smaller value than both endpoints. Choose that endpoint and delete its zero weights. This keeps qˉ fixed and does not decrease the wiretap objective in step 2.1.

4.1step 3.1induction

Repeating step 3.1 finitely many times reduces any finite auxiliary to at most m positive weights, preserving PX and not decreasing I(U;Y)−I(U;Z). Thus every finite auxiliary is dominated by one with ∣U∣≤m.

5.1F6F7step 1.1step 4.1algebra∎

The parameter space Δm×Δ(X)m of m weights and m posterior laws is a nonempty closed bounded subset of Rm+m2, since it is described by finitely many coordinate inequalities 0≤t≤1 and coordinate-sum equalities. It is compact by [F6]. By step 1.1 the objective F(qˉ)−∑j=1mλjF(qj) is continuous there, including zero weights, so it attains a maximum by [F7]. Step 4.1 shows this maximum equals the supremum over all finite auxiliaries.

Depends on

Used by

Dependency tree · two levels

58 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