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 be a nonempty compact metric space and let . Then there are an integer , distinct points , a Borel partition of , and a Borel map such that for and for every . The partition assigns each point to a nearest point of , and ties are assigned to the least index.
Facts & Assumptions
Given: A nonempty compact metric space and .
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
A metric is symmetric and satisfies the triangle inequality; its values are nonnegative. Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric Nonnegativity of a metric is a consequence of the other axioms, not an axiom
Every nonempty finite list of real numbers has an attained minimum. Every nonempty finite set of reals has a maximum and a minimum
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
For any , the ball is open: if , set ; whenever , [F2] gives , so . Also , so is an open cover.
By [F1], finitely many members of that cover still cover . 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 whose -balls cover .
For , the function satisfies by applying the triangle inequality in both directions to each distance. If , then the ball of radius around lies in ; if , then the ball of radius around lies in . Hence is open and is closed.
Define . These are Borel sets by [F4] and step 3.1. For each , [F3] gives a least index minimizing the finite list , so belongs to the corresponding . If , membership in gives while membership in gives ; therefore the cells are disjoint and form a partition.
Define on . For every subset , is a finite union of Borel sets, so is Borel. The net points from step 2.1 have -balls covering ; hence a nearest center is at distance less than from every point. Thus for all .
Depends on
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Open ball, closed ball and sphere in a metric space
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- The Borel sigma-algebra of a topological space
- Nonnegativity of a metric is a consequence of the other axioms, not an axiom
- Every nonempty finite set of reals has a maximum and a minimum
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
- Dmitriy Panchenko, Lecture Notes on Probability Theory, §4.4 (standard reference, not scraped)
- Filippo Santambrogio, Introduction to Optimal Transport Theory, §1.1, PDF pp. 3–4 (standard reference, not scraped)