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.
Commutator product identities in the fixed convention
Statement
Use and . Then and . Whenever the relevant commutators are central, these pairings are multiplicative in both variables and for all . Define , with .
Facts & Assumptions
Given: are elements of a group; power assertions assume the displayed commutators are central.
The commutator convention is (Subgroup commutators and the lower central series).
Proof
.
. Also .
If commutators are central, their conjugates in steps 1.1 and 1.2 are unchanged. Each variable then defines a homomorphism on any subgroup where that centrality hypothesis holds. The identity has commutator , and gives the inverse rule. Repeated multiplication gives positive powers, the identity gives exponent zero, and the inverse rule gives negative powers. Applying this in both variables yields .
Source notes
Druţu–Kapovich, Lectures on Geometric Group Theory (585-page draft), Lemma 10.25 and Notation 10.26, printed p.281. The source product identities are expanded here in the fixed convention, including zero and negative exponents.
Depends on
Used by
- Finite generation of lower-central factors Lemma
- Finite torsion and the torsion-free quotient Lemma
- Lower-central commutators add weights Lemma
- Power compression in the last lower-central term Lemma
- The three-subgroup containment for normal subgroups Lemma
- Upper-central factors of a torsion-free nilpotent group Lemma
- Weighted collection with finite-order carries Lemma
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)