Superseded: Rosenblatt's Lemmas 4.8-4.9 without the abelian hypothesis — use Chou.fg_of_isVirtuallyPolycyclic_quotient_of_not_hasFreeSubsemigroupOfRankTwo
OpenChou.fg_of_isFinitelyPresented_quotient_of_not_hasFreeSubsemigroupOfRankTwoLet be a finitely generated group with no free subsemigroup on two generators (no pair such that distinct positive words in give distinct elements), and let be a normal subgroup of such that the quotient is finitely presented. Then is finitely generated.
This is the “no free subsemigroup” form of Milnor's Lemmas 1 and 2: Rosenblatt's Lemma 4.8 (for each , the conjugates span a finitely generated subgroup) combined with Lemma 4.9 ( is normally generated by finitely many elements), as Chou applies them in the proof of Theorem 3.2′ without the hypothesis that is abelian. The statement is not asserted in this form by either paper; it is the step Chou's induction needs.
Superseded. The same correction as for the exponentially bounded twin: Rosenblatt's Lemma 4.9 gives normal generation, not finite generation, and the assembly needs a normal form for the quotient that a finite presentation does not supply. The form Chou's proof uses is Chou.fg_of_isVirtuallyPolycyclic_quotient_of_not_hasFreeSubsemigroupOfRankTwo.
import Definitions.Def_Chou_Growth import Mathlib
namespace Chou
/-- Rosenblatt's Lemmas 4.8 and 4.9 (Trans. Amer. Math. Soc. 193 (1974), pp. 42–43), Milnor's Lemmas
1 and 2 with “no free subsemigroup on two generators” in place of “exponentially bounded”, in the
form Chou's proof of Theorem 3.2′ applies them (p. 401, “with the understanding that A doesn't have
to be abelian there”): in a finitely generated group with no free subsemigroup on two generators, a
normal subgroup with finitely presented quotient is finitely generated. -/
theorem fg_of_isFinitelyPresented_quotient_of_not_hasFreeSubsemigroupOfRankTwo {G : Type*} [Group G]
[Group.FG G] (hfree : ¬ HasFreeSubsemigroupOfRankTwo G) (N : Subgroup G) [N.Normal]
[Group.IsFinitelyPresented (G ⧸ N)] : Group.FG N := by
sorry
end Chou