Proving the uniform convergence of $sum_{i=1}^{infty}nx^n$ where $x in [0,1)$ using Weirstrass M test.
$begingroup$
I want to prove the uniform convergence of $sum_{i=1}^{infty}nx^n$ where $x in [0,1)$. I know this sum has been asked a lot of times before but Im supposed to prove this with tools I have seen and this means not using any Theorem involving derivatives. Im trying to prove this using M Weierstrass test, so I want to bound each term of the sum. This means finding a sequence $lbrace M_{n} rbrace geq 0$ such $|nx^n| leq M_{n}$ for every $n in mathbb{x}$ and then proving $sum_{n=1}^{infty} M_{n}< infty$. Im stuck finding a sequence which each term bound the original sum terms. I know that for every $x in [0,1)$ we have$0 leq x^{n} leq 1$ then $0 leq n x^{n} leq n$ but the series $sum_{i=1}^{infty} n$ is not convergent :(
real-analysis calculus sequences-and-series complex-analysis functional-analysis
$endgroup$
add a comment |
$begingroup$
I want to prove the uniform convergence of $sum_{i=1}^{infty}nx^n$ where $x in [0,1)$. I know this sum has been asked a lot of times before but Im supposed to prove this with tools I have seen and this means not using any Theorem involving derivatives. Im trying to prove this using M Weierstrass test, so I want to bound each term of the sum. This means finding a sequence $lbrace M_{n} rbrace geq 0$ such $|nx^n| leq M_{n}$ for every $n in mathbb{x}$ and then proving $sum_{n=1}^{infty} M_{n}< infty$. Im stuck finding a sequence which each term bound the original sum terms. I know that for every $x in [0,1)$ we have$0 leq x^{n} leq 1$ then $0 leq n x^{n} leq n$ but the series $sum_{i=1}^{infty} n$ is not convergent :(
real-analysis calculus sequences-and-series complex-analysis functional-analysis
$endgroup$
add a comment |
$begingroup$
I want to prove the uniform convergence of $sum_{i=1}^{infty}nx^n$ where $x in [0,1)$. I know this sum has been asked a lot of times before but Im supposed to prove this with tools I have seen and this means not using any Theorem involving derivatives. Im trying to prove this using M Weierstrass test, so I want to bound each term of the sum. This means finding a sequence $lbrace M_{n} rbrace geq 0$ such $|nx^n| leq M_{n}$ for every $n in mathbb{x}$ and then proving $sum_{n=1}^{infty} M_{n}< infty$. Im stuck finding a sequence which each term bound the original sum terms. I know that for every $x in [0,1)$ we have$0 leq x^{n} leq 1$ then $0 leq n x^{n} leq n$ but the series $sum_{i=1}^{infty} n$ is not convergent :(
real-analysis calculus sequences-and-series complex-analysis functional-analysis
$endgroup$
I want to prove the uniform convergence of $sum_{i=1}^{infty}nx^n$ where $x in [0,1)$. I know this sum has been asked a lot of times before but Im supposed to prove this with tools I have seen and this means not using any Theorem involving derivatives. Im trying to prove this using M Weierstrass test, so I want to bound each term of the sum. This means finding a sequence $lbrace M_{n} rbrace geq 0$ such $|nx^n| leq M_{n}$ for every $n in mathbb{x}$ and then proving $sum_{n=1}^{infty} M_{n}< infty$. Im stuck finding a sequence which each term bound the original sum terms. I know that for every $x in [0,1)$ we have$0 leq x^{n} leq 1$ then $0 leq n x^{n} leq n$ but the series $sum_{i=1}^{infty} n$ is not convergent :(
real-analysis calculus sequences-and-series complex-analysis functional-analysis
real-analysis calculus sequences-and-series complex-analysis functional-analysis
asked Jan 23 at 3:08
CosCos
23027
23027
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Hints:
Consider separately $[0,a]$ with $a < 1$ where convergence is uniform and $[0,1)$ where it is not.
For $x in [0,a]$ with $a < 1$ take $x = frac{1}{1+y}$ where $y geqslant frac{1}{a}-1 $
We have $nx^n = frac{n}{(1+y)^n} $ and by the binomial theorem
$$(1+y)^n > frac{n(n-1)(n-2)}{6}y^3,$$
so for $n > 2$, $nx^n < ldots$
For $x in [0,1)$ note that
$$sum_{k=n}^{2n} k x^k > (n+1)(n)x^{2n}$$
$endgroup$
add a comment |
$begingroup$
The series is not uniformly convergent on $[0,1)$. If it is, then $nx^{n}$ must tend to $0$ uniformly as $ n to infty$. In particular there exists $n_0$ such that $|nx^{n}| <1$ for all $n geq n_0$ for all $x in [0,1)$. Take $x=frac 1 {n^{1/n}}$ with $n=n_0$ to get a contradiction .
$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%2f3084029%2fproving-the-uniform-convergence-of-sum-i-1-inftynxn-where-x-in-0-1%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Hints:
Consider separately $[0,a]$ with $a < 1$ where convergence is uniform and $[0,1)$ where it is not.
For $x in [0,a]$ with $a < 1$ take $x = frac{1}{1+y}$ where $y geqslant frac{1}{a}-1 $
We have $nx^n = frac{n}{(1+y)^n} $ and by the binomial theorem
$$(1+y)^n > frac{n(n-1)(n-2)}{6}y^3,$$
so for $n > 2$, $nx^n < ldots$
For $x in [0,1)$ note that
$$sum_{k=n}^{2n} k x^k > (n+1)(n)x^{2n}$$
$endgroup$
add a comment |
$begingroup$
Hints:
Consider separately $[0,a]$ with $a < 1$ where convergence is uniform and $[0,1)$ where it is not.
For $x in [0,a]$ with $a < 1$ take $x = frac{1}{1+y}$ where $y geqslant frac{1}{a}-1 $
We have $nx^n = frac{n}{(1+y)^n} $ and by the binomial theorem
$$(1+y)^n > frac{n(n-1)(n-2)}{6}y^3,$$
so for $n > 2$, $nx^n < ldots$
For $x in [0,1)$ note that
$$sum_{k=n}^{2n} k x^k > (n+1)(n)x^{2n}$$
$endgroup$
add a comment |
$begingroup$
Hints:
Consider separately $[0,a]$ with $a < 1$ where convergence is uniform and $[0,1)$ where it is not.
For $x in [0,a]$ with $a < 1$ take $x = frac{1}{1+y}$ where $y geqslant frac{1}{a}-1 $
We have $nx^n = frac{n}{(1+y)^n} $ and by the binomial theorem
$$(1+y)^n > frac{n(n-1)(n-2)}{6}y^3,$$
so for $n > 2$, $nx^n < ldots$
For $x in [0,1)$ note that
$$sum_{k=n}^{2n} k x^k > (n+1)(n)x^{2n}$$
$endgroup$
Hints:
Consider separately $[0,a]$ with $a < 1$ where convergence is uniform and $[0,1)$ where it is not.
For $x in [0,a]$ with $a < 1$ take $x = frac{1}{1+y}$ where $y geqslant frac{1}{a}-1 $
We have $nx^n = frac{n}{(1+y)^n} $ and by the binomial theorem
$$(1+y)^n > frac{n(n-1)(n-2)}{6}y^3,$$
so for $n > 2$, $nx^n < ldots$
For $x in [0,1)$ note that
$$sum_{k=n}^{2n} k x^k > (n+1)(n)x^{2n}$$
edited Jan 23 at 7:14
answered Jan 23 at 3:25
RRLRRL
52.5k42573
52.5k42573
add a comment |
add a comment |
$begingroup$
The series is not uniformly convergent on $[0,1)$. If it is, then $nx^{n}$ must tend to $0$ uniformly as $ n to infty$. In particular there exists $n_0$ such that $|nx^{n}| <1$ for all $n geq n_0$ for all $x in [0,1)$. Take $x=frac 1 {n^{1/n}}$ with $n=n_0$ to get a contradiction .
$endgroup$
add a comment |
$begingroup$
The series is not uniformly convergent on $[0,1)$. If it is, then $nx^{n}$ must tend to $0$ uniformly as $ n to infty$. In particular there exists $n_0$ such that $|nx^{n}| <1$ for all $n geq n_0$ for all $x in [0,1)$. Take $x=frac 1 {n^{1/n}}$ with $n=n_0$ to get a contradiction .
$endgroup$
add a comment |
$begingroup$
The series is not uniformly convergent on $[0,1)$. If it is, then $nx^{n}$ must tend to $0$ uniformly as $ n to infty$. In particular there exists $n_0$ such that $|nx^{n}| <1$ for all $n geq n_0$ for all $x in [0,1)$. Take $x=frac 1 {n^{1/n}}$ with $n=n_0$ to get a contradiction .
$endgroup$
The series is not uniformly convergent on $[0,1)$. If it is, then $nx^{n}$ must tend to $0$ uniformly as $ n to infty$. In particular there exists $n_0$ such that $|nx^{n}| <1$ for all $n geq n_0$ for all $x in [0,1)$. Take $x=frac 1 {n^{1/n}}$ with $n=n_0$ to get a contradiction .
answered Jan 23 at 6:17


Kavi Rama MurthyKavi Rama Murthy
66.7k52867
66.7k52867
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%2f3084029%2fproving-the-uniform-convergence-of-sum-i-1-inftynxn-where-x-in-0-1%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