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 , , and be as in Finite-alphabet lossy source coding with decoder-only side information. Then , is nonincreasing and convex on , for , and is continuous at every feasible distortion, including and .
Facts & Assumptions
Given: The finite source law, bounded distortion, and the candidate single-letter function in the Definition.
Finite-alphabet lossy source coding with decoder-only side information: , , and is the infimum over finite test channels and deterministic maps .
Cardinality bound for the finite Wyner-Ziv auxiliary: every feasible test channel can be replaced without increasing by one with , and the minimum is attained.
Finite entropy and mutual-information chain rules: for finite variables, and all terms are finite.
Finite distributions, entropy, divergence, and stochastic matrices: entropy is a finite sum of terms , with .
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: the closed channel simplexes for a fixed finite auxiliary alphabet are compact subsets of a finite-dimensional Euclidean space.
Proof
For any map and every , ; minimizing over the finite set of maps gives . The feasible test-channel sets are nested as increases, so their infima are nonincreasing. For , because has derivative and minimum at . Thus, for pmfs , either when for some , or . 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 and a minimizing map at have objective zero and distortion , proving for .
Let and . By [F2], choose minimizing channels and , whose distortions satisfy . Let an independent finite select branch 1 with probability , set , and use . Then , the distortion is at most , and the finite conditional chain rule gives because is independent of . Applying [F2] to reduce if necessary proves convexity.
On the interior of , write . Convexity implies whenever , by writing as a convex combination of . For , this gives , hence ; the right side tends to as , while monotonicity gives . For , the inequalities bound between two linear interpolations that both tend to as . This proves continuity at . For right continuity at , let and let be the set of channels with and decoder maps whose distortion is at most and whose objective is at most . 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 , , so extends continuously to ; hence each finite entropy sum is continuous in its probability coordinates. By [F3], . 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 is closed. If every 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 empty. Thus their intersection is nonempty, yielding a channel feasible at with objective at most , contrary to . It follows that on some right neighborhood of ; since by monotonicity, right continuity follows.
For with , time-share a minimum-distortion channel at with the zero-rate channel at . This gives , so as . Nonnegativity and the zero-rate branch in step 1.1 prove continuity there. If , the zero-rate channel already attains the minimum distortion, so the feasible function is identically zero. For , every test channel has distortion at least , so the feasible set is empty and by Definition; for , step 1.1 gives zero.
Depends on
- Finite-alphabet lossy source coding with decoder-only side information
- Finite distributions, entropy, divergence, and stochastic matrices
- Cardinality bound for the finite Wyner-Ziv auxiliary
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Finite entropy and mutual-information chain rules
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
- Aaron D. Wyner and Jacob Ziv, The Rate-Distortion Function for Source Coding with Side Information at the Decoder (standard reference, not scraped)
- Abbas El Gamal and Young-Han Kim, Network Information Theory, author lecture notes (standard reference, not scraped)