Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-05
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.

Path-connected spaces have zero reduced zero-th homology

Statement

If X is nonempty and path-connected, then H~0sing(X;Z)=0.

Facts & Assumptions

Given: A nonempty path-connected topological space X.

[L1]

H0sing(X;Z) is the free abelian group on the path components of X (Zero-th singular homology is free on path components).

[L2]

Reduced degree-zero singular homology is the homology of the augmentation kernel in degree 0 (Augmentation at 0-simplices and reduced singular homology).

[L3]

Every singular 1-boundary lies in the augmentation kernel (The singular augmentation commutes with the boundary).

Proof

technique · direct
1.1

Since X is nonempty and path-connected, it has exactly one path component. By [L1], H0sing(X;Z)Z.

L1given
2.1

Let z=k=1makσkC0(X;Z). Under the isomorphism of step 1.1, the class [z] maps to k=1makZ, which is exactly εX(z). Therefore zkerεX if and only if [z]=0 in H0sing(X;Z), equivalently if and only if zB0(X;Z). By [L3], every 0-boundary lies in kerεX, so kerεX=B0(X;Z).

L3step 1.1algebra
3.1

By [L2], reduced degree-zero homology is H~0sing(X;Z)=kerεX/im1=kerεX/B0(X;Z)=0.

L2step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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