The commutators of a generating set with a set generating one lower central factor generate the next factor
ProvedLowerCentralSeries.succ_le_closure_commutatorElementsLet be a group with lower central series , where is the commutator subgroup of with . Let generate , and let be a subset of whose image generates -- precisely, is contained in the subgroup generated by together with . Then is contained in the subgroup generated by the commutators , for and , together with ; that is, those commutators generate .
The mechanism is that is central in , so the commutator is bilinear modulo and it suffices to check the generators. The commutator is written out as a product rather than with bracket notation, and is in that order.
Three points of precision. The indexing starts at zero, and ; authors who index from one call this subgroup . The family of commutators is asymmetric -- only with and , not the other order and not commutators within or within . And the conclusion is stated as one containment, that lies in the join of the generated subgroup with ; the reverse holds automatically, since each such commutator already lies in , so the two sides are in fact equal and the commutators really do generate the factor.
Nothing here is vacuous -- taking and satisfies the hypotheses for every and -- but two degenerate cases are permitted. At the hypothesis on is automatic, and may be empty, in which case the hypotheses force and the conclusion reduces to the true statement .
import Mathlib
namespace LowerCentralSeries
theorem succ_le_closure_commutatorElements {G : Type*} [Group G] (k : ℕ) (X Y : Set G)
(hX : Subgroup.closure X = ⊤)
(hY : Y ⊆ ((⊤ : Subgroup G).lowerCentralSeries k : Set G))
(hYgen : (⊤ : Subgroup G).lowerCentralSeries k ≤
Subgroup.closure Y ⊔ (⊤ : Subgroup G).lowerCentralSeries (k + 1)) :
(⊤ : Subgroup G).lowerCentralSeries (k + 1)
≤ Subgroup.closure {g : G | ∃ x ∈ X, ∃ y ∈ Y, x * y * x⁻¹ * y⁻¹ = g}
⊔ (⊤ : Subgroup G).lowerCentralSeries (k + 2) := by
sorry
end LowerCentralSeries