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.
A Gaussian rate-distortion optimizer need not have a density
Statement
Let with , use squared-error distortion, and choose . The constant reconstruction attains the Gaussian information rate-distortion value zero, but its law has no density with respect to Lebesgue measure.
Facts & Assumptions
Given: AC, a nondegenerate centered Gaussian source, squared-error distortion, and .
The Axiom of Choice: the Gaussian rate-distortion supplier assumes AC.
General single-letter information rate-distortion function: the information rate is the infimum of mutual information over joint laws meeting the expected-distortion constraint.
Mutual information for standard-Borel random elements: mutual information is the joint-law KL from the product of the marginals.
Gaussian squared-error rate-distortion function: for , the Gaussian squared-error information rate is zero.
The measure with density relative to : having a density with respect to Lebesgue measure requires absolute continuity with respect to that measure.
Proof
The constant choice has expected distortion . Since is constant, , so [F2] gives mutual information zero. By [F3], zero is the minimum rate; hence this reconstruction is optimal.
The singleton has Lebesgue measure zero but . Thus is not absolutely continuous with respect to Lebesgue measure and, by [F4], cannot have a Lebesgue density.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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
- Robert M. Gray, Source Coding Theory, first edition (standard reference, not scraped)
- MIT OpenCourseWare 6.441, Chapter 25: Evaluating R(D) (standard reference, not scraped)