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 finite simplicial complex has a compact Hausdorff realization
Statement
If is a finite abstract simplicial complex, then its geometric realization is compact and Hausdorff.
Proof
Given: A finite abstract simplicial complex .
If has no nonempty simplices, then , which is compact and Hausdorff. Otherwise has finitely many vertices; write them as . For each simplex of , the subset identifies with a Euclidean simplex in , cut out by finitely many linear equations and inequalities, so is compact.
The realization is the union of the finitely many subsets over the nonempty simplices of , and this union is empty in the case handled at the start of step 1.1. Therefore step 1.1 makes a finite union of compact sets and hence compact.
For each simplex , let be open with . Since there are only finitely many simplices, a subset is weakly open exactly when . Thus the weak topology on agrees with the subspace topology from . The cube is Hausdorff, so is Hausdorff as a subspace.
Steps 2.1 and 2.2 give compactness and Hausdorffness.
Depends on
- The geometric realization of an abstract simplicial complex
- Local finiteness, finiteness, and finite dimensionality of a simplicial complex
- Geometric simplices intersect in the realization of their common face
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Distinct points of a metric space have disjoint balls around them
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
46 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
- Allen Hatcher, Algebraic Topology (standard reference, not scraped)
- Vidit Nanda, Computational Algebraic Topology, Lecture 01: Complexes (standard reference, not scraped)