Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I was wondering this today, and my algebra professor didn't know the answer.

Are subgroups of finitely generated groups finitely generated?

I suppose it is necessarily true for finitely generated abelian groups, but is it true in general?

And if not, is there a simple example of a finitely generated group with a non-finitely generated subgroup?

NOTE: This question has been merged with another question, asked by an undergraduate. For an example not involving free groups, please see Andreas Caranti's answer, which was the accepted answer on the merged question.

share|cite|improve this question
Weird, I didn't know that the comments would move when the questions were merged! These are all out-of-place here, as is my answer, which I have therefore deleted. – Tara B Feb 19 '13 at 18:15
@user1729: You might want to delete your comments. – Tara B Feb 19 '13 at 18:21
@TaraB: Wilco. If you look at the other thread though, you will see that not all the comments were moved across... – user1729 Feb 19 '13 at 19:50
Like you noted, this is indeed true for finitely generated abelian groups. Put another way, this is the same as the statement that every finitely generated Z-module is Noetherian, which holds since Z is Noetherian. – Jason Juett Jul 9 at 11:33
up vote 12 down vote accepted

It is well-known that the free group $F_2$ on two generators has as a subgroup a group isomorphic to a free group on a countably infinite set of generators. See Qiaochu's example.

However a finite index subgroup of a finitely generated group is finitely generated.

share|cite|improve this answer

No. The example given on Wikipedia is that the free group $F_2$ contains a subgroup generated by $y^n x y^{-n}, n \ge 1$, which is free on countably many generators.

share|cite|improve this answer

Perhaps an elementary example can be provided by the wreath product of two copies of (the additive group of) $\mathbf{Z}$.

Take copies $G_{i}$ of $\mathbf{Z}$, for $i \in \mathbf{Z}$, and let $$ B = \coprod_{i \in \mathbf{Z}} G_{i} $$ be the direct sum (coproduct).

Now let another copy $H = \langle h \rangle$ of $\mathbf{Z}$ act on $B$ by $$ G_{i}^{h} = G_{i+1}. $$ More precisely, conjugation by $h$ takes a generator $g_{i}$ in the copy $G_{i}$ of $\mathbf{Z}$ to a generator $g_{i+1}$ of the $(i+1)$-th copy.

Then the semidirect product $G = B \rtimes H$ is generated by $g_{0}$ and $h$, but its subgroup $B$ requires an infinite number of generators.

It is easy to see what is going on. $B$ requires an infinite number of generators $g_{i}$. Now $h$ takes one of these generators by conjugation to all others.

share|cite|improve this answer
OK, turns out that this one works! I wouldn't have thought someone would know wreath products before free groups, but I guess it's understandable they might. – Tara B Feb 19 '13 at 17:15
@TaraB, thanks! I was exposed to this very construction (in the elementary terms I have tried to use above, and without any mention of the term wreath product) before I learned about free groups. The key concept is that of a semidirect product. – Andreas Caranti Feb 19 '13 at 17:21
Yes. I don't think I even encountered semidirect products until after free groups, myself, though. In fact I know I didn't, because I definitely knew about presentations by then. – Tara B Feb 19 '13 at 17:23
Note that this answer and these comments were made in a different context (this question was merged with another question asked by an undergraduate who hadn't encountered free groups). – Tara B Feb 19 '13 at 18:14

A theorem of Higman, Neumann, and Neumann says that every countable group (no matter what horrible properties it might have) can be embedded as a subgroup of a group generated by $2$ elements. Thus subgroups of finitely generated groups can be pretty much anything.

share|cite|improve this answer

One of the easiest (counter)example is in Hungerford's Algebra.

Let $G$ be the multiplicative group generated by the real matrices $$a = \left(\begin{array}{l l} 1 & 1\\ 0 & 1 \end{array}\right), b = \left(\begin{array}{l l} 2 & 0\\ 0 & 1 \end{array}\right) $$ Let $H$ be the subgroup of $G$ consisting of matrices that have $1$s on the main diagonal. Then $H$ is not finitely generated.

share|cite|improve this answer
"H have 1s" means what?why H is not finitely generated. – David Chan Jul 8 '14 at 13:02
@DavidChan It means the diagonal is (1,1) – mez Jul 8 '14 at 18:34
isn't H just generated by a? – Auburn Jul 12 at 19:20

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.