Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

The free-presentation homology five-term sequence

Statement

For a free presentation 1RFG1 there is a natural exact sequence 0H2(G;Z)d2R/[F,R]FabGab0. The last two nonzero arrows are induced by inclusion and quotient; d2 is the filtration transgression defined by hx=vy[hy]. Retain DC and supplied-resolution homology conventions.

Facts & Assumptions

Given: The free presentation and the stated homology conventions.

[F1]

Total H2 vanishes and the low-degree total and E2 terms have the stated group interpretations (Free-presentation total homology and its degree-one edges).

[F2]

H2(T) to E20 to E01 to H1(T) to E10 to zero is naturally exact (The low-degree filtration sequence of a first-quadrant bicomplex).

[F3]

The free-presentation bicomplex has anticommuting component differentials h and v with the stated total complex and edge maps (The free-presentation Lyndon bar bicomplex).

Proof

1.1

Apply F2 to the first-quadrant free-presentation bicomplex. Substitute H2(T)=0, E202=H2(G;Z), E012=R/[F,R], H1(T)=Fab and E102=Gab from F1. This identifies the groups in the displayed sequence and supplies exactness at the last three nonzero terms; the next two steps define the first arrow by the printed representative formula and prove the two adjacent exactness claims directly.

F1F2given
1.2

In the bicomplex of [F3], represent a class in E202 by xD20 with hx=vy for some yD11, and define d2[x]=[hy]E012. This is a vertical cycle because vhy=hvy=h2x=0. Replacing y by another lift changes hy by the horizontal boundary of a vertical cycle. Replacing x by x+vt+hu, with tD21 and uD30, permits the compatible replacement y+ht and leaves hy unchanged. Thus the displayed formula is well-defined.

F3algebra
2.1

This d2 is injective here. If [hy]=0 in E012, write hy=ha+vb for a vertical cycle aD11 and bD02. Then (x,ya,b) is a total 2-cycle mapping to [x]. Since H2(T)=0 by [F1], its class and hence [x] vanish. Moreover the edge map j:E012H1(T) sends a vertical cycle z to the total cycle (0,z). The equation jd2[x]=0 follows from (0,hy)=d(x+y). Conversely, if j[z]=0, write (0,z)=d(x+y+b) with xD20, yD11, and bD02. Its components give hx=vy and z=hy+vb, hence [z]=d2[x]. This proves exactness at the first two nonzero terms for the stated representative formula; [F2] supplies exactness at the remaining terms.

F1F2F3step 1.2algebra
3.1

The edge computations in F1 identify the next arrows with r mapped into Fab and f mapped to its quotient class. All constructions in steps 1.2–2.1 commute with the vertexwise maps induced by maps of presentations, so the sequence and the displayed transgression are natural. No terminal surjectivity beyond the printed Gab0 is needed. For R=1 the sequence reduces to zero H2 of F and the identity of its abelianization; for G=1 it reduces to the identity FabFab.

F1F2F3step 1.1step 1.2step 2.1algebra

Depends on

Used by

Dependency tree · two levels

9 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