I am wondering whether there exists an infinite group $G$ such that any two proper non-trivial subgroups are conjugate.

Using HNN extensions one can show that there are infinite groups such that any two non-trivial elements are conjugate. Also there are 2-generated groups such that any proper subgroup is of prime order and such that any two proper subgroups of the same order are conjugate, due to Olshanskii.

For the moment, it is irrelevant whether the group $G$ is finitely generated or not.

  • 4
    $\begingroup$ It is easy to check that such a group $G$ is f.g. Indeed, if $G$ is abelian, then $G$ has at most proper non-trivial subgroup and it easily follows that $G$ is cyclic of order 1, $p$, or $p^2$ for some prime $p$. Otherwise, $G$ has 2 non-commuting elements thus generating some non-abelian subgroup $H$, but also has a nontrivial cyclic subgroup $C$, so $C$ and $H$ cannot be conjugate, thus $H=G$ is generated by 2 elements (and actually by any two non-commuting elements). $\endgroup$ – YCor Sep 21 '15 at 14:46
  • 1
    $\begingroup$ What is wrong with the Ol'shanskii's group you mention? Did you just want more examples? $\endgroup$ – Paul Plummer Sep 21 '15 at 15:32
  • $\begingroup$ In Ol'shanskii's group there are proper subgroups of arbitrarily large order, in particular there are infinitely many conjugacy classes (of proper subgroups). $\endgroup$ – Jim Sep 22 '15 at 5:20
  • $\begingroup$ Ah, I thought you were refering to a Tarski monster. $\endgroup$ – Paul Plummer Sep 23 '15 at 11:34

Assume that $G$ is such a group and non-abelian. Take $x$ a non-trivial element, $H$ the group generated by $x$. It is a proper subgroup of $G$, non-trivial. By assumption any proper non-trivial subgroup is conjugate with $H$, in particular they are all abelian.

Take now $N_G(H)$ its normalizer, we know that $H\subseteq N_G(H)$. If $N_G(H)=G$ then $H$ is normal in $G$ and then $H$ is the unique proper non-trivial subgroup of $G$, clearly, this imposes that $G$ is abelian.

So $N_G(H)$ is proper, since it is non-trivial, it follows that $N_G(H)=gHg^{-1}=<gxg^{-1}>$. Since $H\subseteq N_G(H)$ we can find $k\neq 0$ such that $x=gx^kg^{-1}$. It follows from this that $g\in N_G(H)$ (since $g^{-1}xg=x^k$) (Warning, this last sentence is false).

It follows that $N_G(H)=gHg^{-1}=H$. Hence $N_G(H)=H\subseteq Z_G(H)$ since $H$ is abelian. Hence :

$$H=Z_G(H)=N_G(H) $$

Finally take $l\geq 2$, $H':=<x^l>$ and $H:=<x>$. You have :

$$H'=Z_G(H')\supseteq Z_G(H)=H\supseteq H' $$

hence $H=H'$. So you can find $k_l>0$ such that $x=x^{lk_l}$. Hence $x$ is of finite order.

This shows that any non-trivial element must be of finite order $n$.

Now because of what we wrote $x^n=1$ and there also exists $k_n$ such that $x^{k_nn}=x$ combining both, we get that $x$ is trivial. Since we have done it for any $x\in G$ we get that $G$ is trivial, which is a contradiction (we assumed $G$ to be non-abelian).

Edit :

We saw that the proof above is not correct. I think this second proof will be better, the aim is to show that for any proper non-trivial subgroup $H$ of $G$, $H=Z_G(H)$ :

Assume $G$ is not cyclic. Take $H:=<x>$ where $x\in G$ is non-trivial. It is proper ($G$ not cyclic) and not trivial. Any proper non-trivial subgroup being conjugate to this one, we see that they are all cyclic. Furthermore it is clear that the center of $G$ must be trivial.

In particular, define $H':=Z_G(H)$, since $x$ cannot be central and $H\subseteq H'$ it is both proper and non-trivial hence $H'=<y>$. Take now $H'':=Z_G(H')$ since $y$ cannot be central and $H'\subseteq H''$ it is both proper and non-trivial hence $H''=<z>$.

Now because $H\subseteq H'$ there exists $k$ such that $x=y^k$ and because $H'\subseteq H''$ there exists $k'$ such that $y=z^{k'}$. From this, it follows that $x=y^k=z^{kk'}$. Hence we see that $z\in Z_G(H)=H'$ so that $H''\subseteq Z_G(H)=H'$.

Remember now that $H'\subseteq H''$ so $H'=H''=Z_G(H')$.

We found a proper, non-trivial subgroup $H'$ of $G$ which is its own centralizer. Since they are all conjugate it is true for any proper non-trivial subgroup. Then we can do the same thing as in the proof before.

  • $\begingroup$ Thank you very much! Great answer! $\endgroup$ – Jim Sep 23 '15 at 11:13
  • $\begingroup$ I have one more question: you claim that from $x = g x^k g^{-1}$ it follows that $g \in N_G(H)$. However, to draw this conclusion one would need $H$ to be finite, right? $\endgroup$ – Jim Sep 23 '15 at 11:53
  • $\begingroup$ @Jim, since $H\subseteq gHg^{-1}$, in particular $x\in gHg^{-1}$ whence $x=gx^kg^{-1}$ now conjugate by $g^{-1}$, you have $g^{-1}xg=x^k$ so $g$ conjugates $x$ to an element of $H$. I don't think I used finiteness of $H$ (but I might be wrong, where exactly do you think I used finiteness of $H$?). $\endgroup$ – Clément Guérin Sep 23 '15 at 11:56
  • 2
    $\begingroup$ Yes, that part is OK. But $g \in N_G(H)$ means that $H = g H g^{-1}$. We do not know that $g x g^{-1} \in H$ (and in general this is not the case, e.g. consider the Baumslag Solitar groups). $\endgroup$ – Jim Sep 23 '15 at 12:04
  • 1
    $\begingroup$ I found another mistake in the proof above (in the last part of the original approach): "there exists $k_n$ such that $x^{k_n n} = x$". This would follow by letting $l = n$, but then $H' = \langle x^l \rangle$ is the trivial group. (one can also think of the case that $H$ is cyclic of prime order). Nevertheless the proof shows that any such group has to be a torsion group. $\endgroup$ – Jim Sep 30 '15 at 8:01

As indicated in the comments, the proof of Clément Guérin only shows that such a group necessarily has to be a torsion group. And in fact I found out that there are examples of infinite groups whose proper non-trivial subgroups are all conjugate. The proper reference is:

Some Applications of Graded Diagrams in Combinatorial Group Theory by Ivanov and Ol'shanskii (Groups St Andrews 1989, Vol. 2)

There, Corollary 10 on p. 289 says:

Given a prime $p \gg 1$, there exists an infinite group whose proper non-trivial subgroups are all conjugate and have order $p$.


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.