Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

This is homework from videolecture: "Show that $(x^2-y)$ is prime but not maximal in $C[x,y]$". Linked SE pages offer to approach this by demonstrating that $C[x,y]/(x^2-y)$ is integral domain but not field. However, I feel that exhibiting an ideal strictly containing $(x^2-y)$ is easier; and $(x^2+y^2)$ seems to fit the bill. It also seems that proving that $(x^2-y)$ is prime directly is easier, because the polynomial $x^2-y$ can't be factored.

share|improve this question
5  
$(x,y)$ is a example of an ideal which contains yours. $(x^2+y^2)$, on the other hand, is not. Indeed, as you observe, $x^2-y$ is irreducible, so the ideal $(x^2-y)$ is not contained non-trivially in any principal ideal. –  Mariano Suárez-Alvarez Oct 18 '11 at 18:10
    
When you say primary, do you mean prime? Showing that $x^2 - y$ is irreducible (I assume we are working over a field) would be enough to show that the ideal is prime, but you'd have to prove that. And you would still have to show that it isn't maximal, somehow. –  Dylan Moreland Oct 18 '11 at 18:11
2  
You should edit your question and specify which ring you are working in. $\mathbb{Z}[x,y]$? $\mathbb{Q}[x,y]$? ... –  Bill Cook Oct 18 '11 at 18:17
2  
@TegiriNenashi Over $\mathbf{C}$ there are far more solutions to $x^2 + y^2 = 0$ than the one you've written down; $(1, i)$ is one example. –  Dylan Moreland Oct 18 '11 at 18:32
1  
Perhaps the time has come to gather these comments into an answer? –  Gerry Myerson Oct 19 '11 at 2:52

3 Answers 3

up vote 7 down vote accepted

It may be worth saying that since $\Bbb C$ is algebraically closed, the maximal ideals in $\Bbb C[X,Y]$ are precisely the ideals of the form $(X-\zeta_1,Y-\zeta_2)$ where $\zeta_1$ and $\zeta_2$ are arbitrary complex numbers.

Moreover, the maximal ideal $(X-\zeta_1,Y-\zeta_2)$ contains the ideal $(P(X,Y))$ for a (not necessarily irreducible) polynomial $P(X,Y)$ if and only if $P(\zeta_1,\zeta_2)=0$.

share|improve this answer

An ideal $(x^2+y) \subset \mathbb{C}[x,y]$ is prime because a polynomial $x^2+y$ is irreducible. Indeed, if we assume that $x^2+y = a \cdot b,\ a,b \in \mathbb{C}[x,y]$, then if $y$-degree of $a$ is $1$, y-degree of $b$ must be $0$. If $x$-degree of $a$ is $2$, then $x$-degree of $b$ is $0$, and $b$ is just a complex number. Otherwise, if $x$-degree of $a$ is not $2$, then $a \cdot b$ contains $x^2y$ or $xy$ terms, that are not contained in $x^2+y$.

The ideal is not maximal, because it's contained in an ideal $(x,y) \subset \mathbb{C}[x,y]$.

share|improve this answer

not////let R=Z be the set of integer number then the ideal I=(0) in Z is prime but not maximal the esey example

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.