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.
Under choice, metric spaces have sigma-discrete open bases
Statement
Assume the Axiom of Choice. Every metric space has a -discrete open basis. More precisely, a well-order of the underlying set suffices; after fixing it, the construction uses no further choice.
Facts & Assumptions
A metric satisfies the triangle inequality, and its open balls give its topology (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Open ball, closed ball and sphere in a metric space).
A family is discrete when each point has a neighborhood meeting at most one member; a -discrete basis is a union of a sequence of discrete families of open sets (Discrete families and -locally-finite and -discrete bases).
Assume The Axiom of Choice; The well-ordering theorem supplies a well-order of .
Given: A metric space and the axiom assumption A1.
Proof
Fix the well-order in A1. For and , put , , and define The first set is closed, being the intersection over of the closed sets ; the triangle inequality makes their complements open. Its defining condition is vacuous if . The subtracted union is open, so is closed, and it lies in since a point outside that set violates the condition with .
For fixed the nonempty cores are pairwise separated. Indeed, if , and , then by the subtraction defining the latter core, and hence . For each fixed their union over is : given , the set of centers with is nonempty (it contains ), so has a least member . Openness gives some with . Take with . Then every satisfies , and lies in none of the earlier balls, so . These are least selections or existential instantiations, requiring no further choice.
For each nonempty core define the open set . It contains its core and is contained in : a point outside has distance at least from every core point. For fixed , every ball meets at most one of these sets. Otherwise two points of that ball belonging to different sets yield corresponding core points with and , whence , contradicting step 2.1. Thus each layer is discrete, and its union over covers for every .
The union of all layers is a basis. If with open, choose with and with . By step 3.1 some contains . Both and each in that set lie in , so ; therefore . Enumerate pairs by successive finite diagonals to obtain a sequence of discrete layers. If is empty, all layers are empty and the same basis criterion holds vacuously. This proves the claimed -discrete open basis, with AC used only for the initial well-order.
Depends on
Used by
Dependency tree · two levels
23 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
- R. H. Bing, Metrization of Topological Spaces (standard reference, not scraped)