Mathematics Asked on December 15, 2021
I know that $(0)$, $(x-a,y-b)$ for $(a,b)inmathbb{C}^2$ and $(f(x,y))$ for $f(x,y)$ irreducible in $mathbb{C}[x,y]$ are all prime ideals in $mathbb{C}[x,y]$.
What I’d like to understand is why they are the only prime ideals. In particular, I’d like to know why the following outline of a proof is valid (which comes from Vakil’s algebraic geometry notes): Let $P$ be a prime ideal that is not principal. "Show you can find $f(x,y),g(x,y)in P$ with no common factor. By considering the Euclidean algorithm in the Euclidean domain $mathbb{C}(x)[y]$, we can find a nonzero $h(x)in (f(x,y),g(x,y))subset P$."
I have two questions.
We know that $P$ can be generated by finitely many generators (because $mathbb C[x, y]$ is Noetherian), so suppose that $f_1, dots, f_n$ is a minimal set of generators for $P$. Since $P$ is not principal, $n geq 2$.
Now recall that $mathbb C[x, y]$ is a unique factorisation domain. So suppose that $h$ is a greatest common divisor for $f_1$ and $f_2$. Then $f_1 = hg_1$ and $f_2 = hg_2$, where $g_1, g_2$ have no non-trivial common factor.
Now $h$ can't be in $P$, otherwise $P$ would be generated by $h, f_3, dots, f_n$, contradicting my assumption that the generators $f_1, f_2, dots, f_n$ were minimal.
But $f_1 = hg_1 in P$ and $P$ is prime, so either $hin P$ or $g_1 in P$. Since $h notin P$, we have $g_1 in P$. By a similar argument, $g_2 in P$ too.
Thus we have constructed elements $g_1, g_2 in P$ that have no non-trivial common factor.
For the second part, see this answer.
Answered by Kenny Wong on December 15, 2021
Ad 1: Pick $f$ of minimal (total) degree (but non-zero, of course). Then $Pne(f)$, so there exists $gnotin (f)$ and again we pick it of minimal degree. What could you say about the degree of a common factor?
Answered by Hagen von Eitzen on December 15, 2021
Get help from others!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP