Ring theory - characterizing ideals in a ring.

  • Thread starter Thread starter cosmic_tears
  • Start date Start date
  • Tags Tags
    Ring Theory
cosmic_tears
Messages
47
Reaction score
0
Hello, and thank you VERY MUCH for reading!

Homework Statement


Let p be a prime number.
Let R= Z(p) be the ring defined as followed:
Z(p) = {x/y : gcd(y,p)=1} (notice that it's not the ring {0,1,...,p-1}!)
I need to characterize all the ideals in this ring, and all of it's quotient rings...

Homework Equations


Well, not exactly equations, but just a few defintions:
I is an ideal in R if:
1) it is a subgroup of R under addition.
2) for every a in I and r in R, a*r is in I, and r*a is in I.

The Attempt at a Solution


I already proved Z(p) is a ring (I needed to do so before this question).
I also noticed that an element x/y is invertible if and only if x is not in pZ (meaning, if and only if gcd(x,p)=1).
I know that if an Ideal cosist an invertible element then it is all of R, so I'm seeking for ideals that consist of elements x/y such that gcd(x,p)=1. However, I cannot see how to find how many ideals of this type there are, and more over - how to show that there are no other types of ideals... :-\
I'll think of quotient rings after I find the ideals...


That's it. I really appreciate the fact that you are reading this, and any response is welcomed!
Thanks, bless you, you are a great help!
Tomer.
 
Physics news on Phys.org
This is, I think, called the localization of the integers at the prime p. It really consists of all rational numbers whose denominator is not divisible by p.

So, what does an element look like when it is not invertible? (I think you already know about them.) Pick a prime, say 5, and look at the elements of Z(5). Write down a couple of the non invertible elements. Find relations among them.

( I would write more but that would just hand you the answer and you should think about it because it is not very difficult.)
 
Thanks, PatF, I realized all ideals are of the form (p^k) for a whole k.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top