Independent cyclic generators of a finitely generated abelian group
ProvedWolf.indep_gens_of_fg_commabelian-groupsgroup-theory
Every finitely generated abelian group is generated by finitely many independent cyclic subgroups: there exist and elements such that the cyclic subgroups are independent (each one meets the subgroup generated by the others trivially) and together they generate the whole group. This is the key algebraic input for Wolf's Lemma 3.7, which needs independent generating sets to control growth in the lower central series.
Preamble
import Mathlib.GroupTheory.FiniteAbelian.Basic import Mathlib.Order.SupIndep import Mathlib.Algebra.Group.Pi.Lemmas import Mathlib.Algebra.Notation.Pi.Basic import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.Group.TypeTags.Basic set_option autoImplicit false open scoped BigOperators
Formal statement
theorem Wolf.indep_gens_of_fg_comm {G : Type*} [Group G] [IsMulCommutative G] [Group.FG G] : ∃ (n : ℕ) (f : Fin n → G), iSupIndep (fun i => Subgroup.zpowers (f i)) ∧ (⨆ i, Subgroup.zpowers (f i)) = ⊤ := by sorry