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.
Zero-th simplicial homology is free on connected components
Statement
For every simplicial complex , the group is the free abelian group on the connected components of .
Proof
Given: A simplicial complex .
If and is a vertex of the simplex , then the straight-line barycentric homotopy inside the Euclidean simplex joins to . Hence every point of lies in the same connected component as any vertex of a simplex supporting it, and all vertices of one simplex lie in the same connected component of .
If vertices and are joined by an edge path , then , so vertices in the same edge-path component define the same class in .
Fix a vertex of , let be the set of vertices joined to by edge paths, and let be the subcomplex whose simplices have all vertices in . By step 1.1, every simplex that contains one vertex of has all its vertices in , so for each simplex the intersection is either or . Hence is open and closed in the weak topology. It is connected because every point of lies in a simplex whose vertices are edge-path connected to , so step 1.1 and concatenation of those edge paths connect the point to . Therefore is exactly the connected component of containing . In particular, the connected components of are exactly the realizations of the edge-path components of the vertices, and if every connected component contains a vertex.
Let be the set of connected components of . Since the vertices of every simplex lie in one component by step 1.1, the assignment sending a vertex to the basis vector of the free abelian group extends to a homomorphism . Boundaries of edges map to , so this homomorphism factors through . If , then and both groups are zero. Otherwise step 2.1 shows that every connected component contains a vertex, so is surjective.
Choose one vertex in each nonempty connected component . Every class in is represented by a finite -chain . By step 2.1, two vertices lie in the same connected component exactly when they are edge-path connected, so step 1.2 gives for every . Hence in one has . If , then every component sum is zero, so . Thus is injective.
Therefore is an isomorphism, so is the free abelian group on the connected components of .
Depends on
Used by
Dependency tree · two levels
11 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 03: Homology (standard reference, not scraped)