Proving that $C(r) = c_1r+c_2r^2 + c_3r^3 + cdots$ can be made as small as desired?
$begingroup$
The $c_i$ are all positive and $C(r)$ converges on some interval around $0$.
This seems like a sort of obvious fact, but it took me several minutes to come up with the idea of doing
$$C(r) = sum_{j=1} ^ {infty} c_j r^j= sum_{j=1}^N c_j r^j + sum_{J=N+1}^{infty} c_j r^j$$
First we can make the sum on the right as small as desired by picking $N$ large enough, and then we can make the finite sum as small as desired because the coefficients are now bounded.
My question is, is there another way to solve this? Since this seems like an obvious fact, it seems like it should have a simpler proof.
real-analysis analysis
$endgroup$
add a comment |
$begingroup$
The $c_i$ are all positive and $C(r)$ converges on some interval around $0$.
This seems like a sort of obvious fact, but it took me several minutes to come up with the idea of doing
$$C(r) = sum_{j=1} ^ {infty} c_j r^j= sum_{j=1}^N c_j r^j + sum_{J=N+1}^{infty} c_j r^j$$
First we can make the sum on the right as small as desired by picking $N$ large enough, and then we can make the finite sum as small as desired because the coefficients are now bounded.
My question is, is there another way to solve this? Since this seems like an obvious fact, it seems like it should have a simpler proof.
real-analysis analysis
$endgroup$
$begingroup$
Using the fact that $limsup |c_n|^{1/n}$ is finite, you can bound $|C(r)|$ by a geometric series.
$endgroup$
– Mike Earnest
Jan 27 at 17:58
add a comment |
$begingroup$
The $c_i$ are all positive and $C(r)$ converges on some interval around $0$.
This seems like a sort of obvious fact, but it took me several minutes to come up with the idea of doing
$$C(r) = sum_{j=1} ^ {infty} c_j r^j= sum_{j=1}^N c_j r^j + sum_{J=N+1}^{infty} c_j r^j$$
First we can make the sum on the right as small as desired by picking $N$ large enough, and then we can make the finite sum as small as desired because the coefficients are now bounded.
My question is, is there another way to solve this? Since this seems like an obvious fact, it seems like it should have a simpler proof.
real-analysis analysis
$endgroup$
The $c_i$ are all positive and $C(r)$ converges on some interval around $0$.
This seems like a sort of obvious fact, but it took me several minutes to come up with the idea of doing
$$C(r) = sum_{j=1} ^ {infty} c_j r^j= sum_{j=1}^N c_j r^j + sum_{J=N+1}^{infty} c_j r^j$$
First we can make the sum on the right as small as desired by picking $N$ large enough, and then we can make the finite sum as small as desired because the coefficients are now bounded.
My question is, is there another way to solve this? Since this seems like an obvious fact, it seems like it should have a simpler proof.
real-analysis analysis
real-analysis analysis
asked Jan 27 at 15:37


OviOvi
12.4k1040114
12.4k1040114
$begingroup$
Using the fact that $limsup |c_n|^{1/n}$ is finite, you can bound $|C(r)|$ by a geometric series.
$endgroup$
– Mike Earnest
Jan 27 at 17:58
add a comment |
$begingroup$
Using the fact that $limsup |c_n|^{1/n}$ is finite, you can bound $|C(r)|$ by a geometric series.
$endgroup$
– Mike Earnest
Jan 27 at 17:58
$begingroup$
Using the fact that $limsup |c_n|^{1/n}$ is finite, you can bound $|C(r)|$ by a geometric series.
$endgroup$
– Mike Earnest
Jan 27 at 17:58
$begingroup$
Using the fact that $limsup |c_n|^{1/n}$ is finite, you can bound $|C(r)|$ by a geometric series.
$endgroup$
– Mike Earnest
Jan 27 at 17:58
add a comment |
0
active
oldest
votes
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%2f3089710%2fproving-that-cr-c-1rc-2r2-c-3r3-cdots-can-be-made-as-small-as-desi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3089710%2fproving-that-cr-c-1rc-2r2-c-3r3-cdots-can-be-made-as-small-as-desi%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
$begingroup$
Using the fact that $limsup |c_n|^{1/n}$ is finite, you can bound $|C(r)|$ by a geometric series.
$endgroup$
– Mike Earnest
Jan 27 at 17:58