Abstract
Based on the Padé approximation method, in this paper we determine the coefficients \(a_{j}\) and \(b_{j}\) (\(1\leq j \leq k\)) such that
where \(k\geq 1\) is any given integer. Based on the obtained result, we establish new upper bounds for \(( 1+1/x ) ^{x}\). As an application, we give a generalized Carleman-type inequality.
Similar content being viewed by others
1 Introduction
Let \(a_{n} \geq 0\) for \(n \in \mathbb{N}:=\{1, 2, \ldots \}\) and \(0<\sum_{n=1}^{\infty }a_{n}<\infty \). Then
The constant e is the best possible. The inequality (1.1) was presented in 1922 in [1] by Carleman and it is called Carleman’s inequality. Carleman discovered this inequality during his important work on quasi-analytical functions.
Carleman’s inequality (1.1) was generalized by Hardy [2] (see also [3, p.256]) as follows: If \(a_{n} \geq 0\), \(\lambda_{n}>0\), \(\Lambda_{n}=\sum_{m=1}^{n}\lambda_{m}\) for \(n \in \mathbb{N}\), and \(0<\sum_{n=1}^{\infty }\lambda_{n}a_{n}< \infty \), then
Note that inequality (1.2) is usually referred to as a Carleman-type inequality or weighted Carleman-type inequality. In [2], Hardy himself said that it was Pólya who pointed out this inequality to him.
In [4–20], some strengthened and generalized results of (1.1) and (1.2) have been given by estimating the weight coefficient \(( 1+1/n ) ^{n}\). For example, Yang [17] proved that, for \(n\in \mathbb{N}\),
and then used it to obtain the following strengthened Carleman inequality:
Xie and Zhong [15] proved that, for \(x\geq 1\),
and then used it to improve the Carleman-type inequality (1.2) as follows. If \(0<\lambda_{n+1} \leq \lambda_{n}\), \(\Lambda_{n}=\sum_{m=1}^{n}\lambda_{m}\), \(a_{n} \geq 0\) for \(n \in \mathbb{N}\), and \(0<\sum_{n=1}^{\infty }\lambda_{n}a_{n}< \infty \), then
Taking \(\lambda_{n} \equiv 1\) in (1.6) yields
which improves (1.4).
Recently, Mortici and Hu [14] proved that, for \(x\geq 1\),
and then they used it to establish the following improvement of Carleman’s inequality:
which can be written as
where
For information as regards the history of Carleman-type inequalities, please refer to [21–24].
It follows from (1.8) that
Using the Padé approximation method, in Section 3 we derive (1.11) and the following approximation formula:
Equation (1.12) motivates us to present the following inequality:
Following the same method used in the proof of Theorem 3.2, we can prove the inequality (1.13). We here omit it.
According to Pólya’s proof of (1.1) in [25],
and then the following strengthened Carleman’s inequality is derived directly from (1.13):
which improves (1.7).
Based on the Padé approximation method, we determine the coefficients \(a_{j}\) and \(b_{j}\) (\(1\leq j\leq k\)) such that
where \(k\geq 1\) is any given integer. Based on the obtained result, we establish new upper bounds for \(( 1+1/x ) ^{x}\). As an application, we give a generalization to the Carleman-type inequality.
The numerical values given have been calculated using the computer program MAPLE 13.
2 A useful lemma
For later use, we introduce the following set of partitions of an integer \(n \in \mathbb{N} =\mathbb{N}_{0} \setminus \{ 0 \} := \{1,\,2,\,3,\,\ldots \}\):
In number theory, the partition function \(p(n)\) represents the number of possible partitions of \(n \in \mathbb{N}\) (e.g., the number of distinct ways of representing n as a sum of natural numbers regardless of order). By convention, \(p(0) = 1\) and \(p(n) = 0\) if n is a negative integer. For more information on the partition function \(p(n)\), please refer to [26] and the references therein. The first values of the partition function \(p(n)\) are (starting with \(p(0)=1\)) (see [27]):
It is easy to see that the cardinality of the set \(\mathcal{A}_{n}\) is equal to the partition function \(p(n)\). Now we are ready to present a formula which determines the coefficients \(a_{j}\) in (2.2) with the help of the partition function given by the following lemma.
Lemma 2.1
[28]
The following approximation formula holds true:
where the coefficients \(c_{j}\) \((j \in \mathbb{N})\) are given by
where the \(\mathcal{A}_{j}\) \((\textit{for}\ j \in \mathbb{N})\) are given in (2.1).
3 Padé approximant related to asymptotics for the constant e
For later use, we introduce the Padé approximant (see [29–34]). Let f be a formal power series
The Padé approximation of order \((p, q)\) of the function f is the rational function, denoted by
where \(p\geq 0\) and \(q\geq 1\) are two given integers, the coefficients \(a_{j}\) and \(b_{j}\) are given by (see [29–31, 33, 34])
and the following holds:
Thus, the first \(p + q + 1\) coefficients of the series expansion of \([p/q]_{f}\) are identical to those of f. Moreover, we have (see [32])
with \(f_{n}(x) = c_{0}+ c_{1}x+ \cdots + c_{n}x^{n}\), the nth partial sum of the series f (\(f_{n}\) is identically zero for \(n < 0\)).
Let
It follows from (2.2) that, as \(x\to \infty \),
with the coefficients \(c_{j}\) given by (2.3). In what follows, the function f is given in (3.6).
We now give a derivation of equation (1.11). To this end, we consider
Noting that
holds, we have, by (3.3),
that is,
We thus obtain
and we have, by (3.4),
We now give a derivation of equation (1.12). To this end, we consider
Noting that (3.8) holds, we have, by (3.3),
that is,
We thus obtain
and we have, by (3.4),
Using the Padé approximation method and the expansion (3.7), we now present a general result given by Theorem 3.1. As a consequence, we obtain (1.16).
Theorem 3.1
The Padé approximation of order \((p, q)\) of the asymptotic formula of the function \(f(x)=\frac{1}{e} ( 1+\frac{1}{x} ) ^{x}\) (at the point \(x=\infty \)) is the following rational function:
where \(p\geq 1\) and \(q\geq 1\) are two given integers, the coefficients \(a_{j}\) and \(b_{j}\) are given by
\(c_{j}\) is given in (2.3), and the following holds:
Moreover, we have
with \(f_{n}(x)=\sum_{j=0}^{n}\frac{c_{j}}{x^{j}}\), the nth partial sum of the asymptotic series (3.7).
Remark 3.1
Using (3.16), we can also derive (3.9) and (3.11). Indeed, we have
and
Remark 3.2
Setting \((p, q)=(k, k)\) in (3.15), we obtain (1.16).
Setting
respectively, we obtain by Theorem 3.1, as \(x\to \infty \),
and
Equations (3.17) and (3.18) motivate us to establish the following theorem.
Theorem 3.2
For \(x>0\),
and
Proof
We only prove the inequality (3.20). The proof of (3.19) is analogous. In order to prove (3.20), it suffices to show that
where
Differentiation yields
where
and
Differentiating \(F'(x)\), we find
where
and
Hence, \(F''(x)<0\) for \(x>0\), and we have
The proof is complete. □
The inequality (3.20) can be written as
where
4 A generalized Carleman-type inequality
Theorem 4.1
Let \(0<\lambda_{n+1} \leq \lambda_{n}\), \(\Lambda_{n}=\sum_{m=1}^{n} \lambda_{m}\) \((\Lambda_{n}\geq 1)\), \(a_{n} \geq 0\) \((n \in \mathbb{N})\) and \(0<\sum_{n=1}^{\infty }\lambda_{n}a_{n}<\infty \). Then, for \(0< p \leq 1\),
where \(\mathcal{E}(x)\) is given in (3.22) and
Proof
The inequality
has been proved in Theorem 2.2 of [9] (see also [11, p.96]). From the above inequality and (3.20), we obtain (4.1). The proof is complete. □
Remark 4.1
In Theorem 2.2 of [9], \(c_{k}^{\lambda_{n}}=\frac{( \Lambda_{n+1})^{\Lambda_{n}}}{(\Lambda_{n})^{\Lambda_{n-1}}}\) should be \(c_{n}^{\lambda_{n}}=\frac{(\Lambda_{n+1})^{\Lambda_{n}}}{(\Lambda_{n})^{ \Lambda_{n-1}}}\); see [9, p.44, line 3]. Likewise, \(c_{s}^{\lambda_{n}}=\frac{(\Lambda_{n+1})^{\Lambda_{n}}}{(\Lambda_{n})^{ \Lambda_{n-1}}}\) in Theorem 3.1 of [11] should be \(c_{n}^{\lambda_{n}}=\frac{(\Lambda_{n+1})^{\Lambda_{n}}}{(\Lambda_{n})^{ \Lambda_{n-1}}}\); see [11, p.96, equation (9)].
Remark 4.2
Taking \(p=1\) in (4.1) yields
which improves (1.6). Taking \(\lambda_{n} \equiv 1\) in (4.3) yields
which improves (1.9).
References
Carleman, T: Sur les fonctions quasi-analytiques. In: Comptes rendus du V e Congres des Mathematiciens Scandinaves. Helsingfors, pp. 181-196 (1922)
Hardy, GH: Notes on some points in the integral calculus. Messenger Math. 54, 150-156 (1925)
Hardy, GH, Littlewood, JE, Pólya, G: Inequalities, 2nd edn. Cambridge University Press, Cambridge (1952)
Čižmešija, A, Pečarić, J, Persson, LE: On strengthened Carleman’s inequality. Bull. Aust. Math. Soc. 68, 481-490 (2003)
Chen, HW: On an infinite series for \((1+1/x)^{x}\) and its application. Int. J. Math. Math. Sci. 29, 675-680 (2002)
Chen, CP: Generalization of weighted Carleman-type inequality. East J. Approx. 12, 63-69 (2006)
Chen, CP, Qi, F: Generalization of Hardy’s inequality. Proc. Jangjeon Math. Soc. 7, 57-61 (2004)
Chen, CP, Cheung, WS, Qi, F: Note on weighted Carleman type inequality. Int. J. Math. Math. Sci. 3, 475-481 (2005)
Dragomir, SS, Kim, YH: The strengthened Hardy inequalities and their new generalizations. Filomat 20, 39-49 (2006)
Hu, Y: A strengthened Carleman’s inequality. Commun. Math. Anal. 1, 115-119 (2006)
Lü, Z, Gao, Y, Wei, Y: Note on the Carleman’s inequality and Hardy’s inequality. Comput. Math. Appl. 59, 94-97 (2010)
Li, JL: Notes on an inequality involving the constant e. J. Math. Anal. Appl. 250, 722-725 (2000)
Liu, HP, Zhu, L: New strengthened Carleman’s inequality and Hardy’s inequality. J. Inequal. Appl. 2007, Article ID 84104 (2007). http://link.springer.com/article/10.1155/2007/84104/fulltext.html
Mortici, C, Hu, Y: On some convergences to the constant e and improvements of Carleman’s inequality. Carpath. J. Math. 31, 249-254 (2015)
Xie, Z, Zhong, Y: A best approximation for constant e and an improvement to Hardy’s inequality. J. Math. Anal. Appl. 252, 994-998 (2000)
Yan, P, Sun, GZ: A strengthened Carleman’s inequality. J. Math. Anal. Appl. 240, 290-293 (1999)
Yang, BC, Debnath, L: Some inequalities involving the constant e, and an application to Carleman’s inequality. J. Math. Anal. Appl. 223, 347-353 (1998)
Yang, BC: On Hardy’s inequality. J. Math. Anal. Appl. 234, 717-722 (1999)
Yang, XJ: On Carleman’s inequality. J. Math. Anal. Appl. 253, 691-694 (2001)
Yang, XJ: Approximations for constant e and their applications. J. Math. Anal. Appl. 262, 651-659 (2001)
Johansson, M, Persson, LE, Wedestig, A: Carleman’s inequality - history, proofs and some new generalizations. J. Inequal. Pure Appl. Math. 4(3), Article ID 53 (2003). http://jipam.vu.edu.au/article.php?sid=291
Kaijser, S, Persson, LE, Öberg, A: On Carleman and Knopp’s inequalities. J. Approx. Theory 117, 140-151 (2002)
Kufner, A, Persson, LE: Weighted Inequalities of Hardy Type. World Scientific, Singapore (2003)
Pečarić, J, Stolarsky, KB: Carleman’s inequality: history and new generalizations. Aequ. Math. 61, 49-62 (2001)
Pólya, G: Proof of an inequality. Proc. Lond. Math. Soc. 24, 57 (1926)
Wikipedia contributors: Partition (number theory), Wikipedia, the free encyclopedia. http://en.wikipedia.org/wiki/Partition_function_(number_theory)#Partition_function
Sloane, NJA: \(a(n)\) = number of partitions of n (the partition numbers). Maintained by The OEIS Foundation. http://oeis.org/A000041
Chen, CP, Choi, J: Asymptotic formula for \((1+1/x)^{x}\) based on the partition function. Am. Math. Mon. 121, 338-343 (2014)
Bercu, G: Padé approximant related to remarkable inequalities involving trigonometric functions. J. Inequal. Appl. 2016 99 (2016). http://www.doc88.com/p-0037658479714.html
Bercu, G: The natural approach of trigonometric inequalities-Padé approximant. J. Math. Inequal. 11, 181-191 (2017)
Bercu, G, Wu, S: Refinements of certain hyperbolic inequalities via the Padé approximation method. J. Nonlinear Sci. Appl. 9, 5011-5020 (2016)
Brezinski, C, Redivo-Zaglia, M: New representations of Padé, Padé-type, and partial Padé approximants. J. Comput. Appl. Math. 284, 69-77 (2015)
Li, X, Chen, CP: Padé approximant related to asymptotics for the gamma function. J. Inequal. Appl. 2017, 53 (2017). http://journalofinequalitiesandapplications.springeropen.com/articles/10.1186/s13660-017-1315-1
Liu, J, Chen, CP: Padé approximant related to inequalities for Gauss lemniscate functions. J. Inequal. Appl. 2016, 320 (2016). http://journalofinequalitiesandapplications.springeropen.com/articles/10.1186/s13660-016-1262-2
Acknowledgements
The authors thank the referees for helpful comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors read and approved the final manuscript.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Chen, CP., Zhang, HJ. Padé approximant related to inequalities involving the constant e and a generalized Carleman-type inequality. J Inequal Appl 2017, 205 (2017). https://doi.org/10.1186/s13660-017-1479-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-017-1479-8