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.
Every discrete family is locally finite, so every -discrete basis is -locally finite
Statement
Every discrete family is locally finite. Consequently every -discrete basis is -locally finite.
Facts & Assumptions
Given: A discrete family in a space .
A family is locally finite when every point has a neighbourhood meeting only finitely many of its members (Refinements, locally finite families, point-finite families, and star refinements).
Proof
For each , discreteness supplies a neighbourhood meeting at most one member of . That is a finite number, so [L1] makes locally finite.
Applying step 1.1 separately to every discrete layer in a -discrete decomposition leaves the same countable decomposition and gives a -locally-finite basis.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 16 results over 9 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Encyclopedia of Mathematics, Metrizable space (standard reference, not scraped)