Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Lower-central commutators add weights

Statement

For every group G and i,j1, [γi(G),γj(G)]γi+j(G). The rule (xγi+1,yγj+1)[x,y]γi+j+1 is a well-defined biadditive map between the abelian lower-central factors.

Facts & Assumptions

Given: γ1=G, γi+1=[G,γi]; commutators use xyx1y1.

[F1]

For normal subgroups, [[A,B],C][[B,C],A][[C,A],B] (The three-subgroup containment for normal subgroups).

[F2]

Product commutators are products of conjugate commutators (Commutator product identities in the fixed convention).

Proof

1.1

All γi are characteristic: an automorphism preserving γi preserves the generating commutators for [G,γi]; start at G. Also [U,V]=[V,U] because [u,v]1=[v,u]. For i=1, [G,γj]=γj+1 is the required inclusion.

F2given
2.1

Induct on i, uniformly for all j1. Normality and the three-subgroup containment give [γi+1,γj][γj+1,γi][[γj,γi],G]. By symmetry and the induction hypothesis these two factors lie respectively in γi+j+1 and [γi+j,G]=γi+j+1. This proves the inclusion for i+1 and every j.

F1step 1.1
3.1

Each γi/γi+1 is central in G/γi+1 and therefore abelian. Replacing xγi by xu with uγi+1 changes [x,y] only by commutators of weight at least i+j+1 and conjugations of [x,y]. The latter also change it only by [G,γi+j]γi+j+1. The same argument replaces y by yv, vγj+1. Thus the displayed map is independent of representatives.

F2step 2.1
4.1

Modulo γi+j+1 the conjugations in both product identities disappear, so the pairing sends a product in either input to the product of its values. Identity inputs give identity output; inverses give inverse outputs by applying the product rule to xx1. This is biadditivity for the abelian factors, for all positive indices, also when any factor is trivial.

F2step 3.1

Source notes

Druţu–Kapovich, Lectures on Geometric Group Theory (585-page draft), Proposition 10.45, printed p.286, with Lemma 10.25. Uniform induction follows draft Proposition 10.45. Representative independence and negative-input rules are derived explicitly.

Depends on

Used by

Dependency tree · two levels

3 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