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.
Compact subsets of an arbitrary simplicial realization meet finitely many open simplices
Statement
Assume the Axiom of Countable Choice. For any simplicial complex with weak topology, every compact meets only finitely many open simplices, and is contained in a finite subcomplex. Consequently the images of a finite family of continuous maps from compact simplices lie in one finite subcomplex. No local finiteness is assumed.
Source locators
Appendix Proposition A.1, p.520.
Facts & Assumptions
Countable independent families of nonempty sets admit a choice function. The Axiom of Countable Choice ().
Support faces are finite and weak closedness is tested on simplices. The geometric realization of an abstract simplicial complex.
Closed subsets of compact spaces and finite unions of compact subsets are compact. A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact.
Proof
Given: Countable Choice, an arbitrary , and compact .
If the set of open simplices meeting were infinite, for each positive integer let be the nonempty set of ordered -tuples of points of with distinct support faces. Countable Choice selects one tuple for each . Flatten these finite tuples into a sequence and retain, in their natural order, the first point in each previously unseen support face. There are infinitely many retained points since the tuple of length supplies different faces. This gives a sequence in distinct open simplices, using only the stated countable independent choices and least-index deletions.
A closed simplex has finitely many faces. Each retained point in it has a distinct support face contained in , so it contains only finitely many . Every subset of consequently has finite closed trace on every simplex and is weakly closed in . Thus is closed in and its subspace topology is discrete. Closedness in compact makes compact, whereas its singleton open cover has no finite subcover. This contradiction proves finite.
Include all faces of the finitely many simplices in to obtain a finite subcomplex containing ; if is empty use the vertex-free subcomplex. A continuous image of a compact simplex is compact because any open cover pulls back to an open cover with a finite subcover. A finite union of these images is compact, so the preceding conclusion applies to the entire family at once, including an empty family.
Depends on
Used by
Dependency tree · two levels
16 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)