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

Discussion Overview

The discussion revolves around the properties of homomorphisms between modulo groups, specifically exploring whether non-linear functions can serve as homomorphisms from \(\mathbb{Z}_{2006}\) to \(\mathbb{Z}_{3008}\). Participants examine the conditions under which such mappings can exist, focusing on linear functions and the implications of group generators.

Discussion Character

  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant questions whether non-linear functions can be homomorphisms from \(\mathbb{Z}_{2006}\) to \(\mathbb{Z}_{3008}\), noting that linear functions like \(x \rightarrow a \cdot x\) are valid.
  • Another participant clarifies that the existence of a homomorphism is dependent on the generating element of the group, stating that knowing the image of the generator allows for determining the image of all group elements, with the condition that the image of the generator must be zero.
  • A participant acknowledges a misunderstanding regarding linear functions and expresses confusion about how the restriction on the generator can help identify valid homomorphisms, suggesting that only the trivial solution \(x \rightarrow x\) seems viable.
  • One participant argues that in some cases, such as between \(\mathbb{Z}_{6}\) and \(\mathbb{Z}_{7}\), no homomorphism exists other than the trivial one, as all elements in \(\mathbb{Z}_{7}\) are of order 7, which is prime.

Areas of Agreement / Disagreement

Participants express differing views on the existence and nature of homomorphisms between the specified groups, with some asserting that only linear functions can be homomorphisms while others propose that non-linear functions may not exist at all. The discussion remains unresolved regarding the broader applicability of non-linear functions as homomorphisms.

Contextual Notes

Participants highlight limitations in understanding the implications of group generators and the conditions necessary for defining homomorphisms. There is an acknowledgment of the complexity involved in identifying valid mappings, particularly in cases involving prime orders.

raynard
Messages
9
Reaction score
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
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
2K
  • · Replies 26 ·
Replies
26
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 0 ·
Replies
0
Views
1K
  • · 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