Is a polynomial $f$ zero at $(a_1,ldots,a_n)$ iff $f$ lies in the ideal $(X_1-a_1,ldots,X_n-a_n)$?
$begingroup$
This is probably a very silly question:
If $R$ is an arbitrary commutative ring with unit and $fin R[X]$ a polynomial, then for any element $ain R$ we have
$$f(a)=0 Longleftrightarrow X-a ~mbox{ divides }~ f Longleftrightarrow fin (X-a)$$
where the last equivalence is clear. The first is probably a little surprising as $R[X]$ is usually not euclidean and it is perhaps not clear how to divide by $X-a$.
Now let $fin R[X_1,ldots, X_n]$ be a polynomial. How can I see for an element $(a_1,ldots,a_n)in R^n$ that
$$f(a_1,ldots,a_n)=0 Longleftrightarrow fin (X_1-a_1,ldots,X_n-a_n) ?$$
If this does not work in general, let $R=K$ be a field.
abstract-algebra polynomials ideals roots
$endgroup$
add a comment |
$begingroup$
This is probably a very silly question:
If $R$ is an arbitrary commutative ring with unit and $fin R[X]$ a polynomial, then for any element $ain R$ we have
$$f(a)=0 Longleftrightarrow X-a ~mbox{ divides }~ f Longleftrightarrow fin (X-a)$$
where the last equivalence is clear. The first is probably a little surprising as $R[X]$ is usually not euclidean and it is perhaps not clear how to divide by $X-a$.
Now let $fin R[X_1,ldots, X_n]$ be a polynomial. How can I see for an element $(a_1,ldots,a_n)in R^n$ that
$$f(a_1,ldots,a_n)=0 Longleftrightarrow fin (X_1-a_1,ldots,X_n-a_n) ?$$
If this does not work in general, let $R=K$ be a field.
abstract-algebra polynomials ideals roots
$endgroup$
add a comment |
$begingroup$
This is probably a very silly question:
If $R$ is an arbitrary commutative ring with unit and $fin R[X]$ a polynomial, then for any element $ain R$ we have
$$f(a)=0 Longleftrightarrow X-a ~mbox{ divides }~ f Longleftrightarrow fin (X-a)$$
where the last equivalence is clear. The first is probably a little surprising as $R[X]$ is usually not euclidean and it is perhaps not clear how to divide by $X-a$.
Now let $fin R[X_1,ldots, X_n]$ be a polynomial. How can I see for an element $(a_1,ldots,a_n)in R^n$ that
$$f(a_1,ldots,a_n)=0 Longleftrightarrow fin (X_1-a_1,ldots,X_n-a_n) ?$$
If this does not work in general, let $R=K$ be a field.
abstract-algebra polynomials ideals roots
$endgroup$
This is probably a very silly question:
If $R$ is an arbitrary commutative ring with unit and $fin R[X]$ a polynomial, then for any element $ain R$ we have
$$f(a)=0 Longleftrightarrow X-a ~mbox{ divides }~ f Longleftrightarrow fin (X-a)$$
where the last equivalence is clear. The first is probably a little surprising as $R[X]$ is usually not euclidean and it is perhaps not clear how to divide by $X-a$.
Now let $fin R[X_1,ldots, X_n]$ be a polynomial. How can I see for an element $(a_1,ldots,a_n)in R^n$ that
$$f(a_1,ldots,a_n)=0 Longleftrightarrow fin (X_1-a_1,ldots,X_n-a_n) ?$$
If this does not work in general, let $R=K$ be a field.
abstract-algebra polynomials ideals roots
abstract-algebra polynomials ideals roots
edited Apr 1 '17 at 17:49
coproc
977514
977514
asked Jul 7 '15 at 13:54
user8463524user8463524
577315
577315
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Yes. Another way to see this is by the following:
We can assume without loss of generality that $X_n$ appears in $f$. Then $$f=varphi_0+varphi_1X_n+cdots + varphi_kX_n^k$$
for some $varphiin R[X_1,...,X_{n-1}]$ with $varphi_k(a_1,..,a_{n-1})neq 0$. This reduces to the case you are okay with!
$endgroup$
add a comment |
$begingroup$
Consider the case of $(a_1,ldots,a_n)=(0,ldots,0)$ first, where it's obvious. Then observe that
$$f(a_1,ldots,a_n)=0iff g(0,ldots,0)=0$$
and
$$fin (x_1-a_1,ldots,x_n-a_n)iff gin (x_1,ldots,x_n)$$
where
$$g(x_1,ldots,x_n)=f(x_1+a_1,ldots,x_n+a_n)$$
$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%2f1352606%2fis-a-polynomial-f-zero-at-a-1-ldots-a-n-iff-f-lies-in-the-ideal-x-1-a%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$
Yes. Another way to see this is by the following:
We can assume without loss of generality that $X_n$ appears in $f$. Then $$f=varphi_0+varphi_1X_n+cdots + varphi_kX_n^k$$
for some $varphiin R[X_1,...,X_{n-1}]$ with $varphi_k(a_1,..,a_{n-1})neq 0$. This reduces to the case you are okay with!
$endgroup$
add a comment |
$begingroup$
Yes. Another way to see this is by the following:
We can assume without loss of generality that $X_n$ appears in $f$. Then $$f=varphi_0+varphi_1X_n+cdots + varphi_kX_n^k$$
for some $varphiin R[X_1,...,X_{n-1}]$ with $varphi_k(a_1,..,a_{n-1})neq 0$. This reduces to the case you are okay with!
$endgroup$
add a comment |
$begingroup$
Yes. Another way to see this is by the following:
We can assume without loss of generality that $X_n$ appears in $f$. Then $$f=varphi_0+varphi_1X_n+cdots + varphi_kX_n^k$$
for some $varphiin R[X_1,...,X_{n-1}]$ with $varphi_k(a_1,..,a_{n-1})neq 0$. This reduces to the case you are okay with!
$endgroup$
Yes. Another way to see this is by the following:
We can assume without loss of generality that $X_n$ appears in $f$. Then $$f=varphi_0+varphi_1X_n+cdots + varphi_kX_n^k$$
for some $varphiin R[X_1,...,X_{n-1}]$ with $varphi_k(a_1,..,a_{n-1})neq 0$. This reduces to the case you are okay with!
edited Dec 18 '18 at 20:39
answered Jul 7 '15 at 14:10
EoinEoin
4,5211927
4,5211927
add a comment |
add a comment |
$begingroup$
Consider the case of $(a_1,ldots,a_n)=(0,ldots,0)$ first, where it's obvious. Then observe that
$$f(a_1,ldots,a_n)=0iff g(0,ldots,0)=0$$
and
$$fin (x_1-a_1,ldots,x_n-a_n)iff gin (x_1,ldots,x_n)$$
where
$$g(x_1,ldots,x_n)=f(x_1+a_1,ldots,x_n+a_n)$$
$endgroup$
add a comment |
$begingroup$
Consider the case of $(a_1,ldots,a_n)=(0,ldots,0)$ first, where it's obvious. Then observe that
$$f(a_1,ldots,a_n)=0iff g(0,ldots,0)=0$$
and
$$fin (x_1-a_1,ldots,x_n-a_n)iff gin (x_1,ldots,x_n)$$
where
$$g(x_1,ldots,x_n)=f(x_1+a_1,ldots,x_n+a_n)$$
$endgroup$
add a comment |
$begingroup$
Consider the case of $(a_1,ldots,a_n)=(0,ldots,0)$ first, where it's obvious. Then observe that
$$f(a_1,ldots,a_n)=0iff g(0,ldots,0)=0$$
and
$$fin (x_1-a_1,ldots,x_n-a_n)iff gin (x_1,ldots,x_n)$$
where
$$g(x_1,ldots,x_n)=f(x_1+a_1,ldots,x_n+a_n)$$
$endgroup$
Consider the case of $(a_1,ldots,a_n)=(0,ldots,0)$ first, where it's obvious. Then observe that
$$f(a_1,ldots,a_n)=0iff g(0,ldots,0)=0$$
and
$$fin (x_1-a_1,ldots,x_n-a_n)iff gin (x_1,ldots,x_n)$$
where
$$g(x_1,ldots,x_n)=f(x_1+a_1,ldots,x_n+a_n)$$
answered Jul 7 '15 at 14:02
Zev ChonolesZev Chonoles
110k16231430
110k16231430
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%2f1352606%2fis-a-polynomial-f-zero-at-a-1-ldots-a-n-iff-f-lies-in-the-ideal-x-1-a%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