Abstract algebra: proving an ideal is maximal, Constructing quotient rings

Rfields
Messages
3
Reaction score
0

Homework Statement


M = {(pa,b) | a, b are integers and p is prime}
Prove that M is a maximal ideal in Z x Z

Homework Equations





The Attempt at a Solution



I know that there are two ways to prove an ideal is maximal:

You can show that, in the ring R, whenever J is an ideal such that M is contained by J, then M=J or J=R.

Or you can show that the quotient ring R/M is a field.

I think it will be much easier to show that R/M is a field, but I'm not familiar with how to construct it from the given information. My understanding is that it is the set of all cosets of M (congruence classes modulo M).

Can anyone point me in the right direction? Thanks.
 
Physics news on Phys.org
I assume that p is fixed in M?

Do you know what Z/pZ is isomorphic to, for a given prime p?

Do you know how to show that ZxZ / Zx{0} is isomorphic to Z?
 
P is fixed.

I know that Z/pZ is a field, for a given prime p. Is that what you mean?

To show that ZxZ /Zx{0} is isomorphic to Z, I'd need to create a bijective function from ZxZ / Zx{0} where f(a + b) = f(a) + f(b) and f(ab)= f(a)*f(b).

Are you hinting that since p is a prime integer, Z/M must be a field?
 
Take a look at what M is, when written in the form RxS for the sets R and S. You will see that both R and S are well known sets and that should help you figure out what ZxZ/M should look like.
 
To clarify what I mean, consider that {0}xZ = {(a,b) | a = 0 and b is an integer}.
 
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