limsup of a series
$begingroup$
The series is from Rudin's *Principles of Mathematical Analysis$ ("Baby Rudin"), p.67.
$$frac{1}{2}+frac{1}{3}+frac{1}{2^2}+frac{1}{3^2}+... $$
and Rudin claims that
$$limsup_{nto infty} (a_n)^frac{1}{n} = frac{1}{sqrt{2}}.$$
I do not get why this is the case. Can't we pick
$$frac{1}{2^3}, frac{1}{2^6},frac{1}{2^9}ldots $$
or higher powers of $frac{1}{2}$ in which case we get $$limsup (a_{n_k})^{1/n} = frac{1}{3^frac{1}{3}} > frac{1}{sqrt2}.$$
real-analysis sequences-and-series real-numbers
$endgroup$
|
show 2 more comments
$begingroup$
The series is from Rudin's *Principles of Mathematical Analysis$ ("Baby Rudin"), p.67.
$$frac{1}{2}+frac{1}{3}+frac{1}{2^2}+frac{1}{3^2}+... $$
and Rudin claims that
$$limsup_{nto infty} (a_n)^frac{1}{n} = frac{1}{sqrt{2}}.$$
I do not get why this is the case. Can't we pick
$$frac{1}{2^3}, frac{1}{2^6},frac{1}{2^9}ldots $$
or higher powers of $frac{1}{2}$ in which case we get $$limsup (a_{n_k})^{1/n} = frac{1}{3^frac{1}{3}} > frac{1}{sqrt2}.$$
real-analysis sequences-and-series real-numbers
$endgroup$
2
$begingroup$
Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
$endgroup$
– Did
Dec 31 '18 at 21:40
$begingroup$
@Did makes a lot of sense. thanks!
$endgroup$
– Kaan Yolsever
Dec 31 '18 at 21:41
3
$begingroup$
Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
$endgroup$
– Did
Dec 31 '18 at 21:42
1
$begingroup$
Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
$endgroup$
– Did
Dec 31 '18 at 21:47
1
$begingroup$
Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
$endgroup$
– Did
Dec 31 '18 at 21:48
|
show 2 more comments
$begingroup$
The series is from Rudin's *Principles of Mathematical Analysis$ ("Baby Rudin"), p.67.
$$frac{1}{2}+frac{1}{3}+frac{1}{2^2}+frac{1}{3^2}+... $$
and Rudin claims that
$$limsup_{nto infty} (a_n)^frac{1}{n} = frac{1}{sqrt{2}}.$$
I do not get why this is the case. Can't we pick
$$frac{1}{2^3}, frac{1}{2^6},frac{1}{2^9}ldots $$
or higher powers of $frac{1}{2}$ in which case we get $$limsup (a_{n_k})^{1/n} = frac{1}{3^frac{1}{3}} > frac{1}{sqrt2}.$$
real-analysis sequences-and-series real-numbers
$endgroup$
The series is from Rudin's *Principles of Mathematical Analysis$ ("Baby Rudin"), p.67.
$$frac{1}{2}+frac{1}{3}+frac{1}{2^2}+frac{1}{3^2}+... $$
and Rudin claims that
$$limsup_{nto infty} (a_n)^frac{1}{n} = frac{1}{sqrt{2}}.$$
I do not get why this is the case. Can't we pick
$$frac{1}{2^3}, frac{1}{2^6},frac{1}{2^9}ldots $$
or higher powers of $frac{1}{2}$ in which case we get $$limsup (a_{n_k})^{1/n} = frac{1}{3^frac{1}{3}} > frac{1}{sqrt2}.$$
real-analysis sequences-and-series real-numbers
real-analysis sequences-and-series real-numbers
edited Dec 31 '18 at 21:49
Kaan Yolsever
asked Dec 31 '18 at 21:26
Kaan YolseverKaan Yolsever
13710
13710
2
$begingroup$
Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
$endgroup$
– Did
Dec 31 '18 at 21:40
$begingroup$
@Did makes a lot of sense. thanks!
$endgroup$
– Kaan Yolsever
Dec 31 '18 at 21:41
3
$begingroup$
Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
$endgroup$
– Did
Dec 31 '18 at 21:42
1
$begingroup$
Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
$endgroup$
– Did
Dec 31 '18 at 21:47
1
$begingroup$
Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
$endgroup$
– Did
Dec 31 '18 at 21:48
|
show 2 more comments
2
$begingroup$
Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
$endgroup$
– Did
Dec 31 '18 at 21:40
$begingroup$
@Did makes a lot of sense. thanks!
$endgroup$
– Kaan Yolsever
Dec 31 '18 at 21:41
3
$begingroup$
Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
$endgroup$
– Did
Dec 31 '18 at 21:42
1
$begingroup$
Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
$endgroup$
– Did
Dec 31 '18 at 21:47
1
$begingroup$
Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
$endgroup$
– Did
Dec 31 '18 at 21:48
2
2
$begingroup$
Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
$endgroup$
– Did
Dec 31 '18 at 21:40
$begingroup$
Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
$endgroup$
– Did
Dec 31 '18 at 21:40
$begingroup$
@Did makes a lot of sense. thanks!
$endgroup$
– Kaan Yolsever
Dec 31 '18 at 21:41
$begingroup$
@Did makes a lot of sense. thanks!
$endgroup$
– Kaan Yolsever
Dec 31 '18 at 21:41
3
3
$begingroup$
Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
$endgroup$
– Did
Dec 31 '18 at 21:42
$begingroup$
Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
$endgroup$
– Did
Dec 31 '18 at 21:42
1
1
$begingroup$
Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
$endgroup$
– Did
Dec 31 '18 at 21:47
$begingroup$
Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
$endgroup$
– Did
Dec 31 '18 at 21:47
1
1
$begingroup$
Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
$endgroup$
– Did
Dec 31 '18 at 21:48
$begingroup$
Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
$endgroup$
– Did
Dec 31 '18 at 21:48
|
show 2 more comments
1 Answer
1
active
oldest
votes
$begingroup$
One way, perhaps easier, to see what's going on, is to observe that:0
$$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$
Clearly, to get the supremum of the above we have to take the odd numbered elements:
$$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$
Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...
or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again
$$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$
$endgroup$
add a comment |
Your Answer
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%2f3058051%2flimsup-of-a-series%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$
One way, perhaps easier, to see what's going on, is to observe that:0
$$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$
Clearly, to get the supremum of the above we have to take the odd numbered elements:
$$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$
Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...
or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again
$$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$
$endgroup$
add a comment |
$begingroup$
One way, perhaps easier, to see what's going on, is to observe that:0
$$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$
Clearly, to get the supremum of the above we have to take the odd numbered elements:
$$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$
Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...
or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again
$$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$
$endgroup$
add a comment |
$begingroup$
One way, perhaps easier, to see what's going on, is to observe that:0
$$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$
Clearly, to get the supremum of the above we have to take the odd numbered elements:
$$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$
Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...
or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again
$$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$
$endgroup$
One way, perhaps easier, to see what's going on, is to observe that:0
$$a_1=frac12;,;a_2=frac13;,;a_3=frac1{2^2};,;a_4=frac1{3^2};...$$
Clearly, to get the supremum of the above we have to take the odd numbered elements:
$$a_1,,a_3,,a_5,,....implies limsup_{ntoinfty}sqrt[n]{a_n}=limsup_{ntoinfty}sqrt[2n-1]{frac1{2^n}}=frac1{sqrt2}$$
Because at index $;1=2cdot1-1;$, we have $;frac12;$ , at index $;2cdot2-1=3;$, we have $;frac1{2^2};$, ...at index $;2n-1;$ , we have $;frac1{2^n};$ ...
or taking $;k;$ to be a general odd index, the corresponding element here is $;cfrac1{2^{frac{k+1}2}};$ , so again
$$limsup_{ktoinfty}sqrt[k]{frac1{2^{frac k2+frac12}}}=limsup_{ktoinfty}frac1{2^{1/2}sqrt[k]{sqrt2}}=frac1{sqrt2}$$
answered Dec 31 '18 at 22:38
DonAntonioDonAntonio
180k1495233
180k1495233
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%2f3058051%2flimsup-of-a-series%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
2
$begingroup$
Because each $3^{-3n}$ is $a_{6n}$ but you apply the root test as if $3^{-3n}=a_{9n}$.
$endgroup$
– Did
Dec 31 '18 at 21:40
$begingroup$
@Did makes a lot of sense. thanks!
$endgroup$
– Kaan Yolsever
Dec 31 '18 at 21:41
3
$begingroup$
Reatedly, note that, in your post, $$limsup (a_{n_k})^{1/n}$$ is intrinsically faulty, one should consider $$limsup (a_{n_k})^{1/n_k}$$
$endgroup$
– Did
Dec 31 '18 at 21:42
1
$begingroup$
Please do not change thoroughly your post after you received comments (especially when, as here, basically the same idea applies).
$endgroup$
– Did
Dec 31 '18 at 21:47
1
$begingroup$
Yu could first and foremost "make sure" to cancel the unfortunate edit on this very page.
$endgroup$
– Did
Dec 31 '18 at 21:48