1. Introduction
Recall the definition of higher-order convex functions [
1,
2,
3].
Definition 1.
Suppose f is a real-valued function on . An n-th order divided difference of f at distinct points in may be defined byand A function is called n-convex on , iff the following inequality holds for all choices of distinct points in , This unifies non-negative functions (0-convex), non-decreasing functions (1-convex), the convex function in the usual sense (2-convex) and higher-order convex functions. For n-times differentiable functions, n-convex is .
Inequalities for higher-order convex functions are usually analogs of the Jensen-type inequality for 2-convex (convex) functions or Levinson-type inequality [
4,
5,
6,
7,
8,
9] for 3-convex functions. The inequalities of
n-convex functions for general
are truly extensions for these specific inequalities, so it is natural for researchers to consider extending the inequalities (Jensen type, Hermite–Hadamard type [
10], majorization type…) for convex functions to higher-order convex versions.
In this article, we will focus on several points. Can we establish inequalities for higher-order convex functions with some simple conditions (without assuming too many terms to be non-negative)? Can we establish inequalities for higher-order convex functions under different conditions than those in the existing references? What difference can we make in terms of inequalities in information theory from the perspective of higher-order convexity than convexity in the usual sense?
In [
11], we establish the following inequality for convex functions on three intervals, which will also be useful to higher-order convex functions in this paper.
Theorem 1.
Let and . Let and be non-negative. If is increasing for andthenholds for every convex function ϕ such that the integrals above exist. In [
11], this is used to prove some generalized Levinson inequality and Ky Fan-type inequalities. Some equivalence of the Hermite–Hadamard-type inequality and connections to the Lah–Ribarič inequality are also pointed out. In [
12] this inequality is extended and proves more inequalities.
In [
3] (p. 143), the following types of identities in Theorem 2 and Theorem 3 are proven and used to establish some inequalities for higher-order convex functions. The Green function is defined by
The function
G is convex with respect to both
s and
t.
Theorem 2.
Let integrable functions , be such thatLet and be a function with absolutely continuous. Then we have Theorem 3.
Let , be a function with absolutely continuous and be an open interval with . Also, let , be two functions withThenwhere The assumptions (
1) and (2) are similar to (
4) and (
5).
These results inspire us to consider higher-order convex functions for Theorem 1. The difficulty is that “inequality” in Theorem 1 can be expressed as an integral of with a non-negative weight function but may not be expressed by some higher-order derivative ; identities in Theorem 2 and Theorem 3 are expressed by an integral of higher-order derivative , but the weight function may not be non-negative.
In this paper, we will establish inequality for some higher-order convex functions without assuming the weight function to be non-negative because the inequality on three intervals naturally possesses this property. The second section is particularly devoted to inequalities for 3-convex functions, and some necessary lemmas and corollaries are also mentioned. The third section is devoted to inequalities for general -convex functions, and we will show that these kinds of inequalities hold under different assumptions. The fourth section consists of an application to Csiszár -divergence in information theory.
2. Three Interval Inequality for 3-Convex Functions
In this section, we establish inequality on three intervals for 3-convex functions. The following lemma [
12] is essential in our proof. Here
Lemma 1.
Let and . Let and be non-negative. If is an increasing function for and (
1), (2)
hold, then for with absolutely continuous, we getwhereFurthermore, we have . This lemma points out the non-negativity of the weight function .
Remark 1.
This lemma also holds if is decreasing, only changingwithIt can be seen from a substitution that , and we can use a similar conclusion for . The first main result below is for 3-convex functions.
Theorem 4.
Let and . Let two functions and be non-negative. If is an increasing function for and (
1), (2)
hold, thenholds for every 3-differentiable ϕ such that the above integrals exist, where is defined byandfor ; for or . Proof. Utilize Lemma 1 to get
where
And also regard
as a new function
; similar identity conditions (
1), (2) also hold; thus we can apply Lemma 1
where
Then we observe that
thus the identity in the theorem is equivalent to
where
Then
□
The following inequality is a direct corollary.
Corollary 1.
Let and . Let two functions and be non-negative. If is an increasing function for and (
1), (2)
hold, thenholds for every 3-convex function ϕ such that the integrals above exist. The following corollary is an estimation on the difference in the inequality above. Note that are functions but are real numbers.
Corollary 2.
Let and . Let two functions and be non-negative. If is an increasing function for and (
1), (2)
hold, then for , inequalityholds for every ϕ with such that the integrals exist, whereandfor ; for or . Let . We then have the following corollary, where the error term is more clear.
Corollary 3.
Let and . Let two functions and be non-negative. If is an increasing function for and (
1), (2)
hold, thenholds for every ϕ with such that the integrals exist. Proof. In the corollary above, as
, we have
in which the second equation was obtained due to the definition of
, the third equation was obtained due to Fubini’s theorem and the fourth equation was obtained due to (
1), (2). □
The second main theorem is similar to the above and is an analog of the Levinson-type inequality.
Theorem 5.
Let and . Let two functions and be non-negative. If is an increasing function for with and (
1), (2)
hold, thenholds for every 3-convex function ϕ such that the integrals above exist. Proof. We just consider a 3-convex function with
. Utilize Lemma 1 to get
where
And also regard
as a new function
; similar identity conditions also hold; thus we can apply Lemma 1 and Remark 1 to get
where
As
and
is 3-convex, we have
It is easy to observe that
where
Then we consider
in which the last step was obtained due to (
1), (2).
Thus, we can apply the identities above to (
6) with the facts that
is 3-convex and that
,
Combining (
6), we obtain the desired inequality. □
3. Three Interval Inequality for ( + 2)-Convex Functions
In this section, we consider inequalities on three intervals for general higher-order convex functions.
First we utilize Theorem 1 to prove the inequality of Theorem 2 type.
Theorem 6.
Let two functions , be integrable withwith non-decreasing andFor , let be an n-convex function. Then we get the following inequalityin which we further have Proof. First, we can regard
as the whole three interval
in Theorem 1 and
as
. As
G is convex, we can apply Theorem 1 to
in the last term in Theorem 2; with
and
also being non-negative, we get the inequality from Theorem 2. And
also holds in the first
terms. □
Then we utilize Theorem 1 to prove the inequality similar to Theorem 3. Note that in [
3], the same inequality also holds under several different assumptions; they are all deduced from Theorem 3.
Theorem 7.
Let be an even number and be an n-convex function, where is an open interval with . Further, let two functions , be such thatwith non-decreasing andThen we getin which we further have Proof. The first few steps of the proof is similar to the above theorem. Notice, for even n, in the last term in Theorem 3. So with Theorem 1, we can use the identity in Theorem 3 to prove the inequality. □
Another type of higher-order situation can be established as the following.
Theorem 8.
Let and . Let two functions and be non-negative. If is an increasing function for andthen for , inequalityholds for every -convex function ϕ such that the integrals above exist. Proof. For each
i, we can apply Lemma 1 on
to obtain (as the condition of identities is satisfied according to (
9) and (10))
where
Then it is easy to observe that
thus the inequality in the theorem is equivalent to
As
is an
-convex function, we predict that
with
being non-negative, the inequality is proven. □
Remark 2.
For higher-order extensions of Theorem 1, Corollary 1, the above Theorem 8 using of a divided difference is just one case of obtaining such an inequality for general higher-order convex functions; in reality, there are some other types.
One example is Corollary 1, which is a special case, but Theorem 5 is not a special case of Theorem 8 for .
The second example is that for , we have the following inequality for 4-convex functions according to Theorem 8:However, the conclusion below will show a more general inequality for 4-convex functions. Theorem 9.
Let and . Let two functions and be non-negative. If is an increasing function for andand the sequence majorizes , thenholds for every 4-convex function ϕ such that the integrals above exist. Proof. For each
(or
, similarly), we can apply Lemma 1 on
to obtain (as the condition of identities is satisfied according to (
11) and (12))
where
Then we observe that
thus the inequality in the theorem is equivalent to
and as
is 4-convex and
(so
), we affirm that
meanwhile, considering
, the inequality is proven. □
If we want to establish a similar inequality involving
nodes like Theorem 9 for a general
-convex function, the following essential conclusion [
3,
13] (p. 57) is needed.
Lemma 2.
Given real numbers and withthe statements below are equivalent: Theorem 10.
Let and . Let two functions and be non-negative. Consider the case where is an increasing function for ; and are real numbers;and one of the statements below is satisfied:Thenholds for every -convex function ϕ such that the integrals above exist. Proof. For each
(or
, similarly), we can apply Lemma 1 on
to obtain (as the condition of identities is satisfied according to (
13) and (14))
where
Then it is easy to observe that
thus the inequality in the theorem is equivalent to
As
is
-convex (
is
n-convex) and (due to (15))
we can use Lemma 2 to get
meanwhile, considering
, the inequality is proven. □
4. Application to Csiszár -Divergence
Recall some concepts of Csiszár
-divergence [
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25]. For a convex function
, the
-divergence functional
is a generalized definition for a measure of information, a “distance function” defined on the set of the probability distributions
. By selecting this convex function
to be some special function, various divergences can be derived; refer to Chapter 1 in [
15] and Chapter 9.2 in [
16] as well as other mentioned references.
In [
12], we compared two different pairs of
and
for convex function
, if
for some
. In this section, we will further estimate the error between these two divergence functionals for 3-convex
. The following discrete case of Corollary 1 is needed.
Corollary 4.
Let and consider the m-tuple x with . Let two sequences and be non-negative. Ifthen for , inequalityholds for every 3-convex function ϕ. Theorem 11.
Let be 3-convex. If and (
16)
is satisfied, then for , we haveif all are in the domain. Proof. Due to (
16), we may set
in Corollary 4 as
, where
are an increasing rearrangement of
.
Furthermore, set
in Corollary 4 as
, set
in Corollary 4 as
and set
and
. As
, conditions (
17) and (18) are naturally satisfied; using (
19) we obtain (
20). □
Then we illustrate how to apply this theorem to some special examples, where is 3-convex or 3-concave.
Definition 2.
Forthe ϕ-divergence isthe Kullback–Leibler distance. Notice that is 3-concave.
Definition 3.
LetThe corresponding ϕ-divergence isthe Hellinger distance. Notice that is 3-concave.
Definition 4.
For , letThe ϕ-divergence isthe α-order entropy. Furthermore, the Rényi divergence of order α is defined by Notice that is 3-convex, if .
Thus, apart from the previous perspective of convexity (2-convexity) on these distance functions in the References, our 3-convexity perspective may give further estimations.
Another application of Corollary 4 is the comparison between two investment strategies over the same period of years (
and
) with the same weighted arithmetic average annual yields. First recall the original 2-convex version of Corollary 4 under similar assumptions.
holds for every 2-convex function
. Taking
, we have
in which the annual yield among each
(or
) period of years is
. This inequality means that the overall income for a more stable investment strategy
is better than that for the strategy with more fluctuation (sometimes large
, sometimes small).
Now let us turn to Corollary 4 itself. If inequality (
21) above is only a common sense investment, then the following inequality would be more interesting. Taking 3-convex function
, we have
Indeed, no matter whether the annual yield is
or
, the basic rule (
21) will not change, which means the following:
But (
22) reveals that when the annual yields are all larger (
), there is less of a difference between two investment strategies than in the situation when the annual yields are all smaller (
). Especially when some
are close to 0, a more fluctuating strategy would be much more devastating. When the market is strong, every strategy can make money, but the bad ones may only be exposed when the market turns weak.
5. Conclusions
In this paper, by utilizing some identities involving higher-order derivatives of functions, we obtain several inequalities for 3-convex functions as well as general -convex functions, under various assumptions. Some are independent new inequalities; some are extensions of 2,3-convex function cases. From the perspective of 3-convex functions, we also obtain estimates for Csiszár -divergence.