Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

The finite nearest-center quantizer is Borel with finite distortion

Statement

Let X⊆Rd be Borel, let μ be a Borel probability measure on X with finite second moment, and let c1,…,ck∈Rd satisfy the hypotheses of Finite measurable squared-error quantizer and nearest-center rule. The least-index nearest-center rule defines a Borel quantizer on X, and its distortion is finite. Coincident centers and empty cells are allowed.

Facts & Assumptions

Given: Integers d,k≥1, a Borel subset X⊆Rd, a Borel probability measure μ on X with finite second moment, and finite centers c1,…,ck.

[F1]

Finite measurable squared-error quantizer and nearest-center rule: the nearest-center cell Ci(c) is the Borel domain X intersected with strict inequalities against lower indices and non-strict inequalities against higher indices; distortion is the integral of squared Euclidean error.

Proof

1.1givenF1algebra

For fixed i,j, the difference ∥x−ci∥22−∥x−cj∥22 is a continuous polynomial in the coordinates of x. Therefore its strict-negative set is open and its nonpositive set is closed; the finite intersections defining each Ci(c) in [F1] are Borel.

2.1givenF1step 1.1construct

The finite list of distances has a minimum at each x∈X, and the least minimizing index is unique. The tie inequalities in [F1] therefore make the cells a disjoint partition of X; the inverse image of each singleton index is relatively Borel by step 1.1, so the finite-valued index map is Borel.

3.1givenstep 2.1algebra∎

For each coordinate, (xℓ−ci,ℓ)2≤2xℓ2+2ci,ℓ2, since −2xℓci,ℓ≤xℓ2+ci,ℓ2. Summing coordinates and integrating over the partition gives Dμ(Qc;c)≤2∫∥x∥22 dμ(x)+2max⁡1≤i≤k∥ci∥22<∞, so the distortion is well-defined and finite.

Depends on

Used by

Cited to discharge well-definedness by Finite measurable squared-error quantizer and nearest-center rule.

Dependency tree · two levels

2 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