Rate of convergence of a sum of sequence
$begingroup$
Suppose $a_k=1/k$ and $b_k$ is a positive sequence with $ b_k to 0$. Is there any result that establishes the rate of decay of $b_k$, if $$ sum_k a_kb_k < infty $$
or when can in general $sum_k a_k b_k $ be finite if $b_k to 0$ and is positive for all $k$, and $a_k=1/k$
real-analysis sequences-and-series
$endgroup$
add a comment |
$begingroup$
Suppose $a_k=1/k$ and $b_k$ is a positive sequence with $ b_k to 0$. Is there any result that establishes the rate of decay of $b_k$, if $$ sum_k a_kb_k < infty $$
or when can in general $sum_k a_k b_k $ be finite if $b_k to 0$ and is positive for all $k$, and $a_k=1/k$
real-analysis sequences-and-series
$endgroup$
$begingroup$
yes, thanks for pointing out
$endgroup$
– user143234
Dec 24 '18 at 0:58
add a comment |
$begingroup$
Suppose $a_k=1/k$ and $b_k$ is a positive sequence with $ b_k to 0$. Is there any result that establishes the rate of decay of $b_k$, if $$ sum_k a_kb_k < infty $$
or when can in general $sum_k a_k b_k $ be finite if $b_k to 0$ and is positive for all $k$, and $a_k=1/k$
real-analysis sequences-and-series
$endgroup$
Suppose $a_k=1/k$ and $b_k$ is a positive sequence with $ b_k to 0$. Is there any result that establishes the rate of decay of $b_k$, if $$ sum_k a_kb_k < infty $$
or when can in general $sum_k a_k b_k $ be finite if $b_k to 0$ and is positive for all $k$, and $a_k=1/k$
real-analysis sequences-and-series
real-analysis sequences-and-series
edited Dec 24 '18 at 0:58
user143234
asked Dec 24 '18 at 0:53
user143234user143234
1318
1318
$begingroup$
yes, thanks for pointing out
$endgroup$
– user143234
Dec 24 '18 at 0:58
add a comment |
$begingroup$
yes, thanks for pointing out
$endgroup$
– user143234
Dec 24 '18 at 0:58
$begingroup$
yes, thanks for pointing out
$endgroup$
– user143234
Dec 24 '18 at 0:58
$begingroup$
yes, thanks for pointing out
$endgroup$
– user143234
Dec 24 '18 at 0:58
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
There is no result establishing the rate of decay exactly. This follows from a close analysis of the $p$-series test: that is, $sum n^{-p}$ converges for $p>1$, but the rate of convergence need not be so fast. The sum $sum n^{-1}(log n)^{-p}$ also converges for $p>1$ and its rate of convergence is strictly slower than $sum n^{-p}$.
Applying a similar process, we have $sum (nlog n)^{-1}(loglog n)^{-p}$ converges for $p>1$, so on and so forth. In your notation, this means $b_n=(log n)^{-1}(loglog n)^{-p}$, or to go one step further, $b_n=(log nloglog n)^{-1}(logloglog n)^{-p}$.
In all of these cases, it is true that $b_nllfrac{1}{log n}$, so you at least have a minimum rate of decay. This isn't true in general; see the comments for an example where you can prescribe the rate of decay as slowly as you see fit.
Note: The requirement of positivity for $b_n$ can be loosened to positive for all sufficiently large $n$ since we can just otherwise take $b_n=1$ for the first $N$ terms and then define it using the logarithms for $ngeq N+1$.
$endgroup$
$begingroup$
Thanks for the info.
$endgroup$
– user143234
Dec 24 '18 at 1:15
$begingroup$
@user143234: you are welcome.
$endgroup$
– Clayton
Dec 24 '18 at 1:18
$begingroup$
What about say $$b_k = begin{cases}frac{1}{sqrt{log k}} &text{ if } k text{ is a power of } 2\ frac{1}{k^2} &text{ otherwise}end{cases}$$? It does *not* satisfy $b_k ll frac{1}{log k}$...
$endgroup$
– Clement C.
Dec 24 '18 at 1:35
$begingroup$
@ClementC.: Of course. While different from the example I had thought of, your example fits in just fine (that is, I had thought of an example that doesn't satisfy the decay property listed; it doesn't change that the $b_n$ I've defined do satisfy it, though). It seemed like the OP simply wanted to know that there was no definitive, exact rate of decay (for which there isn't).
$endgroup$
– Clayton
Dec 24 '18 at 1:45
$begingroup$
@Clayton: my example is basically to say your sentence "but you can provide some estimate on how quickly it decays" is wrong. You cannot... you can have a subsequence of $(b_k)_k$ going to zero arbitrarily slowly.
$endgroup$
– Clement C.
Dec 24 '18 at 1:48
|
show 2 more comments
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%2f3050846%2frate-of-convergence-of-a-sum-of-sequence%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
$begingroup$
There is no result establishing the rate of decay exactly. This follows from a close analysis of the $p$-series test: that is, $sum n^{-p}$ converges for $p>1$, but the rate of convergence need not be so fast. The sum $sum n^{-1}(log n)^{-p}$ also converges for $p>1$ and its rate of convergence is strictly slower than $sum n^{-p}$.
Applying a similar process, we have $sum (nlog n)^{-1}(loglog n)^{-p}$ converges for $p>1$, so on and so forth. In your notation, this means $b_n=(log n)^{-1}(loglog n)^{-p}$, or to go one step further, $b_n=(log nloglog n)^{-1}(logloglog n)^{-p}$.
In all of these cases, it is true that $b_nllfrac{1}{log n}$, so you at least have a minimum rate of decay. This isn't true in general; see the comments for an example where you can prescribe the rate of decay as slowly as you see fit.
Note: The requirement of positivity for $b_n$ can be loosened to positive for all sufficiently large $n$ since we can just otherwise take $b_n=1$ for the first $N$ terms and then define it using the logarithms for $ngeq N+1$.
$endgroup$
$begingroup$
Thanks for the info.
$endgroup$
– user143234
Dec 24 '18 at 1:15
$begingroup$
@user143234: you are welcome.
$endgroup$
– Clayton
Dec 24 '18 at 1:18
$begingroup$
What about say $$b_k = begin{cases}frac{1}{sqrt{log k}} &text{ if } k text{ is a power of } 2\ frac{1}{k^2} &text{ otherwise}end{cases}$$? It does *not* satisfy $b_k ll frac{1}{log k}$...
$endgroup$
– Clement C.
Dec 24 '18 at 1:35
$begingroup$
@ClementC.: Of course. While different from the example I had thought of, your example fits in just fine (that is, I had thought of an example that doesn't satisfy the decay property listed; it doesn't change that the $b_n$ I've defined do satisfy it, though). It seemed like the OP simply wanted to know that there was no definitive, exact rate of decay (for which there isn't).
$endgroup$
– Clayton
Dec 24 '18 at 1:45
$begingroup$
@Clayton: my example is basically to say your sentence "but you can provide some estimate on how quickly it decays" is wrong. You cannot... you can have a subsequence of $(b_k)_k$ going to zero arbitrarily slowly.
$endgroup$
– Clement C.
Dec 24 '18 at 1:48
|
show 2 more comments
$begingroup$
There is no result establishing the rate of decay exactly. This follows from a close analysis of the $p$-series test: that is, $sum n^{-p}$ converges for $p>1$, but the rate of convergence need not be so fast. The sum $sum n^{-1}(log n)^{-p}$ also converges for $p>1$ and its rate of convergence is strictly slower than $sum n^{-p}$.
Applying a similar process, we have $sum (nlog n)^{-1}(loglog n)^{-p}$ converges for $p>1$, so on and so forth. In your notation, this means $b_n=(log n)^{-1}(loglog n)^{-p}$, or to go one step further, $b_n=(log nloglog n)^{-1}(logloglog n)^{-p}$.
In all of these cases, it is true that $b_nllfrac{1}{log n}$, so you at least have a minimum rate of decay. This isn't true in general; see the comments for an example where you can prescribe the rate of decay as slowly as you see fit.
Note: The requirement of positivity for $b_n$ can be loosened to positive for all sufficiently large $n$ since we can just otherwise take $b_n=1$ for the first $N$ terms and then define it using the logarithms for $ngeq N+1$.
$endgroup$
$begingroup$
Thanks for the info.
$endgroup$
– user143234
Dec 24 '18 at 1:15
$begingroup$
@user143234: you are welcome.
$endgroup$
– Clayton
Dec 24 '18 at 1:18
$begingroup$
What about say $$b_k = begin{cases}frac{1}{sqrt{log k}} &text{ if } k text{ is a power of } 2\ frac{1}{k^2} &text{ otherwise}end{cases}$$? It does *not* satisfy $b_k ll frac{1}{log k}$...
$endgroup$
– Clement C.
Dec 24 '18 at 1:35
$begingroup$
@ClementC.: Of course. While different from the example I had thought of, your example fits in just fine (that is, I had thought of an example that doesn't satisfy the decay property listed; it doesn't change that the $b_n$ I've defined do satisfy it, though). It seemed like the OP simply wanted to know that there was no definitive, exact rate of decay (for which there isn't).
$endgroup$
– Clayton
Dec 24 '18 at 1:45
$begingroup$
@Clayton: my example is basically to say your sentence "but you can provide some estimate on how quickly it decays" is wrong. You cannot... you can have a subsequence of $(b_k)_k$ going to zero arbitrarily slowly.
$endgroup$
– Clement C.
Dec 24 '18 at 1:48
|
show 2 more comments
$begingroup$
There is no result establishing the rate of decay exactly. This follows from a close analysis of the $p$-series test: that is, $sum n^{-p}$ converges for $p>1$, but the rate of convergence need not be so fast. The sum $sum n^{-1}(log n)^{-p}$ also converges for $p>1$ and its rate of convergence is strictly slower than $sum n^{-p}$.
Applying a similar process, we have $sum (nlog n)^{-1}(loglog n)^{-p}$ converges for $p>1$, so on and so forth. In your notation, this means $b_n=(log n)^{-1}(loglog n)^{-p}$, or to go one step further, $b_n=(log nloglog n)^{-1}(logloglog n)^{-p}$.
In all of these cases, it is true that $b_nllfrac{1}{log n}$, so you at least have a minimum rate of decay. This isn't true in general; see the comments for an example where you can prescribe the rate of decay as slowly as you see fit.
Note: The requirement of positivity for $b_n$ can be loosened to positive for all sufficiently large $n$ since we can just otherwise take $b_n=1$ for the first $N$ terms and then define it using the logarithms for $ngeq N+1$.
$endgroup$
There is no result establishing the rate of decay exactly. This follows from a close analysis of the $p$-series test: that is, $sum n^{-p}$ converges for $p>1$, but the rate of convergence need not be so fast. The sum $sum n^{-1}(log n)^{-p}$ also converges for $p>1$ and its rate of convergence is strictly slower than $sum n^{-p}$.
Applying a similar process, we have $sum (nlog n)^{-1}(loglog n)^{-p}$ converges for $p>1$, so on and so forth. In your notation, this means $b_n=(log n)^{-1}(loglog n)^{-p}$, or to go one step further, $b_n=(log nloglog n)^{-1}(logloglog n)^{-p}$.
In all of these cases, it is true that $b_nllfrac{1}{log n}$, so you at least have a minimum rate of decay. This isn't true in general; see the comments for an example where you can prescribe the rate of decay as slowly as you see fit.
Note: The requirement of positivity for $b_n$ can be loosened to positive for all sufficiently large $n$ since we can just otherwise take $b_n=1$ for the first $N$ terms and then define it using the logarithms for $ngeq N+1$.
edited Dec 24 '18 at 1:50
answered Dec 24 '18 at 1:09
ClaytonClayton
19.2k33286
19.2k33286
$begingroup$
Thanks for the info.
$endgroup$
– user143234
Dec 24 '18 at 1:15
$begingroup$
@user143234: you are welcome.
$endgroup$
– Clayton
Dec 24 '18 at 1:18
$begingroup$
What about say $$b_k = begin{cases}frac{1}{sqrt{log k}} &text{ if } k text{ is a power of } 2\ frac{1}{k^2} &text{ otherwise}end{cases}$$? It does *not* satisfy $b_k ll frac{1}{log k}$...
$endgroup$
– Clement C.
Dec 24 '18 at 1:35
$begingroup$
@ClementC.: Of course. While different from the example I had thought of, your example fits in just fine (that is, I had thought of an example that doesn't satisfy the decay property listed; it doesn't change that the $b_n$ I've defined do satisfy it, though). It seemed like the OP simply wanted to know that there was no definitive, exact rate of decay (for which there isn't).
$endgroup$
– Clayton
Dec 24 '18 at 1:45
$begingroup$
@Clayton: my example is basically to say your sentence "but you can provide some estimate on how quickly it decays" is wrong. You cannot... you can have a subsequence of $(b_k)_k$ going to zero arbitrarily slowly.
$endgroup$
– Clement C.
Dec 24 '18 at 1:48
|
show 2 more comments
$begingroup$
Thanks for the info.
$endgroup$
– user143234
Dec 24 '18 at 1:15
$begingroup$
@user143234: you are welcome.
$endgroup$
– Clayton
Dec 24 '18 at 1:18
$begingroup$
What about say $$b_k = begin{cases}frac{1}{sqrt{log k}} &text{ if } k text{ is a power of } 2\ frac{1}{k^2} &text{ otherwise}end{cases}$$? It does *not* satisfy $b_k ll frac{1}{log k}$...
$endgroup$
– Clement C.
Dec 24 '18 at 1:35
$begingroup$
@ClementC.: Of course. While different from the example I had thought of, your example fits in just fine (that is, I had thought of an example that doesn't satisfy the decay property listed; it doesn't change that the $b_n$ I've defined do satisfy it, though). It seemed like the OP simply wanted to know that there was no definitive, exact rate of decay (for which there isn't).
$endgroup$
– Clayton
Dec 24 '18 at 1:45
$begingroup$
@Clayton: my example is basically to say your sentence "but you can provide some estimate on how quickly it decays" is wrong. You cannot... you can have a subsequence of $(b_k)_k$ going to zero arbitrarily slowly.
$endgroup$
– Clement C.
Dec 24 '18 at 1:48
$begingroup$
Thanks for the info.
$endgroup$
– user143234
Dec 24 '18 at 1:15
$begingroup$
Thanks for the info.
$endgroup$
– user143234
Dec 24 '18 at 1:15
$begingroup$
@user143234: you are welcome.
$endgroup$
– Clayton
Dec 24 '18 at 1:18
$begingroup$
@user143234: you are welcome.
$endgroup$
– Clayton
Dec 24 '18 at 1:18
$begingroup$
What about say $$b_k = begin{cases}frac{1}{sqrt{log k}} &text{ if } k text{ is a power of } 2\ frac{1}{k^2} &text{ otherwise}end{cases}$$? It does *not* satisfy $b_k ll frac{1}{log k}$...
$endgroup$
– Clement C.
Dec 24 '18 at 1:35
$begingroup$
What about say $$b_k = begin{cases}frac{1}{sqrt{log k}} &text{ if } k text{ is a power of } 2\ frac{1}{k^2} &text{ otherwise}end{cases}$$? It does *not* satisfy $b_k ll frac{1}{log k}$...
$endgroup$
– Clement C.
Dec 24 '18 at 1:35
$begingroup$
@ClementC.: Of course. While different from the example I had thought of, your example fits in just fine (that is, I had thought of an example that doesn't satisfy the decay property listed; it doesn't change that the $b_n$ I've defined do satisfy it, though). It seemed like the OP simply wanted to know that there was no definitive, exact rate of decay (for which there isn't).
$endgroup$
– Clayton
Dec 24 '18 at 1:45
$begingroup$
@ClementC.: Of course. While different from the example I had thought of, your example fits in just fine (that is, I had thought of an example that doesn't satisfy the decay property listed; it doesn't change that the $b_n$ I've defined do satisfy it, though). It seemed like the OP simply wanted to know that there was no definitive, exact rate of decay (for which there isn't).
$endgroup$
– Clayton
Dec 24 '18 at 1:45
$begingroup$
@Clayton: my example is basically to say your sentence "but you can provide some estimate on how quickly it decays" is wrong. You cannot... you can have a subsequence of $(b_k)_k$ going to zero arbitrarily slowly.
$endgroup$
– Clement C.
Dec 24 '18 at 1:48
$begingroup$
@Clayton: my example is basically to say your sentence "but you can provide some estimate on how quickly it decays" is wrong. You cannot... you can have a subsequence of $(b_k)_k$ going to zero arbitrarily slowly.
$endgroup$
– Clement C.
Dec 24 '18 at 1:48
|
show 2 more comments
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%2f3050846%2frate-of-convergence-of-a-sum-of-sequence%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$
yes, thanks for pointing out
$endgroup$
– user143234
Dec 24 '18 at 0:58