Mixing
Why is it possible here to sum equivalent
$begingroup$
We have a sequence :
$$u_n = frac{e^{-u_{n-1}}}{n+1}$$
It's easy to prove that : $lim_{n to infty} u_n = 0$ and that $lim_{n to infty} nu_n = 1$ so that : $u_n sim frac{1}{n}$.
Then I am asked to find the nature of $ sum (-1)^n u_n$.
In the correction of the exercise they do the following :
$$mid u_n mid = frac{1-u_{n-1} +O(u_{n-1})}{n+1} = frac{1}{n} - frac{1}{n^2} + O(frac{1}{n^2})$$
I don't understand why is it possible to replace $u_{n-1}$ by the equivalent of $u_{n-1}$ which is $frac{1}{n-1}$ since it's a sum. Normally in a sum we need to do some tricks in order to replace a sequence by it's equivalent.
When I compute the limit of $ frac{1-u_{n-1}}{1-1/n}$ it does go to $1$ at infinity. But they are not giving any explanations of why it is possible here ? Is there a rule or something I missed ?
Thank you !
real-analysis sequences-and-series asymptotics
asked Jan 6 at 11:12
hfrjeaklhfuzlhfrjeaklhfuzl
132
$endgroup$
add a comment |
$begingroup$
We have a sequence :
$$u_n = frac{e^{-u_{n-1}}}{n+1}$$
It's easy to prove that : $lim_{n to infty} u_n = 0$ and that $lim_{n to infty} nu_n = 1$ so that : $u_n sim frac{1}{n}$.
Then I am asked to find the nature of $ sum (-1)^n u_n$.
In the correction of the exercise they do the following :
$$mid u_n mid = frac{1-u_{n-1} +O(u_{n-1})}{n+1} = frac{1}{n} - frac{1}{n^2} + O(frac{1}{n^2})$$
I don't understand why is it possible to replace $u_{n-1}$ by the equivalent of $u_{n-1}$ which is $frac{1}{n-1}$ since it's a sum. Normally in a sum we need to do some tricks in order to replace a sequence by it's equivalent.
When I compute the limit of $ frac{1-u_{n-1}}{1-1/n}$ it does go to $1$ at infinity. But they are not giving any explanations of why it is possible here ? Is there a rule or something I missed ?
Thank you !
real-analysis sequences-and-series asymptotics
asked Jan 6 at 11:12
hfrjeaklhfuzlhfrjeaklhfuzl
132
$endgroup$
$begingroup$
I suppose your big-Oh's should be little-oh's?
$endgroup$
– Hagen von Eitzen
Jan 6 at 11:26
add a comment |
$begingroup$
We have a sequence :
$$u_n = frac{e^{-u_{n-1}}}{n+1}$$
It's easy to prove that : $lim_{n to infty} u_n = 0$ and that $lim_{n to infty} nu_n = 1$ so that : $u_n sim frac{1}{n}$.
Then I am asked to find the nature of $ sum (-1)^n u_n$.
In the correction of the exercise they do the following :
$$mid u_n mid = frac{1-u_{n-1} +O(u_{n-1})}{n+1} = frac{1}{n} - frac{1}{n^2} + O(frac{1}{n^2})$$
I don't understand why is it possible to replace $u_{n-1}$ by the equivalent of $u_{n-1}$ which is $frac{1}{n-1}$ since it's a sum. Normally in a sum we need to do some tricks in order to replace a sequence by it's equivalent.
When I compute the limit of $ frac{1-u_{n-1}}{1-1/n}$ it does go to $1$ at infinity. But they are not giving any explanations of why it is possible here ? Is there a rule or something I missed ?
Thank you !
real-analysis sequences-and-series asymptotics
asked Jan 6 at 11:12
hfrjeaklhfuzlhfrjeaklhfuzl
132
$endgroup$
We have a sequence :
$$u_n = frac{e^{-u_{n-1}}}{n+1}$$
It's easy to prove that : $lim_{n to infty} u_n = 0$ and that $lim_{n to infty} nu_n = 1$ so that : $u_n sim frac{1}{n}$.
Then I am asked to find the nature of $ sum (-1)^n u_n$.
In the correction of the exercise they do the following :
$$mid u_n mid = frac{1-u_{n-1} +O(u_{n-1})}{n+1} = frac{1}{n} - frac{1}{n^2} + O(frac{1}{n^2})$$
I don't understand why is it possible to replace $u_{n-1}$ by the equivalent of $u_{n-1}$ which is $frac{1}{n-1}$ since it's a sum. Normally in a sum we need to do some tricks in order to replace a sequence by it's equivalent.
When I compute the limit of $ frac{1-u_{n-1}}{1-1/n}$ it does go to $1$ at infinity. But they are not giving any explanations of why it is possible here ? Is there a rule or something I missed ?
Thank you !
real-analysis sequences-and-series asymptotics
real-analysis sequences-and-series asymptotics
asked Jan 6 at 11:12
hfrjeaklhfuzlhfrjeaklhfuzl
132
asked Jan 6 at 11:12
hfrjeaklhfuzlhfrjeaklhfuzl
132
asked Jan 6 at 11:12
hfrjeaklhfuzlhfrjeaklhfuzl
132
asked Jan 6 at 11:12
hfrjeaklhfuzlhfrjeaklhfuzl
132
asked Jan 6 at 11:12
hfrjeaklhfuzlhfrjeaklhfuzl
132
132
$begingroup$
I suppose your big-Oh's should be little-oh's?
$endgroup$
– Hagen von Eitzen
Jan 6 at 11:26
add a comment |
$begingroup$
I suppose your big-Oh's should be little-oh's?
$endgroup$
– Hagen von Eitzen
Jan 6 at 11:26
$begingroup$
I suppose your big-Oh's should be little-oh's?
$endgroup$
– Hagen von Eitzen
Jan 6 at 11:26
$begingroup$
I suppose your big-Oh's should be little-oh's?
$endgroup$
– Hagen von Eitzen
Jan 6 at 11:26
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Consider the sequences $a_n=frac{1}{n+1}$, $b_n=u_n-a_n$.
Then $sum_n{(-1)^na_n}$ is well-known to be convergent.
Furthermore, $b_n=frac{1}{n+1}(e^{-u_{n-1}}-1)sim frac{-u_{n-1}}{n} sim -n^{-2}$, thus $sum_n{b_n(-1)^n}$ is absolutely convergent.
answered Jan 6 at 11:18
MindlackMindlack
3,15217
$endgroup$
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%2f3063726%2fwhy-is-it-possible-here-to-sum-equivalent%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$
Consider the sequences $a_n=frac{1}{n+1}$, $b_n=u_n-a_n$.
Then $sum_n{(-1)^na_n}$ is well-known to be convergent.
Furthermore, $b_n=frac{1}{n+1}(e^{-u_{n-1}}-1)sim frac{-u_{n-1}}{n} sim -n^{-2}$, thus $sum_n{b_n(-1)^n}$ is absolutely convergent.
answered Jan 6 at 11:18
MindlackMindlack
3,15217
$endgroup$
add a comment |
$begingroup$
Consider the sequences $a_n=frac{1}{n+1}$, $b_n=u_n-a_n$.
Then $sum_n{(-1)^na_n}$ is well-known to be convergent.
Furthermore, $b_n=frac{1}{n+1}(e^{-u_{n-1}}-1)sim frac{-u_{n-1}}{n} sim -n^{-2}$, thus $sum_n{b_n(-1)^n}$ is absolutely convergent.
answered Jan 6 at 11:18
MindlackMindlack
3,15217
$endgroup$
add a comment |
$begingroup$
Consider the sequences $a_n=frac{1}{n+1}$, $b_n=u_n-a_n$.
Then $sum_n{(-1)^na_n}$ is well-known to be convergent.
Furthermore, $b_n=frac{1}{n+1}(e^{-u_{n-1}}-1)sim frac{-u_{n-1}}{n} sim -n^{-2}$, thus $sum_n{b_n(-1)^n}$ is absolutely convergent.
answered Jan 6 at 11:18
MindlackMindlack
3,15217
$endgroup$
Consider the sequences $a_n=frac{1}{n+1}$, $b_n=u_n-a_n$.
Then $sum_n{(-1)^na_n}$ is well-known to be convergent.
Furthermore, $b_n=frac{1}{n+1}(e^{-u_{n-1}}-1)sim frac{-u_{n-1}}{n} sim -n^{-2}$, thus $sum_n{b_n(-1)^n}$ is absolutely convergent.
answered Jan 6 at 11:18
MindlackMindlack
3,15217
edited Jan 6 at 11:33
answered Jan 6 at 11:18
MindlackMindlack
3,15217
answered Jan 6 at 11:18
MindlackMindlack
3,15217
answered Jan 6 at 11:18
MindlackMindlack
3,15217
3,15217
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.
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%2f3063726%2fwhy-is-it-possible-here-to-sum-equivalent%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$
I suppose your big-Oh's should be little-oh's?
$endgroup$
– Hagen von Eitzen
Jan 6 at 11:26