Abstract
We give further improvements of the Jensen inequality and its converse on time scales, allowing also negative weights. These results generalize the Jensen inequality and its converse for both discrete and continuous cases. Further, we investigate the exponential and logarithmic convexity of the differences between the left-hand side and the right-hand side of these inequalities and present several families of functions for which these results can be applied.
1. Preliminaries
The combined dynamic derivative, also called diamond-α (⋄α) dynamic derivative (α ∈ [0,1]), was introduced as a linear convex combination of the well-known delta and nabla dynamic derivatives on time scales. By a time scale 𝕋 we mean any nonempty closed subset of real numbers. Using the delta and nabla derivatives, the notions of delta and nabla integrals were defined (see [1]). We assume, throughout this paper, that the basic notions of the time scales are well known and understood.
Definition 1 (diamond-α integral [1, Definition 3.2]). —
Let f : 𝕋 → ℝ be continuous function and let a, b ∈ 𝕋. Then, the diamond-α integral of f from a to b is defined by
(1)
Remark 2 . —
From the above definition it is clear that for α = 1 the diamond-α integral reduces to the standard delta integral and for α = 0 the diamond-α integral reduces to the standard nabla integral.
Moreover, if 𝕋 = ℝ, then
(2) if 𝕋 = ℤ, then
(3) if 𝕋 = hℤ, where h > 0, then
(4) if 𝕋 = q ℕ0, where q > 1, then
(5)
Recently, the Jensen inequality, the improvement of the Jensen inequality, and their converses are given for time scale integrals (see [2–4]).
Let 𝕋 be a time scale, and let a, b ∈ 𝕋. Then the time scale interval is denoted and defined by [a, b]𝕋 = [a, b]∩𝕋.
Theorem 3 (see [2]). —
Let c, d ∈ ℝ. If g ∈ C([a, b]𝕋, (c, d)), w ∈ C([a, b]𝕋, ℝ) with ∫a b | w(t) | ⋄α t > 0 and Φ ∈ C((c, d), ℝ) is convex, then
(6)
Note that in this Jensen inequality we have nonnegative weights. In order to give a better version of this Jensen inequality on time scales, Dinu [4] gives the definition of α-Steffensen-Popoviciu (α-SP) weight.
Definition 4 (α-SP weight [4, Definition 1]). —
Let g ∈ C(𝕋, ℝ). Then, w ∈ C(𝕋, ℝ) is an α-Steffensen-Popoviciu (α-SP) weight for g on [a, b]𝕋 if
(7) for every convex function Φ ∈ C([m, M], ℝ), where
(8)
In the following lemma he gives a characterization for α-SP weight for a nondecreasing function g on time scales.
Lemma 5 (see [4, Lemma 2]). —
Let w ∈ C(𝕋, ℝ) such that ∫a b w(t)⋄α t > 0. Then, w is an α-SP weight for a nondecreasing function g ∈ C([a, b]𝕋, ℝ) if and only if it verifies the following condition:
(9) for every s ∈ [a, b]𝕋.
If the following stronger (but more suitable) condition holds
(10) then w is also an α-SP weight for the nondecreasing continuous function g.
As given in [4], all positive weights are α-SP weights, for any continuous function g and every α ∈ [0,1]. But there are some α-SP weights that are allowed to take the negative values. The Jensen inequality on time scales, where it is allowed that the weight function takes some negative values, is given in the following theorem.
Theorem 6 (see [4, Theorem 2]). —
Let g ∈ C([a, b]𝕋, [m, M]) and let w ∈ C([a, b]𝕋, ℝ) such that ∫a b w(t)⋄α t > 0. Then, the following two statements are equivalent:
- (i)
w is an α-SP weight for g on [a, b]𝕋;
- (ii)
for every convex function Φ ∈ C([m, M], ℝ), it holds
(11)
Remark 7 . —
Let g be nondecreasing function. If 𝕋 = ℕ, then Theorem 6 is equivalent to the Jensen-Steffensen inequality given by Steffensen in [5] (see also [6, page 57]). On the other hand if we take 𝕋 = ℝ in Theorem 6, we obtain the integral version of the Jensen-Steffensen inequality given by Boas [7] (see also [6, page 59]).
Considering the converse of the Jensen inequality, Dinu [4] gives the following definition of α-Hermite-Hadamard (α-HH) weight, its characterization for a nondecreasing function g on time scales, and the improvement of the converse of the Jensen inequality for some negative weights.
Definition 8 (α-HH weight [4, Definition 2]). —
Let g ∈ C(𝕋, ℝ). Then w ∈ C(𝕋, ℝ) is an α-Hermite-Hadamard (α-HH) weight for g on [a, b]𝕋 if
(12) for every convex function Φ ∈ C([m, M], ℝ), where
(13)
Lemma 9 (see [4, Lemma 3]). —
Let w ∈ C([a, b]𝕋, ℝ) be such that ∫a b w(t)⋄α t > 0. Then w is an α-HH weight for a nondecreasing function g ∈ C([a, b]𝕋, ℝ) if and only if it verifies the following condition:
(14) for every s ∈ [a, b]𝕋.
In the next result Dinu [4] gives the connection between these two classes of weights on a time scale.
Theorem 10 (see [4, Theorem 3]). —
Let g ∈ C(𝕋, ℝ). Then every α-SP weight for g on [a, b]𝕋 is an α-HH weight for g on [a, b]𝕋, for all α ∈ [0,1].
In the following two sections of our paper we give some further generalizations of the Jensen-type inequalities on time scales allowing negative weights, and we also give the mean-value theorems of the Lagrange and Cauchy type for the functionals obtained by taking the difference of the left-hand side and right-hand side of these new inequalities. These results also generalize the results given in [8] for continuous and discrete cases. Section 4 in our paper deals with exponential convexity and logarithmic convexity of the functionals obtained in two previous sections. Finally, in Section 5 we present several families of exponentially convex functions which fulfil the conditions of our results. The results from Sections 4 and 5 generalize the results given in [9] for continuous and discrete cases.
2. Improvement of the Jensen Inequality on Time Scales
Let m, M ∈ ℝ, where m ≠ M. Consider the Green function G : [m, M]×[m, M] → ℝ defined by
| (15) |
The function G is convex and continuous with respect to both x and y.
It is well known that (see, e.g., [8–11]) any function Φ ∈ C 2([m, M], ℝ) can be represented by
| (16) |
where the function G is defined in (15). Using (16), we now derive several interesting results concerning the Jensen-type inequalities.
In the following theorem, we give the generalization of the Jensen inequality on time scales, where negative weights are also allowed.
Theorem 11 . —
Let g ∈ C([a, b]𝕋, ℝ) be such that g([a, b]𝕋)⊆[m, M]. Let w ∈ C([a, b]𝕋, ℝ) be such that ∫a b w(t)⋄α t ≠ 0 and ∫a b g(t)w(t)⋄α t/∫a b w(t)⋄α t ∈ [m, M]. Then, the following two statements are equivalent:
- (i)
for every convex function Φ ∈ C([m, M], ℝ)holds;
(17) - (ii)
for all y ∈ [m, M]holds, where G : [m, M]×[m, M] → ℝ is defined in (15).
(18) Furthermore, the statements (i) and (ii) are also equivalent if we change the sign of inequality in both (17) and (18).
Proof —
(i) ⇒ (ii): let (i) hold. As the function G(·, y) (y ∈ [m, M]) is continuous and convex, it follows that (18) holds.
(ii) ⇒ (i): let (ii) hold. Let Φ ∈ C 2([m, M], ℝ). Then by using (16) we get
(19) If the function Φ is also convex, then Φ′′(y) ≥ 0 for all y ∈ [m, M], and hence it follows that for every convex function Φ ∈ C 2([m, M], ℝ) inequality (17) holds. Moreover, it is not necessary to demand the existence of the second derivative of the function Φ (see [6, page 172]). The differentiability condition can be directly eliminated by using the fact that it is possible to approximate uniformly a continuous convex function by convex polynomials.
The last part of our theorem can be proved analogously.
Remark 12 . —
Let the conditions of Theorem 11 hold. Then the following two statements are equivalent.
- ()
For every concave function Φ ∈ C([m, M], ℝ) the reverse inequality in (17) holds.
- ()
For all y ∈ [m, M] inequality (18) holds.
Moreover, statements (i′) and (ii′) are also equivalent if we change the sign of inequality in both statements (i′) and (ii′).
Remark 13 . —
Consider (19). Suppose that g is nondecreasing and that it has the first derivative. Let m = g(a) and M = g(b), and make the substitution y = g(s). Then we get
(20) Since g is nondecreasing, we have that g′(s) ≥ 0 for all s ∈ [a, b]𝕋. If Φ ∈ C 2([m, M], ℝ) is convex, then Φ′′(g(s)) ≥ 0 for all s ∈ [a, b]𝕋. Hence, if and only if
(21) holds for all s ∈ [a, b]𝕋, then for every continuous convex function Φ inequality (17) holds.
Combining the result from Theorem 11 with Theorem 6 and Lemma 5, we get the following two corollaries.
Corollary 14 . —
Let g ∈ C([a, b]𝕋, [m, M]) and let w ∈ C([a, b]𝕋, ℝ) be such that ∫a b w(t)⋄α t > 0. Then w is an α-SP weight for g on [a, b]𝕋 if and only if
(22) holds for all y ∈ [m, M], where G is defined in (15).
Corollary 15 . —
Let g ∈ C([a, b]𝕋, [m, M]) be nondecreasing function and w ∈ C([a, b]𝕋, ℝ) such that ∫a b w(t)⋄α t > 0. Then
(23) hold for all s ∈ [a, b]𝕋, if and only if
(24) holds for all y ∈ [m, M], where G is defined in (15).
To shorten the notation, in the sequel we will use the following notation:
| (25) |
Under the assumptions of Theorem 11, we define the following functional 𝒥 1(g, Φ):
| (26) |
where the function Φ is defined on [m, M]. Clearly, if Φ is continuous and convex, then 𝒥 1(g, Φ) is nonnegative.
Theorem 16 . —
Let g ∈ C([a, b]𝕋, ℝ) and Φ ∈ C 2([m, M], ℝ). Let 𝒥 1 be defined as in (26). Then there exists ξ ∈ [m, M] such that
(27) holds, where Φ0(x) = x 2/2.
Proof —
Since the function Φ′′ is continuous and
(28) does not change its positivity on [m, M], applying the integral mean-value theorem on (19) we get that there exists ξ ∈ [m, M] such that
(29) holds. As in [12], it can be easily checked that it holds
(30) Calculating the integral on the right-hand side of (29), we get
(31) and the proof is completed.
Remark 17 . —
Theorem 16 can also be proved by using the following two convex functions:
(32) where
(33) Since ϕ 1 and ϕ 2 are continuous and convex, we have
(34) This implies that
(35) Hence, as the function Φ′′ is continuous, there exists ξ ∈ [m, M] such that (27) holds.
Theorem 18 . —
Let g ∈ C([a, b]𝕋, ℝ) and Φ, Ψ ∈ C 2([m, M], ℝ). Let 𝒥 1 be defined as in (26). Then there exists ξ ∈ [m, M] such that
(36) holds, provided that the denominator on the left-hand side of (36) is nonzero.
Proof —
Let χ be defined as the linear combination of functions Φ and Ψ by
(37) Then χ ∈ C 2([m, M], ℝ). By applying Theorem 16 on χ, it follows that there exists ξ ∈ [m, M] such that
(38) After a short calculation we get that 𝒥 1(g, χ) = 0. By hypothesis 𝒥 1(g, Φ0) ≠ 0 (otherwise, we have a contradiction with 𝒥 1(g, Ψ) ≠ 0), so it follows that
(39) which is equivalent to (36).
Remark 19 . —
In Theorem 18, if the inverse of the function Φ′′/Ψ′′ exists, then (36) gives
(40)
Remark 20 . —
Note that setting the function Ψ as Ψ(x) = x 2/2 in Theorem 18, we get the statement of Theorem 16.
As a consequence of the above two mean-value theorems, the following corollaries easily follow.
Corollary 21 . —
Let g ∈ C([a, b]𝕋, [m, M]), Φ, Ψ : [m, M] → ℝ, and let w ∈ C([a, b]𝕋, ℝ) be an α-SP weight for g. Let 𝒥 1 be defined as in (26). Then the following two statements hold.
Proof —
The statement (i) (statement (ii), resp.,) directly follows from Theorem 16 (Theorem 18, resp.,) and Corollary 14.
Corollary 22 . —
Let g ∈ C([a, b]𝕋, [m, M]) be monotone function, Φ, Ψ : [m, M] → ℝ, and w ∈ C([a, b]𝕋, ℝ) such that ∫a b w(t)⋄α t > 0. Let (9) hold for all s ∈ [a, b]𝕋. Let 𝒥 1 be defined as in (26). Then the following two statements hold.
Proof —
The statement (i) (statement (ii), resp.,) directly follows from Theorem 16 (Theorem 18, resp.,) and Corollary 15.
3. Improvement of the Converse of the Jensen Inequality on Time Scales
Using the similar method as in previous section, in the following theorem we obtain the generalization of the converse of the Jensen inequality on time scales, where negative weights are also allowed.
Theorem 23 . —
Let g ∈ C([a, b]𝕋, ℝ) be such that g([a, b]𝕋)⊆[m, M] and let c, d ∈ [m, M] (c ≠ d) be such that c ≤ g(t) ≤ d for all t ∈ [a, b]𝕋. Let w ∈ C([a, b]𝕋, ℝ) be such that ∫a b w(t)⋄α t ≠ 0. Then, the following two statements are equivalent.
- (i)
For every convex function Φ ∈ C([m, M], ℝ)holds.
(41) - (ii)
For all y ∈ [m, M]holds, where the function G : [m, M]×[m, M] → ℝ is defined in (15).
(42) Furthermore, the statements (i) and (ii) are also equivalent if we change the sign of inequality in both (41) and (42).
Proof —
The idea of the proof is very similar to the proof of Theorem 11.
(i) ⇒ (ii): let (i) hold. As the function G(·, y) (y ∈ [m, M]) is continuous and convex, it follows that (42) holds.
(ii) ⇒ (i): let (ii) hold. Let Φ ∈ C 2([m, M], ℝ). Then by using (16) we get
(43) If the function Φ is also convex, then Φ′′(y) ≥ 0 for all y ∈ [m, M], and hence it follows that for every convex function Φ ∈ C 2([m, M], ℝ) the inequality (41) holds. Moreover, it is not necessary to demand the existence of the second derivative of the function Φ (see [6, page 172]). The differentiability condition can be directly eliminated by using the fact that it is possible to approximate uniformly a continuous convex function by convex polynomials.
The last part of our theorem can be proved analogously.
Remark 24 . —
Let the conditions of Theorem 23 hold. Then the following two statements are equivalent.
- ()
For every concave function Φ ∈ C([m, M], ℝ), the reverse inequality in (41) holds.
- ()
For all y ∈ [m, M] inequality (42) holds.
Moreover, statements (i′) and (ii′) are also equivalent if we change the sign of inequality in both statements (i′) and (ii′).
Remark 25 . —
Note that in all the results in this section we allow that the mean value goes out of the interval [m, M], while in the results from the previous section we demanded that .
Setting c = m and d = M in Theorem 23, we get the following result.
Corollary 26 . —
Let g ∈ C([a, b]𝕋, ℝ) be such that g([a, b]𝕋)⊆[m, M]. Let w ∈ C([a, b]𝕋, ℝ) be such that ∫a b w(t)⋄α t ≠ 0. Then, the following two statements are equivalent.
- (i)
For every convex function Φ ∈ C([m, M], ℝ)holds.
(44) - (ii)
For all y ∈ [m, M]holds, where the function G : [m, M]×[m, M] → ℝ is defined as in (15).
(45) Furthermore, statements (i) and (ii) are also equivalent if we change the sign of inequality in both (44) and (45).
Remark 27 . —
As a consequence of Corollary 26, we get the result from Lemma 9.
Let c = m and d = M. Then (43) transforms into
(46) Let ∫a b w(t)⋄α t > 0, and suppose that g is nondecreasing and that it has the first derivative. Now, similarly as in [4], we derive the result from Lemma 9. Let m = g(a) and M = g(b), and make the substitution y = g(s). Then we get
(47) Since g is nondecreasing, we have that g′(s) ≥ 0 for all s ∈ [a, b]𝕋. If Φ ∈ C 2([m, M], ℝ) is convex, then Φ′′(g(s)) ≥ 0 for all s ∈ [a, b]𝕋. Hence, if and only if
(48) holds for all s ∈ [a, b]𝕋, then for every continuous convex function Φ inequality (44) holds. Note that (48) is equivalent to condition (14).
Corollary 28 . —
Let g ∈ C([a, b]𝕋, [m, M]) and let w ∈ C([a, b]𝕋, ℝ) be an α-SP weight for g on [a, b]𝕋. Then
(49) holds for all y ∈ [m, M].
Proof —
The proof follows directly from Theorem 10 and Corollary 26.
Under the assumptions of Theorem 23, we define the following functional 𝒥 2(g, Φ):
| (50) |
where the function Φ is defined on [m, M]. Clearly, if Φ is continuous and convex, then 𝒥 2(g, Φ) is nonnegative.
Theorem 29 . —
Let g ∈ C([a, b]𝕋, ℝ) and Φ ∈ C 2([m, M], ℝ). Let 𝒥 2 be defined as in (50). Then there exists ξ ∈ [m, M] such that
(51) holds, where Φ0(x) = x 2/2.
Proof —
The idea of the proof is very similar to the proof of Theorem 16.
Since the function Φ′′ is continuous and
(52) does not change its positivity on [m, M], applying the integral mean-value theorem on (43) we get that there exists ξ ∈ [m, M] such that
(53) Calculating the integral on the right-hand side of (53), we get
(54) and we get statement (51) of our theorem.
Remark 30 . —
Note that (54) can also be expressed as
(55)
Theorem 31 . —
Let g ∈ C([a, b]𝕋, ℝ) and Φ, Ψ ∈ C 2([m, M], ℝ). Let 𝒥 2 be defined as in (50). Then there exists ξ ∈ [m, M] such that
(56) holds, provided that the denominator on the left-hand side of (56) is nonzero.
Proof —
The proof is very similar to the proof of Theorem 18.
4. Exponential and Logarithmic Convexity
First we recall some definitions and facts about exponentially convex and logarithmically convex functions (see, e.g., [13, 14] or [9]) which we need for our results.
Definition 32 . —
A function f : I → ℝ(I⊆ℝ) is n-exponentially convex in the Jensen sense on I, if
(57) holds for all choices ξ i ∈ ℝ and x i ∈ I, i = 1,…, n.
A function f : I → ℝ is n-exponentially convex if it is n-exponentially convex in the Jensen sense and continuous on I.
Remark 33 . —
It is clear from the definition that 1-exponentially convex functions in the Jensen sense are in fact nonnegative functions. Also, n-exponentially convex functions in the Jensen sense are k-exponentially convex in the Jensen sense for every k ∈ ℕ, k ≤ n.
By definition of positive semidefinite matrices and some basic linear algebra, we have the following proposition.
Proposition 34 . —
If f is an n-exponentially convex function in the Jensen sense, then the matrix [f((x i + x j)/2)]i,j=1 k is positive, semidefinite for all k ∈ ℕ, k ≤ n. Particularly, det[f((x i + x j)/2)]i,j=1 k ≥ 0 for all k ∈ ℕ, k ≤ n.
Definition 35 . —
A function f : I → ℝ is exponentially convex in the Jensen sense on I, if it is n-exponentially convex in the Jensen sense for all n ∈ ℕ.
A function f : I → ℝ is exponentially convex if it is exponentially convex in the Jensen sense and continuous.
Remark 36 . —
Some examples of exponentially convex functions are (see [15]) as follows:
- (i)
f : I → ℝ defined by f(x) = ce kx, where c ≥ 0 and k ∈ ℝ;
- (ii)
f : ℝ + → ℝ defined by f(x) = x −k, where k > 0;
- (iii)
f : ℝ + → ℝ + defined by , where k > 0.
Remark 37 . —
It is known (and easy to show) that f : I → ℝ + is log-convex in the Jensen sense on I, if and only if
(58) holds for every ρ, σ ∈ ℝ and x, y ∈ I. It follows that a positive function is log-convex in the Jensen sense if and only if it is 2-exponentially convex in the Jensen sense. Also, using basic convexity theory, it follows that a positive function is log-convex if and only if it is 2-exponentially convex.
The following lemma is equivalent to the definition of convex function (see [6, page 2]).
Lemma 38 . —
If x 1, x 2, x 3 ∈ I are such that x 1 < x 2 < x 3, then the function f : I → ℝ is convex if and only if the following inequality holds:
(59)
We will also need the following result (see, e.g., [6]).
Proposition 39 . —
If f : I → ℝ is a convex function and x 1, x 2, y 1, y 2 ∈ I are such that x 1 ≤ y 1, x 2 ≤ y 2, x 1 ≠ x 2, and y 1 ≠ y 2, then the following inequality is valid:
(60)
When dealing with functions with different degree of smoothness, divided differences are found to be very useful.
Definition 40 . —
The second order divided difference of a function f : I → ℝ at mutually different points x 0, x 1, x 2 ∈ I is defined recursively by
(61)
Remark 41 . —
The value [x 0, x 1, x 2; f] is independent of the order of the points x 0, x 1, and x 2. This definition may be extended to include the case in which some or all the points coincide (see [6, page 16]). Namely, taking the limit x 1 → x 0 in (61), we obtain
(62) provided that f′ exists, and furthermore, taking the limits x i → x 0, i = 1,2, in (61), we obtain
(63) provided that f′′ exists.
A function f : I → ℝ is convex if and only if for every choice of three mutually different points x 0, x 1, x 2 ∈ I[x 0, x 1, x 2; f] ≥ 0 holds.
Now, we use an idea from [15] to give an elegant method of producing an n-exponentially convex and exponentially convex functions applying the functionals 𝒥 1 and 𝒥 2 on a given family of functions with the same property.
Theorem 42 . —
Let 𝒥 i, i = 1,2, be linear functionals defined in (26) and (50), respectively. Let Ω = {Φρ : ρ ∈ J}, where J is an interval in ℝ, be a family of functions Φρ ∈ C([m, M], ℝ) such that the function ρ ↦ [x 0, x 1, x 2; Φρ] is n-exponentially convex in the Jensen sense on J for every choice of three mutually different points x 0, x 1, x 2 ∈ [m, M]. Then ρ ↦ 𝒥 i(g, Φρ) is an n-exponentially convex function in the Jensen sense on J. If the function ρ ↦ 𝒥 i(g, Φρ) is also continuous on J, then it is n-exponentially convex on J.
Proof —
Define the function ν : I → ℝ by
(64) where ξ j, ξ k ∈ ℝ, r j, r k ∈ J, 1 ≤ j, k ≤ n, r jk = (r j + r k)/2, and Φrjk ∈ Ω. Using the assumption that for every choice of three mutually different points x 0, x 1, x 2 ∈ [m, M]ρ ↦ [x 0, x 1, x 2; Φρ] is n-exponentially convex in the Jensen sense on J, we obtain
(65) Therefore, ν is convex (and continuous) function on I. Hence 𝒥 i(g, ν) ≥ 0, i = 1,2, which implies that
(66) We conclude that the function ρ ↦ 𝒥 i(g, Φρ) is n-exponentially convex on J in the Jensen sense.
If ρ ↦ 𝒥 i(g, Φρ) is continuous on J, then ρ ↦ 𝒥 i(g, Φρ) is n-exponentially convex by definition.
The following corollary is an immediate consequence of Theorem 42.
Corollary 43 . —
Let 𝒥 i, i = 1,2, be linear functionals defined in (26) and (50), respectively. Let Ω = {Φρ : ρ ∈ J}, where J is an interval in ℝ, be a family of functions Φρ ∈ C([m, M], ℝ) such that the function ρ ↦ [x 0, x 1, x 2; Φρ] is exponentially convex in the Jensen sense on J for every choice of three mutually different points x 0, x 1, x 2 ∈ [m, M]. Then ρ ↦ 𝒥 i(g, Φρ) is an exponentially convex function in the Jensen sense on J. If the function ρ ↦ 𝒥 i(g, Φρ) is also continuous on J, then it is exponentially convex on J.
Corollary 44 . —
Let 𝒥 i, i = 1,2, be linear functionals defined in (26) and (50), respectively. Let Ω = {Φρ : ρ ∈ J}, where J is an interval in ℝ, be a family of functions Φρ ∈ C([m, M], ℝ) such that the function ρ ↦ [x 0, x 1, x 2; Φρ] is 2-exponentially convex in the Jensen sense on J for every choice of three mutually different points x 0, x 1, x 2 ∈ [m, M]. Then, the following statements hold.
- (i)
ρ ↦ 𝒥 i(g, Φρ) is a 2-exponentially convex function in the Jensen sense on J.
- (ii)
If ρ ↦ 𝒥 i(g, Φρ) is continuous on J, then it is also 2-exponentially convex on J. If ρ ↦ 𝒥 i(g, Φρ) is additionally strictly positive, then it is also log-convex on J, and for r, s, t ∈ J such that r < s < t, we have
(67) - (iii)
If ρ ↦ 𝒥 i(g, Φρ) is strictly positive and differentiable function on J, then for every p, q, u, v ∈ J such that p ≤ u, q ≤ v, we havewhere
(68) for Φp, Φq ∈ Ω.
(69)
Proof —
(i) and the first part of (ii) are immediate consequences of Theorem 42. If ρ ↦ 𝒥 i(g, Φρ) is continuous and strictly positive, its log-convexity is an immediate consequence of Remark 37. Now applying Lemma 38 on the function f(x) = log𝒥 i(g, Φx) and r, s, t ∈ J (r < s < t), we get
(70) which is equivalent to inequality (67).
To prove (iii), let ρ ↦ 𝒥 i(g, Φρ) be strictly positive and differentiable and therefore continuous too. By (ii), the function ρ ↦ 𝒥 i(g, Φρ) is log-convex on J; that is, the function ρ ↦ log𝒥 i(g, Φρ) is convex on J, and by Proposition 39 we obtain
(71) for p ≤ u, q ≤ v, p ≠ q, and u ≠ v, concluding that
(72) The cases p = q and u = v follow from (71) as limit cases.
Remark 45 . —
Note that the results from Theorem 42, Corollary 43, and Corollary 44 still hold when two of the points x 0, x 1, x 2 ∈ [m, M] coincide, for a family of differentiable functions Φρ such that the function ρ ↦ [x 0, x 1, x 2; Φρ] is n-exponentially convex in the Jensen sense (exponentially convex in the Jensen sense and log-convex in the Jensen sense), and furthermore, they still hold when all three points coincide for a family of twice differentiable functions with the same property. The proofs are obtained by recalling Remark 41 and suitable characterization of convexity.
5. Examples
In this section we will vary on choice of a family Ω = {Φρ : ρ ∈ J} in order to construct different examples of exponentially convex functions and construct some means.
Example 46 . —
Consider a family of functions
(73) defined by
(74) It is (d 2/dx 2)κ ρ(x) = e ρx > 0 which shows that κ ρ is convex on ℝ for every ρ ∈ ℝ. From Remark 36, it follows that ρ ↦ (d 2/dx 2)κ ρ(x) is exponentially convex. Therefore, ρ ↦ [x 0, x 1, x 2; κ ρ] is exponentially convex (see [15]) (and so exponentially convex in the Jensen sense). Now using Corollary 43 we conclude that ρ ↦ 𝒥 i(g, κ ρ), (i = 1,2) are exponentially convex in the Jensen sense. It is easy to verify that these mappings are continuous, so they are exponentially convex.
For this family of functions, ℳ p,q(g, 𝒥 i, Ω) from (69) becomes
(75) and using (68) we have that it is monotonous in parameters p and q.
If 𝒥 i (i = 1,2) are positive, using Theorems 18 and 31 applied for Φ = κ p ∈ Ω 1 and Ψ = κ q ∈ Ω 1, it follows that
(76) satisfy ℵ p,q(g, 𝒥 i, Ω 1)∈[m, M]. If we set g([a, b]𝕋) = [m, M] then we have that ℵ p,q(g, 𝒥 i, Ω 1) are means (of the function g). Note that by (68) they are monotonous means.
Example 47 . —
Consider a family of functions
(77) defined by
(78) It is (d 2/dx 2)β ρ(x) = x ρ−2 = e (ρ−2)logx > 0, which shows that β ρ is convex function for x > 0. Also, from Remark 36 it follows that ρ ↦ (d 2/dx 2)β ρ(x) is exponentially convex. Therefore ρ ↦ [x 0, x 1, x 2; β ρ] is exponentially convex (and so exponentially convex in the Jensen sense). Here we assume that [m, M]⊂(0, ∞), so our family Ω 2 of β ρ fulfills the conditions of Corollary 43. In this case ℳ p,q(g, 𝒥 i, Ω) from (69) becomes
(79) If 𝒥 i (i = 1,2) are positive, by applying Theorems 18 and 31 for Φ = β p ∈ Ω 2 and Ψ = β q ∈ Ω 2, it follows that for i = 1,2 there exist ξ i ∈ [m, M] such that
(80) Since the function ξ i ↦ ξ i p−q is invertible for p ≠ q, we have
(81) Also, ℳ p,q(g, 𝒥 i, Ω 2) is continuous, symmetric, and monotonous (by (68)). If we set g([a, b]𝕋) = [m, M], then we have that
(82) which shows that ℳ p,q(g, 𝒥 i, Ω 2) are means (of the function g).
Now we impose one additional parameter r in case g([a, b]𝕋) = [m, M]. For r ≠ 0 by substituting g ↦ g r, p ↦ p/r, and q ↦ q/r in (82), we get
(83) We define new generalized means as follows:
(84) These new generalized means are also monotonic.
Example 48 . —
Consider a family of functions
(85) defined by
(86) It is (d 2/dx 2)γ ρ(x) = ρ −x > 0, which shows that γ ρ is convex function for ρ > 0. Also, from Remark 36 it follows that ρ ↦ (d 2/dx 2)γ ρ(x) is exponentially convex. Therefore ρ ↦ [x 0, x 1, x 2; γ ρ] is exponentially convex (and so exponentially convex in the Jensen sense). Here we assume that [m, M]⊂(0, ∞), so our family Ω 3 of γ ρ fulfills the conditions of Corollary 43. In this case ℳ p,q(g, 𝒥 i, Ω) from (69) becomes
(87) and by (68) it is monotonous function in parameters p and q.
If 𝒥 i (i = 1,2) are positive, using Theorems 18 and 31 applied for Φ = γ p ∈ Ω 3 and Ψ = γ q ∈ Ω 3, it follows that
(88) satisfies ℵ p,q(g, 𝒥 i, Ω 3)∈[m, M]. Here L(p, q) is the logarithmic mean defined by L(p, q) = (p − q)/(logp − logq) for p ≠ q, L(p, p) = p.
Example 49 . —
Consider a family of functions
(89) defined by
(90) It is , which shows that δ ρ is convex function for ρ > 0. Also, from Remark 36 it follows that ρ ↦ (d 2/dx 2)δ ρ(x) is exponentially convex. Therefore ρ ↦ [x 0, x 1, x 2; δ ρ] is exponentially convex (and so exponentially convex in the Jensen sense). Here we assume that [m, M]⊂(0, ∞), so our family Ω 4 of δ ρ fulfills the conditions of Corollary 43. In this case ℳ p,q(g, 𝒥 i, Ω) from (69) becomes
(91) and it is monotonous function in parameters p and q by (68).
If 𝒥 i (i = 1,2) are positive, using Theorems 18 and 31 applied for Φ = δ p ∈ Ω 4 and Ψ = δ q ∈ Ω 4, it follows that
(92) satisfies ℵ p,q(g, 𝒥 i, Ω 4)∈[m, M].
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
References
- 1.Sheng Q., Fadag M., Henderson J., Davis J. M. An exploration of combined dynamic derivatives on time scales and their applications. Nonlinear Analysis: Real World Applications. 2006;7(3):395–413. doi: 10.1016/j.nonrwa.2005.03.008. [DOI] [Google Scholar]
- 2.Ammi M. R. S., Ferreira R. A. C., Torres D. F. M. Diamond-α Jensen's inequality on time scales. Journal of Inequalities and Applications. 2008;2008:13. doi: 10.1155/2008/576876.576876 [DOI] [Google Scholar]
- 3.Anwar M., Bibi R., Bohner M., Pečarić J. Integral inequalities on time scales via the theory of isotonic linear functionals. Abstract and Applied Analysis. 2011;2011:16. doi: 10.1155/2011/483595.483595 [DOI] [Google Scholar]
- 4.Dinu C. A weighted Hermite Hadamard inequality for Steffensen-Popoviciu and Hermite-Hadamard weights on time scales. Analele Ştiinţifice ale Universităţii “Ovidius” Constanţa. Seria: Matematică. 2009;17(1):77–90. [Google Scholar]
- 5.Steffensen J. F. On certain inequalities and methods of approximation. Journal of the Institute of Actuaries. 1919;51:274–297.. [Google Scholar]
- 6.Pečarić J. E., Proschan F., Tong Y. L. Convex Functions, Partial Orderings, and Statistical Applications. Vol. 187. Boston, Mass, USA: Academic Press; 1992. (Mathematics in Science and Engineering). [Google Scholar]
- 7.Boas, R. P., Jr. The Jensen-Steffensen inequality. Univerzitet u Beogradu. Publikacije Elektrotehničkog Fakulteta. Serija Matematika i Fizika. 1970;(302–319):1–8. [Google Scholar]
- 8.Pečarić J., Perić I., Rodić Lipanović M. Uniform treatment of Jensen type inequalities. Mathematical Reports. 2014;16(66)(2) [Google Scholar]
- 9.Khan A. R., Pečarić J., Rodić Lipanović M. n-exponential convexity for Jensen-type inequalities. Journal of Mathematical Inequalities. 2013;7(3):313–335. doi: 10.7153/jmi-07-29. [DOI] [Google Scholar]
- 10.Niculescu C. P., Persson L.-E. Convex Functions and Their Applications: A Contemporary Aproach. Vol. 23. New York, NY, USA: Springer; 2006. p. p. xvi+255. (CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC). [Google Scholar]
- 11.Widder D. V. Completely convex functions and Lidstone series. Transactions of the American Mathematical Society. 1942;51:387–398. doi: 10.1090/S0002-9947-1942-0006356-4. [DOI] [Google Scholar]
- 12.Franjić I., Khalid S., Pečarić J. On the refinements of Jensen-Steffensen inequalities. Journal of Inequalities and Applications. 2011;2011, article 12:11. doi: 10.1186/1029-242X-2011-12. [DOI] [Google Scholar]
- 13.Klaričić Bakula M., Pečarić J., Perić J. Extensions of the Hermite-Hadamard inequality with applications. Mathematical Inequalities & Applications. 2012;15(4):899–921. doi: 10.7153/mia-15-77. [DOI] [Google Scholar]
- 14.Pečarić J., Perić J. Improvements of the Giaccardi and the Petrović inequality and related Stolarsky type means. Analele Universităţii din Craiova. Seria Matematică Informatică. 2012;39(1):65–75. [Google Scholar]
- 15.Jakšetić J., Pečarić J. Exponential Convexity Method. Journal of Convex Analysis. 2013;20(1):181–197. [Google Scholar]
