Are Non-linear Functions Also Homomorphisms Between Modulo Groups?

  • Context: Graduate 
  • Thread starter Thread starter raynard
  • Start date Start date
  • Tags Tags
    Groups
Click For Summary
SUMMARY

This discussion addresses the conditions under which non-linear functions can serve as homomorphisms between modulo groups, specifically from \(\mathbb{Z}_{2006}\) to \(\mathbb{Z}_{3008}\). It is established that while linear functions of the form \(f(x) = a \cdot x\) qualify as homomorphisms, not all functions meet this criterion. The key restriction identified is that the image of the generating element must equal zero, which limits the potential for non-linear homomorphisms. An example is provided where the function \(f(x) = 20x\) leads to a contradiction, reinforcing the need for careful consideration of group properties.

PREREQUISITES
  • Understanding of cyclic groups and their properties
  • Familiarity with homomorphisms in group theory
  • Knowledge of modulo arithmetic and its applications
  • Basic concepts of linear functions in mathematics
NEXT STEPS
  • Study the properties of cyclic groups in depth
  • Explore the concept of homomorphisms in greater detail
  • Investigate the implications of generating elements in group theory
  • Learn about the structure of groups with prime orders, such as \(\mathbb{Z}_p\)
USEFUL FOR

Mathematicians, students of abstract algebra, and anyone interested in the properties of group homomorphisms and cyclic groups.

raynard
Messages
9
Reaction score
0
I was wondering, if we want to define a morphism from
\mathbb{Z}2006 to, let's say \mathbb{Z}3008.
Obviously, all linear functions like $ x \rightarrow a\cdot x$ will do, but are there any other functions which can result in a homomorphism?
 
Physics news on Phys.org
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:
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.
 
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:

Similar threads

  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 26 ·
Replies
26
Views
992
  • · Replies 1 ·
Replies
1
Views
662
  • · Replies 0 ·
Replies
0
Views
969
  • · Replies 3 ·
Replies
3
Views
1K
Replies
2
Views
2K
  • · Replies 23 ·
Replies
23
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
Replies
4
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K