First isomorphism theorem: Difference between revisions

Latest revision as of 21:34, 10 April 2026

The first isomorphism theorem is a fundamental result in abstract algebra that describes the relationship between a homomorphism, its kernel, and its image. The theorem appears uniformly across algebraic structures such as groups, rings, and modules, and serves as a prototype for many structural results in algebra. Specifically, given a homeomorphism, the quotient of its domain by its kernel is isomorphic to its image.

Group theory

Statement

Let $\text{[math]}$ and $\text{[math]}$ be groups and $\text{[math]}$ a group homomorphism. Then,

The kernel of $\text{[math]}$ , $\text{[math]}$ is a normal subgroup of $\text{[math]}$ .
The image of $\text{[math]}$ , $\text{[math]}$ is a subgroup of $\text{[math]}$ .
$\text{[math]}$ .

Proof

Proof of 1

By definition, $\text{[math]}$ where $\text{[math]}$ is the identity of $\text{[math]}$ . $\text{[math]}$ is a subgroup of $\text{[math]}$ because:

Identity: Since $\text{[math]}$ is a homomorphism, $\text{[math]}$ . Therefore $\text{[math]}$ , implying $\text{[math]}$ is non-empty and has an identity.
Closure: Let $\text{[math]}$ , then

$\text{[math]}$

Thus $\text{[math]}$ .

Inverses: Let $\text{[math]}$ , then
$\text{[math]}$

Thus $\text{[math]}$ .

Therefore, $\text{[math]}$ is a subgroup of $\text{[math]}$ .

Let $\text{[math]}$ and $\text{[math]}$ , then

$\text{[math]}$

thus $\text{[math]}$ .

Therefore, $\text{[math]}$ is a normal subgroup.

□

Proof of 2

By definition, $\text{[math]}$ . $\text{[math]}$ is a subgroup of $\text{[math]}$ because:

Identity: Since $\text{[math]}$ is a homomorphism, $\text{[math]}$ . Therefore $\text{[math]}$ , implying $\text{[math]}$ is non-empty and has an identity.
Closure: Let $\text{[math]}$ , then by definition, there exists $\text{[math]}$ such that $\text{[math]}$ and $\text{[math]}$ . Thus

$\text{[math]}$

Thus $\text{[math]}$ .

Inverses: Let $\text{[math]}$ , and $\text{[math]}$ such that $\text{[math]}$ . Then
$\text{[math]}$

Thus $\text{[math]}$ .

Therefore, $\text{[math]}$ is a subgroup.

□

@@ Line 6: / Line 6: @@
 Let <math>G</math> and <math>H</math> be [[Group|groups]] and <math>f\colon g\to H</math> a group homomorphism. Then,
-* The kernel of <math>f</math> is a normal subgroup of <math>G</math>.
+# The kernel of <math>f</math>, <math>\ker f\trianglelefteq G</math> is a normal subgroup of <math>G</math>.
-* The image of <math>f</math> is a subgroup of <math>H</math>.
+# The image of <math>f</math>, <math>\operatorname{im}f<G</math> is a subgroup of <math>H</math>.
+# <math>G/\ker f \cong \operatorname{im} f</math>.
-* <math>G/\ker f \cong \operatorname{im} f</math> .
+=== Proof ===
+{{Proof|title=Proof of 1|proof=
+By definition, <math>\ker f=\{g\in G\mid f(g)=e_H\}</math> where <math>e_H</math> is the identity of <math>H</math>. <math>\ker f</math> is a subgroup of <math>G</math> because:
+* '''Identity''': Since <math>f</math> is a homomorphism, <math>f(e_G)=e_H</math>. Therefore <math>e_G\in \ker f</math>, implying <math>\ker f</math> is non-empty and has an identity.
+* '''Closure''': Let <math>a,b\in \ker f</math>, then
+<math display="block">f(ab)=f(a)f(b)=e_He_H=e_H.</math>
+Thus <math>ab\in \ker f</math>.
+* '''Inverses''': Let <math>a\in\ker f</math>, then <math display="block">f(a^{-1})=f(a)^{-1}=e_H^{-1}=e_H.</math>
+Thus <math>a^{-1}\in \ker f</math>.
+Therefore, <math>\ker f</math> is a subgroup of <math>G</math>.
+Let <math>g\in G</math> and <math>k\in \ker f</math>, then
+<math display="block">f\left(gkg^{-1}\right)=f(g)f(k)f\left(g^{-1}\right)=f(g)e_Hf\left(g^{-1}\right)=f(g)f\left(g^{-1}\right)=f(g)f(g)^{-1}=e_H,</math>
+thus <math>gkg^{-1}\in \ker f</math>.
+Therefore, <math>\ker f\trianglelefteq G</math> is a normal subgroup.
+}}
+{{Proof|title=Proof of 2|proof=
+By definition, <math>\operatorname{im} f=\{h\in H\mid \exists g\in G: f(g)=h\}</math>. <math>\operatorname{im} f</math> is a subgroup of <math>H</math> because:
+* '''Identity''': Since <math>f</math> is a homomorphism, <math>f(e_G)=e_H</math>. Therefore <math>e_H\in \operatorname{im} f</math>, implying <math>\operatorname{im} f</math> is non-empty and has an identity.
+* '''Closure''': Let <math>h_1,h_2\in \operatorname{im} f</math>, then by definition, there exists <math>g_1,g_2\in G</math> such that <math>f(g_1)=h_1</math> and <math>f(g_2)=h_2</math>. Thus
+<math display="block">h_1h_2=f(g_1)f(g_2)=f(g_1g_2).</math>
+Thus <math>h_1h_2\in \operatorname{im} f</math>.
+* '''Inverses''': Let <math>h\in\operatorname{im}f</math>, and <math>g\in G</math> such that <math>f(g)=h</math>. Then <math display="block">h^{-1}=\left(f(g)\right)^{-1}=f\left(g^{-1}\right).</math>
+Thus <math>h^{-1}\in \operatorname{im} f</math>.
+Therefore, <math>\operatorname{im} f< H</math> is a subgroup.
+}}