Let $G$ be a group, $H\subseteq G$ a subgroup and $a\in G$ an element of the group. Is it possible that $aHa^{-1} \subset H$, but $aHa^{-1} \neq H$?

If $H$ has finite index or finite order, this is not possible.

  • 7
    $\begingroup$ Yes, it's possible. I gave an example here. $\endgroup$ Feb 10, 2012 at 17:37
  • 6
    $\begingroup$ And it's not a stupid question! $\endgroup$
    – Derek Holt
    Feb 11, 2012 at 5:51
  • $\begingroup$ I believe that this post should be re-opened. See here. Basically, there is nowhere to post an answer to this question. $\endgroup$
    – user1729
    Jun 18, 2013 at 9:10
  • $\begingroup$ possible duplicate of Example of a subgroup for normality $\endgroup$ Jun 18, 2013 at 16:28
  • 1
    $\begingroup$ @user1729: Yes I found that out when it was too late (although I think one could defend that being duplicates is a symmetric relation, and in any case the older question is not always the better formulated although that was not an argument for me here). I cannot unvote, though I could vote as well to close that one as a duplicate of this one... $\endgroup$ Jun 18, 2013 at 16:37

4 Answers 4


Consider the group of matrices $$G=\left\{ \begin{bmatrix} x & y \\ 0 & 1 \end{bmatrix} : x \in \mathbb{Q}^{\times},y \in \mathbb{Q} \right\} = \operatorname{AGL}(1,\mathbb{Q}) $$ and its subgroup $$H=\left\{ \begin{bmatrix} 1 & y \\ 0 & 1 \end{bmatrix} : y \in \mathbb{Z} \right\} \cong \mathbb{Z}$$ and of course the single element $$a=\begin{bmatrix} 2 & 0 \\ 0 & 1 \end{bmatrix}$$ A direct calculation gives $$aHa^{-1} = \left\{ \begin{bmatrix} 1 & 2y \\ 0 & 1 \end{bmatrix} : y \in \mathbb{Z} \right\} < H$$ is a proper subgroup of H.

Similar issues showed up in this question.

  • 3
    $\begingroup$ And I gave the exact same example here... (-: $\endgroup$ Feb 10, 2012 at 17:42

First of all, the group $G$ has to be non-abelian. Otherwise any subgroup is normal and $a^{-1}Ha = H$ for each $a \in G$. You also need the subgroup $H$ (and thus $G$) to be infinite as you mentioned.

I'll give a different example. Let $G = S_{\mathbb{Z}}$, the group of bijections from $\mathbb{Z}$ to $\mathbb{Z}$.

For the subgroup, let $H = \{f \in G \mid f(x) = x \text{ for each } x \leq 0 \}$. Define the map $\sigma \in G$ by $\sigma(x) = x + 1$ for every $x \in \mathbb{Z}$.

It is not difficult to show that $\sigma H\sigma^{-1} \subseteq H$. Since $\sigma f \sigma^{-1}(1) = \sigma(f(0)) = \sigma(0) = 1$ for any $f \in H$, we notice that $\sigma H \sigma^{-1}$ contains only maps that fix $1$. Thus $\sigma H \sigma^{-1}$ cannot be all of $H$.

  • $\begingroup$ I like this example, thanks. $\endgroup$
    – Sasha
    Feb 11, 2012 at 8:10
  • $\begingroup$ Could you explain me why is it necessary for the subgroup H to be infinite? $\endgroup$ Oct 23, 2020 at 9:29
  • 1
    $\begingroup$ @CarlosMendes: Because $H$ and $a^{-1}Ha$ have the same number of elements. $\endgroup$ Oct 23, 2020 at 14:10

Let $G=\langle a,t;t^{-1}at=a^2\rangle$ and take $H=\langle a\rangle$. Noting that $\langle a^2\rangle\lneq\langle a\rangle$, clearly $t^{-1}H t\lneq H$. So this works.

If you are not comfortable with presentations, then here $G$ is actually just linear functions $f: \mathbb{R}\rightarrow\mathbb{R}$ generated by the function $x\mapsto x+1$ (which corresponds to the generator $a$) and the function $x\mapsto 2\cdot x$. The elements of $G$ then consist of all functions of the form $f(x)=2n\cdot x+m/2^k$. Then, $$t^{-1}at(x)=t^{-1}a(2x)=t^{-1}(2(x+1))=t^{-1}(2x+2)=x+2=a^2(x)$$ as required.

The group above is what is called a Baumslag-Solitar group. In general these groups are quite nasty, but this one is actually very nice (for example, it is metabelian and residually finite). In fact, we can replace the $2$ in the presentation with any non-zero integer and we get the same nice properties, and the same stuff happens which I have just outlined. Indeed, if the $2$ is replaced with an $i$, then you get a similar pair of linear functions. If I recall correctly, the function corresponding to $a$ is still $x\mapsto x+1$, but now $t$ becomes $x\mapsto i\cdot x$. If you want more details, then look up the book Groups, Graphs and Trees by John Meier.

Now, Baumslag-Solitar groups are what are called HNN-extensions of the infinite cyclic group $\mathbb{Z}$. If $H$ is some group which contains two isomorphic subgroups, $A$ and $B$ say with isomorphism $\phi: A\mapsto B$, then you can create a new group $G$ by using a stable letter to induce the isomorphism $\phi$. That is, $$G=\langle H, t; t^{-1}At=A\phi\rangle.$$ It is a theorem that $H$ embeds into $G$ in the natural way. My point? Well, if $H$ contains a pair of isomorphic subgroups $A$ and $B$ such that $A<B$ then you can use an HNN-extension to construct a group with the property we are discussing. Indeed, if $A<B=H$ (so $H$ contains a proper subgroup isomorphic to itself) then you can get a nice example of what is going on here. If $B=H$ then this is called an ascending HNN-extension. The Baumslag-Solitar examples above are ascending HNN-extensions of the infinite cyclic group.

Another example is as follows: all subgroups of a free group are free, so the group $$\langle a, b, t; a^t=ab, b^t=ba\rangle$$ is an example of what we are talking about.

HNN-extensions have a geometric visualisation. Take the infinite tree where every vertex has incoming edges labelled by the cosets $H/A=\{hA: h\in H\}$ and outgoing edges labelled by the cosets $H/B$, where $B=A\phi$. Then the group $G=\langle H, t; A^t=A\phi\rangle$ acts on this tree where $H$ fixes some vertex and acts on the incoming and outgoing edges by acting on the labels as left multiplication, while $t$ moves every vertex along the outgoing edge with label $H(=1H)$, the edge labelled by the coset containing the identity. This means that these examples have a similar flavour to an answer of Marc van Leeuwen to an identical question.

Moral: There are lots of examples of groups with subgroups having this property!

  • $\begingroup$ Typo in first line. This is the same example Arturo and I gave :-) $\endgroup$ Jun 18, 2013 at 15:40
  • $\begingroup$ @JackSchmidt I was pretty positive that it was, but I also wanted to get the presentation in there. Because it is obvious if you think about this using presentations! (Actually, I will add in a bit about HNN-extensions which will make it more different) $\endgroup$
    – user1729
    Jun 18, 2013 at 15:42
  • $\begingroup$ In case this is for your own studies: I think your $G$ is precisely $\operatorname{AGL}(1,\mathbb{Z}[\tfrac12])$. The A stands for “affine” and the matrices are a nice way to represent $z \mapsto xz+y$. The $y$s come from an abelian group, and the $x$s from its automorphism group. AGL(n,R) for a positive integer n and ring R takes the abelian group to be $R^n$ and the automorphism group to be those automorphisms that are R-linear (so invertible $n\times n$ matrices over $R$). The B-S group with "i" is AGL(1,Z[1/i]). $\endgroup$ Jun 18, 2013 at 15:49
  • $\begingroup$ Looks good (+1) :-) $\endgroup$ Jun 18, 2013 at 16:07
  • $\begingroup$ @JackSchmidt This isn't for my studies, but I appreciate your comments none-the-less. Are we thinking of $G$ as and action of $\mathbb{Z}[\frac{1}{2}]$ as a $\mathbb{Z}$-module, and $\mathbb{Z}[\frac{1}{2}]$ is the derived subgroup of $G$?...... $\endgroup$
    – user1729
    Jun 18, 2013 at 16:07

This is a repost of my answer to another incarnation of this question (An example of a group, a subgroup and an element, satisfying a given condition.). I will delete the answer from there and just leave it here since it seems better to have all answers gathered in one place.

Here is a general way to construct such groups and elements:

Let $X$ be a set with $X = Y\cup Z \cup W$, such that $Y$, $Z$ and $W$ are pairwise disjoint, and such that $|X| = |Y| = |Y\cup Z| = |W|$.

Fix a bijection $\varphi: Y\cup Z\to Y$ and a bijection $\psi: W\to Z\cup W$.

Define a new bijection $\chi: X\to X$ by $\chi(x) = \varphi(x)$ for $x\in Y\cup Z$ and $\chi(x) = \psi(x)$ for $x\in W$.

Let $H$ be the subgroup of the group of bijections from $X$ to $X$ consisting of those elements that fix everything in $Y$.

Now it is easy to check that $\chi^{-1}H\chi$ is the subgroup consisting of those elements that fix everything in $Y\cup Z$, which is a strictly smaller subgroup than $H$.

The very nice example given by Mikko Korhonen is a special case of this, with $X = \mathbb{Z}$, $Y$ the set of non-positive integers, $Z = \{1\}$ and $W$ the set of integers strictly greater than $1$.


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.