Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

A cyclic presentation and its five-term sequence

Example

For m1, the presentation F=ZCm=Z/mZ has kernel R=mZ, and its five-term sequence is 00mZZZ/mZ0. Thus H2(Cm;Z)=0.

Facts & Assumptions

Given: m is a positive integer; F is the free group on one generator, written additively; use the inherited DC and supplied-resolution convention.

[F1]

A free presentation gives an exact sequence with injection from H2 into R/[F,R] and the inclusion and quotient maps on abelianizations. (The free-presentation homology five-term sequence).

Verification

1.1

Every element of the free group on one generator has a unique integer exponent, so identify F with Z. Reduction modulo m is onto and has kernel mZ. All elements of F commute, hence [F,R]=0, Fab=Z, and (Cm)ab=Cm. F1 therefore gives 0H2(Cm;Z)jmZιZZ/mZ0, where ι is the actual subgroup inclusion.

F1algebra
2.1

The inclusion has zero kernel. Exactness gives imj=0, while j is injective, so H2(Cm;Z)=0. Under the isomorphism ZmZ, ama, the middle map becomes multiplication by m; its image is exactly the kernel of reduction modulo m. For m=1 this map is identity and the final quotient is zero.

step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

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