Alphabeta Math
DefinitionDefinition: 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 Lyndon bar bicomplex

Definition

Let 1RFπG1 be a free presentation (here R denotes the normal subgroup, not a ring). Under the DC and supplied-resolution homology convention put Cq=(Bq(F))R, a left ZG-module, and Dpq=Bpright(G)ZGCq,h=dB1,v=(1)p1dC. Then Epq2=Hp(G;Hq(R;Z)) for the p-filtration, and H(TotD)=H(F;Z). The degree-one edge maps are the homomorphism R/[F,R]Fab induced by the subgroup inclusion RF and the quotient homomorphism FabGab.

Facts & Assumptions

Given: The free presentation and DC with supplied homology resolutions; normalized bars carry the vertex-deletion differential.

[F1]

Normalized right bars and finite augmented tensor comparisons compute homology (Diagonal bar coinvariants compute group homology).

[F2]

H1 is naturally abelianization and conjugation coinvariants are R/[F,R] (First integral homology and conjugation coinvariants).

[F3]

The anticommuting total complex has the displayed low-degree filtration maps (The low-degree filtration sequence of a first-quadrant bicomplex).

[F4]

A presentation gives a free group with its normal relation subgroup and quotient (Group presentation by generators and relations).

Proof

1.1

Normality of R makes left F-translation on R-orbits factor through G. A nondegenerate F-tuple has a unique form f0(1,a1,,aq); hence its R-orbit is specified by π(f0) and the relative tuple (1,a1,,aq). Thus Cq is canonically free over ZG on these relative tuples. Both differentials are well-defined, square to zero, and anticommute because the vertical sign changes when p decreases.

F1F4givenalgebra
2.1

To identify Hq(C) without choosing a transversal of R in F, note that the permutation module on any free R-set is tensor-exact. Each element of a tensor product has finite support in the orbit set. On the union of those finitely many orbits choose one representative per orbit; there it is a finite sum of regular free modules. Coordinate lifting proves exactness on that summand, and projection onto it shows injectivity is tested there too. Thus tensoring with the restriction of each Bq(F) preserves exactness even without selecting representatives of all orbits at once. The augmented complex B(F)Z is exact also after restriction to R. Form Bright(R)ZRB(F). Its exact augmented rows and columns give, by the finite elimination in F1, H(C)H(R;Z). Applying the same comparison to B(R)B(F) shows that the isomorphism is induced by the literal inclusion of R-tuples.

F1step 1.1algebra
3.1

For f in F, the maps on R-vertices rfr and rfrf1 into F are equivariant for the same conjugated R-action. The alternating prism between them, i(1)i(fr0,,fri,frif1,,frnf1), has boundary equal to their difference: off-switch faces cancel in pairs and the two surviving switch endpoints are the two maps. It preserves normalized degeneracies and descends to R-coinvariants. Hence the action on Hq(C) induced by left f is conjugation by f on Hq(R;Z). Elements of R already act trivially on C, so this is the stated G-action.

step 2.1algebra
4.1

For fixed q, the horizontal complex Bright(G)Cq has zero positive homology since C_q is free; its zero homology is (Cq)G=(Bq(F))F. The augmentation to this column induces a total homology isomorphism by the finite row elimination of F1. For fixed p, the first factor is free, so vertical homology is Bpright(G)Hq(C) (the sign does not change kernels or images). Taking horizontal homology and using step 3.1 gives exactly the asserted E2 terms. Thus the total computes H(F;Z), and F3 applies.

F1F3step 1.1step 3.1algebra
5.1

The map from E012 to total H1 sends the bar cycle (1,r), r in R, to y=(1)[(1,r)]RD01. The horizontal augmentation sends this to [(1,r)]F, which represents r in Fab. F2 identifies its domain with R/[F,R], so this edge is the homomorphism induced by the subgroup inclusion RF; it is not asserted to be injective.

F2F3step 4.1algebra
6.1

For arbitrary f in F put g=π(f) and y=(1)[(1,f)]RD01, x=(1,g1)[(1)]RD10. Balancing uses (g1)=(1)g, so hx=(1)([f]R[1]R)=vy. Thus y-x is a total cycle whose horizontal augmentation represents [f]. The vertical augmentation sends it to [(1,g1)], representing [g1]=[g] in Gab. Since the [f] generate H1, the other edge is exactly the quotient map. If g=1 then x is degenerate and zero, consistent with step 5.1.

F2F3step 4.1step 5.1algebra
7.1

Group maps of presentations act vertexwise on bars and on R-orbits, commuting with all augmentations and component maps. The constructed homology and E2 identifications, including the edge maps, are therefore natural. Empty X, trivial R, and trivial G cause no failure in the formulas; when G=1 all horizontal positive bars vanish.

step 2.1step 4.1step 5.1step 6.1algebra

Depends on

Used by

Dependency tree · two levels

15 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