New sharp bounds for logarithmic mean and identric mean
© Yang; licensee Springer 2013
Received: 9 November 2012
Accepted: 22 February 2013
Published: 20 March 2013
For with , let , , , , denote the logarithmic mean, identric mean, arithmetic mean, geometric mean and r-order power mean, respectively. We find the best constant such that the inequalities
hold, respectively. From them some new inequalities for means are derived. Lastly, our new lower bound for the logarithmic mean is compared with several known ones, which shows that our results are superior to others.
MSC: 26D07, 26E60, 05A15, 15A18.
Keywordslogarithmic mean identric mean power mean inequality
The main properties of these means are given in . In particular, the function () is continuous and strictly increasing on ℝ. As special cases, the arithmetic mean and geometric mean are and , respectively.
are even on , and therefore we assume that in what follows.
Our main results are stated as follows.
Theorem 1 Let . Then inequalities (1.12) hold for all with if and only if and , and the function is decreasing on .
Theorem 2 Let . Then inequalities (1.13) hold for all with if and only if and , and the function is decreasing on .
We will prove two theorems above by hyperbolic function theory. For this end, we need the following lemma, which tells us an inequality for bivariate homogeneous means can be equivalently changed into the form of hyperbolic functions.
where . And then, due to Lemma 1, Theorem 1 and Theorem 2 can be restated as equivalent ones, respectively.
holds for all if and only if and the function is decreasing on . Inequality (1.16) is reversed if and only if .
holds for all if and only if and the function is decreasing on . Inequality (1.17) is reversed if and only if .
Therefore, we will prove Theorem 1′ and Theorem 2′ instead of Theorem 1 and Theorem 2 in the sequel.
2 Proof of Theorem 1′
In order to prove Theorem 1′, we first give the following lemmas.
which proves the lemma. □
from which (2.6) easily follows.
This lemma is proved. □
Lemma 4 For , let f be defined by (2.4). Then f is increasing if and decreasing if .
Now we are ready to prove desired results.
which together with (2.11) yields , and from (2.10) it is derived that . By mathematical induction, we conclude that for , which proves part one of this lemma.
which leads to , and from (2.10) we have for . By mathematical induction, it is obtained that for .
This completes the proof. □
Now we prove Theorem 1′.
Proof of Theorem 1′ It is clear that (1.16) (or its reverse inequality) is equivalent to (or <0), where is defined by (2.4).
which yields .
for all .
which leads to .
for all .
(iii) Lastly, from Lemma 2 we easily conclude that the function is decreasing on .
Thus the proof is accomplished. □
3 Proof of Theorem 2′
The following lemmas are useful.
from which (3.3) follows.
Thus the lemma is proved. □
Lemma 6 For , let the function g be defined by (3.1). Then g is increasing if and decreasing if .
leads to (3.10).
Now we are in a position to prove our results.
(i) We first prove that g is increasing if . For this end, it is enough to show that by (3.5) and (3.6). Indeed, we have and . Suppose that for . From (3.8) and (3.9) we have , which proves part one of this lemma by mathematical induction.
(ii) Next we prove that g is decreasing if . It suffices to prove that . We have seen that , but . Using (3.8) and (3.10), we conclude that if for . By mathematical induction, part two of this lemma is proved.
Thus the proof ends. □
Based on the above lemmas, Theorem 2′ can be easily proved.
Proof of Theorem 2′ It is clear that (1.17) (or its reverse inequality) is equivalent to (or <0), where is defined by (3.1).
which leads to .
for all .
Solving the inequalities yields .
for all .
(iii) Lastly, due to Lemma 2, the function is clearly decreasing on .
This proves the proof. □
Using Theorem 1 and (2.2), the following corollaries are immediate.
holds for with , where the constants and are the best constants.
By Theorem 2 and (2.3), we obtain the following.
holds for with , where and are the best constants.
where with .
Employing Theorem 1, Theorem 2 and (2.2), we can prove an interesting chain of inequalities involving the logarithmic mean, identric mean, power mean and geometric mean.
hold for with , where .
if and .
The second and third inequalities are equivalent to (1.17), which hold if and only if and by Theorem 2, respectively.
If , then by Theorem 1 the fourth and fifth inequalities hold.
Squaring both sides of (4.8) and (4.9) yields the sixth and seventh inequality, respectively.
The proof is finished. □
From Lemma 6 with (3.4) another known interesting inequality can be reobtained. It should be noted that the second inequality in (4.10) first appeared in  and was reproved by Neuman and Sándor .
where is the best constant.
which is equivalent to (4.10).
Thus the proof is completed. □
5 Comparison of some lower bounds for logarithmic mean
and so on, some of which have been proved to be comparable and others remain to be compared further. As applications of our main results, we will discuss them in this section. To this end, we first give a lemma.
Lemma 7 ([, Conclusion 1])
The function is strictly log-concave on .
Now we compare with .
hold for all with , where and cannot be improved.
Clearly, if we prove that for all , if and if , then inequalities (5.1) are valid.
which together with (5.3) yields under the inductive assumption for . By mathematical induction, it is acquired that for all .
for all .
which yields . On the other hand, by Lemma 2 the function is decreasing on . Therefore, is the largest constant such that for all .
In the same way, we can prove is the smallest constant such that for all .
This completes the proof. □
Next let us compare and .
which completes the proof. □
Using Lemmas 7-9, we can easily prove the following.
Proof The first, second and third inequalities follow from Theorem 1 and Lemma 8. Since , by Theorem 1 the fourth and fifth ones follow. The sixth and seventh ones are obtained from the second and third ones of (4.7).
By the known inequality (see [, (5.13)]), we easily get the eighth one.
Lemma 9 shows that the ninth one holds.
The last one is equivalent to , which easily follows from Lemma 7.
This completes the proof. □
Lastly, we compare with ().
holds for all with if . While and are not comparable if .
which proves inequality (5.6).
which implies that there are numbers such that when and when . Consequently, and are not comparable on if , which is the desired result.
Thus the proof is finished. □
Remark 3 From the above two propositions, as far as the lower bounds for the logarithmic mean are concerned, our new lower bound seems to be superior to most known ones.
The author would like to thank Mr. Pi for her help. The author also wishes to thank the reviewer(s) who gave some important and valuable advises.
- Bullen PS, Mitrinović DS, Vasić PM: Means and Their Inequalities. Reidel, Dordrecht; 1988.View ArticleGoogle Scholar
- Ostle B, Terwilliger HL: A comparison of two means. Proc. Mont. Acad. Sci. 1957, 17: 69–70.Google Scholar
- Karamata J: Sur quélques problémes posés par Ramanujan. J. Indian Math. Soc. 1960, 24: 343–365.MathSciNetGoogle Scholar
- Mitrinović DS: Analytic Inequalities. Springer, New York; 1970.View ArticleGoogle Scholar
- Yang Z-H: Other property of the convex function. Chin. Math. Bull. 1984, 2: 31–32. (in Chinese)Google Scholar
- Yang Z-H: Exponential mean and logarithmic mean. Math. Pract. Theory 1987, 4: 76–78. (in Chinese)Google Scholar
- Sándor J: Some integral inequalities. Elem. Math. 1988, 43: 177–180.MathSciNetGoogle Scholar
- Lin TP: The power mean and the logarithmic mean. Am. Math. Mon. 1974, 81: 879–883. 10.2307/2319447View ArticleGoogle Scholar
- Neuman E: The weighted logarithmic mean. J. Math. Anal. Appl. 1994, 188: 885–900. 10.1006/jmaa.1994.1469MathSciNetView ArticleGoogle Scholar
- Carlson BC: The logarithmic mean. Am. Math. Mon. 1972, 79: 615–618. 10.2307/2317088View ArticleGoogle Scholar
- Leach EB, Sholander MC: Extended mean values II. J. Math. Anal. Appl. 1983, 92: 207–223. 10.1016/0022-247X(83)90280-9MathSciNetView ArticleGoogle Scholar
- Wang C, Wang X: Quadrature formulae and analytic inequalities - on the separation of power means by logarithmic mean. Hangzhou Daxue Xuebao 1982, 9(2):156–159.Google Scholar
- Chen J, Wang Z: On the lower bound of the logarithmic mean. Chengdu Ke-Ji Daxue Xuebao 1990, 1990(2):100–102.Google Scholar
- Zhu L: Generalized Lazarevićs inequality and its applications - Part II. J. Inequal. Appl. 2009., 2009: Article ID 379142Google Scholar
- Alzer H: Two inequalities for means. C. R. Math. Acad. Sci. 1987, 9: 11–16.MathSciNetGoogle Scholar
- Yang Z-H: Some monotonicity results for certain mixed means with parameters. Int. J. Appl. Math. Sci. 2012., 2012: Article ID 540710. doi:10.1155/2012/540710Google Scholar
- Stolarsky KB: Generalizations of the logarithmic mean. Math. Mag. 1975, 48: 87–92. 10.2307/2689825MathSciNetView ArticleGoogle Scholar
- Stolarsky KB: The power and generalized logarithmic means. Am. Math. Mon. 1980, 87: 545–548. 10.2307/2321420MathSciNetView ArticleGoogle Scholar
- Pittenger AO: The symmetric, logarithmic and power means. Publ. Elektroteh. Fak. Univ. Beogr., Ser. Mat. Fiz. 1980, 1980(678–715):19–23.MathSciNetGoogle Scholar
- Sándor J: A note on some inequalities for means. Arch. Math. 1991, 56: 471–473. 10.1007/BF01200091View ArticleGoogle Scholar
- Allasia G, Giordano C, Pěcarić J: On the arithmetic and logarithmic means with applications to Stirling’s formula. Atti Semin. Mat. Fis. Univ. Modena 1999, 47: 441–455.Google Scholar
- Alzer H, Qiu S-L: Inequalities for means in two variables. Arch. Math. 2003, 80: 201–215. 10.1007/s00013-003-0456-2MathSciNetView ArticleGoogle Scholar
- Burk F: The geometric, logarithmic, and arithmetic mean inequality. Am. Math. Mon. 1987, 94: 527–528. 10.2307/2322844MathSciNetView ArticleGoogle Scholar
- Kouba O: New bounds for the identric mean of two arguments. J. Inequal. Pure Appl. Math. 2008., 9(3): Article ID 71Google Scholar
- Neuman E, Sándor J: On the Schwab-Borchardt mean. Math. Pannon. 2003, 14: 253–266.MathSciNetGoogle Scholar
- Neuman E, Sándor J: On certain means of two arguments and their extensions. Int. J. Math. Math. Sci. 2003, 2003(16):981–993. 10.1155/S0161171203208103View ArticleGoogle Scholar
- Sándor J: Inequalities for means. Proc. 3rd Symposium of Math. and Its Appl. 1989, 87–90.Google Scholar
- Sándor J: On refinements of certain inequalities for means. Arch. Math. 1995, 31: 279–282.Google Scholar
- Sándor J, Rasa I: Inequalities for certain means in two arguments. Nieuw Arch. Wiskd. 1997, 15: 51–55.Google Scholar
- Sándor J, Trif T: Some new inequalities for means of two arguments. Int. J. Math. Math. Sci. 2001, 25: 525–532. 10.1155/S0161171201003064MathSciNetView ArticleGoogle Scholar
- Vamanamurthy MK, Vuorinen M: Inequalities for means. J. Math. Anal. Appl. 1994, 183: 155–166. 10.1006/jmaa.1994.1137MathSciNetView ArticleGoogle Scholar
- Xia W-F, Chu Y-M, Wang G-D: The optimal upper and lower power mean bounds for a convex combination of the arithmetic and logarithmic means. Abstr. Appl. Anal. 2010., 2010: Article ID 604804Google Scholar
- Yang Z-H: ON the log-convexity of two-parameter homogeneous functions. Math. Inequal. Appl. 2007, 10(3):499–516.MathSciNetGoogle Scholar
- Seiffert H-J: Comment to problem 1365. Math. Mag. 1992, 65: 356. 10.2307/2691251MathSciNetView ArticleGoogle Scholar
- Yang Z-H: Some identities for means and applications. RGMIA Research Report Collection 2005., 8(3): Article ID 17. Available online at http://www.ajmaa.org/RGMIA/papers/v8n3/imp.pdfGoogle Scholar
- Neuman E, Sándor J: Companion inequalities for certain bivariate means. Appl. Anal. Discrete Math. 2009, 3(1):46–51. Available online at http://www.doiserbia.nb.rs/img/doi/1452–8630/2009/1452–86300901046N.pdf 10.2298/AADM0901046NMathSciNetView ArticleGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.