Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedverified 2026-09-26 (gpt-6-sol)
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 K, the group H0simp(K) is the free abelian group on the connected components of ∣K∣.

Proof

Given: A simplicial complex K.

1.1given

If x∈∣σ∣ and u is a vertex of the simplex σ, then the straight-line barycentric homotopy inside the Euclidean simplex ∣σ∣ joins x to u. Hence every point of ∣K∣ 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 ∣K∣.

1.2given

If vertices v and w are joined by an edge path v=v0,…,vm=w, then [w]−[v]=∑i=1m∂[vi−1,vi], so vertices in the same edge-path component define the same class in H0simp(K).

2.1step 1.1

Fix a vertex v of K, let E(v) be the set of vertices joined to v by edge paths, and let K(v) be the subcomplex whose simplices have all vertices in E(v). By step 1.1, every simplex that contains one vertex of E(v) has all its vertices in E(v), so for each simplex σ the intersection ∣K(v)∣∩∣σ∣ is either ∣σ∣ or ∅. Hence ∣K(v)∣ is open and closed in the weak topology. It is connected because every point of ∣K(v)∣ lies in a simplex whose vertices are edge-path connected to v, so step 1.1 and concatenation of those edge paths connect the point to v. Therefore ∣K(v)∣ is exactly the connected component of ∣K∣ containing v. In particular, the connected components of ∣K∣ are exactly the realizations of the edge-path components of the vertices, and if ∣K∣≠∅ every connected component contains a vertex.

3.1step 1.1step 2.1

Let π0(∣K∣) be the set of connected components of ∣K∣. Since the vertices of every simplex lie in one component by step 1.1, the assignment sending a vertex u to the basis vector e[u] of the free abelian group ⨁C∈π0(∣K∣)ZeC extends to a homomorphism C0(K)→⨁C∈π0(∣K∣)ZeC. Boundaries of edges map to 0, so this homomorphism factors through Φ:H0simp(K)→⨁C∈π0(∣K∣)ZeC. If ∣K∣=∅, then C0(K)=0 and both groups are zero. Otherwise step 2.1 shows that every connected component contains a vertex, so Φ is surjective.

4.1step 1.2step 2.1step 3.1

To prove injectivity, let a class be represented by a finite 0-chain z=∑unu[u] with Φ([z])=0. Only finitely many connected components meet its support. For each of those components C, select one vertex aC from the support of z in C; this is a finite selection. By step 2.1, two vertices lie in the same connected component exactly when they are edge-path connected, so step 1.2 gives [u]−[aC]∈B0(K) for every supported u∈C. Hence [z]=∑C(∑u∈Cnu)[aC]. Every coefficient in this finite sum is zero because Φ([z])=0. Thus [z]=0 and Φ is injective.

5.1step 3.1step 4.1∎

Therefore Φ is an isomorphism, so H0simp(K) is the free abelian group on the connected components of ∣K∣.

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