9
$\begingroup$

Question is in the title. For bonus points, construct the group $G$ such that it also has no infinite proper subgroups. (This second question relates to the Prüfer group, but that group is abelian, and clearly $G$ is nonabelian since it has nonabelian subgroups.)

Ignoring the second constraint for now, it is clear that the direct product of every finite group contains every finite group as a subgroup, but it is not a very "natural" group. Are there any examples of more common infinite groups that also happen to have every finite group as a subgroup?

$\endgroup$
  • $\begingroup$ I am pretty sure this has been asked before: did you search? $\endgroup$ – Mariano Suárez-Álvarez Jan 7 '14 at 20:51
  • 3
    $\begingroup$ @MarianoSuárez-Alvarez The second criterion, not in the title, is a bit different from most other questions. $\endgroup$ – Mario Carneiro Jan 7 '14 at 21:03
  • $\begingroup$ Have you actually looked at the other questions? $\endgroup$ – Mariano Suárez-Álvarez Jan 7 '14 at 21:05
  • 3
    $\begingroup$ @MarianoSuárez-Alvarez You don't seem to be giving links, so I will: Group where you can see all the finite subgroups. is similar, but does not consider the second constraint. $\endgroup$ – Mario Carneiro Jan 7 '14 at 21:09
  • $\begingroup$ I am trying to get you to give the links, in fact. $\endgroup$ – Mariano Suárez-Álvarez Jan 7 '14 at 21:11
7
$\begingroup$

Pick one representative for each isomorphism class of finite group —there are countably many of these. Now build the direct product of this countable family. You can also take only the symmetric groups, if you want, and there are many other variations.

The symmetric group on infinitely many letters is another example, or the restricted symmetric group on infinitely many letters (that is, the subgroup of the former of permutations which move finitely maany letters)

$\endgroup$
  • 1
    $\begingroup$ The first one is my example, but the symmetric group example is very nice. But neither one satisfies the second criterion. Is there a reason to believe that it can't be satisfied? $\endgroup$ – Mario Carneiro Jan 7 '14 at 21:04
  • $\begingroup$ I only repeated your construction to note that one can actually do it with fewer groups: take only the symmetric groups, or the $GL$s or the altenrating groups of... $\endgroup$ – Mariano Suárez-Álvarez Jan 7 '14 at 21:06

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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