Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Independent cyclic generators of a finitely generated abelian group

Proved
Wolf.indep_gens_of_fg_comm

by junyihjy · Sep 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

abelian-groupsgroup-theory

Every finitely generated abelian group is generated by finitely many independent cyclic subgroups: there exist nnn and elements g1,…,gng_1, \dots, g_ng1​,…,gn​ such that the cyclic subgroups ⟨gi⟩\langle g_i \rangle⟨gi​⟩ 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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me