Determining when a mapping is an isomporphism

  • Thread starter Thread starter Bashyboy
  • Start date Start date
  • Tags Tags
    Mapping
Click For Summary

Homework Help Overview

The discussion revolves around the mapping ##\phi : \mathbb{Z}_n \rightarrow \mathbb{Z}_n## defined by ##\phi([a]_n) = [ka]_n##. Participants are exploring necessary and sufficient conditions for ##\phi## to be an isomorphism, particularly focusing on the integers ##k## and ##n##.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Some participants attempt to establish a conjecture regarding the conditions under which ##\phi## is an isomorphism, noting that if either ##n## or ##k## divides the other, then ##\phi## would not be an isomorphism.
  • Others question the implications of divisibility and the concept of invertibility in the context of the mapping, particularly regarding the group operation involved.
  • There are discussions about the nature of the group operation in ##\mathbb{Z}_n##, with some participants expressing confusion about the use of multiplication versus addition.
  • One participant suggests that the mapping is invertible under certain conditions, such as when ##k## is a prime number not dividing ##n## or when the greatest common divisor of ##k## and ##n## is 1.

Discussion Status

The discussion is ongoing, with various conjectures being proposed and examined. Participants are actively questioning assumptions and clarifying concepts related to the mapping and its properties. There is no explicit consensus yet, but some productive lines of reasoning have emerged regarding the conditions for isomorphism.

Contextual Notes

Participants note that the problem may not have introduced concepts of multiplication or multiplicative inverses, leading to confusion about their relevance to the mapping. There is also mention of the need for clarity on the group operation being used in the context of ##\mathbb{Z}_n##.

Bashyboy
Messages
1,419
Reaction score
5

Homework Statement


Suppose that ##\phi : \mathbb{Z}_n \rightarrow \mathbb{Z}_n##, where the rule is ##\phi([a]_n) = [ka]_n##. Formulate and prove a conjecture that gives necessary and sufficient conditions on the positive integers ##k## and ##n## which would guarantee that ##\phi## is an isomorphism.

Homework Equations

The Attempt at a Solution


I have already shown that is function is a homomorphism. After having worked with a few examples, I found that if either ##n## or ##k## can divide the other number, then ##\phi## would not be an isomorphism. When they say that they want me to give necessary and sufficient conditions, does that mean they want to prove that

"##\phi## is an isomorphism iff ##k## or ##n## do not divide each other?"

The only thing that troubles me is that there may be more restrictions upon ##k##.
 
Physics news on Phys.org
Consider the case n = 10 and k = 15. Neither divides the other, and yet [a]_{10} \mapsto [15a]_{10} = [5a]_{10} is not invertible, because [5]_{10} does not have a multiplicative inverse.

Consider the case k = 1 and n \geq 1. Then clearly 1 divides n, but [a]_n \mapsto [a]_n is trivially invertible.

You need to think more carefully about the circumstances in which \phi is invertible. To start with, you might consider what \phi^{-1} can possibly be.
 
pasmith said:
because ##[5]_{10}## does not have a multiplicative inverse.

Actually, the group operation is not multiplication, but the addition operator ##\oplus##, which is defined as

Edit: For someone reason, latex on physicsforums has been very problematic for me. I had the break the following up into three segments of latex code.

##[a]_n## ##\oplus## ##[a+b]_n##
 
Bashyboy said:
Actually, the group operation is not multiplication, but the addition operator ##\oplus##, which is defined as

The reason that [a]_{10} \mapsto [5]_{10}[a]_{10} is not an invertible additive homomorphism is that [5]_{10} has no multiplicative inverse.

The operation which takes [a]_n to \phi([a]_n) is not addition of k mod n, but multiplication by k mod n, and that is the operation you need to invert.
 
I don't quite understand. We have not even discussed multiplication with respect to the group ##\mathbb{Z}_n##, only the addition operator ##\oplus##. Why is ##[a]_{10}## being mapped to ##[5]_{10} [a]_{10}##?
 
Bashyboy said:
I don't quite understand. We have not even discussed multiplication with respect to the group ##\mathbb{Z}_n##, only the addition operator ##\oplus##. Why is ##[a]_{10}## being mapped to ##[5]_{10} [a]_{10}##?

This is the homomorphism you are dealing with:

Bashyboy said:

Homework Statement


Suppose that ##\phi : \mathbb{Z}_n \rightarrow \mathbb{Z}_n##, where the rule is ##\phi([a]_n) = [ka]_n##.

Note that [ka]_n = [k]_n[a]_n, because (k + pn)(a + qn) = ka + n(kq + pa + pqn).
 
pasmith said:
##(k+pn)(a+qn)=ka+n(kq+pa+pqn)##

I don't understand what this demonstrates.

This is my problem: at this point in my algebra course, it does not even make sense to write ##[k]_n [a]_n##, unless you wish to define this as ##[k]_n [a]_n := [k]_n \oplus [a]_n##, which I do not believe is your import.

So, for all intents and purposes, I do not know what it means to talk about multiplication with respect to ##\mathbb{Z}_n##, nor do I know about multiplicative inverses. My point is, I do not believe the problem requires these concepts, otherwise it would have introduced them.
 
Okay, this problem is still troubling my mind. Could someone else possibly take a look at it? My professor said I was on the right track with both of these conjectures:

##\phi## is an isomorphism iff ##k## is a prime number such that ##k \nmid n##

and

##\phi## is an isomorphism iff ##gcd(k,n) =1##.

However, I ran into difficulties with both proofs.
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K