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.
Regularity is hereditary, without a hidden hypothesis
Statement
Regularity, with no condition built into its name, is hereditary.
Facts & Assumptions
Given: A regular space , a subspace , a point , and an open set of containing .
In a regular space, open gives an open with (A space is regular if and only if every point has a neighbourhood base of closed neighbourhoods, if and only if open gives an open with ).
Every open set of is a trace , and closure in is the ambient closure intersected with (For the closure of in is , while the interior only contains , with equality when is open; and a dense subset of traces to a dense subset of every open ).
Proof
Write for an open containing .
Choose open with .
The trace is open in , contains , and has .
The closed-neighbourhood characterization now makes regular; as was arbitrary, regularity is hereditary.
Depends on
- A space is regular if and only if every point has a neighbourhood base of closed neighbourhoods, if and only if $x \in U$ open gives an open $V$ with $x \in V \subseteq \overline{V} \subseteq U$
- For $A \subseteq S \subseteq X$ the closure of $A$ in $S$ is $\overline{A}^{X} \cap S$, while the interior only contains $\operatorname{int}^{X}(A) \cap S$, with equality when $S$ is open; and a dense subset of $X$ traces to a dense subset of every open $S$
- Hereditary, open-hereditary and closed-hereditary properties of topological spaces
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 27 results over 12 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
- J. P. May, An Outline Summary of Basic Point Set Topology, §6 (standard reference, not scraped)