1. Introduction
First papers about convex functions date from the end of the nineteenth century, but the real meaning of the convex functions has been developed with the works of the Danish mathematician J. L. W. V. Jensen (1859–1925) from 1905 and 1906 [
1], and his famous inequality. In the many years after that, the Jensen inequality was considered under the weakened conditions, further improved, generalized, refined, reversed, etc., and it has been (and it is still) a constant inspiration for further investigation. By weakening of the conditions of the Jensen inequality, the Jensen-Stefensen inequality was derived. H. D. Brunk generalized it further in [
2] and this result is known as the Jensen-Brunk inequality. Another generalization is the Jensen-Boas inequality (see [
3]). These and many more results can be found in [
4], an excellent book about convex functions. Also, many other famous inequalities are derived using the Jensen inequality, like the Cauchy inequality, the Hölder inequality, the Young inequality, inequalities between means, to name just a few. The applications of all of these inequalities are widely spread in different mathematical areas and so the influence and importance of the Jensen inequality are immeasurable. An interested reader can examine several old and brand new papers which use this inequality (for example [
5,
6,
7,
8,
9,
10,
11,
12,
13]).
Though, the results that consider the Jensen inequality, its variants, reverses, converses, and refinements, consider the case when the measure is positive. Therefore it is of great interest to get the results where it is allowed that the measure can also be negative. In order to do that, we used the following set of the Green functions
(
;
) defined by
These functions have certain nice properties. Due to them, we already got some new results for the inequalities of the Jensen-type and the inequalities of the converse Jensen-type (see for example [
14,
15]) and there are more to come.
Taking into account the properties of the functions
(
), and motivated by the results from S. S. Dragomir in [
16,
17] with reverses of the Jensen inequality in the case when the measure is positive, here in this paper we will give the generalization of some of his results on the Jensen-type inequalities and the converse Jensen-type inequalities, but now allowing that the measure can also be negative. The results that are presented here, represent the continuation of the research presented in [
18,
19].
This paper is structured in the following way. After this introduction, the section with the main results follows. There are given three theorems where the Jensen-type (or converse Jensen-type) inequality for the continuous convex function is connected to the similar inequality for the Green function (). In the next, third, section these theorems are then used to define new Lagrange and Cauchy type mean-value theorems, again connecting our function with the Green functions (). The fourth section presents applications of our results in the direction of constructing exponentially convex functions and deriving new Cauchy means.
2. Main Results
As we already mentioned in the introduction, the functions
(
) have some interesting and very useful properties, and they will also be very important for deriving our results in this paper. It is not difficult to see that for every fixed value
our functions
(
) are continuous and convex on
. Furthermore, every function
such that
can be expressed using these functions
(
) as follows:
These representations can be easily proved after a short calculation by integrating by parts, but the interested reader can also consult [
14] (Lemma 1.1).
We will now give our main results, and for the sake of the clearer notation we will use
To begin with, we give an improvement of the Jensen inequality.
Theorem 1. Let be a continuous function and let . Suppose is a continuous function or a function of bounded variation where and let . For every continuous convex function holdsif and only if for every holdswhere the functions are defined in (
1)–(
4).
Moreover, this equivalence holds also in the case if we reverse the inequality sign in both (
9) and (
10).
Proof. Let for every continuous convex function
inequality (
9) hold. As the functions
(
,
) are continuous and convex on
for every
, the inequality (
9) holds also for them. That is: it holds (
10).
Let us now prove the other implication. We will first prove it in the case when
. Suppose that for every
inequality (
10) holds. In the case when
we can use the representations (
5)–(
8), and we have
After some calculation, for every function
we obtain the following relation
If
is convex function, then for every
we have that
. Further, if for every
holds (
10), then the term in the square brackets in (
15) is less then or equal to zero. That means that the left hand side of (
15) also has to be less then or equal to zero, which means that for every continuous convex function
, such that
, holds inequality (
9). After all, also notice that the existence of the second derivative of the function
is not necessary, because it is possible to uniformly approximate a continuous convex function by convex polynomials (see also [
4], p. 172).
We will skip the proof of the last sentence of our theorem since it can be conducted in the same way. □
Remark 1. Note that the condition assures that the one sided derivatives are finite. If and are finite, then we can also allow that can be the whole interval .
Remark 2. The previous theorem considers the case when the function ϕ is convex. Concluding in a similar way, we can also get the results that hold for concave function. Under the conditions of the previous theorem, we have the following.
For every continuous concave function holds (
9)
if and only if for every holds (
10)
with reversed inequality sign. Also, for every continuous concave function holds (
9)
with reversed inequality sign if and only if for every holds (
10).
Our next theorem states a similar result for the converse Jensen inequality, in the literature also known as the Lah-Ribarič or Edmundson-Lah-Ribarič inequality.
Theorem 2. Let be a continuous function and let . Suppose that is a continuous function or a function of bounded variation where . For every continuous convex function holdsif and only if for every holdswhere the functions are defined in (
1)–(
4).
Moreover, this equivalence holds also in the case if we reverse the inequality sign in both (
16)
and (
17).
Proof. We can carry out this proof in the same way as the previous one.
Let for every continuous convex function
inequality (
16) hold. As the functions
(
) are continuous and convex on
for every
, the inequality (
16) also holds for them, i.e., (
17) holds.
We prove now the other implication, and we do that first in the case when
. Suppose that for every
holds (
17). When
, using the representations (
5)–(
8) and relations (
11)–(
14), after some calculation for every function
we obtain
If
is convex function, then for every
we have that
. Further, if for every
holds (
17), then the term in the square brackets in (
18) is less then or equal to zero. This leads to conclusion that also the left hand side of (
18) has to be less than or equal to zero, i.e., that for every contionuos convex function
, such that
, holds (
16).
As in the proof of Theorem 1, the same remark about the differentiability condition here also holds. And the comment about proving the last sentence of this theorem holds also here. □
Remark 3. Note that here we don’t need the condition that .
Remark 4. Also, in this case, concluding in a similar way, we can get the results that hold for the concave function. Under the conditions of the previous theorem, we have the following.
For every continuous concave function holds (
16)
if and only if for every holds (
17)
with reversed inequality sign. Also, for every continuous concave function holds (
16)
with reversed inequality sign if and only if for every holds (
17).
In our third theorem we have again an improvement of the Jensen inequality, but now without derivatives.
Theorem 3. Let be a continuous function and let . Suppose that is a continuous function or a function of bounded variation where and let . For every continuous convex function holdsif and only if for every holdswhere the functions are defined in (
1)–(
4).
Moreover, this equivalence holds also in the case if we reverse the inequality sign in both (
19)
and (
20).
Proof. This proof goes similarly to the previous two. The first implication is obvious.
In order to prove the other implication, we prove it first when
. Suppose that for every
holds (
20). When
, using the representations (
5)–(
8) we obtain
If
is convex, then for every
we have that
, and if for every
holds (
20), we conclude again that for every continuous convex function
, such that
, holds (
19). As already explained in the previous proofs, also in this case the existence of
is not necessary.
The proof of the last sentence of this theorem is analogous. □
Remark 5. Under the conditions of the previous theorem, we have the following.
For every continuous concave function holds (
19)
if and only if for every holds (
20)
with reversed inequality sign. Also, for every continuous concave function holds (
19)
with reversed inequality sign if and only if for every holds (
20).
3. Mean-Value Theorems
Let
be a continuous function,
, and suppose that
is a continuous function or a function of bounded variation with
. The previous three theorems and inequalities (
9), (
16) and (
19) offer us the possibility of formulating new Lagrange-type and Cauchy-type mean value theorems, and these mean value theorems can give us a possibility to derive some new means.
Firstly, for easier notation and formulation of these results, for functions
g and
and for continuous convex function
, we will define three functionals by subtraction of the right-hand from the left-hand side of inequalities (
9), (
16) and (
19):
with a remark that for
and
the value of
has to be in
.
From Theorems 1–3 we obtain that:
if for any
we have that for every
holds (
10), and
if for any
we have that for every
holds (
10) with reversed inequality sign;
if for any
we have that for every
holds (
17), and
if for any
we have that for every
holds (
17) with reversed inequality sign;
if for any
we have that for every
holds (
20), and
if for any
we have that for every
holds (
20) with reversed inequality sign.
For each of these functionals we will now derive the Lagrange-type mean value theorem and after that also Cauchy-type mean value theorem.
Theorem 4. Let be a continuous function, , and let be such that . Suppose that is a continuous function or a function of bounded variation where and let .
If for any for every holds (
10)
or if for any for every holds (
10)
with reversed inequality sign, then there exists such thatwhere . Proof. Suppose that for some
for every
holds inequality (
10), or holds (
10) with reversed inequality sign, i.e., that for that
the term
retains the same sign on the whole
.
As for
the relation (
15) is valid, we can apply the integral mean-value theorem on it, and obtain that for that
there exists
such that
Now we have to calculate the integral on the right side. Suppose that
. We have that
and
Calculating the right side of (
21) we obtain
what proves the statement of our theorem.
For other
p we proceed the same way. For
we have that
and
for
and
for
and
In all these cases direct calculation brings us to the same conclusion which proves our theorem. □
In the next two theorems we have the Lagrange mean-value theorems for the functionals and . We give these results here without the proofs as these proofs are conducted analogously.
Theorem 5. Let be a continuous function, , and let be such that . Suppose that is a continuous function or a function of bounded variation where .
If for any for every holds (
17)
or if for any for every holds (
17)
with reversed inequality sign, then there exists such thatwhere . Theorem 6. Let be a continuous function, , and let be such that . Suppose that is a continuous function or a function of bounded variation where and let .
If for any for every holds (
20)
or if for any for every holds (
20)
with reversed inequality sign, then there exists such thatwhere . The Cauchy-type mean value theorem for all three functionals , , is given in the following result.
Theorem 7. Let be a continuous function, , and let be such that . Suppose that is a continuous function or a function of bounded variation where .
If for any for every holds (
10)
or if for any for every holds (
10)
with reversed inequality sign, then there exists such thatunder condition that the denominator of the fraction on the left side is not equal to zero, and assuming that . If for any for every holds (
17)
or if for any for every holds (
17)
with reversed inequality sign, then there exists such thatunder condition that the denominator of the fraction on the left side is not equal to zero. If for any for every holds (
20)
or if for any for every holds (
20)
with reversed inequality sign, then there exists such thatunder condition that the denominator of the fraction on the left side is not equal to zero, and assuming that . Proof. We will prove this theorem only for the functional , as the other cases can be proved analogously.
Let us define the function
as follows:
On this new function we can also apply Theorem 4, because it is the linear combination of the functions
and
. After short calculation we obtain that there exists
such that
where
. The term
has to be different from zero, because, otherwise, we would have a contradiction with the condition that the denominator of the left side is not equal to zero, and consequently, we get the statement of our theorem. □
Remark 6. If our functions ϕ and ψ are such that there exists the inverse function of , then we havewhat brings us to new Cauchy means. 4. Applications
In order to round off this paper, we would like to present some applications. When we speak about the mean-value theorems it is somehow most natural to derive some means. In order to get the Cauchy-type means with certain nice properties, we will use the method from the paper [
20], which will firstly help us to define some new exponentially convex functions, and then to define the new means.
At the very beginning of this section, before stating our results, we have to recall some of the very basic definitions and facts about exponential convexity. Throughout this section, with I we will denote an open interval in .
Definition 1. A function is n—exponentially convex in the Jensen sense on I iffor all and , . A function is n—exponentially convex if it is n—exponentially convex in the Jensen sense and continuous on I. Remark 7. Note that 1—exponentially convex functions in the Jensen sense are non-negative functions, as we can see from the definition. Further, n—exponentially convex functions in the Jensen sense are k—exponentially convex in the Jensen sense for every , .
Definition 2. A function is exponentially convex in the Jensen sense on I, if it is n—exponentially convex in the Jensen sense for all . A function is exponentially convex if it is exponentially convex in the Jensen sense and continuous.
Remark 8. Here we mention also some examples of exponentially convex functions from [20], as we will need them in the process of constructing our means: - (i)
defined by , where and .
- (ii)
defined by , where .
- (iii)
defined by , where .
Remark 9. A positive function is log-convex in the Jensen sense on I if and only if it is 2—exponentially convex in the Jensen sense on I, i.e., if and only if for every and holds If such function is also continuous on I, it follows that it is log-convex on I.
We also recall the following two lemmas from [
4], p. 2.
Lemma 1. If are such that , then the function is convex if and only if Lemma 2. If is a convex function and are such that , then We have to recall also the definition of the divided difference of the second order.
Definition 3. The divided difference of the second order of a function at mutually different points is defined recursively by Remark 10. The value is independent of the order of the points and . Also, we can extended this definition to include the case when some or all of the points are equal ([4], p. 14). Taking the limit in (
22)
, we obtainassuming that exists. Further, taking the limits in (
22)
, we obtainassuming that exists. A function is convex if and only if for every choice of three mutually different points holds .
Now, we can start with our results. We will take s certain family of functions, then apply our functionals to it, and in this way, we will construct n—exponentially convex and exponentially convex functions.
Before we proceed, using the functionals
we will define three new functionals to assure that the functionals we use in this process are always non-negative, whenever they are defined. For continuous function
with
, a continuous function or a function of bounded variation
with
, and continuous convex function
, we are now defining new functionals
by:
It is now
always when these functionals are defined.
Theorem 8. Let be a family of functions where , such that for every three mutually different points the function is n—exponentially convex in the Jensen sense on I. Then the functions are also n—exponentially convex in the Jensen sense on I. If the function is also continuous on I, then it is n—exponentially convex on I.
Proof. Let us define the function
by
where
,
,
, for
. As the linear combination of continuous functions from the set
, this function is also continuous on
. The fact that the mapping
is
n—exponentially convex in the Jensen sense on
I implies that
for every three mutually different points
, and this means that also our function
is convex on
. This implies
and therefore
which means that
are n—exponentially convex in the Jensen sense on
I.
If is additionally also continuous on I, then it is n-exponentially convex by definition. □
As an immediate consequence of this theorem, we have the following corollary.
Corollary 1. Let be a family of functions where , such that for every three mutually different points the function is exponentially convex in the Jensen sense on I. Then the functions are also exponentially convex in the Jensen sense on I. If the function is also continuous on I, then it is exponentially convex on I.
We also have the following corollary.
Corollary 2. Let be a family of functions where , such that for every three mutually different points the function is 2—exponentially convex in the Jensen sense on I.
If the function is continuous on I, then it is 2—exponentially convex on I. Further, if is also strictly positive, then it is also log-convex on I, and it holds for such that .
If the function is strictly positive and differentiable on I, then it holds for every such that and , where for .
Proof. From Theorem 8 we get that the first sentence is valid, and the log-convexity follows from Remark 9. We still have to prove (
25). We have that the function
is strictly positive, and we can apply Lemma 1 on the function
. We have that
for
(
) and therefore inequality (
23) holds.
From
we have that the function
is log-convex on
I, and that means that the function
is convex on
I. Applying Lemma 2 we get
where
,
,
,
.
We get the cases
and
as limit cases from (
26). □
Remark 11. When two or all of the points are equal, the results from Theorem 8, Corollaries 1 and 2 are also valid. The proofs for that can be obtained using Remark 10 and adequate characterization of convexity.
Now we will look at some families of functions that fulfill the assumptions of Theorem 8, Corollaries 1 and 2, and using them we will get some Cauchy-type means.
Example 1. Let us define a family of functionsby It is for , and so for every the function is convex on . Remark 8
gives us that is exponentially convex, and from [20] we also have that is exponentially convex and therefore exponentially convex in the Jensen sense. That means that the family of functions fulfills the assumptions from Corollary 1,
and therefore we have that for functions are exponentially convex in the Jensen sense. Although is not continuous at , these functions are continuous, and it follows that they are exponentially convex. Applying Corollary 2
on , we obtainand from (
24)
we conclude that they are monotone in parameters u and v. Using the Cauchy-type theorem from Section 3, applied for and , we get that forholds If we set that , we get thatwhich means that then are means of the function g. From (
24)
we have that are also monotone. Example 2. Let us define a family of functionsby We have that , and so for every the function is convex for . From Remark 8
we have that is exponentially convex, and from [20] we have that is exponentially convex and therefore exponentially convex in the Jensen sense. This means that fulfills the assumptions from Corollary 1.
Now we will assume that from Corollaries 1
and 2
is a subset of , and we obtain that As in the previous example, we have that functions () are exponentially convex, and that are monotone.
Using the Cauchy-type theorem from Section 3, applied for and we have that there existsuch that As is invertible for , in that case we obtain As before, if we set , we getand that shows us that then are means of function g. We can also add here one additional parameter, we will denote it by r. In that case, for we use the substitution , and in (
27)
, and we obtain We can define new generalized mean by Such means are also monotone. Namely, for such that , we haveasfor , such that , and because for are monotone in both parameters. The result when can be derived by taking the limit . Example 3. Let us define a family of functionsby We have that , and so for every the function is convex for . Remark 8
gives us that is exponentially convex, and from [20] we then also have that is exponentially convex. This means that fulfills the assumptions of Corollary 1.
If we set that , we get As before, we have also here that () are exponentially convex, and that are monotone.
Using the Cauchy-type theorem from Section 3, applied for and , we get that forholds If we set is , then are means of the function g.
Example 4. Let us define a family of functionsby We have that , and so for every is convex.
Remark 8
gives us that is exponentially convex, and from [20] we also have that is exponentially convex. This means that fulfills the assumptions from Corollary 1.
Assuming that , we haveAs before, we conclude that the functions () are exponentially convex, and that are monotone.
Using our Cauchy-type theorem applied for and , we get that forholdswhere is the logarithmic mean defined by If we set that , then are means of the function g.