2
$\begingroup$

Please critique my proof:

Let $f: G \to H$ be a group homomorphism and let $U \leqslant G.$ Show that $f^{-1}(f(U)) = U \cdot \ker(f).$

$(i) \hspace{1mm} f^{-1}(f(U)) \subseteq U \cdot \ker(f):$ Let $a \in f^{-1}(f(U)).$ Then $f(a) \in f(U) \Rightarrow$ There exists $u \in U$ such that $f(u) = f(a).$ Let $v = u^{-1} a$, then $a = u v$. This shows $v \in \ker(f)$ since $f(v) = f(u^{-1} a) = f(u^{-1}) f(a) = f(u)^{-1} f(a) = f(u)^{-1} f(u) = 1_H.$ Thus $a = uv \in U \cdot \ker(f).$

$(ii) \hspace{1mm} f^{-1}(f(U)) \supseteq U \cdot \ker(f):$ Now assume that $a \in U \cdot \ker(f).$ Then $a = uu'$ for $u \in U$ and $u' \in \ker(f).$ Thus $f(uu') = f(u)1_H = f(u) \in f(U)$ and so $uu' = a \in f^{-1}(f(U)).$ Combining $(i)$ and $(ii)$ completes the proof.

$\endgroup$
2
  • 2
    $\begingroup$ In (i) why is $a\in U$? $\endgroup$
    – scineram
    Mar 16, 2015 at 5:26
  • $\begingroup$ I think I made a mistake, now I am not sure how to continue. $\endgroup$
    – St Vincent
    Mar 16, 2015 at 6:59

1 Answer 1

1
$\begingroup$

There exists $u \in U$ such that $f(u) = f(a).$ Let $v = u^{-1} a$, then $a = u v$. $f(v) = f(u^{-1} a) = f(u^{-1}) f(a) = f(u)^{-1} f(a) = 1_H$. So $v \in \ker(f)$.

$\endgroup$
0

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .