How can I find the kernel of a homomorphism of finite groups?

In summary, the conversation discusses the map $f$ that maps the elements from group $\Bbb Z_8$ to group $\Bbb Z_4$, given by $f([k]_8) = [k]_4$. It is mentioned that $f$ is a homomorphism and the conversation delves into finding the kernel of $f$. The kernel is defined as the set of elements that map to 0, and it is shown that the kernel contains at least $[0]_8$. The conversation also briefly touches on the definition and properties of the groups $\Bbb Z_8$ and $\Bbb Z_4$.
  • #1
onie mti
51
0
i was given that Z8 to Z4 is given by
f= 0 1 2 3 4 5 6 7
0 1 2 3 0 1 2 3

where f is homomorphism. how can i find the kernal K
 
Physics news on Phys.org
  • #2
onie mti said:
i was given that Z8 to Z4 is given by
f= 0 1 2 3 4 5 6 7
0 1 2 3 0 1 2 3

where f is homomorphism. how can i find the kernal K

The kernel is the set of elements that map to 0...
 
  • #3
It would be more compact to write:

$f(k\text{ (mod }8)) = k\text{ (mod }4)$

or even more succinctly:

$f([k]_8) = [k]_4$.

Also, usually one doesn't just "declare" a map to be a homomorphism, one has to prove it. In this example that means showing:

$f([k]_8+[m]_8) = f([k]_8) + f([m]_8)$ where the addition on the left is mod 8, and the addition on the right is mod 4.

I would start by showing:

$f([k]_8 + [m]_8) = f([k+m]_8) = [k+m]_4$.

Now clearly every $k = 8t$ (every integral multiple of 8) is also a multiple of 4: $k = 4(2t)$.

This means that $f([0]_8) = [0]_4$, so we know the kernel will at least contain $[0]_8$.

Are there integral multiples of 4 that are NOT multiples of 8?

(Hint: what are odd multiples of 4 reduced mod 8? Start with:

(2n+1)(4) = 8n + 4 =...? mod 8)
 
  • #4
Deveno said:
It would be more compact to write:

$f(k\text{ (mod }8)) = k\text{ (mod }4)$

or even more succinctly:

$f([k]_8) = [k]_4$.

Also, usually one doesn't just "declare" a map to be a homomorphism, one has to prove it. In this example that means showing:

$f([k]_8+[m]_8) = f([k]_8) + f([m]_8)$ where the addition on the left is mod 8, and the addition on the right is mod 4.

I would start by showing:

$f([k]_8 + [m]_8) = f([k+m]_8) = [k+m]_4$.

Now clearly every $k = 8t$ (every integral multiple of 8) is also a multiple of 4: $k = 4(2t)$.

This means that $f([0]_8) = [0]_4$, so we know the kernel will at least contain $[0]_8$.

Are there integral multiples of 4 that are NOT multiples of 8?

(Hint: what are odd multiples of 4 reduced mod 8? Start with:

(2n+1)(4) = 8n + 4 =...? mod 8)

I do not follow from the point where you said k=8t, why are we saying that
 
  • #5
Presumably, we are dealing with the groups $\Bbb Z_8$ and $\Bbb Z_4$.

Do you recall how these groups are defined?

The reason I put brackets around the "$k$", is because the "1" (for example) in $\Bbb Z_8$ is not "the same 1" as we have in the integers.

I "tag" the brackets with a subscript, so we know "which group they came from".

So when I write $k$ (or some other letter) without the brackets, I mean the actual integer.

Here is how we create $\Bbb Z_8$:

we send the sets:

$\{...-24,-16,-8,0,8,16,24,...\} \to [0]_8$
$\{...-23,-15,-7,1,9,17,25,...\} \to [1]_8$
...
$\{8n+k: n \in \Bbb Z\} \to [k]_8$.

So if an integer $m$ is in the SET $[k]_8$ (these are COSETS of the multiples of 8, that is cosets of the subgroup $8\Bbb Z \subseteq \Bbb Z$), this means $m = 8n + k$, for some integer $n$.

The group $\Bbb Z_8$ is referred to variously as:

"The cyclic group of order 8"
"The integers modulo 8"
"The quotient group $\Bbb Z/8\Bbb Z$".

Do you have more questions?
 
  • #6
Deveno said:
Presumably, we are dealing with the groups $\Bbb Z_8$ and $\Bbb Z_4$.

Do you recall how these groups are defined?

The reason I put brackets around the "$k$", is because the "1" (for example) in $\Bbb Z_8$ is not "the same 1" as we have in the integers.

I "tag" the brackets with a subscript, so we know "which group they came from".

So when I write $k$ (or some other letter) without the brackets, I mean the actual integer.

Here is how we create $\Bbb Z_8$:

we send the sets:

$\{...-24,-16,-8,0,8,16,24,...\} \to [0]_8$
$\{...-23,-15,-7,1,9,17,25,...\} \to [1]_8$
...
$\{8n+k: n \in \Bbb Z\} \to [k]_8$.

So if an integer $m$ is in the SET $[k]_8$ (these are COSETS of the multiples of 8, that is cosets of the subgroup $8\Bbb Z \subseteq \Bbb Z$), this means $m = 8n + k$, for some integer $n$.

The group $\Bbb Z_8$ is referred to variously as:

"The cyclic group of order 8"
"The integers modulo 8"
"The quotient group $\Bbb Z/8\Bbb Z$".

Do you have more questions?
thanks a lot. :eek:
 

FAQ: How can I find the kernel of a homomorphism of finite groups?

What is a homomorphism of finite groups?

A homomorphism of finite groups is a function between two groups that preserves the group's structure. This means that the operation of the first group is mapped to the operation of the second group, and the identity element of the first group is mapped to the identity element of the second group.

How is a homomorphism different from an isomorphism?

A homomorphism only needs to preserve the group's structure, while an isomorphism must also be a bijective function. This means that an isomorphism is a one-to-one and onto function, while a homomorphism can map multiple elements to the same element.

What are some examples of homomorphisms of finite groups?

Some examples of homomorphisms of finite groups include the identity homomorphism, where every element is mapped to itself, and the trivial homomorphism, where every element is mapped to the identity element. Other examples include homomorphisms that preserve the group's operation, such as addition or multiplication.

How do homomorphisms relate to subgroups?

Homomorphisms can be used to define subgroups. If a homomorphism exists between two groups, then the image of the homomorphism, which is a subset of the second group, can be considered a subgroup of the second group. This can help to study the structure and properties of the original group.

Are there any applications of homomorphisms of finite groups?

Homomorphisms of finite groups have various applications in different fields such as cryptography, coding theory, and combinatorics. For example, in cryptography, homomorphisms are used to encrypt and decrypt messages, while in coding theory, they are used to encode and decode information. In combinatorics, homomorphisms are used to study the symmetries of objects.

Similar threads

Back
Top