Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge 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.

A compact metric space has a finite Borel nearest-center quantization at every positive scale

Statement

Let (X,d) be a nonempty compact metric space and let ε>0. Then there are an integer m≥1, distinct points x1,…,xm∈X, a Borel partition C1,…,Cm of X, and a Borel map Q:X→F:={x1,…,xm} such that Q(x)=xi for x∈Ci and d(x,Q(x))<ε for every x∈X. The partition assigns each point to a nearest point of F, and ties are assigned to the least index.

Facts & Assumptions

Given: A nonempty compact metric space (X,d) and ε>0.

[F1]

Every open cover of a compact metric space has a finite subcover. Open cover, subcover, compact metric space, and compact subset of a metric space

[F3]

Every nonempty finite list of real numbers has an attained minimum. Every nonempty finite set of reals has a maximum and a minimum

[F4]

The Borel sigma-algebra contains every open and closed set and is closed under finite unions and intersections. The Borel sigma-algebra of a topological space

Proof

technique · direct
1.1givenF1F2

For any x∈X, the ball B(x,ε) is open: if y∈B(x,ε), set δ=ε−d(x,y)>0; whenever d(y,z)<δ, [F2] gives d(x,z)≤d(x,y)+d(y,z)<ε, so B(y,δ)⊆B(x,ε). Also x∈B(x,ε), so {B(x,ε):x∈X} is an open cover.

2.1step 1.1F1construct

By [F1], finitely many members of that cover still cover X. Each selected member is a ball with at least one center; since the list is finite, finite induction selects a center for every selected member without any choice axiom. Removing repeated centers and preserving their first-occurrence order leaves a finite nonempty distinct list x1,…,xm whose ε-balls cover X.

3.1step 2.1F2algebra

For i<j, the function hij(x)=d(x,xi)−d(x,xj) satisfies ∣hij(x)−hij(y)∣≤2d(x,y) by applying the triangle inequality in both directions to each distance. If hij(x)<0, then the ball of radius −hij(x)/4 around x lies in {hij<0}; if hij(x)>0, then the ball of radius hij(x)/4 around x lies in {hij>0}. Hence {hij<0} is open and {hij≤0} is closed.

4.1step 2.1step 3.1F3F4

Define Ci:=⋂j<i{x:d(x,xi)<d(x,xj)}∩⋂j>i{x:d(x,xi)≤d(x,xj)}. These are Borel sets by [F4] and step 3.1. For each x, [F3] gives a least index minimizing the finite list d(x,x1),…,d(x,xm), so x belongs to the corresponding Ci. If i<j, membership in Ci gives d(x,xi)≤d(x,xj) while membership in Cj gives d(x,xj)<d(x,xi); therefore the cells are disjoint and form a partition.

5.1step 2.1step 4.1F4∎

Define Q(x)=xi on Ci. For every subset A⊆F, Q−1(A)=⋃i:xi∈ACi is a finite union of Borel sets, so Q is Borel. The net points from step 2.1 have ε-balls covering X; hence a nearest center is at distance less than ε from every point. Thus d(x,Q(x))<ε for all x.

Depends on

Used by

Dependency tree · two levels

21 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