- Research
- Open Access
Exponential convexity of Petrović and related functional
- Saad I Butt1Email author,
- Josip Pečarić1, 2 and
- Atiq Ur Rehman3
https://doi.org/10.1186/1029-242X-2011-89
© Butt et al; licensee Springer. 2011
- Received: 22 March 2011
- Accepted: 20 October 2011
- Published: 20 October 2011
Abstract
We consider functionals due to the difference in Petrović and related inequalities and prove the log-convexity and exponential convexity of these functionals by using different families of functions. We construct positive semi-definite matrices generated by these functionals and give some related results. At the end, we give some examples.
Keywords
- convex functions
- divided difference
- exponentially convex
- functionals
- log-convex functions
- positive semi-definite
1 Introduction
First time exponentially convex functions are introduced by Bernstein [1]. Independently of Bernstein, but some what later Widder [2] introduced these functions, as a sub-class of convex functions in a given interval (a, b), and denoted this class by Wa,b. After the initial development, there is a big gap in time before applications and examples of interest were constructed. One of the reasons is that, aside from absolutely monotone functions and completely monotone functions, as special classes of exponentially convex functions, there is no operative criteria to recognize exponential convexity of functions.
for all n ∈ ℕ and all choices ξ i ∈ ℝ and x i + x j ∈ (a, b), 1 ≤ i, j ≤ n.
- (i)
f is exponentially convex.
- (ii)f is continuous and
for every ξ i ∈ ℝ and every x i ∈ (a, b), 1 ≤ i ≤ n.
for every n ∈ ℕ, x i ∈ (a, b), i = 1, ..., n.
We consider functionals due to the differences in the Petrović and related inequalities. These inequalities are given in the following theorems [[4], pp. 152-159].
Remark 1.5. Let us note that if f(x)/x is a strictly increasing function for x ∈ I, then equality in (3) is valid if we have equalities in (2) instead of the inequalities, that is, x1= ⋯ = x n and .
- (i)If there exists an m(≤ n) such that(4)
- (ii)If there exists an m(≤ n) such that(5)
then the reverse of inequality in (3) holds.
Remark 1.8. If f(x)/x is a strictly increasing function for x ∈ I, then strict inequality holds in (6).
Remark 1.10. If f is a strictly increasing function on I and all x i 's are not equal, then we obtain strict inequality in (7).
Theorem 1.11. Let I = [0, a] ⊆ ℝ be an interval, (x1, ..., x n ) ∈ I n , and (p1, ..., p n ) be a non-negative n-tuple such that (2) holds.
Remark 1.12. In the above theorem, if f is a strictly convex, then inequality in (8) is strict, if all x i 's are not equal or .
(b) Ifand either
or
then the reverse of the inequality in (10) holds.
In this paper, we consider certain families of functions to prove log-convexity and exponential convexity of functionals due to the differences in inequalities given in Theorems 1.4-1.13. We construct positive semi-definite matrices generated by these functionals. Also by using log-convexity of these functionals, we prove monotonicity of the expressions introduced by these functionals. At the end, we give some examples.
2 Main results
provided that f' exists.
provided that f″ exists.
One can note that if for all u0, u1 ∈ I, [u0, u1, f] ≥ 0, then f is increasing on I and if for all u0, u1, u2 ∈ I, [u0, u1, u2, f] ≥ 0, then f is convex on I.
If f(u)/u is strictly increasing for u ∈ I and all x i 's are not equal orthen strict inequality holds in the above expression.
If f is strictly increasing function on I and all x i 's are not equal, then we obtain strict inequality in the above expression.
If f is strictly increasing function on I and all x i 's are not equal, then we obtain strict inequality in the above expression for.
The following lemma is nothing more than the discriminant test for the non-negativity of second-order polynomials.
holds for each m, n ∈ ℝ and r, t ∈ I.
To define different families of functions, let I ⊆ ℝ and (c, d) ⊆ ℝ be intervals. For distinct points u0, u1, u2 ∈ I we suppose
D1 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u1, F t ] is log-convex in J-sense, where F t (u) = f t (u)/u}.
D2 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u0, F t ] is log-convex in J-sense, where F t (u) = f t (u)/u and exists}.
D3 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u1, f t ] is log-convex in J-sense}.
D4 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u0, f t ] is log-convex in J-sense, where exists}.
D5 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u1, u2, f t ] is log-convex in J-sense}.
D6 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u0, u2, f t ] is log-convex in J-sense, where exists}.
D7 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u0, u0, f t ] is log-convex in J-sense, where exists}.
In this theorem, we prove log-convexity in J-sense, log-convexity and related results of the functionals associated with their respective families of functions.
Theorem 2.5. Let be the linear functionals defined in(M k ), associate the functionals with D i in such a way that, for k = 1, 2, 3, 4, f t ∈ D i , i = 1, 2, for k = 5, f t ∈ D i , i = 3, 4 and for k = 6, 7, 8, f t ∈ D i , i = 5, 6, 7. Also for k = 7, 8, assume that the linear functionals are positive. Then, the following statements are valid:
(a) The functionsare log-convex in J-sense on (c, d).
(b) If the functionsare continuous on (c, d), then the functionsare log-convex on (c, d).
Proof. (a) First, we prove log-convexity in J-sense of for k = 1, 2, 3, 4. For this, we consider the families of functions defined in D1 and D2.
where H (u) = h(u)/u and F t (u) = f t (u)/u.
Since t ↦ [u0, u1, F t ] is log-convex in J-sense, by Lemma 2.4 the right-hand side of above expression is non-negative. This implies h(u)/u is an increasing function for u ∈ I.
Now [u0, u1, F t ] > 0 as it is log-convex, this implies f t (u)/u is strictly increasing for all u ∈ I and t ∈ (c, d). Also all x i 's are not equal and therefore by Remark 2.1, are positive valued, and hence, by Lemma 2.4, the inequality (16) implies log-convexity in J-sense of the functions for k = 1, 2, 3, 4.
Now we prove log-convexity in J-sense of . For this, we consider the families of functions defined in D3 and D4. Following the same steps as above and having H(u) = h(u), we have the log-convexity in J-sense of by using Remark 2.2 and Lemma 2.4.
At last, we prove log-convexity in J-sense of for k = 6, 7, 8. For this, we consider the families of Functions defined in D i for i = 5, 6, 7.
Since t ↦ [u0, u1, u2, f t ] is log-convex in J-sense, by Lemma 2.4 the right-hand side of above expression is non-negative. This implies h is a strictly convex function on I.
Since are positive valued, we have by Lemma 2.4 and inequality (17) the log-convexity in J-sense of the functions for k = 6, 7, 8.
(b) If are additionally continuous for k = 1, ..., 8 and D i 's associated with them, then these are log-convex, since J-convex continuous functions are convex functions.
Other possible cases are treated similarly.
In order to define different families of functions related to exponential convexity, let I ⊆ ℝ and (c, d) ⊆ ℝ be any intervals. For distinct points u0, u1, u2 ∈ I we suppose
E1 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u1, F t ] is exponentially convex, where F t (u) = f t (u)/u}.
E2 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u0, F t ] is exponentially convex, where F t (u) = f t (u)/u and exists}.
E3 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u1, f t ] is exponentially convex}.
E4 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u0, f t ] is exponentially convex, where exists}.
E5 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u1, u2, f t ] is exponentially convex}.
E6 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u0, u2, f t ] is exponentially convex, where exists}.
E7 = {f t : I → ℝ | t ∈ (c, d) and t ↦ [u0, u0, u0, f t ] is exponentially convex, where exists}.
In this theorem, we prove the exponential convexity of the functionals associated with their respective families of functions. Also we define positive semi-definite matrices for these functionals and give some related results.
Theorem 2.6. Letbe the linear functionals defined in (M k ), associate the functionals with E i in such a way that, for k = 1, 2, 3, 4, f t ∈ E i , i = 1, 2, for k = 5, f t ∈ E i , i = 3, 4 and for k = 6, 7, 8, f t ∈ E i , i = 5, 6, 7. Then, the following statements are valid:
(a) Ifare continuous on (c, d), then the functions, are exponentially convex on (c, d).
whereis defined similarly as in (15).
Proof. (a) First, we prove exponential convexity of for k = 1, 2, 3, 4. For this, we consider the families of functions defined in E1 and E2.
where H (u) = h(u)/u and F t (u) = f t (u)/u.
Since t ↦ [u0, u1, F t ] is exponentially convex, right-hand side of the above expression is non-negative, which implies h(u)/u is an increasing function on I.
Hence is exponentially convex for k = 1, 2, 3, 4.
Now we prove exponential convexity of . For this, we consider the families of functions defined in E3 and E4. Following the same steps as above and having H (u) = h(u), we have the exponential convexity of the by using Remark 2.2.
At last, we prove exponential convexity of for k = 6, 7, 8. For this, we consider the families of functions defined in E i for i = 5, 6, 7.
Since t ↦ [u0, u1, u2, f t ] is exponentially convex therefore right-hand side of the above expression is non-negative, which implies h(u) is a strictly convex function on I.
Hence are exponentially convex for k = 6, 7, 8.
(b) It follows by Proposition 1.2.
(c) Since are positive derivable for k = 1, ..., 8 with E i 's associated with them, we have our conclusion using part (c) of the Theorem 2.5.
3 Examples
In this section, we will vary on choices of families of functions in order to construct different examples of log and exponentially convex functions and related results.
Then φ t (u)/u is strictly increasing on (0, ∞) for each t ∈ ℝ. One can note that t ↦ [u0, u0, φ t (u)/u] is log-convex for all t ∈ ℝ. If we choose f t = φ t in Theorem 2.5, we get log-convexity of the functionals for k = 1, 2, 3, 4, which have been proved in [5, 6].
Since φ t (u)/u)' = ut-2= e(t - 2) log u, the mapping t ↦ (φ t (u)/u)' is exponentially convex [7]. If we choose f t = φ t in Theorem 2.6, we get results that have been proved in [6, 8]. Also we get for t, r ≠ 1. By making substitution , t ↦ t/s, r ↦ r/s and s ≠ 0, t, r ≠ s, we get for t, r ≠ s, where is defined in [5].
Similarly, for t, r ≠ 1, and by substitution used above for t, r ≠ s, where is defined in [6].
Then, β t is strictly increasing on (0, ∞) for each t ∈ ℝ. One can note that t ↦ [u0, u0, β t ] is log-convex for all t ∈ ℝ. If we choose f t = β t in Theorem 2.5, we get log-convexity of the functional , which have been proved in [9].
Since , the mapping is exponentially convex [7]. If we choose f t = β t in Theorem 2.6, we get results that have been proved in [9]. Also we get ℭ5,4 (t, r; β t ) = H t,r (x; p; q) for t, r ≠ 0, where H t,r (x; p; q) is defined in [9].
with a convention that 0 log 0 = 0. Then δ t is convex on [0, ∞) for each t ∈ (0, ∞). One can note that t ↦ [u0, u0, u0, δ t ] is log-convex for all t ∈ (0, ∞). If we choose f t = δ t in Theorem 2.5, we get log-convexity of the functionals for k = 6, 7, 8, which have been proved in [10].
Since , the mapping is exponentially convex [7]. If we choose f t = δ t in Theorem 2.6, we get results that have been proved in [8, 10]. Also we get for t, r ≠ 1. By making substitution , t ↦ t/s, r ↦ r/s and s ≠ 0, t, r ≠ s, we get for t, r ≠ s, where is defined in [10].
Similarly, for t, r ≠ 1 and by substitution used above for t, r ≠ s, where is defined in [6].
One can note that t ↦ [u0, u0, ζ t (u)/u] is log-convex for all t ∈ (0, ∞). If we choose f t = ζ t in Theorem 2.5, we get log-convexity of the functionals for k = 1, 2, 3, 4.
Since ζ t (u)/u)' = t-u, the mapping t ↦ (ζ t (u)/u)' is exponentially convex [7]. If we choose f t = ζ t in Theorem 2.6, we get exponential convexity of the functionals for k = 1, 2, 3, 4.
where .
where .
One can note that t ↦ [u0, u0, θ t ] is log-convex for all t ∈ (0, ∞), and if we choose f t = θ t in Theorem 2.5, we get log-convexity of the functional .
Since , the mapping is exponentially convex function [7]. If we choose f t = θ t in Theorem 2.6, we get exponential convexity of the functional .
Where .
One can note that t ↦ [u0, u0, λ t (u)/u] is log-convex for all t ∈ (0, ∞). If we choose f t = λ t in Theorem 2.5, we get log-convexity of the functionals for k = 1, 2, 3, 4.
Since , the mapping t ↦ (λ t (u)/u)' is exponentially convex function [7]. If we choose f t = λ t in Theorem 2.6, we get exponential convexity of the functionals for k = 1, 2, 3, 4.
Where .
Where .
One can note that t ↦ [u0, u0, ξ t ] is log-convex for all t ∈ (0, ∞). If we choose f t = ξ t in Theorem 2.5, we get log-convexity of the functional .
Since , the mapping is exponentially convex function [7]. If we choose f t = ξ t in Theorem 2.6 we get exponential convexity of the functional .
Where .
One can note that t ↦ [u0, u0, ψ t (u)/u] is log-convex for all t ∈ ℝ. If we choose f t = ψ t in Theorem2.5, we get log-convexity of the functionals for k = 1, 2, 3, 4.
Since (ψ t (u)/u)' = e ut , the mapping t ↦ (ψ t (u)/u)' is exponentially convex function [7]. If we choose f t = ψ t in Theorem 2.6 we get exponential convexity of the functionals for k = 1, 2, 3, 4.
Where .
where .
One can note that t ↦ [u0, u0, ω t ] is log-convex for all t ∈ ℝ. If we choose f t = ω t in Theorem 2.5, we get log-convexity of the functional .
Since , the mapping is exponentially convex function [7]. If we choose f t = ω t in Theorem 2.6 we get exponential convexity of the functional .
Where .
Declarations
Acknowledgements
The authors wish to thank the anonymous referees for their very careful reading of the manuscript and fruitful comments and suggestions. This research was partially funded by Higher Education Commission, Pakistan. The research of the first author was supported by the Croatian Ministry of Science, Education and Sports under the Research Grant 117-1170889-0888.
Authors’ Affiliations
References
- Bernstein SN: Sur les fonctions absolument monotones. Acta Math 1929, 52: 1–66. 10.1007/BF02592679View ArticleGoogle Scholar
- Widder DV: The Laplace Transform. Princeton 1946, 1941.Google Scholar
- Mitrinović DS, Pečarić J, Fink AM: Classical and New Inequalities in Analysis. Kluwer, The Netherlands; 1993.View ArticleGoogle Scholar
- Pečarić J, Proschan F, Tong YL: Convex Functions, Partial Orderings and Statistical Applications, vol. 187 of Mathematics in Science and Engineering. Academic Press, Boston; 1992.Google Scholar
- Pečarić J, Ur Rehman A: On logarithmic convexity for power sums and related results. J Inequal Appl 2008, 2008: 9. Article ID 389410Google Scholar
- Pečarić J, Farid G, Ur Rehman A: On refinements of Aczél, Popoviciu, Bellmans inequalities and related results. J Inequal Appl 2010, 2010: 17. Article ID 579567Google Scholar
- Jakšetić J, Pečarić J: Exponential convexity method., in press.Google Scholar
- Anwar M, Jakšetić J, Pečarić J, Ur Rehman A: Exponential convexity, positive semi-definite matrices and fundamental inequalities. J Math Inequal 2010,4(2):171–189.MathSciNetView ArticleGoogle Scholar
- Pečarić J, Ur Rehman A: On exponentially convexity for power sums and related results. J Math Inequal (to appear)Google Scholar
- Pečarić J, Ur Rehman A: On logarithmic convexity for power sums and related results II. J Inequal Appl 2008, 2008: 12. Article ID 305623Google Scholar
Copyright
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.