Proving Ring Homomorphism of \phi: Zp \rightarrow Zp

  • Thread starter Thread starter phyguy321
  • Start date Start date
  • Tags Tags
    Ring
Click For Summary

Homework Help Overview

The discussion revolves around proving that the function \(\phi : \mathbb{Z}_p \rightarrow \mathbb{Z}_p\), defined by \(\phi(a) = a^p\), is a ring homomorphism. Participants are exploring the necessary properties and conditions for this proof, particularly in the context of modular arithmetic with prime \(p\).

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss showing that \(\phi(a) + \phi(b) = \phi(a + b)\) and \(\phi(ab) = \phi(a)\phi(b)\) under modulo \(p\). There is a suggestion to use the binomial theorem for the first equality. Some participants question whether \(p\) is prime and how that affects the proof.

Discussion Status

The discussion is active, with participants attempting to clarify the properties of modular arithmetic and the implications of \(p\) being prime. Some guidance has been provided regarding the use of the binomial theorem, but there is no explicit consensus on the proof's direction yet.

Contextual Notes

Participants note that the properties being discussed are generally true regardless of whether \(p\) is prime, but the specific proof requires consideration of \(p\) as prime. There is an emphasis on the need to prove certain equalities under these conditions.

phyguy321
Messages
45
Reaction score
0

Homework Statement


Prove that \phi : Zp \rightarrow Zp,
\phi (a) = a p is a ring homomorphism, find the ker \phi


Homework Equations





The Attempt at a Solution


So show that a _{p} + b _{p} = (a + b)p?
and (ab)p = (ap)(bp)?
 
Last edited:
Physics news on Phys.org
Yes, show those equalities mod p. The second is easy. For the first think about the binomial theorem. Is p supposed to be a prime?
 
p is prime.
so show a mod p + b mod p = (a+b) mod p
and (ab) mod p = (a mod p)*(b mod p)
how do i do that?
 
phyguy321 said:
p is prime.
so show a mod p + b mod p = (a+b) mod p
and (ab) mod p = (a mod p)*(b mod p)
how do i do that?

Those are always true whether p is prime or not. You must have already proved them. Your problem is to prove (a+b)^b mod p=(a+b) mod p when p is prime. I told you how to do that. Use the binomial theorem on (a+b)^p.
 

Similar threads

Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
9
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 19 ·
Replies
19
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
7K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K