Isomorphic iff potentially conjugate in finite

Statement

With one isomorphism

Suppose $G$ is a finite group and $\sigma :H\to K$ is an isomorphism between two subgroups of $G$. Then, there exists a finite group $S$ containing $G$ and an element $g\in S$ such that $gx{g}^{-1}=\sigma (x)$ for any $x\in H$.

With multiple isomorphisms

Suppose $G$ is a finite group and ${\sigma }_i:H_i\to K_i$ is a collection of isomorphisms between subgroups $H_i,K_i$ of $G$, with $i\in I$. Then, there exists a finite group $S$ containing $G$ and elements $g_i\in S$ such that $g_{i}x{g}_i^{-1}=\sigma (x)$ for any $x\in H_i$.

Related facts

• Isomorphic iff potentially conjugate: The general version for infinite groups. Note that the proof outlined in the finite case does not work directly for infinite groups, because the finite groups version uses the fact that isomorphic subgroups have the same index.

Proof

With one isomorphism

Let $S$ be the symmetric group on the set $G$ with $G$ viewed as a subgroup of $S$ via the left multiplication action (this is the embedding given by Cayley's theorem). Under this embedding, the isomorphism $\sigma :H\to K$ lifts to an inner automorphism given by conjugation by a permutation $\alpha$ constructed as follows.

The restriction of $\alpha$ to $H$ is $\sigma$. Further, pick coset representatives for $H,K$ in $G$ such that the identity element is the coset representative of the subgroups themselves. Now, define $\alpha$ as a bijection between these sets of coset representatives such that $\alpha$ sends the identity element to the identity element. Finally, for any element of the form $xh$, with $x$ a coset representative of $H$ and $h\in H$, define $\alpha (xh)=\alpha (x)\sigma (h)$.

We verify that this works. PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]

One of the people editing this page intended to fill in this information at a later stage, but hasn't gotten around to doing it yet. If you see this placeholder for a long time, file an error report at the error reporting page.

With multiple isomorphisms

Since $G$ is finite, so is the set $I$ of isomorphisms. Without loss of generality, $I=\{1,2,3,\dots ,n\}$. The rough idea is that each time we take the symmetric group on the set, we can convert one isomorphism to an inner automorphism. Thus, repeating the process $n$ times yields a finite group in which all the isomorphisms are realized as inner automorphisms.

The new finite group has order $f^n(|G|)$, where $f$ is the factorial function. This grows very rapidly with $n$ for $\left|G\right|>2$. For instance, $f^2(6)$ is $720!$ which is a number with several thousand digits.