Bourbaki

Exercise 17, § 7

Algebra, I

Bourbaki marks this one as harder than the rest.

a) Prove that every subgroup of a finitely generated nilpotent group is finitely generated.

(In the commutative case, reason by induction on the minimum number of generators of the group; then proceed by induction on the nilpotency class of the group.) Give an example of a finitely generated solvable group containing a subgroup which is not finitely generated. b) Prove that every finitely generated nilpotent group is finitely presented. (Write the group in the form F(X)/R, with X finite, and choose r such that R ⊃ Cr(F(X)); use a) to show that R/Cr(F(X)) is finitely generated; observe that F(X)/Cr(F(X)) is finitely presented, cf. exerc. 16.)

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-6-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.