Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finitely generated abelian groups have property (P)

Proved
Chou.hasPackingProperty_of_commGroup_of_fg

by dbenbenn · Sep 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

amenable-groupselementary-amenable-groupsgroup-growthgroup-theory

Every finitely generated abelian group has property (P).

Preamble
import Definitions.Def_Chou_ElementaryAmenable
import Definitions.Def_Chou_Classes
import Mathlib
Formal statement
namespace Chou

/-- p. 403: every finitely generated abelian group has property (P). -/
theorem hasPackingProperty_of_commGroup_of_fg {G : Type*} [CommGroup G] [Group.FG G] : HasPackingProperty G := by
  sorry

end Chou
Source
Chou, C., Elementary amenable groups, Illinois Journal of Mathematics 24 (1980) 396–407, https://doi.org/10.1215/ijm/1256047608, p. 403 ("A similar construction shows that every finitely generated abelian group has property (P)")
Read-back

What the Lean code literally says, in plain math · claude-fable-5-1

Read-back: finitely generated abelian groups have the packing property

The statement

Let GGG be a set carrying the structure of a commutative group (a group whose multiplication satisfies ab=baab = baab=ba for all a,b∈Ga, b \in Ga,b∈G; the group is written multiplicatively, with identity 111). Assume in addition that GGG is finitely generated: there exists a finite subset T⊆GT \subseteq GT⊆G such that the smallest subgroup of GGG containing TTT is all of GGG. (Here "smallest subgroup containing TTT" means the intersection of all subgroups of GGG that contain TTT.)

Then GGG has the following property, which the declaration calls the packing property and which unfolds as follows.

For every finite subset F⊆GF \subseteq GF⊆G, there exist two subsets S,X⊆GS, X \subseteq GS,X⊆G such that

  1. F⊆SF \subseteq SF⊆S;
  2. SSS is finite;
  3. the map
S×X⟶G,(s,x)⟼s⋅xS \times X \longrightarrow G, \qquad (s, x) \longmapsto s \cdot xS×X⟶G,(s,x)⟼s⋅x

is a bijection from the Cartesian product S×XS \times XS×X onto all of GGG.

Item 3, spelled out completely, is the conjunction of three conditions on the map μ(s,x)=s⋅x\mu(s,x) = s\cdot xμ(s,x)=s⋅x restricted to pairs (s,x)(s,x)(s,x) with s∈Ss \in Ss∈S and x∈Xx \in Xx∈X:

  • (maps into GGG) for every s∈Ss \in Ss∈S and x∈Xx \in Xx∈X, the product s⋅xs \cdot xs⋅x lies in GGG — this condition is automatically true, since every element of GGG lies in GGG;
  • (injective on S×XS \times XS×X) for all s,s′∈Ss, s' \in Ss,s′∈S and x,x′∈Xx, x' \in Xx,x′∈X, if s⋅x=s′⋅x′s \cdot x = s' \cdot x's⋅x=s′⋅x′ then (s,x)=(s′,x′)(s, x) = (s', x')(s,x)=(s′,x′), i.e. s=s′s = s's=s′ and x=x′x = x'x=x′;
  • (surjective onto GGG) every g∈Gg \in Gg∈G is of the form g=s⋅xg = s \cdot xg=s⋅x for some s∈Ss \in Ss∈S and some x∈Xx \in Xx∈X.

So item 3 says exactly: every element of GGG can be written as s⋅xs \cdot xs⋅x with s∈Ss \in Ss∈S, x∈Xx \in Xx∈X, and this representation is unique. The product is taken in the order "element of SSS on the left, element of XXX on the right"; since GGG is commutative here, the order does not change the value.

What is quantified, and how

  • GGG is universally quantified (it is an implicit parameter of the theorem) and ranges over types in an arbitrary universe. The two structural assumptions on GGG — commutative group, finitely generated — are the only hypotheses.
  • "Finitely generated" is stated for the group structure underlying the commutative-group structure: the finite generating set generates GGG as a group (closure under multiplication and inverses), not merely as a monoid.
  • Inside the conclusion, FFF is universally quantified over all subsets of GGG, with the hypothesis that FFF is finite. "Finite" means the subset is in bijection with {0,1,…,n−1}\{0, 1, \dots, n-1\}{0,1,…,n−1} for some natural number nnn; the empty set counts as finite.
  • SSS and XXX are existentially quantified (plain existence, not unique existence). They may depend on FFF. There is no finiteness requirement on XXX, and no other constraint on XXX beyond item 3.
  • The theorem asserts only that such SSS and XXX exist; it does not describe them, bound the size of SSS in terms of FFF, or claim any uniqueness.

Edge cases the quantifiers silently include

  • F=∅F = \varnothingF=∅. The empty set is finite, so the property must hold for it: some finite SSS (which may be any finite set, since ∅⊆S\varnothing \subseteq S∅⊆S trivially) and some XXX with S×X→GS \times X \to GS×X→G bijective must exist.
  • SSS and XXX cannot be empty. Item 3 requires surjectivity onto GGG, and GGG contains the identity element 111, so G≠∅G \ne \varnothingG=∅; hence the product S×XS \times XS×X must be nonempty, forcing both S≠∅S \ne \varnothingS=∅ and X≠∅X \ne \varnothingX=∅. This is a consequence of the definition, not a separate hypothesis.
  • Nothing requires 1∈S1 \in S1∈S or 1∈X1 \in X1∈X. The definition places no such condition.
  • FFF need not be a subgroup, need not contain 111, and need not be closed under anything. It is an arbitrary finite subset.
  • The trivial group G={1}G = \{1\}G={1} is a commutative group generated by the empty set, so it is within the scope of the hypotheses.
  • Every finite commutative group is finitely generated (by itself), so all finite commutative groups are in scope; so are, for example, Zn\mathbb{Z}^nZn and finite products of cyclic groups. Infinitely generated commutative groups (such as Q\mathbb{Q}Q under addition) are not covered by the hypotheses.
  • Non-commutative groups are not covered, even if finitely generated: commutativity is a hypothesis, not a conclusion.
  • The hypotheses are satisfiable (e.g. by the trivial group), so the statement is not vacuous.

Summary in one sentence

For every finitely generated commutative group GGG and every finite subset F⊆GF \subseteq GF⊆G, there is a finite set SSS with F⊆S⊆GF \subseteq S \subseteq GF⊆S⊆G and a (possibly infinite) set X⊆GX \subseteq GX⊆G such that every element of GGG is uniquely expressible as a product s⋅xs \cdot xs⋅x with s∈Ss \in Ss∈S and x∈Xx \in Xx∈X.

Human review
  • Endorsed by Shuze Chen · Sep 19, 2026

  • Endorsed by dbenbenn · Sep 19, 2026

    Confirmed by the mission captain (proposal self-audit).

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me