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.
Single-letter and block distortion
Definition
Let and be measurable spaces, and let be a measurable single-letter distortion. For a positive integer and ordered blocks and , define the normalized additive block distortion by
If the same ordered blocks are labeled and , for any integer , the equivalent formula is
The substitution gives the defining sum, so changing the coordinate labels changes neither the block distortion nor its normalization. In particular, blocks use the indices , while blocks use .
When the alphabets are finite and nonempty and is finite-valued, define . Expected distortion is ; the excess-distortion probability at threshold is . These are distinct criteria: one is an expectation and the other is a tail probability.
Used by
- Finite measurable squared-error quantizer and nearest-center rule Definition
- Finite-alphabet information rate-distortion function Definition
- Finite-alphabet lossy source coding with decoder-only side information Definition
- Finite-alphabet multiterminal lossy source code Definition
- Finite-alphabet point-to-point joint source-channel codes Definition
- Fixed-length operational rate-distortion functions Definition
- General single-letter information rate-distortion function Definition
- Stationary finite-block information rate-distortion function Definition
- Lossless Wyner-Ziv endpoint is the Slepian-Wolf rate Example
- Finite-IID rate-distortion mutual-information converse Lemma
- Lossy separation for finite IID sources and finite DMCs Theorem
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Robert M. Gray, Source Coding Theory, first edition (standard reference, not scraped)
- MIT OpenCourseWare 6.441, Chapter 23: Rate-distortion theory (standard reference, not scraped)