Is Cubing a Permutation in Zp for Primes Equivalent to 2 Mod 3?

  • Thread starter Thread starter Hello Kitty
  • Start date Start date
  • Tags Tags
    Cubic
Hello Kitty
Messages
25
Reaction score
0
[SOLVED] cubic reciprocity?

I would like to prove the following conjecture:

If p \equiv 2\ (mod\ 3) is a prime, then the cubing function x \mapsto x^3 is a permutation of \mathbb{Z}_p.

I've tried to find a contradiction to the negation by assuming that if n \neq m\ (mod\ 3), but n^3 \equiv m^3\ (mod\ 3), then since m^3 - n^3 = (m-n)(m^2-mn+n^2), we must have (m^2-mn+n^2) \equiv 0\ (mod\ 3) to avoid a contradiction concerning zero-divisors. Now I'm stuck.
 
Physics news on Phys.org
what exactly you mean saying "the cubing function x \mapsto x^3 is a permutation of \mathbb{Z}_p"?

We know that there are 2^p permutations (sub-groups) in \mathbb{Z}_p, right?

So you mean that one of these subgroups represent a cube? If yes, is the sub-group sum or product?
 
I would have interpreted "the cubing function x \mapsto x^3is a permutation of \mathbb{Z}_p" to mean that it permutes the members of \mathbb{Z}_p- but that's so trivial, that's probably not what's meant!

03= 0, 13= 1, 23= 2 mod 3. In fact, the cubing function is just the identity on \mathbb{Z}_p!
 
3 isn't the only prime. :-p


As for the original poster... what do you know about the multiplicative structure of Z/pZ?
 
I thought "the cubing function x \mapsto x^3 is a permutation of \mathbb{Z}_p" was a pretty unambiguous statement. Maybe it would be better to say it's a "bijection \mathbb{Z}_p \rightarrow \mathbb{Z}_p".

HallsofIvy: Besides the fact that 3 is not congruent to 2 mod 3, in \mathbb{Z}_5, 2^3 \equiv 3\ (mod\ 5) so it is not the identity.

Hurkyl: It is a group of order p-1, which is of the form 3k+1. I guess the obvious fact that springs to mind is that no element can have order 3 then by Lagrange. This means no cube can be congruent to 1 mod p (except, of course, 1). So I guess this means the kernel of the cubing map is {1} ***alarm bells ringing*** actually this map is a group homomorphism so Ker={1} implies it is injective. Of course this implies it is a bijective too.
 
It can be looked at a little more algebratically: If X^3 == Y^3 Mod P, then there exists an element x/y such that (x/y)^3 == 1 Mod P, which implies 3 divides the order of the group, p-1. Thus, unless x=y, P would be of the form 3k+1. (Which is about what Hello Kitty is saying)
 
Last edited:
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top