$(x^3-y^2)$ is a Prime Ideal in the Ring $R[x, y]$, $R$ is an Integral Domain.

Problems and solutions of ring theory in abstract algebra

Problem 239

Let $R$ be an integral domain. Then prove that the ideal $(x^3-y^2)$ is a prime ideal in the ring $R[x, y]$.

LoadingAdd to solve later

Sponsored Links


Consider the ring $R[t]$, where $t$ is a variable. Since $R$ is an integral domain, so is $R[t]$.
Define the function $\Psi:R[x,y] \to R[t]$ sending $x$ to $t^2$ and $y$ to $t^3$, and extend it to for any $f(x,y)\in R[x,y]$ by linearity.
Then the map $\Psi$ is a ring homomorphism.

Our goal is to show that the kernel of $\Psi$ is the ideal $(x^3-y^2)$. If this is proved, then the first isomorphism theorem implies that $R[x,y]/(x^3-y^2)$ is a subring of the integral domain $R[t]$, and thus $(x^3-y^2)$ is a prime ideal.

Therefore it suffices to show that $\ker(\Psi)=(x^3-y^2)$.
Since we have
\[\Psi(x^3-y^2)=(t^2)^3-(t^3)^2=t^6-t^6=0,\] one inclusion $(x^3-y^2) \subset \ker(\Psi)$ is clear.

To show that the other inclusion $\ker(\Psi) \subset (x^3-y^2)$, note that for any $f(x,y)\in R[x,y]$ we can write
\[f(x,y)=f_0(x)+f_1(x)y+(x^3-y^2)g(x,y), \tag{*}\] where $f_0(x), f_1(x)\in R[x]$ and $g(x,y)\in R[x,y]$.
To obtain this expression, note that we have
\[x^my^n=-(x^3-y^2)x^my^{n-2}+x^{m+3}y^{n-2}\] for integers $m$ and $n\geq 2$.

Use this relation recursively (to the second term), we can express
\[x^my^n=(x^3-y^2)p(x,y)+q_0(x)+q_1(x)y\] for some $p(x,y)\in R[x,y]$ and $q_0, q_1\in R[x]$.
Hence we obtain the expression (*).

Suppose that $f(x,y)\in \ker(\Psi)$ and $f(x,y)$ can be written as in (*).
Then we have
&=f_0(t^2)+f_1(t^2)t^3+((t^2)^3-(t^3)^2)g(t^2, t^3)\\

Note that the even terms of the polynomial $f_0(t^2)+f_1(t^2)t^3$ are $f_0(t^2)$, and the odd terms are $f_1(t^2)t^3$.
Thus, we have $f_0(t^2)=0$, and $f_1(t^2)=0$.
Equivalently, we have $f_0(x)=0$ and $f_1(x)=0$.

It follows that
\[f(x,y)=(x^3-y^2)g(x,y)\] and it is in the ideal $(x^3-y^2)$.
Thus we prove that $\ker(\Psi)=(x^3-y^2)$ as required.

LoadingAdd to solve later

Sponsored Links

More from my site

You may also like...

1 Response

  1. Sumangaladevi says:

    Very helpful. Thank you

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

More in Ring theory
Problems and solutions of ring theory in abstract algebra
Polynomial $x^4-2x-1$ is Irreducible Over the Field of Rational Numbers $\Q$

Show that the polynomial \[f(x)=x^4-2x-1\] is irreducible over the field of rational numbers $\Q$.