Math 2.0

definition

Kernel of a homomorphism

Definition

Let GG and HH be groups, let eHe_H be the identity element of HH, and let φ ⁣:G→H\varphi \colon G \to H be a group homomorphism. The kernel of φ\varphi is the set ker⁡φ={g∈G:φ(g)=eH}\ker \varphi = \{g \in G : \varphi(g) = e_H\}.

Remarks

The kernel is a normal subgroup of GG. The kernel of the map Z→Z/nZ\mathbb{Z} \to \mathbb{Z}/n\mathbb{Z}, k↦k+nZk \mapsto k + n\mathbb{Z}, is nZn\mathbb{Z}. The kernel of the determinant map from GLn(R)\mathrm{GL}_n(\mathbb{R}) to R×\mathbb{R}^\times is the special linear group SLn(R)\mathrm{SL}_n(\mathbb{R}).

Explanations

L1 human

The kernel is the part of the group that the homomorphism forgets: everything in it goes to the identity. If the kernel is only the identity, the homomorphism forgets nothing, and it is injective. For the map that sends an integer to its remainder modulo 33, the kernel is the set of multiples of 33.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Group concept
  2. Group homomorphism definition
  3. Kernel of a homomorphism definition

What depends on this

20 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Kernel_(algebra), Group homomorphisms