Is the largest root of a parametrized family of polynomials again polynomial?
$newcommand{a}{alpha} newcommand{bb}{mathbb}$
Let $a = (a_0, dots, a_{n-1}) in bb R^n$ be fixed. We consider the parametrized family of monic polynomials
$$ f(r, z) = z^n + ra_{n-1} z^{n-1} + dots + r a_1 z + r a_0,$$
where $r in bb R$.
For each $r in bb R$, let $L(r)$ denote the largest root. My question is whether $L(r)$ is a polynomial in $r$. By Vieta's formula, for each $r$, we can represent all the roots as a polynomial in $r$. I am not sure if some crossing happened in the roots, this is still true.
linear-algebra abstract-algebra polynomials
add a comment |
$newcommand{a}{alpha} newcommand{bb}{mathbb}$
Let $a = (a_0, dots, a_{n-1}) in bb R^n$ be fixed. We consider the parametrized family of monic polynomials
$$ f(r, z) = z^n + ra_{n-1} z^{n-1} + dots + r a_1 z + r a_0,$$
where $r in bb R$.
For each $r in bb R$, let $L(r)$ denote the largest root. My question is whether $L(r)$ is a polynomial in $r$. By Vieta's formula, for each $r$, we can represent all the roots as a polynomial in $r$. I am not sure if some crossing happened in the roots, this is still true.
linear-algebra abstract-algebra polynomials
add a comment |
$newcommand{a}{alpha} newcommand{bb}{mathbb}$
Let $a = (a_0, dots, a_{n-1}) in bb R^n$ be fixed. We consider the parametrized family of monic polynomials
$$ f(r, z) = z^n + ra_{n-1} z^{n-1} + dots + r a_1 z + r a_0,$$
where $r in bb R$.
For each $r in bb R$, let $L(r)$ denote the largest root. My question is whether $L(r)$ is a polynomial in $r$. By Vieta's formula, for each $r$, we can represent all the roots as a polynomial in $r$. I am not sure if some crossing happened in the roots, this is still true.
linear-algebra abstract-algebra polynomials
$newcommand{a}{alpha} newcommand{bb}{mathbb}$
Let $a = (a_0, dots, a_{n-1}) in bb R^n$ be fixed. We consider the parametrized family of monic polynomials
$$ f(r, z) = z^n + ra_{n-1} z^{n-1} + dots + r a_1 z + r a_0,$$
where $r in bb R$.
For each $r in bb R$, let $L(r)$ denote the largest root. My question is whether $L(r)$ is a polynomial in $r$. By Vieta's formula, for each $r$, we can represent all the roots as a polynomial in $r$. I am not sure if some crossing happened in the roots, this is still true.
linear-algebra abstract-algebra polynomials
linear-algebra abstract-algebra polynomials
edited Nov 26 at 17:47
asked Nov 26 at 17:10
user1101010
7551630
7551630
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
Consider $n = 2,$ and the case $f(r, z) = z^2 - rz = z(z-r)$, i.e., $a_1 = -1, a_0 = 0$.
The largest root is $r$ (for $r ge 0$), but $0$ for $r < 0$. The function
$$
h(r) = begin{cases}
r & r ge 0 \
0 & r < 0
end{cases}
$$
is not differentiable at zero, hence not a polynomial.
Thanks for your nice answer. May I ask another question: I am looking for the zeros of $L(r) - 1$ and your example shows it is not a polynomial in $t$. But I am still hoping the number of the zeros is bounded. Could you comment on this part? Thanks.
– user1101010
Nov 26 at 18:36
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%2f3014607%2fis-the-largest-root-of-a-parametrized-family-of-polynomials-again-polynomial%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Consider $n = 2,$ and the case $f(r, z) = z^2 - rz = z(z-r)$, i.e., $a_1 = -1, a_0 = 0$.
The largest root is $r$ (for $r ge 0$), but $0$ for $r < 0$. The function
$$
h(r) = begin{cases}
r & r ge 0 \
0 & r < 0
end{cases}
$$
is not differentiable at zero, hence not a polynomial.
Thanks for your nice answer. May I ask another question: I am looking for the zeros of $L(r) - 1$ and your example shows it is not a polynomial in $t$. But I am still hoping the number of the zeros is bounded. Could you comment on this part? Thanks.
– user1101010
Nov 26 at 18:36
add a comment |
Consider $n = 2,$ and the case $f(r, z) = z^2 - rz = z(z-r)$, i.e., $a_1 = -1, a_0 = 0$.
The largest root is $r$ (for $r ge 0$), but $0$ for $r < 0$. The function
$$
h(r) = begin{cases}
r & r ge 0 \
0 & r < 0
end{cases}
$$
is not differentiable at zero, hence not a polynomial.
Thanks for your nice answer. May I ask another question: I am looking for the zeros of $L(r) - 1$ and your example shows it is not a polynomial in $t$. But I am still hoping the number of the zeros is bounded. Could you comment on this part? Thanks.
– user1101010
Nov 26 at 18:36
add a comment |
Consider $n = 2,$ and the case $f(r, z) = z^2 - rz = z(z-r)$, i.e., $a_1 = -1, a_0 = 0$.
The largest root is $r$ (for $r ge 0$), but $0$ for $r < 0$. The function
$$
h(r) = begin{cases}
r & r ge 0 \
0 & r < 0
end{cases}
$$
is not differentiable at zero, hence not a polynomial.
Consider $n = 2,$ and the case $f(r, z) = z^2 - rz = z(z-r)$, i.e., $a_1 = -1, a_0 = 0$.
The largest root is $r$ (for $r ge 0$), but $0$ for $r < 0$. The function
$$
h(r) = begin{cases}
r & r ge 0 \
0 & r < 0
end{cases}
$$
is not differentiable at zero, hence not a polynomial.
answered Nov 26 at 17:54
John Hughes
62.3k24090
62.3k24090
Thanks for your nice answer. May I ask another question: I am looking for the zeros of $L(r) - 1$ and your example shows it is not a polynomial in $t$. But I am still hoping the number of the zeros is bounded. Could you comment on this part? Thanks.
– user1101010
Nov 26 at 18:36
add a comment |
Thanks for your nice answer. May I ask another question: I am looking for the zeros of $L(r) - 1$ and your example shows it is not a polynomial in $t$. But I am still hoping the number of the zeros is bounded. Could you comment on this part? Thanks.
– user1101010
Nov 26 at 18:36
Thanks for your nice answer. May I ask another question: I am looking for the zeros of $L(r) - 1$ and your example shows it is not a polynomial in $t$. But I am still hoping the number of the zeros is bounded. Could you comment on this part? Thanks.
– user1101010
Nov 26 at 18:36
Thanks for your nice answer. May I ask another question: I am looking for the zeros of $L(r) - 1$ and your example shows it is not a polynomial in $t$. But I am still hoping the number of the zeros is bounded. Could you comment on this part? Thanks.
– user1101010
Nov 26 at 18:36
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3014607%2fis-the-largest-root-of-a-parametrized-family-of-polynomials-again-polynomial%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