Complex Polynomial Inequality Proof
up vote
2
down vote
favorite
I'm trying to solve this question but I am having trouble connecting the dots. The question reads:
Assume that we have a complex polynomial:
$$P(z) = a_0+a_1z+...+a_nz^n$$
Satisfies $|P(z)|leq 1$ whenever $|z|=1$. Show that $|a_n|leq 1 >>forall n$.
So, I have simplified $|P(z)|geq|a_n|left|1-frac{|a_{n-1}|}{|a_n|} -...-frac{|a_0|}{|a_n|}right|$, using the fact that $|z|=1$.
Now, I'm confused by how to proceed. There's no indication that the sequence is decreasing? Am I on the right track?
sequences-and-series complex-analysis
add a comment |
up vote
2
down vote
favorite
I'm trying to solve this question but I am having trouble connecting the dots. The question reads:
Assume that we have a complex polynomial:
$$P(z) = a_0+a_1z+...+a_nz^n$$
Satisfies $|P(z)|leq 1$ whenever $|z|=1$. Show that $|a_n|leq 1 >>forall n$.
So, I have simplified $|P(z)|geq|a_n|left|1-frac{|a_{n-1}|}{|a_n|} -...-frac{|a_0|}{|a_n|}right|$, using the fact that $|z|=1$.
Now, I'm confused by how to proceed. There's no indication that the sequence is decreasing? Am I on the right track?
sequences-and-series complex-analysis
1
Maybe it pays to think about integrating $z^{-k}P(z)$ around the unit circle.
– Gerry Myerson
Nov 12 at 4:55
add a comment |
up vote
2
down vote
favorite
up vote
2
down vote
favorite
I'm trying to solve this question but I am having trouble connecting the dots. The question reads:
Assume that we have a complex polynomial:
$$P(z) = a_0+a_1z+...+a_nz^n$$
Satisfies $|P(z)|leq 1$ whenever $|z|=1$. Show that $|a_n|leq 1 >>forall n$.
So, I have simplified $|P(z)|geq|a_n|left|1-frac{|a_{n-1}|}{|a_n|} -...-frac{|a_0|}{|a_n|}right|$, using the fact that $|z|=1$.
Now, I'm confused by how to proceed. There's no indication that the sequence is decreasing? Am I on the right track?
sequences-and-series complex-analysis
I'm trying to solve this question but I am having trouble connecting the dots. The question reads:
Assume that we have a complex polynomial:
$$P(z) = a_0+a_1z+...+a_nz^n$$
Satisfies $|P(z)|leq 1$ whenever $|z|=1$. Show that $|a_n|leq 1 >>forall n$.
So, I have simplified $|P(z)|geq|a_n|left|1-frac{|a_{n-1}|}{|a_n|} -...-frac{|a_0|}{|a_n|}right|$, using the fact that $|z|=1$.
Now, I'm confused by how to proceed. There's no indication that the sequence is decreasing? Am I on the right track?
sequences-and-series complex-analysis
sequences-and-series complex-analysis
edited Nov 12 at 5:10
Wesley Strik
1,378322
1,378322
asked Nov 12 at 4:25
Felicio Grande
499619
499619
1
Maybe it pays to think about integrating $z^{-k}P(z)$ around the unit circle.
– Gerry Myerson
Nov 12 at 4:55
add a comment |
1
Maybe it pays to think about integrating $z^{-k}P(z)$ around the unit circle.
– Gerry Myerson
Nov 12 at 4:55
1
1
Maybe it pays to think about integrating $z^{-k}P(z)$ around the unit circle.
– Gerry Myerson
Nov 12 at 4:55
Maybe it pays to think about integrating $z^{-k}P(z)$ around the unit circle.
– Gerry Myerson
Nov 12 at 4:55
add a comment |
2 Answers
2
active
oldest
votes
up vote
4
down vote
This is very easy with a simple trick. Let $q(z)=a_n+a_{n-1}z+cdots+ a_0z^{n}$. Then $q(z)=z^{n}p(frac 1 z)$. $q$ is a polynomial and $|q(z)| leq 1$ if $|z|=1$. By MMP $|q(0)| leq 1$ which is what we need.
Ah, I misunderstood the question – I thought it was asking for $|a_k|le1$ for $0le kle n$.
– Gerry Myerson
Nov 13 at 10:06
add a comment |
up vote
2
down vote
One way to show this is via Cauchy estimates.
From Cauchy integral formula, for the $n$-th derivative of $P$ we have
$$
P^{(n)}(z) = frac{n!}{2pi i } int_{|xi| = 1} frac{P(xi)}{(z - xi)^{n+1}}dxi.
$$
Hence, using the fact that $|P|leq 1$ on $|xi| = 1$, we obtain
$$
n! |a_n| leq frac{n!}{2pi } int_{|xi| = 1} frac{|dxi| }{|z - xi|^{n+1}} =
frac{n!}{2pi} intlimits_0^{2pi} left|frac{ie^{itheta}} {(e^{itheta})^{n+1}}right| dtheta = n!,
$$
which gives $|a_n|leq 1$.
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',
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%2f2994849%2fcomplex-polynomial-inequality-proof%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
up vote
4
down vote
This is very easy with a simple trick. Let $q(z)=a_n+a_{n-1}z+cdots+ a_0z^{n}$. Then $q(z)=z^{n}p(frac 1 z)$. $q$ is a polynomial and $|q(z)| leq 1$ if $|z|=1$. By MMP $|q(0)| leq 1$ which is what we need.
Ah, I misunderstood the question – I thought it was asking for $|a_k|le1$ for $0le kle n$.
– Gerry Myerson
Nov 13 at 10:06
add a comment |
up vote
4
down vote
This is very easy with a simple trick. Let $q(z)=a_n+a_{n-1}z+cdots+ a_0z^{n}$. Then $q(z)=z^{n}p(frac 1 z)$. $q$ is a polynomial and $|q(z)| leq 1$ if $|z|=1$. By MMP $|q(0)| leq 1$ which is what we need.
Ah, I misunderstood the question – I thought it was asking for $|a_k|le1$ for $0le kle n$.
– Gerry Myerson
Nov 13 at 10:06
add a comment |
up vote
4
down vote
up vote
4
down vote
This is very easy with a simple trick. Let $q(z)=a_n+a_{n-1}z+cdots+ a_0z^{n}$. Then $q(z)=z^{n}p(frac 1 z)$. $q$ is a polynomial and $|q(z)| leq 1$ if $|z|=1$. By MMP $|q(0)| leq 1$ which is what we need.
This is very easy with a simple trick. Let $q(z)=a_n+a_{n-1}z+cdots+ a_0z^{n}$. Then $q(z)=z^{n}p(frac 1 z)$. $q$ is a polynomial and $|q(z)| leq 1$ if $|z|=1$. By MMP $|q(0)| leq 1$ which is what we need.
answered Nov 12 at 5:31
Kavi Rama Murthy
46.6k31854
46.6k31854
Ah, I misunderstood the question – I thought it was asking for $|a_k|le1$ for $0le kle n$.
– Gerry Myerson
Nov 13 at 10:06
add a comment |
Ah, I misunderstood the question – I thought it was asking for $|a_k|le1$ for $0le kle n$.
– Gerry Myerson
Nov 13 at 10:06
Ah, I misunderstood the question – I thought it was asking for $|a_k|le1$ for $0le kle n$.
– Gerry Myerson
Nov 13 at 10:06
Ah, I misunderstood the question – I thought it was asking for $|a_k|le1$ for $0le kle n$.
– Gerry Myerson
Nov 13 at 10:06
add a comment |
up vote
2
down vote
One way to show this is via Cauchy estimates.
From Cauchy integral formula, for the $n$-th derivative of $P$ we have
$$
P^{(n)}(z) = frac{n!}{2pi i } int_{|xi| = 1} frac{P(xi)}{(z - xi)^{n+1}}dxi.
$$
Hence, using the fact that $|P|leq 1$ on $|xi| = 1$, we obtain
$$
n! |a_n| leq frac{n!}{2pi } int_{|xi| = 1} frac{|dxi| }{|z - xi|^{n+1}} =
frac{n!}{2pi} intlimits_0^{2pi} left|frac{ie^{itheta}} {(e^{itheta})^{n+1}}right| dtheta = n!,
$$
which gives $|a_n|leq 1$.
add a comment |
up vote
2
down vote
One way to show this is via Cauchy estimates.
From Cauchy integral formula, for the $n$-th derivative of $P$ we have
$$
P^{(n)}(z) = frac{n!}{2pi i } int_{|xi| = 1} frac{P(xi)}{(z - xi)^{n+1}}dxi.
$$
Hence, using the fact that $|P|leq 1$ on $|xi| = 1$, we obtain
$$
n! |a_n| leq frac{n!}{2pi } int_{|xi| = 1} frac{|dxi| }{|z - xi|^{n+1}} =
frac{n!}{2pi} intlimits_0^{2pi} left|frac{ie^{itheta}} {(e^{itheta})^{n+1}}right| dtheta = n!,
$$
which gives $|a_n|leq 1$.
add a comment |
up vote
2
down vote
up vote
2
down vote
One way to show this is via Cauchy estimates.
From Cauchy integral formula, for the $n$-th derivative of $P$ we have
$$
P^{(n)}(z) = frac{n!}{2pi i } int_{|xi| = 1} frac{P(xi)}{(z - xi)^{n+1}}dxi.
$$
Hence, using the fact that $|P|leq 1$ on $|xi| = 1$, we obtain
$$
n! |a_n| leq frac{n!}{2pi } int_{|xi| = 1} frac{|dxi| }{|z - xi|^{n+1}} =
frac{n!}{2pi} intlimits_0^{2pi} left|frac{ie^{itheta}} {(e^{itheta})^{n+1}}right| dtheta = n!,
$$
which gives $|a_n|leq 1$.
One way to show this is via Cauchy estimates.
From Cauchy integral formula, for the $n$-th derivative of $P$ we have
$$
P^{(n)}(z) = frac{n!}{2pi i } int_{|xi| = 1} frac{P(xi)}{(z - xi)^{n+1}}dxi.
$$
Hence, using the fact that $|P|leq 1$ on $|xi| = 1$, we obtain
$$
n! |a_n| leq frac{n!}{2pi } int_{|xi| = 1} frac{|dxi| }{|z - xi|^{n+1}} =
frac{n!}{2pi} intlimits_0^{2pi} left|frac{ie^{itheta}} {(e^{itheta})^{n+1}}right| dtheta = n!,
$$
which gives $|a_n|leq 1$.
answered Nov 12 at 5:04
Hayk
2,022212
2,022212
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.
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%2f2994849%2fcomplex-polynomial-inequality-proof%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
1
Maybe it pays to think about integrating $z^{-k}P(z)$ around the unit circle.
– Gerry Myerson
Nov 12 at 4:55