Conjugate subgroup (source code)

= Conjugate subgroup
{title2=$gHg^{-1}$}
{wiki}

For a <subgroup> $H$ of a <group> $G$ and $g\in G$, the conjugate subgroup is the <conjugate subset>
$$
gHg^{-1}=\{ghg^{-1}:h\in H\}.
$$
It is a <subgroup> because <conjugation> is a <group automorphism>. Restricting that <group automorphism> gives a <group isomorphism> from $H$ to $gHg^{-1}$, so conjugate <subgroups> have the same <group order>. This describes the same operations after moving their reference configuration. Conjugacy of <subgroups> is an <equivalence relation>. <Abstract Algebra (second edition) by John A. Beachy and others/Structure of Groups>{ref}

For an <equilateral triangle> with <vertices of a polygon> labeled $1,2,3$ counterclockwise, its <symmetry group> is the <symmetric group> $S_3$, also the <dihedral group> of <group order> six. Let $r=(123)$ be the counterclockwise <rotation> through $120$ degrees, and let $s=(12)$ be the <reflection> fixing <vertex of a polygon> $3$. Products apply the rightmost <permutation> first. The <cyclic subgroup> $K=\langle s\rangle=\{e,(12)\}$ contains the <identity element> and one <reflection>. Relabeling a <transposition> by <conjugation> gives
$$
r(12)r^{-1}=(r(1)\ r(2))=(23),\qquad r^2(12)r^{-2}=(13).
$$
Thus the <conjugation action> moves $K$ among the three <subgroups> $\langle(12)\rangle$, $\langle(23)\rangle$, and $\langle(13)\rangle$. Geometrically, the <rotation> moves the axis of the <reflection> to the next axis. Each <reflection> fixes a different <vertex of a polygon>, although <group isomorphisms> relate all three <subgroups>.

\Image[/triangle-reflection-subgroup-conjugation-orbit.png]
{title=The <conjugation action> of a triangle <rotation> cycles three <reflection> <subgroups>}
{description=Each arrow sends a <subgroup> $L$ to $rLr^{-1}$, rather than multiplying its elements by $r$ on one side. The three-node <group orbit> has <stabilizer subgroup> $N_{S_3}(K)=K$. The <cyclic subgroup> $H=\langle r\rangle$ has a one-node <group orbit> even though <reflection> <conjugation> exchanges its two nonidentity elements.}

The <normalizer> tells when this change of reference leaves the <subgroup> unchanged. For any <group> $G$ and <subgroup> $H\leq G$, there is a <bijection>
$$
\{gN_G(H):g\in G\}\longrightarrow\{gHg^{-1}:g\in G\},\qquad gN_G(H)\longmapsto gHg^{-1}.
$$
Two choices $g,k$ give the same conjugate <subgroup> exactly when $k^{-1}g\in N_G(H)$. Consequently the <index of a subgroup> $[G:N_G(H)]$ counts the distinct conjugate <subgroups>, even for an infinite <group>. For a <finite group> the count is $|G|/|N_G(H)|$. These are <cosets>; they need not form a <quotient group>, since $N_G(H)$ need not be a <normal subgroup> of $G$. In the triangle example there are $6/2=3$ conjugate <subgroups>, while the <cyclic subgroup> $\langle r\rangle$ has only one. <Group Theory (v4.01) by James S. Milne>{ref}