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 countable local base can be chosen open and decreasing
Statement
If is first countable and , then has a countable local base of open sets with .
Facts & Assumptions
Given: A countable local base at (First countable space: a countable neighbourhood base at every point).
Each neighbourhood of contains an open neighbourhood of (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).
Every nonempty at most countable set is a surjective image of (A nonempty set is at most countable iff it is a surjective image of , Finite, countably infinite, countable, uncountable).
Proof
A local base is nonempty, so enumerate it as by [L2], with repetitions allowed. Put . Since is a neighbourhood of , its interior is open, contains , and is contained in . This definition is canonical and uses no countable choice.
Put ; each is open, contains , and .
Since , every neighbourhood contains some , so is the required decreasing local base.
Depends on
- First countable space: a countable neighbourhood base at every point
- Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open
- Finite, countably infinite, countable, uncountable
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 39 results over 16 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
- UCR General Topology Notes (standard reference, not scraped)
- First-countable space (Wikipedia) (standard reference, not scraped)