Homomorphism on modulo groups

  • Thread starter raynard
  • Start date
  • Tags
    Groups
In summary, the conversation discusses the definition of a morphism from the cyclic group \mathbb{Z}2006 to \mathbb{Z}3008 and whether all linear functions will result in a homomorphism. It is noted that a homomorphism depends on the generating element of the group and that the only restriction is that the image of the generating element in \mathbb{Z}2006 must be 0. The claim that all homomorphisms will do is proven to be false with a specific example. The conversation also touches on the idea that sometimes a homomorphism may not exist except for the trivial solution mapping everything to 0.
  • #1
raynard
9
0
I was wondering, if we want to define a morphism from
[tex]\mathbb{Z}[/tex]2006 to, let's say [tex]\mathbb{Z}[/tex]3008.
Obviously, all linear functions like [tex]$ x \rightarrow a\cdot x$[/tex] will do, but are there any other functions which can result in a homomorphism?
 
Physics news on Phys.org
  • #2
Well, in the case of this cyclic group an homomorphism depends on the generating element of the group. When you have the image of your generating element you have the image of every other element of the group. The only restriction is

image_generating_element2006 = 0.

In your case the claim that all homom. will do is FALSE. Example, define

f : Z2006 -> Z3008
x |-> 20x.

Apply f to 2006 = 1 + 1 + ... + 1:

1016 = 40120 = 20 + 20 + ... + 20 [2006 times]= f(1) + f(1) + ... + f(1) [2006 times]= f(1 + 1 + ... + 1 [2006 times]) = f(2006) = f(0) = 0

CONTRADICTION
 
Last edited:
  • #3
I understand my error in believing every linair function will result in a homomorphism.
However, I don't fully understand how the restriction on a generator (gen2006 = 0) can help in finding function that do result in a morphism. The only possible combination is the trivial solution x |-> x.
 
  • #4
Well, sometimes a homomorphism doesn't even exists (except for the trivial homom. which maps everything to 0), for example, try to find a homom. between Z6 and Z7 (in which EVERY element is of order 7, as 7 is prime).
 
Last edited:
  • #5


A homomorphism is a function that preserves the algebraic structure of a group. In the case of modulo groups, the algebraic structure is the operation of addition and the preservation of this structure means that the function must preserve the addition operation.

In the case of \mathbb{Z}2006 and \mathbb{Z}3008, both groups have the same operation of addition (mod 2006 in the first group and mod 3008 in the second group). Therefore, any function that preserves the addition operation will result in a homomorphism.

Aside from linear functions, there are other functions that can result in a homomorphism between these two groups. For example, the function $f(x) = x^2$ will also preserve the addition operation and therefore, will result in a homomorphism.

In general, any function that satisfies the property $f(x+y) = f(x) + f(y)$ will result in a homomorphism between modulo groups. This is because this property ensures that the function preserves the addition operation.

In conclusion, while linear functions are the most obvious and common examples of homomorphisms between modulo groups, there are other functions that can also result in a homomorphism as long as they satisfy the property of preserving the addition operation.
 

What is a homomorphism on modulo groups?

A homomorphism on modulo groups is a function that preserves the group structure between two modulo groups. In other words, it maps elements from one group to another in a way that preserves the group's operation and identity elements.

How is a homomorphism on modulo groups different from a regular homomorphism?

A homomorphism on modulo groups is similar to a regular homomorphism in that it also preserves the group structure. However, it is specifically used for modulo groups, which have infinite elements and use modular arithmetic operations instead of regular arithmetic operations.

What is the importance of homomorphism on modulo groups in mathematics?

Homomorphism on modulo groups is important in mathematics because it allows for the study and comparison of different modulo groups. It also helps in understanding the relationship between different modulo groups and how their structures are related.

How is homomorphism on modulo groups used in cryptography?

Homomorphism on modulo groups is used in cryptography to encrypt and decrypt messages using modular arithmetic operations. This allows for secure communication and data storage, as the modulo groups used in cryptography have very large numbers that are difficult to factor.

What are some real-world applications of homomorphism on modulo groups?

Homomorphism on modulo groups has many practical applications, such as in cryptography, coding theory, and data compression. It is also used in computer graphics, error-correcting codes, and in the study of number theory. Additionally, homomorphism on modulo groups has applications in fields such as physics, chemistry, and engineering.

Similar threads

  • Linear and Abstract Algebra
Replies
1
Views
852
  • Linear and Abstract Algebra
Replies
13
Views
1K
Replies
11
Views
2K
Replies
2
Views
1K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Linear and Abstract Algebra
Replies
3
Views
1K
  • Linear and Abstract Algebra
Replies
9
Views
917
  • Linear and Abstract Algebra
Replies
11
Views
1K
  • Linear and Abstract Algebra
Replies
19
Views
1K
  • Linear and Abstract Algebra
2
Replies
52
Views
2K
Back
Top