Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4.12, linear-algebra half: if every eigenvalue of every conjugation lies on the unit circle then the group is almost nilpotent

Open
Rosenblatt.isVirtuallyNilpotent_of_isPolycyclic_of_isNilpotent_quotient_of_forall_eigenvalue_norm_eq_one

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

group-growthgroup-theorynilpotent-groupspolycyclic-groupssolvable-groups

Let Γ\GammaΓ be a polycyclic group with a normal subgroup AAA carrying an isomorphism A≅ZkA \cong \mathbb{Z}^kA≅Zk, such that Γ/A\Gamma/AΓ/A is nilpotent. Suppose given, for each g∈Γg \in \Gammag∈Γ, an integer k×kk \times kk×k matrix TgT_gTg​ representing conjugation by ggg in those coordinates:

g⋅ι(z)⋅g−1=ι(Tgz)for all z∈Zk,g \cdot \iota(z) \cdot g^{-1} = \iota(T_g z) \qquad\text{for all } z \in \mathbb{Z}^k,g⋅ι(z)⋅g−1=ι(Tg​z)for all z∈Zk,

where ι\iotaι is the isomorphism Zk→A≤Γ\mathbb{Z}^k \to A \le \GammaZk→A≤Γ. If every complex eigenvalue of every TgT_gTg​ has modulus 111, then Γ\GammaΓ is almost nilpotent.

Reading the pieces. Zk\mathbb{Z}^kZk appears as Multiplicative (Fin k → ℤ), the additive group written multiplicatively. Matrices act on column vectors from the left. The eigenvalue condition is quantified over every group element, every complex number and every nonzero complex vector, and the norm is that of a scalar — the modulus of the eigenvalue — not a matrix norm. "Almost nilpotent" is Mathlib's Group.IsVirtuallyNilpotent: a nilpotent subgroup of finite index, not required to be normal.

What the conjugation hypothesis forces. Because it is asserted for every ggg and every zzz, it pins conjugation in both directions and makes the family g↦Tgg \mapsto T_gg↦Tg​ a group homomorphism Γ→GLk(Z)\Gamma \to GL_k(\mathbb{Z})Γ→GLk​(Z): one gets T1=IT_1 = IT1​=I, Tg−1=Tg−1T_{g^{-1}} = T_g^{-1}Tg−1​=Tg−1​ and det⁡Tg=±1\det T_g = \pm 1detTg​=±1 for free. None of that has to be assumed.

Redundancy and degeneracy, stated because they are real. The normality of AAA is mathematically redundant — it follows from the conjugation hypothesis — but it is retained because the nilpotency hypothesis on Γ/A\Gamma/AΓ/A cannot even be stated without it. The polycyclic hypothesis is not redundant: given the others it amounts to Γ\GammaΓ being finitely generated, and without it the statement fails (take Q\mathbb{Q}Q written multiplicatively with AAA the subgroup generated by one element). The only degenerate rank is k=0k = 0k=0, where there is no nonzero vector and AAA is forced to be trivial.

The hypotheses are satisfiable, and not only in abelian examples: the infinite dihedral group with AAA its subgroup of translations and Tg=(±1)T_g = (\pm 1)Tg​=(±1) satisfies all of them, with a nilpotent quotient of order two.

Preamble
import Definitions.Def_MilnorWolf_Growth
import Mathlib
Formal statement
namespace Rosenblatt

open scoped Matrix

theorem isVirtuallyNilpotent_of_isPolycyclic_of_isNilpotent_quotient_of_forall_eigenvalue_norm_eq_one
    {G : Type*} [Group G] {k : ℕ} (hpoly : MilnorWolf.IsPolycyclic G)
    (A : Subgroup G) [A.Normal] (e : A ≃* Multiplicative (Fin k → ℤ))
    (T : G → Matrix (Fin k) (Fin k) ℤ)
    (hT : ∀ (g : G) (z : Fin k → ℤ),
      g * ((e.symm (Multiplicative.ofAdd z) : A) : G) * g⁻¹
        = ((e.symm (Multiplicative.ofAdd (T g *ᵥ z)) : A) : G))
    (hnil : Group.IsNilpotent (G ⧸ A))
    (heig : ∀ (g : G) (φ : ℂ) (v : Fin k → ℂ), v ≠ 0 →
      ((T g).map (fun z : ℤ => (z : ℂ))) *ᵥ v = φ • v → ‖φ‖ = 1) :
    Group.IsVirtuallyNilpotent G := by
  sorry

end Rosenblatt
Source
Rosenblatt, J. M., Invariant measures and growth conditions, Transactions of the American Mathematical Society 193 (1974) 33–53, https://doi.org/10.1090/S0002-9947-1974-0342955-9, Theorem 4.12, pp. 48-49, the part of the proof after Theorem 4.17 has been applied

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