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.
Finite measurable squared-error quantizer and nearest-center rule
Definition
Let , let be Borel, and give the relative Borel sigma algebra . Let be a probability measure on with , and let be reproduction points, where . A finite squared-error quantizer is a measurable map , with the finite index set given its discrete sigma algebra; its reproduction at is and its distortion is
This is the expected single-letter distortion of Single-letter and block distortion for the measurable distortion . For a fixed ordered center tuple , the nearest-center rule assigns to the least index minimizing . Its cell at index is
The convention assigns every tie to the smallest index. A general finite measurable quantizer need not use this nearest-center partition; in particular, a compander partition below is specified by its own interval boundaries. When , this is the ordinary full-domain nearest-center quantizer.
Depends on
Used by
- Exact finite-data Lloyd quantizer Algorithm
- Exhaustive global empirical squared-error quantizer Algorithm
- Lloyd can stop at a strictly suboptimal finite-data fixed point Counterexample
- Positive C1 compact one-dimensional compander Definition
- The compact compander is a measurable finite quantizer Lemma
- The finite nearest-center quantizer is Borel with finite distortion Lemma
- Exact finite-data Lloyd descent and finite termination Theorem
- Exhaustive empirical search attains a global quantizer Theorem
Dependency tree · one level
1 result within one dependency step 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)
- Robert Gallager, 6.450 Principles of Digital Communications I, Chapter 3: Quantization (standard reference, not scraped)
- Robert M. Gray and David L. Neuhoff, Quantization, IEEE Transactions on Information Theory 44(6) (1998) (standard reference, not scraped)