Prove that minimum of $ f $ on $ |z| = 1 $ is no greater than $ |a_0| + cdots + |a_m| $
Let $ D $ be the open unit disk. Suppose $ f in H(D) cap C(bar{D}) $ and write $ f(z) = sum a_n z^n $ for $ |z| < 1 $. If $ f $ has exactly $ m $ zeros in $ D $, prove that
$$ min_{|z|=1} |f(z) | leq |a_0| + cdots + |a_m|. $$
My original idea was to prove by contradiction: suppose $$ |f(z)| > |a_0| + cdots + |a_m| geq |a_0 + a_1z + cdots + a_mz^m|. $$
Then if we can use Rouché's theorem, this implies that $ f $ has the same number of zeros as $ f -g $, which is $ m + 1 $, a contradiction. However I don't think I can apply Rouché's theorem since $ f $ is not known to be holomorphic on $ bar{D} $. How do I solve this problem?
complex-analysis
asked 2 days ago
lifeishard911
1146
add a comment |
Let $ D $ be the open unit disk. Suppose $ f in H(D) cap C(bar{D}) $ and write $ f(z) = sum a_n z^n $ for $ |z| < 1 $. If $ f $ has exactly $ m $ zeros in $ D $, prove that
$$ min_{|z|=1} |f(z) | leq |a_0| + cdots + |a_m|. $$
My original idea was to prove by contradiction: suppose $$ |f(z)| > |a_0| + cdots + |a_m| geq |a_0 + a_1z + cdots + a_mz^m|. $$
Then if we can use Rouché's theorem, this implies that $ f $ has the same number of zeros as $ f -g $, which is $ m + 1 $, a contradiction. However I don't think I can apply Rouché's theorem since $ f $ is not known to be holomorphic on $ bar{D} $. How do I solve this problem?
complex-analysis
asked 2 days ago
lifeishard911
1146
add a comment |
Let $ D $ be the open unit disk. Suppose $ f in H(D) cap C(bar{D}) $ and write $ f(z) = sum a_n z^n $ for $ |z| < 1 $. If $ f $ has exactly $ m $ zeros in $ D $, prove that
$$ min_{|z|=1} |f(z) | leq |a_0| + cdots + |a_m|. $$
My original idea was to prove by contradiction: suppose $$ |f(z)| > |a_0| + cdots + |a_m| geq |a_0 + a_1z + cdots + a_mz^m|. $$
Then if we can use Rouché's theorem, this implies that $ f $ has the same number of zeros as $ f -g $, which is $ m + 1 $, a contradiction. However I don't think I can apply Rouché's theorem since $ f $ is not known to be holomorphic on $ bar{D} $. How do I solve this problem?
complex-analysis
asked 2 days ago
lifeishard911
1146
Let $ D $ be the open unit disk. Suppose $ f in H(D) cap C(bar{D}) $ and write $ f(z) = sum a_n z^n $ for $ |z| < 1 $. If $ f $ has exactly $ m $ zeros in $ D $, prove that
$$ min_{|z|=1} |f(z) | leq |a_0| + cdots + |a_m|. $$
My original idea was to prove by contradiction: suppose $$ |f(z)| > |a_0| + cdots + |a_m| geq |a_0 + a_1z + cdots + a_mz^m|. $$
Then if we can use Rouché's theorem, this implies that $ f $ has the same number of zeros as $ f -g $, which is $ m + 1 $, a contradiction. However I don't think I can apply Rouché's theorem since $ f $ is not known to be holomorphic on $ bar{D} $. How do I solve this problem?
complex-analysis
complex-analysis
asked 2 days ago
lifeishard911
1146
asked 2 days ago
lifeishard911
1146
asked 2 days ago
lifeishard911
1146
asked 2 days ago
lifeishard911
1146
asked 2 days ago
lifeishard911
1146
1146
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
Just apply the same argument to the $|z|=1-epsilon$. $max |f(z)| >|a_0|+|a_1|+...+|a_m|$ implies $|f(z)| >|a_0+a_1z+...+a_mz^{m}|$ for $|z|=1-epsilon$ of $epsilon $ is small enough. Als0, number of zeros of a polynomial on the open disk equals the number of zeros on $|z|<1-epsilon$ for $epsilon $ is small enough.
answered 2 days ago
Kavi Rama Murthy
51.5k31855
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%2f3062625%2fprove-that-minimum-of-f-on-z-1-is-no-greater-than-a-0-cdots%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
Just apply the same argument to the $|z|=1-epsilon$. $max |f(z)| >|a_0|+|a_1|+...+|a_m|$ implies $|f(z)| >|a_0+a_1z+...+a_mz^{m}|$ for $|z|=1-epsilon$ of $epsilon $ is small enough. Als0, number of zeros of a polynomial on the open disk equals the number of zeros on $|z|<1-epsilon$ for $epsilon $ is small enough.
answered 2 days ago
Kavi Rama Murthy
51.5k31855
add a comment |
Just apply the same argument to the $|z|=1-epsilon$. $max |f(z)| >|a_0|+|a_1|+...+|a_m|$ implies $|f(z)| >|a_0+a_1z+...+a_mz^{m}|$ for $|z|=1-epsilon$ of $epsilon $ is small enough. Als0, number of zeros of a polynomial on the open disk equals the number of zeros on $|z|<1-epsilon$ for $epsilon $ is small enough.
answered 2 days ago
Kavi Rama Murthy
51.5k31855
add a comment |
Just apply the same argument to the $|z|=1-epsilon$. $max |f(z)| >|a_0|+|a_1|+...+|a_m|$ implies $|f(z)| >|a_0+a_1z+...+a_mz^{m}|$ for $|z|=1-epsilon$ of $epsilon $ is small enough. Als0, number of zeros of a polynomial on the open disk equals the number of zeros on $|z|<1-epsilon$ for $epsilon $ is small enough.
answered 2 days ago
Kavi Rama Murthy
51.5k31855
Just apply the same argument to the $|z|=1-epsilon$. $max |f(z)| >|a_0|+|a_1|+...+|a_m|$ implies $|f(z)| >|a_0+a_1z+...+a_mz^{m}|$ for $|z|=1-epsilon$ of $epsilon $ is small enough. Als0, number of zeros of a polynomial on the open disk equals the number of zeros on $|z|<1-epsilon$ for $epsilon $ is small enough.
answered 2 days ago
Kavi Rama Murthy
51.5k31855
edited 2 days ago
answered 2 days ago
Kavi Rama Murthy
51.5k31855
answered 2 days ago
Kavi Rama Murthy
51.5k31855
answered 2 days ago
Kavi Rama Murthy
51.5k31855
51.5k31855
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%2f3062625%2fprove-that-minimum-of-f-on-z-1-is-no-greater-than-a-0-cdots%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
