Torsion length of finitely presented groups

DefinitionTorsion series#✓fully proved

For a group \(G\), the torsion series of Chiodo and Vyas is the sequence of subgroups \(\mathrm{Tor}_i(G)\) of \(G\) defined by \(\mathrm{Tor}_0(G) = 1\), the trivial subgroup, and, for each \(i\), \(\mathrm{Tor}_{i+1}(G)\) is the normal closure in \(G\) of the set of elements \(g\) such that \(g^n \in \mathrm{Tor}_i(G)\) for some integer \(n > 0\).

This is the preimage of \(\mathrm{Tor}_1(G / \mathrm{Tor}_i(G))\), the normal closure of the torsion elements of \(G / \mathrm{Tor}_i(G)\), since normal closures commute with the quotient map and \(\mathrm{Tor}_i(G)\) lies in that set.

def torsionSeries (G : Type*) [Group G] : ℕ → Subgroup G
  | 0 => ⊥
  | i + 1 => Subgroup.normalClosure {g | ∃ n : ℕ, 0 < n ∧ g ^ n ∈ torsionSeries G i}
Used by 1

DefinitionTorsion length greater than two#✓fully proved

A group \(G\) has torsion length greater than \(2\) when \(G / \mathrm{Tor}_2(G)\) is not torsion-free, where \(\mathrm{Tor}_2(G)\) is the second term of the torsion series of \(G\): some element \(g \in G\) outside \(\mathrm{Tor}_2(G)\) has a power \(g^n\) with \(n > 0\) in \(\mathrm{Tor}_2(G)\).

Then \(G / \mathrm{Tor}_1(G)\) is not torsion-free either, so neither \(1\) nor \(2\) is the torsion length of \(G\).

def TorsionLengthGtTwo (G : Type*) [Group G] : Prop :=
  ∃ g : G, g ∉ torsionSeries G 2 ∧ ∃ n : ℕ, 0 < n ∧ g ^ n ∈ torsionSeries G 2
Uses 1 · Used by 1

DefinitionKourovka Problem 19.23 (Chiodo–Vyas), finitely presented form#✓fully proved

The statement that there is a finitely presented soluble group \(G\) of torsion length greater than \(2\), that is, such that \(G / \mathrm{Tor}_2(G)\) is not torsion-free, where \(\mathrm{Tor}_2(G)\) is the second term of the torsion series of \(G\).

def existsFinitelyPresentedSolubleTorsionLengthGtTwo : Prop :=
  ∃ (G : Type) (_ : Group G), Group.IsFinitelyPresented G ∧ Group.IsSolvable G ∧
    TorsionLengthGtTwo G
Uses 1 · Used by 1

TheoremFinitely presented soluble groups of torsion length greater than two#●ready to prove

Resolved true: the Kourovka Archive answers 19.23 "Yes, such groups exist"; Leary and Minasyan (Theorem 2.14) construct polycyclic groups, which are finitely presented and soluble, of every torsion length n ≥ 1, in particular of torsion length 3. Source: E. I. Khukhro and V. D. Mazurov (eds.), Unsolved Problems in Group Theory: The Kourovka Notebook, 21st issue, arXiv:1401.0300v49 (2026), Archive of Solved Problems, Problem 19.23 (M. Chiodo, R. Vyas); resolution: I. J. Leary and A. Minasyan, A note on torsion length and torsion subgroups, J. Group Theory 26 (2023), no. 4, 741-750 (arXiv:2112.14546), Theorem 2.14: for every integer n ≥ 1 there is a polycyclic group of torsion length n (their torsion length counts G₀ = G, G_{n+1} = G_n / Tor(G_n) from 0 and agrees with the Notebook's for n ≥ 1); Kourovka Archive, Problem 19.23: Yes, such groups exist, https://arxiv.org/abs/2112.14546.

public theorem_wanted existsFinitelyPresentedSolubleTorsionLengthGtTwo_holds :
    existsFinitelyPresentedSolubleTorsionLengthGtTwo
Uses 1
3 fully proved1 ready to prove

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.