This mission formalizes the group theory of J. A. Wolf's Growth of finitely generated solvable groups and curvature of Riemannian manifolds, J. Differential Geometry 2 (1968) 421–446 (doi:10.4310/jdg/1214428658), namely its §3 and §4. Wolf opens with the object of study: "If a group is generated by a finite subset , then one has the 'growth function' , where is the number of distinct elements of expressible as words of length on " (p. 421). Section 3 proves that a group with a finitely generated nilpotent subgroup of finite index "is of polynomial growth, and in fact "; section 4 proves that "a polycyclic group, either has a finitely generated nilpotent subgroup of finite index and thus is of polynomial growth, or has no such subgroup and is of exponential growth" (p. 421).
Applying Milnor's companion note, which is the complete mission Milnor: growth of finitely generated solvable groups on this platform, Wolf concludes "that a finitely generated solvable group, either is polycyclic and has a nilpotent subgroup of finite index and is thus of polynomial growth, or has no nilpotent subgroup of finite index and is of exponential growth" (p. 421). That is the Milnor–Wolf theorem, the goal here, and Wolf's Theorem 4.8. It prompted the question Wolf asks on p. 422, "whether every finitely generated group , which is not of exponential growth, necessarily has a nilpotent subgroup of finite index"; Grigorchuk's groups of intermediate growth (1984) answered it in the negative, and Gromov (1981) proved that polynomial growth alone does force a nilpotent subgroup of finite index.
Growth. For a finite subset of a group , the growth function counts
the elements expressible as words of length on , a word
having length (p. 426). The published MilnorWolf.growthFunction S m takes
this as the size of the ball Chou.wordBall S m, the set of products of at most factors from
. Wolf's two kinds of bound (p. 421) are polynomial growth of degree ,
, and exponential growth, with ; the
published predicates are MilnorWolf.HasPolynomialGrowthOfDegreeLE and
Chou.HasExponentialGrowth, the latter with , which is what Theorem 4.3 actually produces.
Both quantify over some finite generating set, and Wolf shows (p. 427, p. 434) that neither depends
on which one.
Growth exponents. For a finitely generated nilpotent with lower central series
, each factor
is finitely generated abelian with free part of rank ; Wolf's (3.3)
sets and . These are
MilnorWolf.growthExponentOne and MilnorWolf.growthExponentTwo.
Polycyclic groups. A solvable group is polycyclic if it satisfies condition (1) of
Proposition 4.1: "There is a normal series
with every quotient
finite or infinite cyclic" (p. 433), where a normal series, as in Kurosh, has each term normal in
the preceding one. This is MilnorWolf.IsPolycyclic. Solvable is Mathlib's
Group.IsSolvable.
The goal is Wolf's Theorem 4.8 (p. 438): "Let be a finitely generated solvable group. If has a nilpotent subgroup of finite index, then is polycyclic and of polynomial growth of degree . If does not have a nilpotent subgroup of finite index, then is of exponential growth."
The milestones are the results it rests on, in the paper's order. Section 3 climbs from two rescaling lemmas (3.4, 3.5) and the growth function of a free abelian group (3.6) through generating sets adapted to the lower central series (3.7) to the polynomial bounds for a finitely generated nilpotent group (3.2), then passes them to a group with a finite-index subgroup (3.11). Section 4 characterises polycyclic groups (4.1, whose one hard input is Hirsch's theorem, a milestone of its own) and proves the polycyclic dichotomy (4.3). Milnor's Theorem, already proved on this platform, appears as a reference milestone: it is what carries 4.3 from polycyclic to solvable, and Wolf notes on p. 437 that "J. Milnor extended the scope of Theorem 4.3 by proving [10] that a finitely generated nonpolycyclic solvable group must be of exponential growth."
Theorem 4.8 is the first growth dichotomy: within finitely generated solvable groups there is nothing between polynomial and exponential, and the polynomial side is exactly the almost nilpotent one. It is the result Gromov's theorem generalises in one direction and Grigorchuk's groups bound in the other, and the reason a group of intermediate growth can be neither solvable nor elementary amenable, which is how those groups were first placed outside both classes. Chou's Theorem 3.2, in the mission Chou: elementary amenable groups, extends exactly this statement to elementary amenable groups and cites both halves.
Section 3 also has independent value. The polynomial bounds with the explicit exponents and from the lower central series are sharper than the usual textbook statement that a finitely generated nilpotent group has polynomial growth, and the pieces along the way are reusable: the growth function of in closed form, and the fact that polynomial growth of a given degree is inherited from a finite-index subgroup.
The hard milestone is the second half of Theorem 4.3, that a polycyclic group with no nilpotent subgroup of finite index has exponential growth. Wolf proves it through Proposition 4.4, which passes to a Malcev completion and reads the eigenvalues of the induced Lie algebra automorphisms; that machinery is not in Mathlib and is not part of this mission. A route that avoids it: a polycyclic group acts on a free abelian factor of its chain by integer matrices, so either some element has an eigenvalue off the unit circle, and then the separation argument of Wolf's p. 437 applies verbatim with that factor in place of the Lie algebra, or every eigenvalue of every element lies on the unit circle, and then Kronecker's theorem, which Mathlib has, makes them all roots of unity, so a finite-index subgroup acts unipotently and is nilpotent. Wolf records in the "Added in Proof" (p. 445) that "B. Hartley recently sent me a manuscript consisting of an alternate proof that a polycyclic group without nilpotent subgroups of finite index is of exponential growth."
Theorem 3.2 is long rather than deep: the lower bound (3.8) and the upper bound (3.9), (3.10) are two inductions along the lower central series, each carrying explicit word-length bookkeeping, and both need the adapted generating sets of Lemma 3.7, in the corrected form stated here: as printed, the lemma fails when a lower-central factor has torsion. Mathlib has no polycyclic groups, so Proposition 4.1 starts from nothing; it also lacks Hirsch's theorem and P. Hall's finite presentability results, which is why Hirsch is stated here as its own milestone rather than assumed.
No new definitions: every notion is taken from the published bundles Chou_Growth and
MilnorWolf_Growth, so the statements here are directly comparable with those of the Chou and
Milnor missions. Growth is measured on closed balls, Chou.wordBall S m being the products of at
most letters from and its cardinality, finite because is a
Finset. "Not of exponential growth" is the negation of an existential, so it is a statement about
every finite generating set.
Conditions (8) to (11) of Proposition 4.1, Proposition 4.4 and the Lie-theoretic apparatus of §4, and the Riemannian geometry of §2, §5 and §6, are outside this mission; Proposition 4.1 is stated here with its first seven conditions, which are the ones §4 uses. Hirsch's theorem is cited, not proved, by Wolf, and appears as a milestone under its own source (Proc. London Math. Soc. 44 (1938) 53–60) rather than as an omission. Cheeger's and Hartley's sharpenings, recorded in Wolf's "Added in Proof", are not included.
No hypothesis is vacuous: the free abelian groups witness Proposition 3.6 and Theorem 3.2, a polycyclic group with no nilpotent subgroup of finite index exists (the semidirect product for a hyperbolic , which is Wolf's own example of the exponential case), and the lamplighter group is finitely generated solvable and not polycyclic, so Theorem 4.8's second alternative is not empty either. Contributions welcome: proofs of any milestone, and the general library results they need, such as polycyclic groups and Hirsch's theorem.
namespace Wolf
theorem growth_dichotomy_of_isSolvable_of_fg {Γ : Type*} [Group Γ] [Group.FG Γ]
[Group.IsSolvable Γ] :
(∀ Δ : Subgroup Γ, Group.IsNilpotent Δ → Δ.FiniteIndex →
MilnorWolf.IsPolycyclic Γ ∧
MilnorWolf.HasPolynomialGrowthOfDegreeLE Γ (MilnorWolf.growthExponentTwo Δ)) ∧
((¬ ∃ Δ : Subgroup Γ, Group.IsNilpotent Δ ∧ Δ.FiniteIndex) →
Chou.HasExponentialGrowth Γ) := by
sorry
end Wolf
Let be a finitely generated solvable group. If has a nilpotent subgroup of finite index, then is polycyclic and has polynomial growth of degree . If has no nilpotent subgroup of finite index, then has exponential growth.
No open leaves. Every sub-goal is proved or awaiting decomposition.