Alphabeta Math
TheoremStatement: 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 boundary squares to zero

Statement

For every topological space X, every abelian group G, and every integer n1, n1n=0:Cn(X;G)Cn2(X;G). In degree 0, the boundary is already the zero map.

Facts & Assumptions

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

[L1]

The singular boundary is the alternating sum of affine face restrictions (The singular boundary operator).

[L2]

For i<j, the affine face maps satisfy δjδi=δiδj1 (The affine face maps satisfy the cosimplicial identities).

Proof

technique · direct
1.1

If n=0, then 0=0 by [L1], so the degree-zero boundary is already zero. If n=1 and σ:Δ1X is a singular 1-simplex, then 01σ=0(σδ0σδ1)=0, again because 0=0. Thus the claim holds in the two low degrees.

L1given
1.2

Assume n2 and let σ:ΔnX be a singular n-simplex. Expanding twice with [L1] gives n1nσ=i=0nj=0n1(1)i+jσδiδj. Reindex the terms by pairs 0j<in and 0ijn1. By [L2], the term σδiδj with j<i equals σδjδi1, but the two appearances carry opposite signs because (1)i+j=(1)j+(i1). Hence every codimension-two face occurs twice with opposite coefficients, so the whole sum is zero.

L1L2givenalgebra
2.1

Since singular simplices generate Cn(X;Z) and the coefficient version is obtained by tensor extension, steps 1.1 and 1.2 imply n1n=0 on Cn(X;G) for every n1, with degree 0 handled separately in step 1.1.

step 1.1step 1.2

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