Prove that the series, $sum_{n=1}^{infty}{x^{2n}over n^2+x^{2n}}$ converges uniformly in $[-1,1]$












2












$begingroup$


Consider the series $$sum_{n=1}^{infty}{x^{2n}over n^2+x^{2n}}$$



I want to show that the series is uniformly convergent in $[-1,1]$.




Theorem: A series of functions $sum f_n$ will converge uniformly on $[a,b]$ if there exist a convergent $sum M_n$ of positive numbers
such that for all $xin [a,b]$ $$|f_n(x)|le M_n$$ for all $n$.




Attempt:



For $xin [-1,1]quad$ $|x^{2n}|le 1tag{1}$.



Recall,




Reverse Triangle Inequality begin{equation*} ||x|-|y||le|x+y|.
end{equation*}




So $n^2-|x^{2n}|le|n^2+x^{2n}|$ Therefore we have $n^2-1le |x^{2n}+n^2|tag{2}$



Using $(1)$ and $(2)$, we have $$|f_n(x)|le {1over n^2-1}$$



Let $a_n=1/n^2$, then ${M_nover a_n}={n^2over n^2-1}={1over 1-{1over n^2}}$ Therefor by Limit form comparison test, $sum M_n$ converges.



The result follows.





Is this series uniformly convergent only in $[-1,1]$ and to what function it converges?



Edits: For $|x|>1$,



Divide by $|x|^{2n}$, we get $${1over 1+{n^2over |x|^{2n}}}$$. Since exponential grows faster than $n^2$ the expression goes to $1$ as $nto infty$



Therefore series diverges for $|x|>1$










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Does the summand go to zero for $x>1$, as $n $ goes to infinity?
    $endgroup$
    – AnyAD
    Oct 23 '18 at 12:05






  • 1




    $begingroup$
    @AnyAD Thanks I understand it now. I have edited the post to show the calculation.
    $endgroup$
    – StammeringMathematician
    Oct 23 '18 at 12:24
















2












$begingroup$


Consider the series $$sum_{n=1}^{infty}{x^{2n}over n^2+x^{2n}}$$



I want to show that the series is uniformly convergent in $[-1,1]$.




Theorem: A series of functions $sum f_n$ will converge uniformly on $[a,b]$ if there exist a convergent $sum M_n$ of positive numbers
such that for all $xin [a,b]$ $$|f_n(x)|le M_n$$ for all $n$.




Attempt:



For $xin [-1,1]quad$ $|x^{2n}|le 1tag{1}$.



Recall,




Reverse Triangle Inequality begin{equation*} ||x|-|y||le|x+y|.
end{equation*}




So $n^2-|x^{2n}|le|n^2+x^{2n}|$ Therefore we have $n^2-1le |x^{2n}+n^2|tag{2}$



Using $(1)$ and $(2)$, we have $$|f_n(x)|le {1over n^2-1}$$



Let $a_n=1/n^2$, then ${M_nover a_n}={n^2over n^2-1}={1over 1-{1over n^2}}$ Therefor by Limit form comparison test, $sum M_n$ converges.



The result follows.





Is this series uniformly convergent only in $[-1,1]$ and to what function it converges?



Edits: For $|x|>1$,



Divide by $|x|^{2n}$, we get $${1over 1+{n^2over |x|^{2n}}}$$. Since exponential grows faster than $n^2$ the expression goes to $1$ as $nto infty$



Therefore series diverges for $|x|>1$










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Does the summand go to zero for $x>1$, as $n $ goes to infinity?
    $endgroup$
    – AnyAD
    Oct 23 '18 at 12:05






  • 1




    $begingroup$
    @AnyAD Thanks I understand it now. I have edited the post to show the calculation.
    $endgroup$
    – StammeringMathematician
    Oct 23 '18 at 12:24














2












2








2





$begingroup$


Consider the series $$sum_{n=1}^{infty}{x^{2n}over n^2+x^{2n}}$$



I want to show that the series is uniformly convergent in $[-1,1]$.




Theorem: A series of functions $sum f_n$ will converge uniformly on $[a,b]$ if there exist a convergent $sum M_n$ of positive numbers
such that for all $xin [a,b]$ $$|f_n(x)|le M_n$$ for all $n$.




Attempt:



For $xin [-1,1]quad$ $|x^{2n}|le 1tag{1}$.



Recall,




Reverse Triangle Inequality begin{equation*} ||x|-|y||le|x+y|.
end{equation*}




So $n^2-|x^{2n}|le|n^2+x^{2n}|$ Therefore we have $n^2-1le |x^{2n}+n^2|tag{2}$



Using $(1)$ and $(2)$, we have $$|f_n(x)|le {1over n^2-1}$$



Let $a_n=1/n^2$, then ${M_nover a_n}={n^2over n^2-1}={1over 1-{1over n^2}}$ Therefor by Limit form comparison test, $sum M_n$ converges.



The result follows.





Is this series uniformly convergent only in $[-1,1]$ and to what function it converges?



Edits: For $|x|>1$,



Divide by $|x|^{2n}$, we get $${1over 1+{n^2over |x|^{2n}}}$$. Since exponential grows faster than $n^2$ the expression goes to $1$ as $nto infty$



Therefore series diverges for $|x|>1$










share|cite|improve this question











$endgroup$




Consider the series $$sum_{n=1}^{infty}{x^{2n}over n^2+x^{2n}}$$



I want to show that the series is uniformly convergent in $[-1,1]$.




Theorem: A series of functions $sum f_n$ will converge uniformly on $[a,b]$ if there exist a convergent $sum M_n$ of positive numbers
such that for all $xin [a,b]$ $$|f_n(x)|le M_n$$ for all $n$.




Attempt:



For $xin [-1,1]quad$ $|x^{2n}|le 1tag{1}$.



Recall,




Reverse Triangle Inequality begin{equation*} ||x|-|y||le|x+y|.
end{equation*}




So $n^2-|x^{2n}|le|n^2+x^{2n}|$ Therefore we have $n^2-1le |x^{2n}+n^2|tag{2}$



Using $(1)$ and $(2)$, we have $$|f_n(x)|le {1over n^2-1}$$



Let $a_n=1/n^2$, then ${M_nover a_n}={n^2over n^2-1}={1over 1-{1over n^2}}$ Therefor by Limit form comparison test, $sum M_n$ converges.



The result follows.





Is this series uniformly convergent only in $[-1,1]$ and to what function it converges?



Edits: For $|x|>1$,



Divide by $|x|^{2n}$, we get $${1over 1+{n^2over |x|^{2n}}}$$. Since exponential grows faster than $n^2$ the expression goes to $1$ as $nto infty$



Therefore series diverges for $|x|>1$







real-analysis sequences-and-series






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Oct 23 '18 at 12:23







StammeringMathematician

















asked Oct 23 '18 at 11:56









StammeringMathematicianStammeringMathematician

2,5541323




2,5541323








  • 1




    $begingroup$
    Does the summand go to zero for $x>1$, as $n $ goes to infinity?
    $endgroup$
    – AnyAD
    Oct 23 '18 at 12:05






  • 1




    $begingroup$
    @AnyAD Thanks I understand it now. I have edited the post to show the calculation.
    $endgroup$
    – StammeringMathematician
    Oct 23 '18 at 12:24














  • 1




    $begingroup$
    Does the summand go to zero for $x>1$, as $n $ goes to infinity?
    $endgroup$
    – AnyAD
    Oct 23 '18 at 12:05






  • 1




    $begingroup$
    @AnyAD Thanks I understand it now. I have edited the post to show the calculation.
    $endgroup$
    – StammeringMathematician
    Oct 23 '18 at 12:24








1




1




$begingroup$
Does the summand go to zero for $x>1$, as $n $ goes to infinity?
$endgroup$
– AnyAD
Oct 23 '18 at 12:05




$begingroup$
Does the summand go to zero for $x>1$, as $n $ goes to infinity?
$endgroup$
– AnyAD
Oct 23 '18 at 12:05




1




1




$begingroup$
@AnyAD Thanks I understand it now. I have edited the post to show the calculation.
$endgroup$
– StammeringMathematician
Oct 23 '18 at 12:24




$begingroup$
@AnyAD Thanks I understand it now. I have edited the post to show the calculation.
$endgroup$
– StammeringMathematician
Oct 23 '18 at 12:24










1 Answer
1






active

oldest

votes


















2












$begingroup$

Define $$f_n(x)={x^{2n}over n^2+x^{2n}}$$In the interval $[-1,1]$ we have $0le x^{2n}le 1$ therefore $$|f_n(x)|=f_n(x)le {1over n^2+1}$$Now define $M_n={1over n^2+1}$. Obviously the series $sum M_n$ is convergent because$$sum_{n=1}^{infty}M_n=sum_{n=1}^{infty}{1over n^2+1}le sum_{n=1}^{infty}{1over n^2}={pi^2over 6}$$and $$|f_n(x)|le M_n$$which means that the sequence of ${M_n}$ fulfills the conditions of the theorem and using that theorem, we have proved what we wanted.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I think you want $f_n(x)le frac{1}{n^2}.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 16:55










  • $begingroup$
    Also ${1over n^2}$ is another possibility for $M_n$ since ${1over n^2+1}<{1over n^2}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 16:57










  • $begingroup$
    But why do you say $$f_n(x)le {1over n^2+1}?$$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:01










  • $begingroup$
    I'm just looking for some $M_n$ so that the conditions of the theorem hold i.e. $$|f_n(x)|le M_n$$since we have $$|f_n(x)|le {1over n^2}$$ we can arbitrarily choose $M_n={1over n^2+1}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 17:05










  • $begingroup$
    But $1/(n^2+1)<1/n^2.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:08











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2967498%2fprove-that-the-series-sum-n-1-inftyx2n-over-n2x2n-converges-u%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









2












$begingroup$

Define $$f_n(x)={x^{2n}over n^2+x^{2n}}$$In the interval $[-1,1]$ we have $0le x^{2n}le 1$ therefore $$|f_n(x)|=f_n(x)le {1over n^2+1}$$Now define $M_n={1over n^2+1}$. Obviously the series $sum M_n$ is convergent because$$sum_{n=1}^{infty}M_n=sum_{n=1}^{infty}{1over n^2+1}le sum_{n=1}^{infty}{1over n^2}={pi^2over 6}$$and $$|f_n(x)|le M_n$$which means that the sequence of ${M_n}$ fulfills the conditions of the theorem and using that theorem, we have proved what we wanted.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I think you want $f_n(x)le frac{1}{n^2}.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 16:55










  • $begingroup$
    Also ${1over n^2}$ is another possibility for $M_n$ since ${1over n^2+1}<{1over n^2}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 16:57










  • $begingroup$
    But why do you say $$f_n(x)le {1over n^2+1}?$$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:01










  • $begingroup$
    I'm just looking for some $M_n$ so that the conditions of the theorem hold i.e. $$|f_n(x)|le M_n$$since we have $$|f_n(x)|le {1over n^2}$$ we can arbitrarily choose $M_n={1over n^2+1}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 17:05










  • $begingroup$
    But $1/(n^2+1)<1/n^2.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:08
















2












$begingroup$

Define $$f_n(x)={x^{2n}over n^2+x^{2n}}$$In the interval $[-1,1]$ we have $0le x^{2n}le 1$ therefore $$|f_n(x)|=f_n(x)le {1over n^2+1}$$Now define $M_n={1over n^2+1}$. Obviously the series $sum M_n$ is convergent because$$sum_{n=1}^{infty}M_n=sum_{n=1}^{infty}{1over n^2+1}le sum_{n=1}^{infty}{1over n^2}={pi^2over 6}$$and $$|f_n(x)|le M_n$$which means that the sequence of ${M_n}$ fulfills the conditions of the theorem and using that theorem, we have proved what we wanted.






share|cite|improve this answer











$endgroup$













  • $begingroup$
    I think you want $f_n(x)le frac{1}{n^2}.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 16:55










  • $begingroup$
    Also ${1over n^2}$ is another possibility for $M_n$ since ${1over n^2+1}<{1over n^2}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 16:57










  • $begingroup$
    But why do you say $$f_n(x)le {1over n^2+1}?$$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:01










  • $begingroup$
    I'm just looking for some $M_n$ so that the conditions of the theorem hold i.e. $$|f_n(x)|le M_n$$since we have $$|f_n(x)|le {1over n^2}$$ we can arbitrarily choose $M_n={1over n^2+1}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 17:05










  • $begingroup$
    But $1/(n^2+1)<1/n^2.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:08














2












2








2





$begingroup$

Define $$f_n(x)={x^{2n}over n^2+x^{2n}}$$In the interval $[-1,1]$ we have $0le x^{2n}le 1$ therefore $$|f_n(x)|=f_n(x)le {1over n^2+1}$$Now define $M_n={1over n^2+1}$. Obviously the series $sum M_n$ is convergent because$$sum_{n=1}^{infty}M_n=sum_{n=1}^{infty}{1over n^2+1}le sum_{n=1}^{infty}{1over n^2}={pi^2over 6}$$and $$|f_n(x)|le M_n$$which means that the sequence of ${M_n}$ fulfills the conditions of the theorem and using that theorem, we have proved what we wanted.






share|cite|improve this answer











$endgroup$



Define $$f_n(x)={x^{2n}over n^2+x^{2n}}$$In the interval $[-1,1]$ we have $0le x^{2n}le 1$ therefore $$|f_n(x)|=f_n(x)le {1over n^2+1}$$Now define $M_n={1over n^2+1}$. Obviously the series $sum M_n$ is convergent because$$sum_{n=1}^{infty}M_n=sum_{n=1}^{infty}{1over n^2+1}le sum_{n=1}^{infty}{1over n^2}={pi^2over 6}$$and $$|f_n(x)|le M_n$$which means that the sequence of ${M_n}$ fulfills the conditions of the theorem and using that theorem, we have proved what we wanted.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 30 '18 at 17:33

























answered Nov 30 '18 at 16:10









Mostafa AyazMostafa Ayaz

15.6k3939




15.6k3939












  • $begingroup$
    I think you want $f_n(x)le frac{1}{n^2}.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 16:55










  • $begingroup$
    Also ${1over n^2}$ is another possibility for $M_n$ since ${1over n^2+1}<{1over n^2}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 16:57










  • $begingroup$
    But why do you say $$f_n(x)le {1over n^2+1}?$$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:01










  • $begingroup$
    I'm just looking for some $M_n$ so that the conditions of the theorem hold i.e. $$|f_n(x)|le M_n$$since we have $$|f_n(x)|le {1over n^2}$$ we can arbitrarily choose $M_n={1over n^2+1}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 17:05










  • $begingroup$
    But $1/(n^2+1)<1/n^2.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:08


















  • $begingroup$
    I think you want $f_n(x)le frac{1}{n^2}.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 16:55










  • $begingroup$
    Also ${1over n^2}$ is another possibility for $M_n$ since ${1over n^2+1}<{1over n^2}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 16:57










  • $begingroup$
    But why do you say $$f_n(x)le {1over n^2+1}?$$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:01










  • $begingroup$
    I'm just looking for some $M_n$ so that the conditions of the theorem hold i.e. $$|f_n(x)|le M_n$$since we have $$|f_n(x)|le {1over n^2}$$ we can arbitrarily choose $M_n={1over n^2+1}$
    $endgroup$
    – Mostafa Ayaz
    Nov 30 '18 at 17:05










  • $begingroup$
    But $1/(n^2+1)<1/n^2.$
    $endgroup$
    – zhw.
    Nov 30 '18 at 17:08
















$begingroup$
I think you want $f_n(x)le frac{1}{n^2}.$
$endgroup$
– zhw.
Nov 30 '18 at 16:55




$begingroup$
I think you want $f_n(x)le frac{1}{n^2}.$
$endgroup$
– zhw.
Nov 30 '18 at 16:55












$begingroup$
Also ${1over n^2}$ is another possibility for $M_n$ since ${1over n^2+1}<{1over n^2}$
$endgroup$
– Mostafa Ayaz
Nov 30 '18 at 16:57




$begingroup$
Also ${1over n^2}$ is another possibility for $M_n$ since ${1over n^2+1}<{1over n^2}$
$endgroup$
– Mostafa Ayaz
Nov 30 '18 at 16:57












$begingroup$
But why do you say $$f_n(x)le {1over n^2+1}?$$
$endgroup$
– zhw.
Nov 30 '18 at 17:01




$begingroup$
But why do you say $$f_n(x)le {1over n^2+1}?$$
$endgroup$
– zhw.
Nov 30 '18 at 17:01












$begingroup$
I'm just looking for some $M_n$ so that the conditions of the theorem hold i.e. $$|f_n(x)|le M_n$$since we have $$|f_n(x)|le {1over n^2}$$ we can arbitrarily choose $M_n={1over n^2+1}$
$endgroup$
– Mostafa Ayaz
Nov 30 '18 at 17:05




$begingroup$
I'm just looking for some $M_n$ so that the conditions of the theorem hold i.e. $$|f_n(x)|le M_n$$since we have $$|f_n(x)|le {1over n^2}$$ we can arbitrarily choose $M_n={1over n^2+1}$
$endgroup$
– Mostafa Ayaz
Nov 30 '18 at 17:05












$begingroup$
But $1/(n^2+1)<1/n^2.$
$endgroup$
– zhw.
Nov 30 '18 at 17:08




$begingroup$
But $1/(n^2+1)<1/n^2.$
$endgroup$
– zhw.
Nov 30 '18 at 17:08


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2967498%2fprove-that-the-series-sum-n-1-inftyx2n-over-n2x2n-converges-u%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

How to send String Array data to Server using php in android

Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

Is anime1.com a legal site for watching anime?