Two Minimal Prime Ideals in k[X,Y]/<XY>

  • Thread starter Thread starter Dragonfall
  • Start date Start date
  • Tags Tags
    Prime
Dragonfall
Messages
1,023
Reaction score
5

Homework Statement


Show that there are exactly two minimal prime ideals in k[X,Y]/<XY>. P is a minimal prime ideal if it is prime and every subset of P that is a prime ideal is actually P. k is a field.


The Attempt at a Solution



Prime ideals of k[X,Y] are <0> and <f> for irreducibles f. But then doesn't every ideal contain <0>? So how can there be other prime ideals?
 
Physics news on Phys.org
I think that that definition should be modified to include the word 'non-trivial' somewhere in there. How about:

P is a minimal prime ideal if it is prime and every non-trivial subset of P that is a prime ideal is actually P. k is a field.
 
Alright, but even with that, I'm still not sure how to preceed. It probably has to do with the fact that nontrivial prime ideals of k[X,Y] are generated by irreducible elements. Somehow this translates to two nontrivial minimal prime ideals in k[X,Y]/<XY>
 
I could be mistaken but I think that the idea of a correspondence between ideals in R and ideals in R/I might called for here.

Edit:

What's (xn + 1)(ym + 1) in R[x, y]/(xy)?
How does xn + ym factor?
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top