Homomorphism Flashcards

1
Q

What is a homomorphism?

A

Let (G, *) and (H, °) be groups. If a mapping f: G → H exists such that,
f(x * y) = f(x) ° f(y), where x, y ∈ G, then f is said to be a group homomorphism.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the kernel of a homomorphism?

A

The kernel of a homomorphism, Ker(f), is defined as:
Ker(f) = { x ∈ G: f(x) = eH}
Where G and H are groups, and eH is the identity element of the group H.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is an isomorphism?

A

Simply, it is a homomorphism that is bijective (one-to-one and onto mapping).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is a subgroup?

A

Let H be a non-empty subset of a group (G, *). If H is also a group under the same operation *, then H is said to be a subset of G. That is denoted by, H ≤ G

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is the centre of a group?

A

The centre of a group (G, *), denoted by Z(G), is a subset of elements of G that are commutative with all other elements of G under the operation *.
That is,
Z(G) = { a ∈ G: x * a = a * x for all x ∈ G}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the two-step proof for subgroups (definition)?

A

Suppose V is a nonempty subset of a group (G, *), then V is a subgroup if its elements are closed under the group operation, and there exists an inverse for every element in V.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the two-step proof for subgroups (steps)?

A
  1. Identify the defining properties (P) of the subset.
  2. Show the subset is a nonempty set by proving the identity element of G has the property (checking to see if the identity element of G is defined by P/exists under P and thus exists in the subset.)
  3. Check for closure under the binary operation.
  4. Check for closure under inverses.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Prove that the kernel of a homomorphism is a subgroup.

A
  1. Recall Ker(f) = {x ∈ G: f(x) =eH}
    f(eG) = eH by the property of homomorphism. Thus eG ∈ Ker(f) => Ker(f) is nonempty.
  2. Assume a and b ∈ Ker(f)
    => f(a) = eH, f(b) = eH
    We must show f(a * b) = eH.
    Recall f(a * b) = f(a) * f(b)
    => f(a * b) = eH * eH = eH. Thus it is closed under the group operation.
  3. We must prove that for all a ∈ Ker(f), a^-1 ∈ Ker(f). Note that since a∈G, a^-1∈G, thus it exists so we can use it in the proof.
    f(a^-1) = (f(a))^-1 by properties of homomorphism.
    Since f(a) = eH,
    f(a^-1) = (eH)^-1
    => f(a^-1) = eH. Thus a^-1∈Ker(f) for all a in ker(f).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly