How to prove a ring (with unity) with prime number of elements is field

MathNugget

Junior Member
Joined
Feb 1, 2024
Messages
195
Say, [imath](R, +, \cdot)[/imath] is the ring (I'd like to prove this even when the operations aren't the usual sum and product, but I suppose the proofs are similar). I'll shorten the ring to R (and will mention when I talk about the set R without operations).

I searched it on google, I know (other) forums are full of proofs...unfortunately, I cannot follow up any of them.


The last one is the most elementary.
I know with Lagrange's theorem, since (R, +) is a group, and [imath]0_R, 1_R \in (R,+)[/imath], if I prove [imath]1_R\neq 0_R[/imath], then since the order of an element divides order of group, the elements of the set R would be [imath]0_R, 1_R, 1_R+1_R, ..., 1_R+...+1_R[/imath] p-1 times.

Say, [imath]0_R=1_R[/imath]. Computing [imath]a\cdot (0_R+0_R)=[/imath] both ways (sum first, or distributivity), we get [imath]a0_R=a0_R+a0_R \rightarrow 0_R=a0_R[/imath].
Then I compute [imath]1_R a=0_Ra \rightarrow a=0_R[/imath]. And [imath]a \in R[/imath] was an arbitrary element, so either the ring has just 2 elements.
If p>2, then [imath]0_R \neq 1_R[/imath].

With this, I think I roughly proved that [imath](R, +)\simeq (\mathbb{Z}_p, +)[/imath].
Seems harder to prove that the elements are invertible under multiplication...

[imath]a \cdot b=(a\cdot 1_R) \cdot (b\cdot 1_R)=(1_R+...+1_R)\cdot (1_R+...1_R)=1_R+....+1_R=r[/imath], with [imath]r \equiv ab (mod p)[/imath]. At this point, where would I go with the proof? It looks like the whole thing maps very clearly to [imath](\mathbb{Z}_p,+, \cdot)[/imath], but with all the notations, I also feel like half of the proof is circular and I used somewhere in the proof that the rings are izomorphic...
 
unfortunately, I cannot follow up any of them.
What do you mean? You can't read them? The very first link has good answers to you question.

Proving that [imath]1\neq 0[/imath] in [imath]R[/imath] is pretty straightforward by contradiction: if [imath]1 = 0[/imath] then for every [imath]x\in R: x = 1\cdot x = 0[/imath].

Personally, I think you proof is complete since you've proven ring isomorphism between [imath]R[/imath] and [imath]\mathbb Z_p[/imath].
 
What do you mean? You can't read them? The very first link has good answers to you question.
Even worse, I can read those posts, but they raise more questions 😭.

The first comment says things like:
If [imath]R[/imath] is a ring with unit [imath]1_R[/imath], then there’s a map [imath]\mathbb{Z} \rightarrow R[/imath] given by [imath]1 \rightarrow 1_R[/imath] uniquely extendend to a ring homomorphism, whose kernel must be [imath]n\mathbb{Z}[/imath] for some [imath]n\in \mathbb{N_0}[/imath].
This is basically the conclusion (the question), reformulated a little and put as a premise. Or at least, I don't know how to explain why this is so (if it's supposed to be obvious)... That's why I was trying to find a proof that uses as little theoretical results as possible, I am also working on my final project, and it's supposed to be as close to 'self-sufficient' or 'standalone', so to say, as possible.
 
This is basically the conclusion (the question), reformulated a little and put as a premise.
Why? What is missing? Can't you fill in all the details, like how to extend the homomorphism? You've pretty much done that in your post.
Personally, I like the proof which says that if a finite ring has no divisors of zero then for any non-zero [imath]a\in R[/imath] mapping [imath]x\rightarrow ax[/imath] is bijective.
 
Why? What is missing? Can't you fill in all the details, like how to extend the homomorphism? You've pretty much done that in your post.
I guess I was hoping there's plenty more needed to make the proof complete...
Personally, I like the proof which says that if a finite ring has no divisors of zero then for any non-zero [imath]a\in R[/imath] mapping [imath]x\rightarrow ax[/imath] is bijective.
What does this prove? that the group with multiplication is cyclical too?



oh, nevermind... if [imath]x\rightarrow ax[/imath], and [imath]a \neq 1[/imath], then a different element is sent to 1. and since it happens for all nonzero a, it's done...
 
I actually like your proof, and I think I managed to prove that is a bijection.
[imath]x \rightarrow ax[/imath]
the 2 sets, R and f(R) have same (finite) order. so injectivity=surjectivity=bijection (easy to prove because injection and surjection create an inequality between orders of groups, and here they're finite)

[imath]ax=ay \Leftrightarrow ax-ay=0 \Leftrightarrow a(x-y)=0\Leftrightarrow x-y=0\Leftrightarrow x=y[/imath] because there's no 0 divisors...

so then it's obvious.
 
Why? What is missing? Can't you fill in all the details, like how to extend the homomorphism? You've pretty much done that in your post.
Personally, I like the proof which says that if a finite ring has no divisors of zero then for any non-zero [imath]a\in R[/imath] mapping [imath]x\rightarrow ax[/imath] is bijective.
new problem...How would I prove the ring has no divisors of zero from what we have so far?
 
What is the definition of a ring with/without no zero divisors? Do you understand that definition?
Also, it is the forum policy to start a new thread for a new question.
The reason is that someone has to read post 7 to know that there is a new question.
 
How would I prove the ring has no divisors of zero from what we have so far
Good point! I somehow assumed that rings with units have no zero divisors, but [imath]\mathbb Z_4[/imath] provides a good counterexample :( Time to use prime order of the ring. Here is a hint: if [imath]x[/imath] is a divisor of 0 then all its multiples are divisors too.
 
Good point! I somehow assumed that rings with units have no zero divisors, but [imath]\mathbb Z_4[/imath] provides a good counterexample :( Time to use prime order of the ring. Here is a hint: if [imath]x[/imath] is a divisor of 0 then all its multiples are divisors too.
True. But as far as I know, we cannot Lagrange's theorem on a monoid (like the set of the ring, with the 2nd operation). So, we'll have to prove it is cyclical (which I assume it's what you want to do) with a different technique than for the set with the first operation (which is a group).


I'll stick to the 1+ 1+....+1 solution, even though it looks weird.

But I learned to write this: [imath]\underbrace{1+...+1}_{\text{p times}}[/imath] in Latex, so the day was fairly productive. Thanks again for help; at this pace, your name should be on my final paper too :LOL:


Funny enough though, all rings [imath](\mathbb{Z}_n, +, \cdot)[/imath] are either fields, or have 0 divisors. There's no nuance for them...
 
Last edited:
For any element [imath]x[/imath], zero divisor or not, the set of its multiples is a subgroup of [imath]\mathbb Z_p^+[/imath]. How many elements can such a subgroup have?
 
I see, you're saying, based on what we proved so far, that ab+ac=a(b+c) , so it's a subgroup with addition... (which can only be proven by the same 1+ 1 +...+1 approach).

Then it either has order 1 (aa=a, all the time, so a = 0 or 1) or p. take an element a which isn't 0 or 1, and then I guess it's accessible to prove the group is cyclical...
 
I see, you're saying, based on what we proved so far, that ab+ac=a(b+c) , so it's a subgroup with addition... (which can only be proven by the same 1+ 1 +...+1 approach).

Then it either has order 1 (aa=a, all the time, so a = 0 or 1) or p. take an element a which isn't 0 or 1, and then I guess it's accessible to prove the group is cyclical...
True. And 1 cannot be a zero divisor in a non-trivial ring.
 
Top