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 and , . The rule is a well-defined biadditive map between the abelian lower-central factors.
Facts & Assumptions
Given: , ; commutators use .
For normal subgroups, (The three-subgroup containment for normal subgroups).
Product commutators are products of conjugate commutators (Commutator product identities in the fixed convention).
Proof
All are characteristic: an automorphism preserving preserves the generating commutators for ; start at . Also because . For , is the required inclusion.
Induct on , uniformly for all . Normality and the three-subgroup containment give . By symmetry and the induction hypothesis these two factors lie respectively in and . This proves the inclusion for and every .
Each is central in and therefore abelian. Replacing by with changes only by commutators of weight at least and conjugations of . The latter also change it only by . The same argument replaces by , . Thus the displayed map is independent of representatives.
Modulo 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 . This is biadditivity for the abelian factors, for all positive indices, also when any factor is trivial.
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
- Druţu–Kapovich, Lectures on Geometric Group Theory (585-page draft) (standard reference, not scraped)