Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

The singular augmentation commutes with the boundary

Statement

For every topological space X and every abelian group G, εX∂1=0:C1(X;G)→G. Consequently im⁡∂1⊆ker⁡εX, so the reduced singular chain complex of Augmentation at 0-simplices and reduced singular homology is well defined.

Facts & Assumptions

Given: A topological space X and an abelian group G.

[L1]

The augmentation sends every 0-simplex tensor g to g (Augmentation at 0-simplices and reduced singular homology).

[L2]

The singular boundary of a 1-simplex is the terminal 0-face minus the initial 0-face (The singular boundary operator).

Proof

technique · direct
1.1L1L2givenalgebra

Let σ:Δ1→X be a singular 1-simplex and let g∈G. By [L2], ∂1(σ⊗g)=(σδ0)⊗g−(σδ1)⊗g. Applying [L1] gives εX∂1(σ⊗g)=g−g=0.

2.1step 1.1∎

The generators σ⊗g span C1(X;G), so step 1.1 proves εX∂1=0 on all of C1(X;G). Therefore every 1-boundary lies in ker⁡εX, which is exactly the compatibility needed in degree 0 for the reduced chain complex.

Depends on

Used by

Dependency tree · two levels

4 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