7
$\begingroup$

Let $H$ and $K$ be normal subgroups of a group $G$ such that they intersect trivially.

Why is it then the case that

$hk=kh;\;\;\;\; \forall h\in H,\;\forall k\in K?$

  • 2
    Ha. I put this on a homework assignment a few weeks ago. Not to worry, the papers have all been handed in and the solutions posted to the web.2012-05-21

3 Answers 3

14

Note that $hkh^{-1}k^{-1} = (hkh^{-1})k^{-1} \in K$, because $hkh^{-1}\in K$ (by normality of $K$) and $k^{-1}\in K$.

Also, $hkh^{-1}k^{-1} = h(kh^{-1}k^{-1})\in H$, because $kh^{-1}k^{-1}\in H$ (by normality of $H$), and $h\in H$.

So $hkh^{-1}k^{-1} \in H\cap K=\{1\}$. So $hkh^{-1}k^{-1}=1$.

Note that you don't even need $H$ and $K$ to be normal. You just need $H$ and $K$ to normalize each other, that is, $H\subseteq N_G(K)$ and $K\subseteq N_G(H)$.

10

Because $hkh^{-1}k^{-1}$ is both in $H$ and $K$.

  • 3
    Wow! you and @Arturo answered "exactly" at the same time measured with a least count of 1 second.2012-05-20
0

$H,K\vartriangleleft G\Rightarrow \left[ H,K\right] \leq H\cap K=1\Rightarrow \left[ h,k\right] =1,\forall h\in H$ and $k\in K$

  • 0
    This post has been long dead. But anyways, this is really assuming what you are trying to prove. The proof that $[H,K] \leq H \cap K$ is about as hard as the proof of the OP's question. Might as well prove this and then draw the conclusion from there.2018-08-10