Upper bound the Polylogarithm $sum_{n=1}^infty frac{x^n}{n^2}$












1












$begingroup$


Let $x in (0,1)$ be some real number, we can then consider the Polylogarithm:
$$operatorname{L}_2(x)=sum_{n=1}^infty frac{x^n}{n^2}$$
It is not hard to see that the following upper bound holds:
$$
operatorname{L}_2(x) = x cdot sum_{n=1}^infty frac{x^{n-1}}{n^2} leq x sum_{n=1}^infty frac{1}{n^2} =frac{xpi^2}{6}.
$$

One could continue to get a finer upper bound using the same strategy:
$$
operatorname{L}_2(x) = sum_{n=1}^m frac{x^n}{n^2} + sum_{n=m+1}^infty frac{x^{n}}{n^2}
$$

where we can then upper bound $$sum_{n=m+1}^infty frac{x^{n}}{n^2} leq x^{m+1} cdot sum_{n=m+1}^infty frac{1}{n^2}$$
I am quite pleased with this, but was wondering if there are alternative, better well known bounds.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Just to be precise it is more common to call this special Polylogarithm "Dilogarithm" $($or Spence's Function$)$ denoted as $operatorname{Li}_2(z)$.
    $endgroup$
    – mrtaurho
    Dec 21 '18 at 11:55










  • $begingroup$
    You can use this formula : $sum_{n=1}^{infty}frac{x^{n+1}}{n(n+1)} = (1-x) log(1-x) + x$. But I don't know if it will be better
    $endgroup$
    – Damien
    Dec 21 '18 at 14:14












  • $begingroup$
    Awesome, this is exactly the type of thing I was looking for! You can post it as an answer if you want to. Just a small thing: your last $x$ should be a $1$ I believe, i.e. $(1-x) log(1-x) + 1$.
    $endgroup$
    – HolyMonk
    Dec 21 '18 at 14:43
















1












$begingroup$


Let $x in (0,1)$ be some real number, we can then consider the Polylogarithm:
$$operatorname{L}_2(x)=sum_{n=1}^infty frac{x^n}{n^2}$$
It is not hard to see that the following upper bound holds:
$$
operatorname{L}_2(x) = x cdot sum_{n=1}^infty frac{x^{n-1}}{n^2} leq x sum_{n=1}^infty frac{1}{n^2} =frac{xpi^2}{6}.
$$

One could continue to get a finer upper bound using the same strategy:
$$
operatorname{L}_2(x) = sum_{n=1}^m frac{x^n}{n^2} + sum_{n=m+1}^infty frac{x^{n}}{n^2}
$$

where we can then upper bound $$sum_{n=m+1}^infty frac{x^{n}}{n^2} leq x^{m+1} cdot sum_{n=m+1}^infty frac{1}{n^2}$$
I am quite pleased with this, but was wondering if there are alternative, better well known bounds.










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Just to be precise it is more common to call this special Polylogarithm "Dilogarithm" $($or Spence's Function$)$ denoted as $operatorname{Li}_2(z)$.
    $endgroup$
    – mrtaurho
    Dec 21 '18 at 11:55










  • $begingroup$
    You can use this formula : $sum_{n=1}^{infty}frac{x^{n+1}}{n(n+1)} = (1-x) log(1-x) + x$. But I don't know if it will be better
    $endgroup$
    – Damien
    Dec 21 '18 at 14:14












  • $begingroup$
    Awesome, this is exactly the type of thing I was looking for! You can post it as an answer if you want to. Just a small thing: your last $x$ should be a $1$ I believe, i.e. $(1-x) log(1-x) + 1$.
    $endgroup$
    – HolyMonk
    Dec 21 '18 at 14:43














1












1








1


0



$begingroup$


Let $x in (0,1)$ be some real number, we can then consider the Polylogarithm:
$$operatorname{L}_2(x)=sum_{n=1}^infty frac{x^n}{n^2}$$
It is not hard to see that the following upper bound holds:
$$
operatorname{L}_2(x) = x cdot sum_{n=1}^infty frac{x^{n-1}}{n^2} leq x sum_{n=1}^infty frac{1}{n^2} =frac{xpi^2}{6}.
$$

One could continue to get a finer upper bound using the same strategy:
$$
operatorname{L}_2(x) = sum_{n=1}^m frac{x^n}{n^2} + sum_{n=m+1}^infty frac{x^{n}}{n^2}
$$

where we can then upper bound $$sum_{n=m+1}^infty frac{x^{n}}{n^2} leq x^{m+1} cdot sum_{n=m+1}^infty frac{1}{n^2}$$
I am quite pleased with this, but was wondering if there are alternative, better well known bounds.










share|cite|improve this question











$endgroup$




Let $x in (0,1)$ be some real number, we can then consider the Polylogarithm:
$$operatorname{L}_2(x)=sum_{n=1}^infty frac{x^n}{n^2}$$
It is not hard to see that the following upper bound holds:
$$
operatorname{L}_2(x) = x cdot sum_{n=1}^infty frac{x^{n-1}}{n^2} leq x sum_{n=1}^infty frac{1}{n^2} =frac{xpi^2}{6}.
$$

One could continue to get a finer upper bound using the same strategy:
$$
operatorname{L}_2(x) = sum_{n=1}^m frac{x^n}{n^2} + sum_{n=m+1}^infty frac{x^{n}}{n^2}
$$

where we can then upper bound $$sum_{n=m+1}^infty frac{x^{n}}{n^2} leq x^{m+1} cdot sum_{n=m+1}^infty frac{1}{n^2}$$
I am quite pleased with this, but was wondering if there are alternative, better well known bounds.







real-analysis calculus upper-lower-bounds polylogarithm






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 21 '18 at 11:56









mrtaurho

6,15271641




6,15271641










asked Dec 21 '18 at 11:50









HolyMonkHolyMonk

622416




622416








  • 1




    $begingroup$
    Just to be precise it is more common to call this special Polylogarithm "Dilogarithm" $($or Spence's Function$)$ denoted as $operatorname{Li}_2(z)$.
    $endgroup$
    – mrtaurho
    Dec 21 '18 at 11:55










  • $begingroup$
    You can use this formula : $sum_{n=1}^{infty}frac{x^{n+1}}{n(n+1)} = (1-x) log(1-x) + x$. But I don't know if it will be better
    $endgroup$
    – Damien
    Dec 21 '18 at 14:14












  • $begingroup$
    Awesome, this is exactly the type of thing I was looking for! You can post it as an answer if you want to. Just a small thing: your last $x$ should be a $1$ I believe, i.e. $(1-x) log(1-x) + 1$.
    $endgroup$
    – HolyMonk
    Dec 21 '18 at 14:43














  • 1




    $begingroup$
    Just to be precise it is more common to call this special Polylogarithm "Dilogarithm" $($or Spence's Function$)$ denoted as $operatorname{Li}_2(z)$.
    $endgroup$
    – mrtaurho
    Dec 21 '18 at 11:55










  • $begingroup$
    You can use this formula : $sum_{n=1}^{infty}frac{x^{n+1}}{n(n+1)} = (1-x) log(1-x) + x$. But I don't know if it will be better
    $endgroup$
    – Damien
    Dec 21 '18 at 14:14












  • $begingroup$
    Awesome, this is exactly the type of thing I was looking for! You can post it as an answer if you want to. Just a small thing: your last $x$ should be a $1$ I believe, i.e. $(1-x) log(1-x) + 1$.
    $endgroup$
    – HolyMonk
    Dec 21 '18 at 14:43








1




1




$begingroup$
Just to be precise it is more common to call this special Polylogarithm "Dilogarithm" $($or Spence's Function$)$ denoted as $operatorname{Li}_2(z)$.
$endgroup$
– mrtaurho
Dec 21 '18 at 11:55




$begingroup$
Just to be precise it is more common to call this special Polylogarithm "Dilogarithm" $($or Spence's Function$)$ denoted as $operatorname{Li}_2(z)$.
$endgroup$
– mrtaurho
Dec 21 '18 at 11:55












$begingroup$
You can use this formula : $sum_{n=1}^{infty}frac{x^{n+1}}{n(n+1)} = (1-x) log(1-x) + x$. But I don't know if it will be better
$endgroup$
– Damien
Dec 21 '18 at 14:14






$begingroup$
You can use this formula : $sum_{n=1}^{infty}frac{x^{n+1}}{n(n+1)} = (1-x) log(1-x) + x$. But I don't know if it will be better
$endgroup$
– Damien
Dec 21 '18 at 14:14














$begingroup$
Awesome, this is exactly the type of thing I was looking for! You can post it as an answer if you want to. Just a small thing: your last $x$ should be a $1$ I believe, i.e. $(1-x) log(1-x) + 1$.
$endgroup$
– HolyMonk
Dec 21 '18 at 14:43




$begingroup$
Awesome, this is exactly the type of thing I was looking for! You can post it as an answer if you want to. Just a small thing: your last $x$ should be a $1$ I believe, i.e. $(1-x) log(1-x) + 1$.
$endgroup$
– HolyMonk
Dec 21 '18 at 14:43










0






active

oldest

votes












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


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3048436%2fupper-bound-the-polylogarithm-sum-n-1-infty-fracxnn2%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















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%2f3048436%2fupper-bound-the-polylogarithm-sum-n-1-infty-fracxnn2%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

Plaza Victoria

Puebla de Zaragoza

Musa