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.

Convexity, monotonicity, and continuity of finite Wyner-Ziv rate

Statement

Let RWZ(D), Dmin⁡, and Dmax⁡ be as in Finite-alphabet lossy source coding with decoder-only side information. Then Dmin⁡≤Dmax⁡, RWZ is nonincreasing and convex on [Dmin⁡,∞), RWZ(D)=0 for D≥Dmax⁡, and RWZ is continuous at every feasible distortion, including Dmin⁡ and Dmax⁡.

Facts & Assumptions

Given: The finite source law, bounded distortion, and the candidate single-letter function in the Definition.

[F1]

Finite-alphabet lossy source coding with decoder-only side information: Dmin⁡=E[min⁡x^d(X,x^)], Dmax⁡=min⁡h:Y→X^E[d(X,h(Y))], and RWZ(D) is the infimum over finite U−X−Y test channels and deterministic maps g(Y,U).

[F2]

Cardinality bound for the finite Wyner-Ziv auxiliary: every feasible test channel can be replaced without increasing I(X;U∣Y) by one with ∣U∣≤∣X∣+1, and the minimum is attained.

[F3]

Finite entropy and mutual-information chain rules: for finite variables, I(X;U∣Y)=H(X∣Y)−H(X∣U,Y) and all terms are finite.

[F4]

Finite distributions, entropy, divergence, and stochastic matrices: entropy is a finite sum of terms −pln⁡p, with 0ln⁡0=0.

Proof

1.1F1F4algebra

For any map h:Y→X^ and every (x,y), d(x,h(y))≥min⁡x^d(x,x^); minimizing over the finite set of maps gives Dmin⁡≤Dmax⁡. The feasible test-channel sets are nested as D increases, so their infima are nonincreasing. For s>0, ln⁡s≤s−1 because s−1−ln⁡s has derivative 1−1/s and minimum 0 at s=1. Thus, for pmfs p,q, either D(p∥q)=+∞ when pi>0=qi for some i, or D(p∥q)≥∑i:pi>0(pi−qi)=1−∑i:pi>0qi≥0. By [F1] and [F4], each conditional mutual information is a positive weighted sum of such divergences, so every feasible objective is nonnegative. A constant auxiliary U and a minimizing map h at Dmax⁡ have objective zero and distortion Dmax⁡, proving RWZ(D)=0 for D≥Dmax⁡.

1.2F1F2F3chooseconstruct

Let D1,D2≥Dmin⁡ and 0≤λ≤1. By [F2], choose minimizing channels (U1,g1) and (U2,g2), whose distortions d1,d2 satisfy dj≤Dj. Let an independent finite Q select branch 1 with probability λ, set U=(Q,UQ), and use g(Y,U)=gQ(Y,UQ). Then U−X−Y, the distortion λd1+(1−λ)d2 is at most λD1+(1−λ)D2, and the finite conditional chain rule gives I(X;U∣Y)=I(X;Q∣Y)+I(X;UQ∣Y,Q)=λRWZ(D1)+(1−λ)RWZ(D2) because Q is independent of (X,Y). Applying [F2] to reduce U if necessary proves convexity.

2.1F1F2F3F4F5step 1.1algebra

On the interior of [Dmin⁡,Dmax⁡], write s(a,b)=(RWZ(b)−RWZ(a))/(b−a). Convexity implies s(a,b)≤s(b,c) whenever a<b<c, by writing b as a convex combination of a,c. For D−<z<D, this gives s(D−,z)≤s(z,D), hence RWZ(z)≤D−zD−D−RWZ(D−)+z−D−D−D−RWZ(D); the right side tends to RWZ(D) as z↑D, while monotonicity gives RWZ(z)≥RWZ(D). For D<z<D+, the inequalities s(D−,D)≤s(D,z)≤s(z,D+) bound RWZ(z) between two linear interpolations that both tend to RWZ(D) as z↓D. This proves continuity at D. For right continuity at Dmin⁡<Dmax⁡, let r<RWZ(Dmin⁡) and let Kj be the set of channels with ∣U∣=∣X∣+1 and decoder maps whose distortion is at most Dmin⁡+1/j and whose objective is at most r. The union of the finitely many channel simplexes over decoder maps is compact by [F5]: each simplex is closed and bounded in a finite-dimensional Euclidean space, and a finite union of compact sets is compact. For 0<t≤1, 0≤−tln⁡t=tln⁡(1/t)=t∫11/tduu≤t∫11/tduu≤2t, so −tln⁡t extends continuously to 0; hence each finite entropy sum is continuous in its probability coordinates. By [F3], I(X;U∣Y)=H(X,Y)+H(U,Y)−H(Y)−H(X,U,Y). Each joint law in this expression depends linearly on the channel entries, and its entropy is continuous by the preceding limit, so the objective is continuous; for each fixed decoder map the expected distortion is also a finite linear function of the channel entries. Therefore each Kj is closed. If every Kj were nonempty, they would be nested closed subsets of this compact space with the finite intersection property: if their total intersection were empty, their open complements would cover the compact space and a finite subcover would force one Kj empty. Thus their intersection is nonempty, yielding a channel feasible at Dmin⁡ with objective at most r, contrary to r<RWZ(Dmin⁡). It follows that RWZ(D)>r on some right neighborhood of Dmin⁡; since RWZ(D)≤RWZ(Dmin⁡) by monotonicity, right continuity follows.

3.1F1step 1.1step 2.1algebra∎

For Dmin⁡≤D≤Dmax⁡ with Dmin⁡<Dmax⁡, time-share a minimum-distortion channel at Dmin⁡ with the zero-rate channel at Dmax⁡. This gives RWZ(D)≤Dmax⁡−DDmax⁡−Dmin⁡RWZ(Dmin⁡), so RWZ(D)→0 as D↑Dmax⁡. Nonnegativity and the zero-rate branch in step 1.1 prove continuity there. If Dmin⁡=Dmax⁡, the zero-rate channel already attains the minimum distortion, so the feasible function is identically zero. For D<Dmin⁡, every test channel has distortion at least Dmin⁡, so the feasible set is empty and RWZ(D)=+∞ by Definition; for D≥Dmax⁡, step 1.1 gives zero.

Depends on

Used by

Dependency tree · two levels

43 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