Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 chain complex of a point

Example

Let ∗ be a one-point space. For each n≥0 there is exactly one singular n-simplex cn:Δn→∗, so Cn(∗;Z)≅Z[cn]. Moreover ∂0(c0)=0, and for n≥1 ∂n(cn)=(∑i=0n(−1)i)cn−1={0,n odd,cn−1,n even.

Hence H0sing(∗;Z)≅Z, all higher singular homology groups vanish, and the reduced singular homology groups are zero in every degree.

Facts & Assumptions

Given: The one-point space ∗.

[L1]

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

[L2]

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

Verification

technique · direct
1.1L2givenalgebra

Every map Δn→∗ is the same constant map cn, so each chain group is free of rank one on cn. By [L2], ∂0=0, and for n≥1 one has ∂n(cn)=∑i=0n(−1)icn−1, which is 0 for odd n and cn−1 for even n.

2.1L1step 1.1∎

Therefore ker⁡∂n=0 for even n≥2 and ker⁡∂n=Z[cn]=im⁡∂n+1 for odd n≥1, so Hnsing(∗;Z)=0 for all n>0. Also H0sing(∗;Z)≅Z[c0]≅Z. Since the augmentation of [L1] sends c0 to 1, its kernel is 0, so the reduced degree-zero group also vanishes.

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