What are the ideals in ${Bbb C}[x,y]$ that contain $f_1,f_2in{Bbb C}[x,y]$?
$begingroup$
This question is based on an exercise in Artin's Algebra:
Which ideals in the polynomial ring $R:={Bbb C}[x,y]$ contain $f_1=x^2+y^2-5$ and $f_2=xy-2$?
Using Hilbert's (weak) nullstellensatz, one can identify all the maximal ideals of $R$ that contain $f_1$ and $f_2$. For the general ideals contain $(f_1, f_2)$, it suffices to identify ideals in $R/(f_1,f_2)$ by the correspondence theorem. But I don't see how to go on. Is there a systematic way to do it?
algebraic-geometry ring-theory commutative-algebra ideals
$endgroup$
add a comment |
$begingroup$
This question is based on an exercise in Artin's Algebra:
Which ideals in the polynomial ring $R:={Bbb C}[x,y]$ contain $f_1=x^2+y^2-5$ and $f_2=xy-2$?
Using Hilbert's (weak) nullstellensatz, one can identify all the maximal ideals of $R$ that contain $f_1$ and $f_2$. For the general ideals contain $(f_1, f_2)$, it suffices to identify ideals in $R/(f_1,f_2)$ by the correspondence theorem. But I don't see how to go on. Is there a systematic way to do it?
algebraic-geometry ring-theory commutative-algebra ideals
$endgroup$
add a comment |
$begingroup$
This question is based on an exercise in Artin's Algebra:
Which ideals in the polynomial ring $R:={Bbb C}[x,y]$ contain $f_1=x^2+y^2-5$ and $f_2=xy-2$?
Using Hilbert's (weak) nullstellensatz, one can identify all the maximal ideals of $R$ that contain $f_1$ and $f_2$. For the general ideals contain $(f_1, f_2)$, it suffices to identify ideals in $R/(f_1,f_2)$ by the correspondence theorem. But I don't see how to go on. Is there a systematic way to do it?
algebraic-geometry ring-theory commutative-algebra ideals
$endgroup$
This question is based on an exercise in Artin's Algebra:
Which ideals in the polynomial ring $R:={Bbb C}[x,y]$ contain $f_1=x^2+y^2-5$ and $f_2=xy-2$?
Using Hilbert's (weak) nullstellensatz, one can identify all the maximal ideals of $R$ that contain $f_1$ and $f_2$. For the general ideals contain $(f_1, f_2)$, it suffices to identify ideals in $R/(f_1,f_2)$ by the correspondence theorem. But I don't see how to go on. Is there a systematic way to do it?
algebraic-geometry ring-theory commutative-algebra ideals
algebraic-geometry ring-theory commutative-algebra ideals
edited Oct 2 '14 at 5:12
zcn
13.2k1540
13.2k1540
asked Feb 21 '14 at 16:05
JackJack
1
1
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I don't know if this counts as a "systematic" way of doing it or not, but you can do the following.
First, in the ring $R$ you have $y = 2/x$, so you have the isomorphism $$R = frac{mathbb{C}[x,y]}{(f_1,f_2)}cong frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}.$$ Observe that you have the factorization of ideals $$x^2 + 4x^{-2} - 5 = (x-2)(x+2)(x-1)(x+1)$$ in the ring $frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}$. These are pairwise coprime maximal ideals, so the Chinese remainder theorem says that $$frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}cong frac{mathbb{C}[x,x^{-1}]}{(x-2)}times frac{mathbb{C}[x,x^{-1}]}{(x+2)}times frac{mathbb{C}[x,x^{-1}]}{(x-1)}times frac{mathbb{C}[x,x^{-1}]}{(x+1)}$$$$cong mathbb{C}times mathbb{C}times mathbb{C}times mathbb{C}.$$ Unraveling definitions, we see that $Rcong mathbb{C}^4$, the isomorphism being $$f(x,y)mapsto (f(2,1), f(-2, -1), f(1,2), f(-1,-2)).$$
Now, to understand what the ideals of $R$ are, you need to know what the ideals of $mathbb{C}^4$ are. There are $2^4$ ideals of $mathbb{C}^4$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely, the ideals $$I_S = {(a_1,a_2,a_3,a_4) : a_i = 0,,,mathrm{ if },,,iin S}.$$ There are therefore $2^4$ ideals of $R$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely the ideals $$J_S = {f : (f(2,1), f(-2,-1), f(1,2), f(-1,-2))in I_S}.$$ I hope this analysis works!
$endgroup$
$begingroup$
In your factorization in the 5th line, I think there is a factor $x^{-2}$?
$endgroup$
– Jack
Feb 23 '14 at 14:46
$begingroup$
@Jack: You are correct, but remember this is a factorization of ideals, and $x^{-1}$ is a unit in $mathbb{C}[x,x^{-1}]$, so the extra factor of $x^{-2}$ does not matter here....
$endgroup$
– froggie
Feb 23 '14 at 15:40
$begingroup$
Ah, I see. I don't know much about the ideal factorization. It seems the answer depends mainly on the special forms of $f_1$ and $f_2$. Can it be generalized to any $f_1, f_2$?
$endgroup$
– Jack
Feb 23 '14 at 16:47
$begingroup$
@Jack: Yeah, one of the nice things about these equations is that we are easily able to eliminate the $y$-variable by writing it as $y = 2/x$. Once we do this, we get an equation depending only on $x$, and then because $mathbb{C}$ is algebraically closed you can always factor a polynomial in one variable. As for any $f_1,f_2$, I think you would have to be more careful if you can't solve for $y$ that easily....
$endgroup$
– froggie
Feb 23 '14 at 17:18
1
$begingroup$
@JackBauer Obviously in this answer $R=mathbb C[X,Y]/(f_1,f_2)$. No need to ask this, really!
$endgroup$
– user26857
Dec 29 '18 at 15:53
|
show 5 more comments
$begingroup$
Here's a procedure that works more generally: the ideal $I := (x^2 + y^2 - 5, xy - 2)$ has height $2$ in $mathbb{C}[x,y]$. To see this, note that $x^2 + y^2 - 5$ (or $xy - 2$) is irreducible over $mathbb{C}$ (e.g. by Eisenstein), hence generates a height $1$ prime ideal in $mathbb{C}[x,y]$, which does not contain the other generator. More generally yet, the generators of $I$ form a regular sequence, and any ideal generated by a regular sequence has height equal to the length of the sequence.
Thus, the quotient $R := mathbb{C}[x,y]/I$ has Krull dimension $le dim mathbb{C}[x,y] - text{ht}(I) = 0$, so $R$ is an Artinian ring. Every Artinian ring is a finite product of Artinian local rings, and ideals in a finite product are products of ideals, so writing $R = prod_{i=1}^n R_i$, the number of $R$-ideals is the product of the numbers of $R_i$-ideals.
In this particular case, $R = R_1 times cdots times R_4$, each $R_i cong mathbb{C}$ by the Nullstellensatz, and $mathbb{C}$ has precisely $2$ ideals, so $R$ has a total of $2^4 = 16$ ideals.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f684984%2fwhat-are-the-ideals-in-bbb-cx-y-that-contain-f-1-f-2-in-bbb-cx-y%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I don't know if this counts as a "systematic" way of doing it or not, but you can do the following.
First, in the ring $R$ you have $y = 2/x$, so you have the isomorphism $$R = frac{mathbb{C}[x,y]}{(f_1,f_2)}cong frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}.$$ Observe that you have the factorization of ideals $$x^2 + 4x^{-2} - 5 = (x-2)(x+2)(x-1)(x+1)$$ in the ring $frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}$. These are pairwise coprime maximal ideals, so the Chinese remainder theorem says that $$frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}cong frac{mathbb{C}[x,x^{-1}]}{(x-2)}times frac{mathbb{C}[x,x^{-1}]}{(x+2)}times frac{mathbb{C}[x,x^{-1}]}{(x-1)}times frac{mathbb{C}[x,x^{-1}]}{(x+1)}$$$$cong mathbb{C}times mathbb{C}times mathbb{C}times mathbb{C}.$$ Unraveling definitions, we see that $Rcong mathbb{C}^4$, the isomorphism being $$f(x,y)mapsto (f(2,1), f(-2, -1), f(1,2), f(-1,-2)).$$
Now, to understand what the ideals of $R$ are, you need to know what the ideals of $mathbb{C}^4$ are. There are $2^4$ ideals of $mathbb{C}^4$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely, the ideals $$I_S = {(a_1,a_2,a_3,a_4) : a_i = 0,,,mathrm{ if },,,iin S}.$$ There are therefore $2^4$ ideals of $R$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely the ideals $$J_S = {f : (f(2,1), f(-2,-1), f(1,2), f(-1,-2))in I_S}.$$ I hope this analysis works!
$endgroup$
$begingroup$
In your factorization in the 5th line, I think there is a factor $x^{-2}$?
$endgroup$
– Jack
Feb 23 '14 at 14:46
$begingroup$
@Jack: You are correct, but remember this is a factorization of ideals, and $x^{-1}$ is a unit in $mathbb{C}[x,x^{-1}]$, so the extra factor of $x^{-2}$ does not matter here....
$endgroup$
– froggie
Feb 23 '14 at 15:40
$begingroup$
Ah, I see. I don't know much about the ideal factorization. It seems the answer depends mainly on the special forms of $f_1$ and $f_2$. Can it be generalized to any $f_1, f_2$?
$endgroup$
– Jack
Feb 23 '14 at 16:47
$begingroup$
@Jack: Yeah, one of the nice things about these equations is that we are easily able to eliminate the $y$-variable by writing it as $y = 2/x$. Once we do this, we get an equation depending only on $x$, and then because $mathbb{C}$ is algebraically closed you can always factor a polynomial in one variable. As for any $f_1,f_2$, I think you would have to be more careful if you can't solve for $y$ that easily....
$endgroup$
– froggie
Feb 23 '14 at 17:18
1
$begingroup$
@JackBauer Obviously in this answer $R=mathbb C[X,Y]/(f_1,f_2)$. No need to ask this, really!
$endgroup$
– user26857
Dec 29 '18 at 15:53
|
show 5 more comments
$begingroup$
I don't know if this counts as a "systematic" way of doing it or not, but you can do the following.
First, in the ring $R$ you have $y = 2/x$, so you have the isomorphism $$R = frac{mathbb{C}[x,y]}{(f_1,f_2)}cong frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}.$$ Observe that you have the factorization of ideals $$x^2 + 4x^{-2} - 5 = (x-2)(x+2)(x-1)(x+1)$$ in the ring $frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}$. These are pairwise coprime maximal ideals, so the Chinese remainder theorem says that $$frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}cong frac{mathbb{C}[x,x^{-1}]}{(x-2)}times frac{mathbb{C}[x,x^{-1}]}{(x+2)}times frac{mathbb{C}[x,x^{-1}]}{(x-1)}times frac{mathbb{C}[x,x^{-1}]}{(x+1)}$$$$cong mathbb{C}times mathbb{C}times mathbb{C}times mathbb{C}.$$ Unraveling definitions, we see that $Rcong mathbb{C}^4$, the isomorphism being $$f(x,y)mapsto (f(2,1), f(-2, -1), f(1,2), f(-1,-2)).$$
Now, to understand what the ideals of $R$ are, you need to know what the ideals of $mathbb{C}^4$ are. There are $2^4$ ideals of $mathbb{C}^4$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely, the ideals $$I_S = {(a_1,a_2,a_3,a_4) : a_i = 0,,,mathrm{ if },,,iin S}.$$ There are therefore $2^4$ ideals of $R$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely the ideals $$J_S = {f : (f(2,1), f(-2,-1), f(1,2), f(-1,-2))in I_S}.$$ I hope this analysis works!
$endgroup$
$begingroup$
In your factorization in the 5th line, I think there is a factor $x^{-2}$?
$endgroup$
– Jack
Feb 23 '14 at 14:46
$begingroup$
@Jack: You are correct, but remember this is a factorization of ideals, and $x^{-1}$ is a unit in $mathbb{C}[x,x^{-1}]$, so the extra factor of $x^{-2}$ does not matter here....
$endgroup$
– froggie
Feb 23 '14 at 15:40
$begingroup$
Ah, I see. I don't know much about the ideal factorization. It seems the answer depends mainly on the special forms of $f_1$ and $f_2$. Can it be generalized to any $f_1, f_2$?
$endgroup$
– Jack
Feb 23 '14 at 16:47
$begingroup$
@Jack: Yeah, one of the nice things about these equations is that we are easily able to eliminate the $y$-variable by writing it as $y = 2/x$. Once we do this, we get an equation depending only on $x$, and then because $mathbb{C}$ is algebraically closed you can always factor a polynomial in one variable. As for any $f_1,f_2$, I think you would have to be more careful if you can't solve for $y$ that easily....
$endgroup$
– froggie
Feb 23 '14 at 17:18
1
$begingroup$
@JackBauer Obviously in this answer $R=mathbb C[X,Y]/(f_1,f_2)$. No need to ask this, really!
$endgroup$
– user26857
Dec 29 '18 at 15:53
|
show 5 more comments
$begingroup$
I don't know if this counts as a "systematic" way of doing it or not, but you can do the following.
First, in the ring $R$ you have $y = 2/x$, so you have the isomorphism $$R = frac{mathbb{C}[x,y]}{(f_1,f_2)}cong frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}.$$ Observe that you have the factorization of ideals $$x^2 + 4x^{-2} - 5 = (x-2)(x+2)(x-1)(x+1)$$ in the ring $frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}$. These are pairwise coprime maximal ideals, so the Chinese remainder theorem says that $$frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}cong frac{mathbb{C}[x,x^{-1}]}{(x-2)}times frac{mathbb{C}[x,x^{-1}]}{(x+2)}times frac{mathbb{C}[x,x^{-1}]}{(x-1)}times frac{mathbb{C}[x,x^{-1}]}{(x+1)}$$$$cong mathbb{C}times mathbb{C}times mathbb{C}times mathbb{C}.$$ Unraveling definitions, we see that $Rcong mathbb{C}^4$, the isomorphism being $$f(x,y)mapsto (f(2,1), f(-2, -1), f(1,2), f(-1,-2)).$$
Now, to understand what the ideals of $R$ are, you need to know what the ideals of $mathbb{C}^4$ are. There are $2^4$ ideals of $mathbb{C}^4$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely, the ideals $$I_S = {(a_1,a_2,a_3,a_4) : a_i = 0,,,mathrm{ if },,,iin S}.$$ There are therefore $2^4$ ideals of $R$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely the ideals $$J_S = {f : (f(2,1), f(-2,-1), f(1,2), f(-1,-2))in I_S}.$$ I hope this analysis works!
$endgroup$
I don't know if this counts as a "systematic" way of doing it or not, but you can do the following.
First, in the ring $R$ you have $y = 2/x$, so you have the isomorphism $$R = frac{mathbb{C}[x,y]}{(f_1,f_2)}cong frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}.$$ Observe that you have the factorization of ideals $$x^2 + 4x^{-2} - 5 = (x-2)(x+2)(x-1)(x+1)$$ in the ring $frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}$. These are pairwise coprime maximal ideals, so the Chinese remainder theorem says that $$frac{mathbb{C}[x,x^{-1}]}{(x^2 + 4x^{-2} - 5)}cong frac{mathbb{C}[x,x^{-1}]}{(x-2)}times frac{mathbb{C}[x,x^{-1}]}{(x+2)}times frac{mathbb{C}[x,x^{-1}]}{(x-1)}times frac{mathbb{C}[x,x^{-1}]}{(x+1)}$$$$cong mathbb{C}times mathbb{C}times mathbb{C}times mathbb{C}.$$ Unraveling definitions, we see that $Rcong mathbb{C}^4$, the isomorphism being $$f(x,y)mapsto (f(2,1), f(-2, -1), f(1,2), f(-1,-2)).$$
Now, to understand what the ideals of $R$ are, you need to know what the ideals of $mathbb{C}^4$ are. There are $2^4$ ideals of $mathbb{C}^4$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely, the ideals $$I_S = {(a_1,a_2,a_3,a_4) : a_i = 0,,,mathrm{ if },,,iin S}.$$ There are therefore $2^4$ ideals of $R$, corresponding to subsets $Ssubseteq{1,2,3,4}$; namely the ideals $$J_S = {f : (f(2,1), f(-2,-1), f(1,2), f(-1,-2))in I_S}.$$ I hope this analysis works!
edited Dec 29 '18 at 11:01
user198044
answered Feb 21 '14 at 17:04
froggiefroggie
8,54211741
8,54211741
$begingroup$
In your factorization in the 5th line, I think there is a factor $x^{-2}$?
$endgroup$
– Jack
Feb 23 '14 at 14:46
$begingroup$
@Jack: You are correct, but remember this is a factorization of ideals, and $x^{-1}$ is a unit in $mathbb{C}[x,x^{-1}]$, so the extra factor of $x^{-2}$ does not matter here....
$endgroup$
– froggie
Feb 23 '14 at 15:40
$begingroup$
Ah, I see. I don't know much about the ideal factorization. It seems the answer depends mainly on the special forms of $f_1$ and $f_2$. Can it be generalized to any $f_1, f_2$?
$endgroup$
– Jack
Feb 23 '14 at 16:47
$begingroup$
@Jack: Yeah, one of the nice things about these equations is that we are easily able to eliminate the $y$-variable by writing it as $y = 2/x$. Once we do this, we get an equation depending only on $x$, and then because $mathbb{C}$ is algebraically closed you can always factor a polynomial in one variable. As for any $f_1,f_2$, I think you would have to be more careful if you can't solve for $y$ that easily....
$endgroup$
– froggie
Feb 23 '14 at 17:18
1
$begingroup$
@JackBauer Obviously in this answer $R=mathbb C[X,Y]/(f_1,f_2)$. No need to ask this, really!
$endgroup$
– user26857
Dec 29 '18 at 15:53
|
show 5 more comments
$begingroup$
In your factorization in the 5th line, I think there is a factor $x^{-2}$?
$endgroup$
– Jack
Feb 23 '14 at 14:46
$begingroup$
@Jack: You are correct, but remember this is a factorization of ideals, and $x^{-1}$ is a unit in $mathbb{C}[x,x^{-1}]$, so the extra factor of $x^{-2}$ does not matter here....
$endgroup$
– froggie
Feb 23 '14 at 15:40
$begingroup$
Ah, I see. I don't know much about the ideal factorization. It seems the answer depends mainly on the special forms of $f_1$ and $f_2$. Can it be generalized to any $f_1, f_2$?
$endgroup$
– Jack
Feb 23 '14 at 16:47
$begingroup$
@Jack: Yeah, one of the nice things about these equations is that we are easily able to eliminate the $y$-variable by writing it as $y = 2/x$. Once we do this, we get an equation depending only on $x$, and then because $mathbb{C}$ is algebraically closed you can always factor a polynomial in one variable. As for any $f_1,f_2$, I think you would have to be more careful if you can't solve for $y$ that easily....
$endgroup$
– froggie
Feb 23 '14 at 17:18
1
$begingroup$
@JackBauer Obviously in this answer $R=mathbb C[X,Y]/(f_1,f_2)$. No need to ask this, really!
$endgroup$
– user26857
Dec 29 '18 at 15:53
$begingroup$
In your factorization in the 5th line, I think there is a factor $x^{-2}$?
$endgroup$
– Jack
Feb 23 '14 at 14:46
$begingroup$
In your factorization in the 5th line, I think there is a factor $x^{-2}$?
$endgroup$
– Jack
Feb 23 '14 at 14:46
$begingroup$
@Jack: You are correct, but remember this is a factorization of ideals, and $x^{-1}$ is a unit in $mathbb{C}[x,x^{-1}]$, so the extra factor of $x^{-2}$ does not matter here....
$endgroup$
– froggie
Feb 23 '14 at 15:40
$begingroup$
@Jack: You are correct, but remember this is a factorization of ideals, and $x^{-1}$ is a unit in $mathbb{C}[x,x^{-1}]$, so the extra factor of $x^{-2}$ does not matter here....
$endgroup$
– froggie
Feb 23 '14 at 15:40
$begingroup$
Ah, I see. I don't know much about the ideal factorization. It seems the answer depends mainly on the special forms of $f_1$ and $f_2$. Can it be generalized to any $f_1, f_2$?
$endgroup$
– Jack
Feb 23 '14 at 16:47
$begingroup$
Ah, I see. I don't know much about the ideal factorization. It seems the answer depends mainly on the special forms of $f_1$ and $f_2$. Can it be generalized to any $f_1, f_2$?
$endgroup$
– Jack
Feb 23 '14 at 16:47
$begingroup$
@Jack: Yeah, one of the nice things about these equations is that we are easily able to eliminate the $y$-variable by writing it as $y = 2/x$. Once we do this, we get an equation depending only on $x$, and then because $mathbb{C}$ is algebraically closed you can always factor a polynomial in one variable. As for any $f_1,f_2$, I think you would have to be more careful if you can't solve for $y$ that easily....
$endgroup$
– froggie
Feb 23 '14 at 17:18
$begingroup$
@Jack: Yeah, one of the nice things about these equations is that we are easily able to eliminate the $y$-variable by writing it as $y = 2/x$. Once we do this, we get an equation depending only on $x$, and then because $mathbb{C}$ is algebraically closed you can always factor a polynomial in one variable. As for any $f_1,f_2$, I think you would have to be more careful if you can't solve for $y$ that easily....
$endgroup$
– froggie
Feb 23 '14 at 17:18
1
1
$begingroup$
@JackBauer Obviously in this answer $R=mathbb C[X,Y]/(f_1,f_2)$. No need to ask this, really!
$endgroup$
– user26857
Dec 29 '18 at 15:53
$begingroup$
@JackBauer Obviously in this answer $R=mathbb C[X,Y]/(f_1,f_2)$. No need to ask this, really!
$endgroup$
– user26857
Dec 29 '18 at 15:53
|
show 5 more comments
$begingroup$
Here's a procedure that works more generally: the ideal $I := (x^2 + y^2 - 5, xy - 2)$ has height $2$ in $mathbb{C}[x,y]$. To see this, note that $x^2 + y^2 - 5$ (or $xy - 2$) is irreducible over $mathbb{C}$ (e.g. by Eisenstein), hence generates a height $1$ prime ideal in $mathbb{C}[x,y]$, which does not contain the other generator. More generally yet, the generators of $I$ form a regular sequence, and any ideal generated by a regular sequence has height equal to the length of the sequence.
Thus, the quotient $R := mathbb{C}[x,y]/I$ has Krull dimension $le dim mathbb{C}[x,y] - text{ht}(I) = 0$, so $R$ is an Artinian ring. Every Artinian ring is a finite product of Artinian local rings, and ideals in a finite product are products of ideals, so writing $R = prod_{i=1}^n R_i$, the number of $R$-ideals is the product of the numbers of $R_i$-ideals.
In this particular case, $R = R_1 times cdots times R_4$, each $R_i cong mathbb{C}$ by the Nullstellensatz, and $mathbb{C}$ has precisely $2$ ideals, so $R$ has a total of $2^4 = 16$ ideals.
$endgroup$
add a comment |
$begingroup$
Here's a procedure that works more generally: the ideal $I := (x^2 + y^2 - 5, xy - 2)$ has height $2$ in $mathbb{C}[x,y]$. To see this, note that $x^2 + y^2 - 5$ (or $xy - 2$) is irreducible over $mathbb{C}$ (e.g. by Eisenstein), hence generates a height $1$ prime ideal in $mathbb{C}[x,y]$, which does not contain the other generator. More generally yet, the generators of $I$ form a regular sequence, and any ideal generated by a regular sequence has height equal to the length of the sequence.
Thus, the quotient $R := mathbb{C}[x,y]/I$ has Krull dimension $le dim mathbb{C}[x,y] - text{ht}(I) = 0$, so $R$ is an Artinian ring. Every Artinian ring is a finite product of Artinian local rings, and ideals in a finite product are products of ideals, so writing $R = prod_{i=1}^n R_i$, the number of $R$-ideals is the product of the numbers of $R_i$-ideals.
In this particular case, $R = R_1 times cdots times R_4$, each $R_i cong mathbb{C}$ by the Nullstellensatz, and $mathbb{C}$ has precisely $2$ ideals, so $R$ has a total of $2^4 = 16$ ideals.
$endgroup$
add a comment |
$begingroup$
Here's a procedure that works more generally: the ideal $I := (x^2 + y^2 - 5, xy - 2)$ has height $2$ in $mathbb{C}[x,y]$. To see this, note that $x^2 + y^2 - 5$ (or $xy - 2$) is irreducible over $mathbb{C}$ (e.g. by Eisenstein), hence generates a height $1$ prime ideal in $mathbb{C}[x,y]$, which does not contain the other generator. More generally yet, the generators of $I$ form a regular sequence, and any ideal generated by a regular sequence has height equal to the length of the sequence.
Thus, the quotient $R := mathbb{C}[x,y]/I$ has Krull dimension $le dim mathbb{C}[x,y] - text{ht}(I) = 0$, so $R$ is an Artinian ring. Every Artinian ring is a finite product of Artinian local rings, and ideals in a finite product are products of ideals, so writing $R = prod_{i=1}^n R_i$, the number of $R$-ideals is the product of the numbers of $R_i$-ideals.
In this particular case, $R = R_1 times cdots times R_4$, each $R_i cong mathbb{C}$ by the Nullstellensatz, and $mathbb{C}$ has precisely $2$ ideals, so $R$ has a total of $2^4 = 16$ ideals.
$endgroup$
Here's a procedure that works more generally: the ideal $I := (x^2 + y^2 - 5, xy - 2)$ has height $2$ in $mathbb{C}[x,y]$. To see this, note that $x^2 + y^2 - 5$ (or $xy - 2$) is irreducible over $mathbb{C}$ (e.g. by Eisenstein), hence generates a height $1$ prime ideal in $mathbb{C}[x,y]$, which does not contain the other generator. More generally yet, the generators of $I$ form a regular sequence, and any ideal generated by a regular sequence has height equal to the length of the sequence.
Thus, the quotient $R := mathbb{C}[x,y]/I$ has Krull dimension $le dim mathbb{C}[x,y] - text{ht}(I) = 0$, so $R$ is an Artinian ring. Every Artinian ring is a finite product of Artinian local rings, and ideals in a finite product are products of ideals, so writing $R = prod_{i=1}^n R_i$, the number of $R$-ideals is the product of the numbers of $R_i$-ideals.
In this particular case, $R = R_1 times cdots times R_4$, each $R_i cong mathbb{C}$ by the Nullstellensatz, and $mathbb{C}$ has precisely $2$ ideals, so $R$ has a total of $2^4 = 16$ ideals.
edited Dec 29 '18 at 15:45
user26857
39.3k124183
39.3k124183
answered Feb 23 '14 at 23:10
zcnzcn
13.2k1540
13.2k1540
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f684984%2fwhat-are-the-ideals-in-bbb-cx-y-that-contain-f-1-f-2-in-bbb-cx-y%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown