Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 coboundary squares to zero

Statement

For every space X, abelian group G and integer n, the singular coboundary satisfies δn+1δn=0:Cn(X;G)Cn+2(X;G).

Facts & Assumptions

[F1]

Singular cochain complex with coefficients defines δnφ=φn+1 for n0, with zero cochain groups and zero coboundaries in negative degrees.

[F2]

The singular boundary squares to zero gives k1k=0 for k1, including the low-degree boundary convention.

Proof

Given: X,G,n as in the statement.

1.1

If n0, let φCn(X;G) and cCn+2(X;Z). Associativity of composition and [F1]–[F2] give ((δn+1δn)φ)(c)=(φn+1)n+2(c)=φ(0)=0. This holds for every chain, hence the cochain is zero, for every φ. It includes n=0, where the boundary composite is 12.

F1F2
1.2

If n<0, the domain Cn is zero and δn=0 by [F1], so the composite is zero. In particular n=1 has zero first map even though the later groups may be nonzero. For empty X or G=0 all groups are zero and both calculations remain valid.

F1
2.1

Steps 1.1 and 1.2 cover every integer n. Thus the graded cochains and coboundary form a complex, with no topological restrictions on X or freeness/injectivity restriction on G. A point still has singular simplices in every nonnegative degree; step 1.1 applies to that unnormalized complex without discarding them. No representatives, bases or primitives were selected, so no AC is used.

F1step 1.1step 1.2

Depends on

Used by

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