Next Article in Journal
Topology Structure Implied in β-Hilbert Space, Heisenberg Uncertainty Quantum Characteristics and Numerical Simulation of the DE Algorithm
Next Article in Special Issue
Hermite-Hadamard Type Inequalities for Interval (h1, h2)-Convex Functions
Previous Article in Journal
A Two-Echelon Supply Chain Management With Setup Time and Cost Reduction, Quality Improvement and Variable Production Rate
Previous Article in Special Issue
New Integral Inequalities via the Katugampola Fractional Integrals for Functions Whose Second Derivatives Are Strongly η-Convex
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized Steffensen’s Inequality by Fink’s Identity

1
Department of Mathematics, COMSATS University Islamabad, Vehari Campus, Vehari 61100, Pakistan
2
Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Lahore 54000, Pakistan
3
RUDN University, Miklukho-Maklaya str. 6, 117198 Moscow, Russia
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(4), 329; https://doi.org/10.3390/math7040329
Submission received: 11 February 2019 / Revised: 27 March 2019 / Accepted: 28 March 2019 / Published: 4 April 2019
(This article belongs to the Special Issue Inequalities)

Abstract

:
By using Fink’s Identity, Green functions, and Montgomery identities we prove some identities related to Steffensen’s inequality. Under the assumptions of n-convexity and n-concavity, we give new generalizations of Steffensen’s inequality and its reverse. Generalizations of some inequalities (and their reverse), which are related to Hardy-type inequality. New bounds of Gr u ¨ ss and Ostrowski-type inequalities have been proved. Moreover, we formulate generalized Steffensen’s-type linear functionals and prove their monotonicity for the generalized class of ( n + 1 ) -convex functions at a point. At the end, we present some applications of our study to the theory of exponentially convex functions.

1. Introduction

Integral inequalities such as Hardy’s inequality, Steffensen’s inequality, and Ostrowski’s inequality are topics of interest of many Mathematicians since their pronouncement. Several generalizations of these inequalities have been proved for different classes of functions, such as convex functions, n-convex functions, and other types of functions, for example see [1,2,3,4]. Moreover, integral inequalities have been proved for different integrals, such as Jensen-steffensen inequality for diamond integral and bounds of related identities have been obtained in [5]. Other than that, Hardy’s inequality for fractional integral on general domains have been proved in [6].
Steffensen’s inequality was proved in [7]: if ψ , f : [ c , d ] R , with ψ be a decreasing function and function f having range in [ 0 , 1 ] , then
c d ψ ( z ) f ( z ) d t c c + θ ψ ( z ) d z , where θ = c d f ( z ) d z .
A massive literature dealing with several variants and improvements of Steffensen’s inequality can be seen in [8,9] and references therein. A well known generalization of Steffensen’s inequality has been presented in [4]. Several results of [4] have been recently generalized by using non-bounded Montgomery’s identity in [10]. To proceed further, we recall a nice generalization of Steffensen’s inequality proved by Pečarić, see [11].
Theorem 1.
Let ψ : J R be a increasing function (J is an interval in R such that c , d , f ( c ) , f ( d ) J ) and f : [ c , d ] R be increasing and differentiable function.
(i) 
If f ( t ) t , then
f ( c ) f ( d ) ψ ( z ) d z c d ψ ( z ) f ( z ) d z .
(ii) 
If f ( t ) t , then (2) holds in reverse direction.
Remark 1.
We can consider f to be absolute continuous instead of differentiable function and the suppositions of Theorem 1 can also be weakened. In fact for an increasing function ψ, the function Ψ ( x ) = c x ψ ( z ) d z is well defined and satisfies Ψ = ψ at all except the set of points with measure zero. One can substitute x = f ( z ) in (2) (see [12] (Corollary 20.5)), provided that f is absolutely continuous increasing function, therefore
Ψ ( f ( d ) ) Ψ ( f ( c ) ) = f ( c ) f ( d ) ψ ( x ) d x = c d ψ ( f ( z ) ) f ( z ) d z c d ψ ( z ) f ( z ) d z ,
where the last inequality holds when f ( z ) z . In [1], substitutions presented conclude that (3) yields (2) and generalization of a result proved by Rabier in [4], which gives (1).
Recently, Fahad et al. introduced new generalization [1] of (1) by extending the results of [4,11]. By using Hermite interpolation, several inequalities related to the results of [1,4,11] have also been proved in [13]. We consider the important conclusions given in [1].
Corollary 1.
Suppose ψ : J R , f : [ c , d ] R two differentiable functions with f non-decreasing as well, where J is an interval containing [ c , d ] , f ( c ) and f ( d ) . If ψ is convex, then:
(i) 
If f satisfies condition ( i ) given in Theorem 1, then
ψ ( f ( d ) ) ψ ( f ( c ) ) + c d ψ ( z ) f ( z ) d z .
(ii) 
(4) holds in reverse direction, if f satisfies condition ( i i ) given in Theorem 1.
Corollary 1 gives (3) and therefore leads to (1), (2) and generalization of Rabier’s result in [4]. Next we narrate some further important results of [1].
Corollary 2.
Consider ψ : [ 0 , d ] R be differentiable convex function with ψ ( 0 ) = 0 and f : [ 0 , d ] [ 0 , + ) be another function.
(i) 
If 0 t f ( z ) d z t for every t [ 0 , b ] , then
ψ 0 d f ( z ) d z 0 d ψ ( z ) f ( z ) d z .
(ii) 
(5) holds reversely if t 0 t f ( z ) d z for every t [ 0 , d ] .
Corollary 3.
Consider ψ and f as defined in Corollary 2 and let λ : [ 0 , d ] [ 0 , + ) and denote Λ ( z ) = z d λ ( t ) d t .
(i) 
If 0 t f ( z ) d z t for every t [ 0 , d ] , then
0 d λ ( t ) ψ 0 t f ( z ) d z d t 0 d Λ ( z ) ψ ( z ) f ( z ) d z .
(ii) 
(6) holds reversely if t 0 t f ( z ) d z for every t [ 0 , d ] .
Following two lemmas will be useful in our construction as well, see [14,15].
Lemma 1.
For a function ψ C 2 ( [ c , d ] ) , we have:
ψ ( ξ ) = d ξ d c ψ ( c ) + ξ c d c ψ ( d ) + c d G , 1 ( ξ , u ) ψ ( u ) d u ,
ψ ( ξ ) = ψ ( c ) + ( ξ c ) ψ ( d ) + c d G , 2 ( ξ , u ) ψ ( u ) d u ,
ψ ( ξ ) = ψ ( d ) + ( d ξ ) ψ ( c ) + c d G , 3 ( ξ , u ) ψ ( u ) d u ,
ψ ( ξ ) = ψ ( d ) ( d c ) ψ ( d ) + ( ξ c ) ψ ( c ) + c d G , 4 ( ξ , u ) ψ ( u ) d u ,
ψ ( ξ ) = ψ ( c ) + ( d c ) ψ ( c ) ( d ξ ) ψ ( d ) + c d G , 5 ( ξ , u ) ψ ( u ) d u ,
where
G , 1 ( ξ , u ) = ( ξ d ) ( u c ) d c , if c u ξ , ( u d ) ( ξ c ) d c , if ξ < u d .
G , 2 ( ξ , u ) = c u , if c u ξ , c ξ , if ξ < u d .
G , 3 ( ξ , u ) = ξ d , if c u ξ , u d , if ξ < u d .
G , 4 ( ξ , u ) = ξ c , if c u ξ , u c , if ξ < u d .
and
G , 5 ( ξ , u ) = d u , if c u ξ , d ξ , if ξ < u d .
Lemma 2.
Let ψ C 1 [ c , d ] , then
ψ ( ξ ) = 1 d c c d ψ ( u ) d u + c d p 1 ( ξ , u ) ψ ( u ) d u ,
ψ ( ξ ) = ψ ( d ) + c d p 2 ( ξ , u ) ψ ( u ) d u
and
ψ ( ξ ) = ψ ( c ) + c d p 3 ( ξ , u ) ψ ( u ) d u ,
where
p 1 ( ξ , u ) = u c d c , if c u ξ , u d d c , if ξ < u d .
p 2 ( ξ , u ) = 0 , if c u ξ , 1 , if ξ < u d .
p 3 ( ξ , u ) = 1 , if c u ξ , 0 , if ξ < u d .
Clearly,
p i ( ξ , u ) = G , i ( ξ , u ) ξ f o r a l l i = 1 , 2 , 3 , p 2 ( ξ , u ) = G , 5 ( ξ , u ) ξ a n d p 3 ( ξ , u ) = G , 4 ( ξ , u ) ξ .
Throughout the calculations in the main results, we will use p i ( ξ , u ) corresponding to G , i ( ξ , u ) ξ for i = 1 , 2 , 3 , and for G , 4 ( ξ , u ) ξ , G , 5 ( ξ , u ) ξ we use p 3 ( ξ , s ) and p 2 ( ξ , s ) , respectively.
We also require the classical Fink’s identity given in [16]:
Lemma 3.
Let c , d R and ψ : [ c , d ] R , n 1 and ψ ( n 1 ) is absolutely continuous on [ c , d ] .
ψ ( u ) = n d c c d ψ ( s ) d s w = 1 n 1 n w ( d c ) w ! ψ ( w 1 ) ( c ) ( u c ) w ψ ( w 1 ) ( d ) ( u d ) w + 1 ( n 1 ) ! ( d c ) c d ( u t ) n 1 W c , d ( t , u ) ψ ( n ) ( t ) d t ,
where W c , d ( t , u ) is given by:
W c , d ( t , u ) = t c , if c t u d , t d , if c u < t d .
Divided differences are fairly ascribed to Newton, and the term “divided difference” was used by Augustus de Morgan in 1842. Divided differences are found to be very helpful when we are dealing with functions having different degrees of smoothness. The following definition of divided difference is given in [8] (p. 14).
Definition 1.
The nth-order divided difference of a function ψ : c , d R at mutually distinct points z 0 , , z n c , d is defined recursively by
z i ; ψ = ψ z i , i = 0 , , n , z 0 , , z n ; ψ = z 1 , , z n ; ψ z 0 , , z n 1 ; ψ z n z 0 .
It is easy to see that (26) is equivalent to
z 0 , , z n ; ψ = i = 0 n ψ z i q z i , w h e r e q z = j = 0 n z z j .
The following definition of a real valued convex function is characterized by nth-order divided difference (see [8] (p. 15)).
Definition 2.
A function ψ : c , d R is said to be n-convex n 0 if and only if for all choices of n + 1 distinct points z 0 , , z n c , d , z 0 , , z n ; ψ 0 holds.
If this inequality is reversed, then ψ is said to be n-concave. If the inequality is strict, then ψ is said to be a strictly n-convex (n-concave) function.
Remark 2.
Note that 0-convex functions are non-negative functions, 1-convex functions are increasing functions, and 2-convex functions are simply the convex functions.
The following theorem gives an important criteria to examine the n-convexity of a function ψ (see [8] (p. 16)).
Theorem 2.
If ψ n exists, then ψ is n-convex if and only if ψ n 0 .
In this article, we use Fink’s identity, Montgomery identities, and Green functions to prove some identities related to Steffensen’s inequality. By using these identities we obtain a generalization of (4). In addition, we construct new identities which enable us to prove generalizations of inequalities (5) and (6) as one can obtain Classical Hardy-type inequalities from them, see [1]. We use Čebyšev functional to construct new bounds of Gr u ¨ ss and Ostrowski-type inequalities. Finally, we give several applications of our work.

2. Main Results

For our convenience, we use the following notations and assumptions:
S 1 ( ψ , f , c , d ) = ψ ( f ( c ) ) + c d ψ ( z ) f ( z ) d z ψ ( f ( d ) ) .
S 2 ( ψ , f , d ) = 0 d ψ ( z ) f ( z ) d z ψ 0 d f ( z ) d z .
S 3 ( ψ , f , w , d ) = 0 d Λ ( z ) ψ ( z ) f ( z ) d z 0 d λ ( t ) ψ 0 t f ( z ) d z d t .
  • ( A 1 ) For n N , n 3 , let ψ : [ c , d ] R be n times differentiable function with ψ ( n 1 ) absolutely continuous on [ c , d ] .
  • ( A 2 ) For n N , n 3 , let ψ : [ 0 , d ] R be n times differentiable function with ψ ( 0 ) = 0 and ψ ( n 1 ) absolutely continuous on [ 0 , d ] .
The first part of this section is the generalization of (4). For this, we start with the following theorem:
Theorem 3.
Consider ( A 1 ) with f be as in Corollary 1 ( i ) then:
(a) 
For j = 1 , 2 , 4 , 5 , we have:
S 1 ( ψ , f , c , d ) = ( n 2 ) ( ψ ( d ) ψ ( c ) ) d c c d S 1 ( G , j ( . , u ) , f , c , d ) d u + w = 1 n 3 n w 2 ( d c ) w ! × ψ ( w + 1 ) ( d ) c d S 1 ( G , j ( . , u ) , f , c , d ) ( u d ) w d u ψ ( w + 1 ) ( c ) c d S 1 ( G , j ( . , u ) , f , c , d ) ( u c ) w d u + 1 ( n 3 ) ! ( d c ) c d ψ ( n ) ( t ) c d S 1 ( G , j ( . , u ) , f , c , d ) ( u t ) n 3 W c , d ( t , u ) d u d t .
(b) 
If ψ ( c ) = 0 , then
S 1 ( ψ , f , c , d ) = ( n 2 ) ( ψ ( d ) ψ ( c ) ) d c c d S 1 ( G , 3 ( . , u ) , f , c , d ) d u + w = 1 n 3 n w 2 ( d c ) w ! × ψ ( w + 1 ) ( d ) c d S 1 ( G , 3 ( . , u ) , f , c , d ) ( u d ) w d u ψ ( w + 1 ) ( c ) c d S 1 ( G , 3 ( . , u ) , f , c , d ) ( u c ) w d u + 1 ( n 3 ) ! ( d c ) c d f ( n ) ( t ) c d S 1 ( G , 3 ( . , u ) , f , c , d ) ( u t ) n 3 W c , d ( t , u ) d u d t .
Proof. 
(a) 
We first prove by fixing j = 1 , other cases for j = 2 , 4 , 5 can be treated analogously. Utilizing (7) and (17) for ψ and ψ respectively, we get
S 1 ( ψ , f , c , d ) = ψ ( f ( c ) ) ψ ( f ( d ) ) + c d ψ ( t ) f ( t ) d t = d f ( c ) d c ψ ( c ) + f ( c ) c d c ψ ( d ) + c d G , 1 ( f ( c ) , u ) ψ ( u ) d u d f ( d ) d c ψ ( c ) f ( d ) c d c ψ ( d ) c d G , 1 ( f ( d ) , u ) ψ ( u ) d u + c d ψ ( d ) ψ ( c ) d c + c d p 1 ( t , u ) ψ ( u ) d u f ( t ) d t .
Simplifying and employing Fubini’s theorem, we get
S 1 ( ψ , f , c , d ) = f ( d ) f ( c ) d c ψ ( c ) f ( d ) f ( c ) d c ψ ( d ) + c d G , 1 ( f ( c ) , u ) G , 1 ( f ( d ) , u ) ψ ( u ) d u + ψ ( d ) ψ ( c ) d c f ( d ) f ( c ) + c d c d p 1 ( t , u ) f ( t ) ψ ( u ) d t d u = c d S 1 ( G , 1 ( . , u ) , f , c , d ) ψ ( u ) d u .
Now by replacing n with n 2 in (24) for ψ , we have:
S 1 ( ψ , f , c , d ) = c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( ( n 2 ) ( ψ ( d ) ψ ( c ) ) d c + w = 1 n 3 n w 2 ( d c ) w ! × ψ ( w + 1 ) ( d ) ( u d ) w ψ ( w + 1 ) ( c ) ( u c ) w + 1 ( n 3 ) ! ( d c ) c d ( u t ) n 3 W c , d ( t , u ) ψ ( n ) ( t ) d t ) d u .
Rest follows from simplification and Fubini’s theorem.
(b) 
Using assumption ψ ( c ) = 0 and employing a similar method as in ( a ) .
From the next two theorems we get a generalization of Steffensen’s inequality and its reverse by generalizing (4) and its reverse.
Theorem 4.
Consider ( A 1 ) with f be as in Corollary 1 ( i ) and let
( u t ) n 3 W c , d ( t , u ) 0 .
(a) 
If ψ is n-convex, then for each j { 1 , 2 , 3 , 4 , 5 } (where ψ ( 0 ) = 0 for j = 3 ) , we have:
S 1 ( ψ , f , c , d ) ( n 2 ) ( ψ ( d ) ψ ( c ) ) d c c d S 1 ( G , 1 ( . , u ) , f , c , d ) d u + w = 1 n 3 n w 2 ( d c ) w ! × ψ ( w + 1 ) ( d ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u d ) w d u ψ ( w + 1 ) ( c ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u c ) w d u .
(b) 
If ψ is n-convex, then for each j, (29) holds in the reverse direction.
Proof. 
For each j , the function G , j ( . , u ) is convex and differentiable. Since f is non-decreasing with f ( z ) z , therefore Corollary 1 ( i ) gives S 1 ( G , 1 ( . , u ) , f , c , d ) 0 . On the other hand, if ψ is n-convex ( ψ is n-convex), then ψ ( n ) ( z ) ( ) 0 . Therefore, given assumption together with n-convexity of ψ ( ψ ) implies c d ψ ( n ) ( t ) c d S 1 ( G , j ( . , u ) , f , c , d ) ( u t ) n 3 W c , d ( t , u ) d u d t ( ) 0 . The rest follows from (27). □
Theorem 5.
Consider ( A 1 ) for even n and f as in Corollary 1 ( i ) . Then
(a) 
If ψ is n-convex, then (29) holds.
(b) 
If ψ is n-convex, then the reverse of (29) holds.
(c) 
Let (29) (reverse of (29)) holds and
w = 0 n 3 n w 2 ( d c ) w ! ψ ( w + 1 ) ( d ) ( u d ) w d u ψ ( w + 1 ) ( c ) ( u c ) w d u ( ) 0 .
Then S 1 ( ψ , f , c , d ) ( ) 0 .
Proof. 
( a ) , ( b ) We define
H ( u , t ) = ( u t ) n 3 W c , d ( t , u ) = ( u t ) n 3 ( t c ) , if c t u d , ( u t ) n 3 ( t d ) , if c u < t d .
Clearly H ( u , t ) 0 for even n . Consequently, we get (28), n-convexity of ψ ( ψ ), and Theorem 4 ( a ) (Theorem 4 ( b ) ) yields (29) (and its reverse).
( c ) By definition of G , j ( . , u ) and assumption on f , Corollary 1 ( i ) gives S 1 ( G , j ( . , u ) , f , c , d ) 0 . Therefore, by using (30) and S 1 ( G , j ( . , u ) , f , c , d ) 0 in (29) (and its reverse), we get S 1 ( ψ , f , c , d ) ( ) ( ) 0 , which completes the proof. □
Now, we prove the following theorem which enables us to prove a generalization of (5).
Theorem 6.
Consider ( A 2 ) and let f be as in Corollary 2 ( i ) then:
(a) 
S 2 ( ψ , f , d ) = ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 2 ( G , j ( . , u ) , f , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 2 ( G , j ( . , u ) , f , d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) 0 d S 2 ( G , j ( . , u ) , f , d ) u w d u + 1 d ( n 3 ) ! 0 d ψ ( n ) ( t ) 0 d S 2 ( G , j ( . , u ) , f , d ) ( u t ) n 3 W 0 , d ( t , u ) d u d t
for j = 1 , 2 .
(b) 
If ψ ( 0 ) = 0 , then
S 2 ( ψ , f , d ) + ψ ( d ) = ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 2 ( G , 3 ( . , u ) , f , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 2 ( G , 3 ( . , u ) , f , d ) ( u d ) w d u f ( w + 1 ) ( 0 ) 0 d S 2 ( G , 3 ( . , u ) , f , d ) u w d u + 1 d ( n 3 ) ! 0 d ψ ( n ) ( t ) 0 d S 2 ( G , 3 ( . , u ) , f , d ) ( u t ) n 3 W 0 , d ( t , u ) d u d t .
(c) 
S 2 ( ψ , f , d ) + ψ ( d ) d ψ ( d ) = ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 2 ( G , 4 ( . , u ) , f , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 2 ( G , 4 ( . , u ) , f , d ) ( u d ) w d u f ( w + 1 ) ( 0 ) 0 d S 2 ( G , 4 ( . , u ) , f , d ) u w d u + 1 d ( n 3 ) ! 0 d ψ ( n ) ( t ) 0 d S 2 ( G , 4 ( . , u ) , f , d ) ( u t ) n 3 W 0 , d ( t , u ) d u d t .
(d) 
If ψ ( 0 ) = 0 , then
S 2 ( ψ , f , d ) d ψ ( d ) = ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 2 ( G , 5 ( . , u ) , f , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 2 ( G , 5 ( . , u ) , f , d ) ( u d ) w d u f ( w + 1 ) ( 0 ) 0 d S 2 ( G , 5 ( . , u ) , f , d ) u w d u + 1 d ( n 3 ) ! 0 d ψ ( n ) ( t ) 0 d S 2 ( G , 5 ( . , u ) , f , d ) ( u t ) n 3 W 0 , d ( t , u ) d u d t .
Proof. 
We give proof of our results by fixing j = 1 , and other cases can be proved in the similar way. By using (7) and (17) for ψ and ψ respectively and applying assumption ψ ( 0 ) = 0 , we get
S 2 ( ψ , f , d ) = 0 d ψ ( t ) f ( t ) d t ψ 0 d f ( t ) d t = 0 d 1 d ψ ( d ) f ( t ) d t + 0 d 0 d G , 1 ( t , u ) t ψ ( u ) d u f ( t ) d t 0 d f ( t ) d t d ψ ( d ) 0 d G , 1 0 d f ( t ) d t , u ψ ( u ) d u = 0 d S 2 ( G , 1 ( . , u ) , f , d ) ψ ( u ) d u .
Now replacing n with n 2 in (24) for ψ and simplifying we get the required identities. □
Our next result gives a generalization of (5).
Theorem 7.
Consider ( A 2 ), f as in Corollary 2 ( i ) and let
( u t ) n 3 W 0 , d ( t , u ) 0 ,
then the following hold:
(a) 
If ψ is n-convex, then
(i) 
S 2 ( ψ , f , d ) ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 2 ( G , j ( . , u ) , f , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 2 ( G , j ( . , u ) , f , d ) ( u d ) w d u f ( w + 1 ) ( 0 ) 0 d S 2 ( G , j ( . , u ) , f , d ) u w d u
for j = 1 , 2 .
(ii) 
If ψ ( 0 ) = 0 , then
S 2 ( ψ , f , d ) + ψ ( d ) ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 2 ( G , 3 ( . , u ) , f , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 2 ( G , 3 ( . , u ) , f , d ) ( u d ) w d u f ( w + 1 ) ( 0 ) 0 d S 2 ( G , 3 ( . , u ) , f , d ) u w d u .
(iii) 
S 2 ( ψ , f , d ) + ψ ( d ) d ψ ( d ) ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 2 ( G , 4 ( . , u ) , f , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 2 ( G , 4 ( . , u ) , f , d ) ( u d ) w d u f ( w + 1 ) ( 0 ) 0 d S 2 ( G , 4 ( . , u ) , f , d ) u w d u .
(iv) 
If ψ ( 0 ) = 0 , then
S 2 ( ψ , f , d ) d ψ ( d ) ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 2 ( G , 5 ( . , u ) , f , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 2 ( G , 5 ( . , u ) , f , d ) ( u d ) w d u f ( w + 1 ) ( 0 ) 0 d S 2 ( G , 5 ( . , u ) , f , d ) u w d u .
(b) 
Inequalities (32)–(35) are reversed provided that ψ is n-convex.
Proof. 
The proof is similar to that of Theorem 4 except using Theorem 6 and Corollary 2 ( i ) . □
Theorem 8.
Consider ( A 2 ) for even n and f be as in Corollary 2 ( i ) . Then
(a) 
If ψ is n-convex, then (32)–(35) hold.
(b) 
If ψ is n-convex, then the reverse of (32)–(35) holds.
(c) 
If any of (32)–(35) (reverse of (32)–(35)) hold and
w = 0 n 3 n w 2 d w ! ψ ( w + 1 ) ( d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) u w d u ( ) 0 .
Then S 2 ( ψ , f , d ) ( ) 0 .
Proof. 
The proof is similar to that of Theorem 5 except using Theorem 7 and Corollary 2 ( i ) . □
Next we give some generalized identities considering (6).
Theorem 9.
Consider ( A 2 ) and let f, λ and Λ be as in Corollary 3 ( i ) then:
(a) 
For j = 1 , 2 , we have
S 3 ( ψ , f , λ , d ) = ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 3 ( G , j ( . , u ) , f , λ , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 3 ( G , j ( . , u ) , f , λ , d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) 0 d S 3 ( G , j ( . , u ) , f , λ , d ) u w d u + 1 d ( n 3 ) ! 0 d ψ ( n ) ( t ) 0 d S 3 ( G , j ( . , u ) , f , λ , d ) ( u t ) n 3 W 0 , d ( t , u ) d u d t .
(b) 
If ψ ( 0 ) = 0 , then
S 3 ( ψ , f , λ , d ) + ψ ( d ) 0 d λ ( x ) d x = ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 3 ( G , 3 ( . , u ) , f , λ , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 3 ( G , 3 ( . , u ) , f , λ , d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) 0 d S 3 ( G , 3 ( . , u ) , f , λ , d ) u w d u + 1 d ( n 3 ) ! 0 d ψ ( n ) ( t ) 0 d S 3 ( G , 3 ( . , u ) , f , λ , d ) ( u t ) n 3 W 0 , d ( t , u ) d u d t .
(c) 
S 3 ( ψ , f , λ , d ) + ( ψ ( d ) d ψ ( d ) ) 0 d λ ( x ) d x = ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 3 ( G , 4 ( . , u ) , f , λ , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 3 ( G , 4 ( . , u ) , f , λ , d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) 0 d S 3 ( G , 4 ( . , u ) , f , λ , d ) u w d u + 1 d ( n 3 ) ! 0 d ψ ( n ) ( t ) 0 d S 3 ( G , 4 ( . , u ) , f , λ , d ) ( u t ) n 3 W 0 , d ( t , u ) d u d t .
(d) 
If ψ ( 0 ) = 0 , then
S 3 ( ψ , f , λ , d ) d ψ ( d ) 0 d λ ( x ) d x = ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 3 ( G , 5 ( . , u ) , f , λ , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 3 ( G , 5 ( . , u ) , f , λ , d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) 0 d S 3 ( G , 5 ( . , u ) , f , λ , d ) u w d u + 1 d ( n 3 ) ! 0 d ψ ( n ) ( t ) 0 d S 3 ( G , 5 ( . , u ) , f , λ , d ) ( u t ) n 3 W 0 , d ( t , u ) d u d t .
Proof. 
We give a proof of our results by fixing j = 1 , and other cases can be proved in a similar way. By using (7) and (17) for ψ and ψ respectively and applying assumption ψ ( 0 ) = 0 , we get:
S 3 ( ψ , f , λ , d ) = 0 d Λ ( t ) ψ ( t ) f ( t ) d t 0 d λ ( x ) ψ 0 x f ( t ) d t d x = 0 d Λ ( t ) f ( t ) 1 d ψ ( d ) + 0 d G , 1 ( t , u ) t ψ ( u ) d u d t 0 d λ ( x ) [ 1 d ψ ( d ) 0 x f ( t ) d t + 0 d G , 1 0 x f ( t ) d t , u ψ ( u ) d u ] d x = 1 d ψ ( d ) 0 d Λ ( t ) f ( t ) d t 0 d λ ( x ) 0 x f ( t ) d t d x + 0 d Λ ( t ) f ( t ) 0 d G , 1 ( t , u ) t ψ ( u ) d u d t 0 d λ ( x ) 0 d G , 1 0 x f ( t ) d t , u ψ ( u ) d u d x .
Since 0 d λ ( x ) 0 x f ( t ) d t d x = 0 d f ( t ) t d λ ( x ) d x d t = 0 d Λ ( t ) f ( t ) d t , therefore
S 3 ( ψ , f , λ , d ) = 0 d 0 d Λ ( t ) f ( t ) G , 1 ( t , u ) t d t 0 d λ ( x ) G , 1 0 x f ( t ) d t , u d x ψ ( u ) d u = 0 d S 3 ( G , 1 ( . , u ) , f , λ , d ) ψ ( u ) d u .
The rest follows from (24). □
Next, we present a generalization of (6).
Theorem 10.
Consider ( A 2 ) and let f, λ, Λ be as in Corollary 3 ( i ) and (31) holds, then:
(a) 
If ψ is n-convex, then
(i) 
For j = 1 , 2 , we have
S 3 ( ψ , f , λ , d ) ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 3 ( G , j ( . , u ) , f , λ , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 3 ( G , j ( . , u ) , f , λ , d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) 0 d S 3 ( G , j ( . , u ) , f , λ , d ) u w d u .
(ii) 
If ψ ( 0 ) = 0 , then
S 3 ( ψ , f , λ , d ) + ψ ( d ) 0 d λ ( x ) d x ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 3 ( G , 3 ( . , u ) , f , λ , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 3 ( G , 3 ( . , u ) , f , λ , d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) 0 d S 3 ( G , 3 ( . , u ) , f , λ , d ) u w d u .
(iii) 
S 3 ( ψ , f , λ , d ) + ( ψ ( d ) d ψ ( d ) ) 0 d λ ( x ) d x ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 3 ( G , 4 ( . , u ) , f , λ , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 3 ( G , 4 ( . , u ) , f , λ , d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) 0 d S 3 ( G , 4 ( . , u ) , f , λ , d ) u w d u .
(iv) 
If ψ ( 0 ) = 0 , then
S 3 ( ψ , f , λ , d ) d ψ ( d ) 0 d λ ( x ) d x ( n 2 ) ( ψ ( d ) ψ ( 0 ) ) d 0 d S 3 ( G , 5 ( . , u ) , f , λ , d ) d u + w = 1 n 3 n w 2 d w ! × ψ ( w + 1 ) ( d ) 0 d S 3 ( G , 5 ( . , u ) , f , λ , d ) ( u d ) w d u ψ ( w + 1 ) ( 0 ) 0 d S 3 ( G , 5 ( . , u ) , f , λ , d ) u w d u .
(b) 
Inequalities (37)–(40) are reversed provided that ψ is n-convex.
Proof. 
The proof is similar to that of Theorem 4 except using Theorem 9 and Corollary 3 ( i ) . □
Theorem 11.
Consider ( A 2 ) for even n and let f, λ, and Λ be as in Corollary 3 ( i ) . Then
(a) 
If ψ is n-convex, then (37)–(40) hold.
(b) 
If ψ is n-convex, then the reverses of (37)–(40) hold.
(c) 
If any of (37)–(40) (reverse of (37)–(40)) hold and (36) is valid. Then S 3 ( ψ , f , λ , d ) ( ) 0 .
Proof. 
The proof is similar to that of Theorem 5 except using Theorem 10 and Corollary 3 ( i ) . □

3. New Upper Bounds Via Čebyšev Functional

Consider the Čebyšev functional for two Lebesgue integrable functions F 1 , F 2 : [ c , d ] R given as:
T ( F 1 , F 2 ) = 1 d c c d F 1 ( ξ ) F 2 ( ξ ) d ξ 1 d c c d F 1 ( ξ ) d ξ . 1 d c c d F 2 ( ξ ) d ξ .
Cerone and Dragomir in [17] proposed new bounds utilizing Čebyšev functional given as:
Theorem 12.
For F 1 L [ c , d ] and F 2 : [ c , d ] R be an absolutely continuous function along with ( . c ) ( d . ) [ F 2 ] 2 L [ c , d ] . The following inequality holds
| T ( F 1 , F 2 ) | 1 2 T ( F 1 , F 1 ) ( d c ) 1 2 c d ( ξ c ) ( d ξ ) [ F 2 ( ξ ) ] 2 d ξ 1 2 .
Theorem 13.
For F 1 : [ c , d ] R be an absolutely continuous with F 1 L [ c , d ] and F 2 : [ c , d ] R is an increasing function. The following inequality holds
| T ( F 1 , F 2 ) | | | F 1 | | 2 ( d c ) c d ( ξ c ) ( d ξ ) d F 2 ( ξ ) .
The constants 1 2 and 1 2 are the optimal constants.
Now we utilize the above theorems to construct new upper bounds for our obtained generalized identities. For our convenience we denote
O j ( t ) = c d S 1 ( G , j ( . , u ) , f , c , d ) ( u t ) n 3 W c , d ( t , u ) d u , t [ c , d ] ,
for { j = 1 , , 5 } . Consider the Čebyšev functional T j ( O j , O j ) { j = 1 , , 5 } given as:
T j ( O j , O j ) = 1 d c c d O j 2 ( ξ ) d ξ 1 d c c d O j ( ξ ) d ξ 2 .
Gr u ¨ ss type inequalities associated with Theorems 12 and 13 can be given as:
Theorem 14.
Under the assumptions of Theorem 3, let ψ : [ c , d ] R be absolutely continuous along with ( . c ) ( d . ) [ ψ ( n + 1 ) ] 2 L [ c , d ] and O j { j = 1 , 2 , 3 , 4 , 5 } be defined as in (43). Then
S 1 ( ψ , f , c , d ) w = 0 n 3 n w 2 ( d c ) w ! × ψ ( w + 1 ) ( d ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u d ) w d u ψ ( w + 1 ) ( c ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u c ) w d u ψ ( n 1 ) ( d ) ψ ( n 1 ) ( c ) ( d c ) 2 n 3 ! c d O j ( t ) d t = R e m ( c , d , O j , ψ ( n ) )
where
| R e m ( c , d , O j , ψ ( n ) ) | 1 2 n 3 ! T j ( O j , O j ) ( d c ) 1 2 | c d ( t c ) ( d t ) [ ψ ( n + 1 ) ( t ) ] 2 d t | 1 2 .
Proof. 
Fix { j = 1 , , 5 }. Using Čebyšev functional for F 1 = O j , F 2 = ψ ( n ) and by comparing (45) with (27), we have
R e m ( c , d , O j , ψ ( n ) ) = 1 ( n 3 ) ! T j ( O j , ψ ( n ) ) .
Employing Theorem 12 for the new functions, we get the required bound. □
Theorem 15.
Under the assumptions of Theorem 3, let ψ : [ c , d ] R be absolutely continuous along with ψ ( n + 1 ) 0 and O j { j = 1 , 2 , 3 , 4 , 5 } be defined as in (44). Then R e m ( c , d , O j , ψ ( n ) ) in (45) satisfies a bound
| R e m ( c , d , O j , ψ ( n ) ) | | | O j | | n 3 ! ψ ( n 1 ) ( d ) + ψ ( n 1 ) ( c ) 2 ψ ( n 2 ) ( d ) ψ ( n 2 ) ( c ) d c .
Proof. 
In the proof of Theorem 14, we have established that
R e m ( c , d , O j , ψ ( n ) ) = 1 ( n 3 ) ! T j ( O j , ψ ( n ) ) .
Now applying Theorem 13 for F 1 = O j , F 2 = ψ ( n ) , we have
| R e m ( c , d , O j , ψ ( n ) ) | = 1 ( n 3 ) ! | T j ( O j , ψ ( n ) ) |
| | O j | | 2 ( d c ) n 3 ! c d ( t c ) ( d t ) ψ ( n + 1 ) ( t ) d t
Now since
c d ( t c ) ( d t ) ψ ( n + 1 ) ( t ) d t = c d [ 2 t ( c + d ) ] ψ ( n ) ( t ) d t = ( d c ) ψ ( n 1 ) ( d ) + ψ ( n 1 ) ( c ) 2 ψ ( n 2 ) ( d ) f ( n 2 ) ( c )
therefore the required bound in (46) follows. □
Ostrowski-type inequalities associated with generalized Steffensen’s inequality can be given as:
Theorem 16.
Under the assumptions of Theorem 3, let | ψ ( n ) | s : [ c , d ] R be a R-integrable function and consider ( s , s ) pair of conjugate exponents from [ 1 , ] such that 1 s + 1 s = 1 . Then, we have
| S 1 ( ψ , f , c , d ) w = 0 n 3 n w 2 ( d c ) w ! × ψ ( w + 1 ) ( d ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u d ) w d u ψ ( w + 1 ) ( c ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u c ) w d u | | | ψ ( n ) | | s n 3 ! ( d c ) c d | c d S 1 ( G , j ( . , u ) , f , c , d ) ( u t ) n 3 W c , d ( t , u ) d u | s d t 1 / s .
The constant on the R.H.S. of (47) is sharp for 1 < s and the best possible for s = 1 .
Proof. 
Fix { j = 1 , , 5 }. Let us denote by
I j = 1 n 3 ! ( d c ) c d S 1 ( G , j ( . , u ) , f , c , d ) ( u t ) n 3 W c , d ( t , u ) d u , t [ c , d ] .
Using identity (27), we find
| S 1 ( ψ , f , c , d ) w = 0 n 3 n w 2 ( d c ) w ! × ψ ( w + 1 ) ( d ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u d ) w d u ψ ( w + 1 ) ( c ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u c ) w d u | = c d I j ( t ) ψ ( n ) ( t ) d t .
Applying Hölder’s inequality for integrals on the R. H. S. of (48), we obtain
| c d I j ( t ) ψ ( n ) ( t ) d t | c d ψ n t s d t 1 s c d I j t s d t 1 s ,
which combined together with (48) gives (47).
For sharpness of the constant c d | I j ( t ) | s d t 1 / s let us define the function ψ for which the equality in (47) holds.
For 1 < s let ψ be such that
ψ ( n ) ( t ) = sgn I j ( t ) | I j ( t ) | 1 s 1
and for s = let ψ ( n ) ( t ) = sgn I j ( t ) .
For s = 1 , we shall show that
| c d I j ( t ) ψ ( n ) ( t ) d t | max t [ c , d ] | I j ( t ) | c d ψ ( n ) ( t ) d t
is the best possible inequality. Suppose that | I j ( t ) | attains its maximum at t 0 [ c , d ] . To start with first we assume that I j ( t 0 ) > 0 . For Θ small enough we define ψ Θ ( t ) by
ψ Θ ( t ) = 0 , c t t 0 , 1 Θ n ! ( t t 0 ) n , t o t t 0 + Θ , 1 n ! ( t t 0 ) n 1 , t 0 + Θ t d .
Then for Θ small enough
| c d I j ( t ) ψ ( n ) ( t ) d t | = | t 0 t 0 + Θ I j ( t ) 1 Θ d t | = 1 Θ t 0 t 0 + Θ I j ( t ) d t .
Now from inequality (49), we have
1 Θ t 0 t 0 + Θ I j ( t ) d t I j ( t 0 ) t 0 t 0 + Θ 1 Θ d t = I j ( t 0 ) .
Since
lim Θ 0 1 Θ t 0 t 0 + Θ I j ( t ) d t = I j ( t 0 ) ,
the statement follows. In the case when I j ( t 0 ) < 0 , we define f Θ ( t ) by
ψ Θ ( t ) = 1 n ! ( t t 0 Θ ) n 1 , c t t 0 , 1 Θ n ! ( t t 0 Θ ) n , t o t t 0 + Θ , 0 , t 0 + Θ t d ,
then the rest of the proof is the same as above. □
Remark 3.
Similar bounds of Gr u ¨ ss and Ostrowski-type inequalities can be obtained by using Theorems 6 and 9.

4. Monotonic Steffensen’s-Type Functionals

The notion of ( n + 1 ) -convex function at a point was introduced in [18]. In the current section, we define some linear functionals from the differences of the generalized Steffensen’s-type inequalities. By proving monotonicity of these functionals, we obtain new inequalities which contribute to the theory of more generalized class of functions, i.e., ( n + 1 ) -convex functions at a point. Below is the definition of ( n + 1 ) -convex function at point, see [18].
Definition 3.
Let I R be an interval, ξ I 0 and n N . A function f : I R is said to be ( n + 1 ) -convex at point ξ if there exists a constant K ξ such that the function
F ( x ) = f ( x ) K ξ x n n !
is n-concave on I ( , ξ ] and n-convex on I [ ξ , ) .
Pečarić et al. in [18] studied necessary and sufficient conditions on two linear functionals Ω : C ( [ δ 1 , ξ ] ) R and Γ : C ( [ ξ , δ 2 ] R so that the inequality Ω ( f ) Γ ( f ) holds for every function f that is ( n + 1 ) -convex at point ξ. In this section, we define some linear functionals and obtained certain inequalities associated with these linear functionals. Let n N be even, ψ : [ c , d ] R be n times differentiable function with ψ ( n 1 ) absolutely continuous on [ c , d ] . Let c 1 , c 2 [ c , d ] and ξ ( c , d ) , where c 1 < ξ < c 2 . Let f 1 : [ c 1 , ξ ] R and f 2 : [ ξ , c 2 ] R be increasing with f i ( t ) t for i = 1 , 2 . For j = 1 , 2 , , 5 , we construct:
Ω 1 , j ( ψ ) = S 1 ( ψ , f 1 , c 1 , ξ ) w = 0 n 3 n w 2 ( ξ c 1 ) w ! × ψ ( w + 1 ) ( ξ ) c 1 ξ S 1 ( G , 1 ( . , u ) , f 1 , c 1 , ξ ) ( u ξ ) w d u ψ ( w + 1 ) ( c 1 ) c 1 ξ S 1 ( G , 1 ( . , u ) , f 1 , c 1 , ξ ) ( u c 1 ) w d u
and
Γ 1 , j ( ψ ) = S 1 ( ψ , f 2 , ξ , c 2 ) w = 0 n 3 n w 2 ( c 2 ξ ) w ! × ψ ( w + 1 ) ( c 2 ) ξ c 2 S 1 ( G , 1 ( . , u ) , f 2 , ξ , c 2 ) ( u c 2 ) w d u ψ ( w + 1 ) ( ξ ) ξ c 2 S 1 ( G , 1 ( . , u ) , f 2 , ξ , c 2 ) ( u ξ ) w d u .
Theorem 5 ( a ) enables Γ 1 , j ( ψ ) 0 for j = 1 , 2 , , 5 (and ψ ( 0 ) = 0 for j = 3 ), provided that ψ is n-convex. Furthermore, Theorem 5 ( b ) enables Ω 1 , j ( ψ ) 0 for j = 1 , 2 , , 5 (and f ( 0 ) = 0 for j = 3 ), provided that ψ is n-convex.
Theorem 17.
Let ψ , f 1 , f 2 be as defined above and ψ : [ c , d ] R be ( n + 1 ) -convex at a point ξ for even n > 3 . If Ω 1 , j ( P n ) = Γ 1 , j ( P n ) , for all j = 1 , 2 , , 5 and ψ ( 0 ) = 0 for j = 3 , where P n ( u ) = u n then:
Ω 1 , j ( ψ ) Γ 1 , j ( ψ ) ,
for j = 1 , 2 , , 5 .
Proof. 
Since ψ is ( n + 1 ) -convex, it follows from Definition 3 that there exist K ξ such that Ψ ( u ) = ψ ( u ) K ξ u n n ! is n-concave on [ c 1 , ξ ] and n-convex on [ ξ , c 2 ] . Therefore, for each j = 1 , 2 , , 5 , we have
Ω 1 , j ( ψ ) K ξ n ! Ω 1 , j ( P n ) = Ω 1 , j ( Ψ ) 0 Γ 1 , j ( Ψ ) = Γ 1 , j ( ψ ) K ξ n ! Γ 1 , j ( P n ) .
Since Ω 1 , j ( P n ) = Γ 1 , j ( P n ) , therefore Ω 1 , j ( ψ ) Γ 1 , j ( ψ ) , which completes the proof. □
Remark 4.
We may proceed further by defining linear functionals with the inequalities proved in Theorems 8 and 11. Moreover, by proving monotonicity of new functionals we extend the inequalities in Theorems 8 and 11.

5. Application to Exponentially Convex Functions

We start this section by an important Remark given as:
Remark 5.
By the virtue of Theorem 4 ( a ) , for j = 1 , 2 , , 5 , we define the positive linear functionals with respect to n-convex function ψ as follows
Δ 1 , j ( ψ ) : = S 1 ( ψ , f , c , d ) w = 0 n 3 n w 2 ( d c ) w ! × ψ ( w + 1 ) ( d ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u d ) w d u ψ ( w + 1 ) ( c ) c d S 1 ( G , 1 ( . , u ) , f , c , d ) ( u c ) w d u 0 .
Next we construct the non trivial examples of exponentially convex functions (see [19]) from positive linear functionals Δ 1 , j ( ψ ) for ( j = 1 , 2 , , 5 ).
For this consider the family of real valued functions on [ 0 , ) given as
ψ s ( u ) = u s s ( s 1 ) ( s n + 1 ) , s { 0 , 1 , , n 1 } ; u t ln u ( 1 ) n 1 t t ! ( n 1 t ) ! , s = t { 0 , 1 , , n 1 } .
It is interesting to note that this is a family of n-convex functions as
d n d u n ψ s ( u ) = u s n 0 .
Since s u s n = e ( s n ) ln u is exponentially convex function, therefore the mapping s Δ 1 , j ( ψ s ) is exponential convex and as a special case, it is also log-convex mapping. The log-convexity of this mapping enables us to construct the known Lyapunov inequality given as
Δ 1 , j ( ψ s ) t r Δ 1 , j ( ψ r ) t s Δ 1 , j ( ψ t ) s r
for r , s , t R such that r < s < t where j = 1 , 2 , , 5 .
Remark 6.
We have not given the proof of the above mentioned results (see [19] for details). The Lyapunov inequality empowered us to refine lower (upper) bound for action of the functional on the class of functions given in (53) because if exponentially convex mapping attains zero value at some point it is zero everywhere (see [19]).
One can also consider some other classes of n-convex functions given in the paper [19,20] and can get similar estimations. A similar technique can also be employed by considering the results of Theorems 7 and 10.

6. Conclusions and Outlooks

In this article, we extended the pool of inequalities by proving generalizations of well-known Steffensen’s inequalities and their reverses. The inequalities proved in the main results provide generalizations of the results from [1,4,7,11]. Moreover, Hardy’s inequality is also one of the well-known inequalities. In this article, we also proved generalizations of inequalities, from [1], which are closely related to Hardy’s inequality. We also developed new bounds of Gr u ¨ ss and Ostrowski-type inequalities. Further, the contribution of these inequalities to the theory of ( n + 1 ) -convex functions has been presented by defining functionals from new inequalities and describing their properties. Lastly, new inequalities related to exponentially convex functions and log-convex functions, such as the Lyapunov inequality, have been developed. In the future, it can be investigated whether we can use other interpolations, such as Hermite interpolation, to prove new generalizations of Steffensen’s inequality and related results.

Author Contributions

Supervision, J.P.; Writing original draft, S.I.B.; Writing – review and editing, A.F. and S.I.B.

Funding

The research of S.I.B. was supported by the H.E.C. Pakistan under NRPU project 5327. The research of J.P. was supported by the Ministry of Education and Science of the Russian Federation (the Agreement number No. 02.a03.21.0008).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Fahad, A.; Pečarić, J.; Praljak, M. Generalized Steffensen’s Inequaliy. J. Math. Inequal. 2015, 9, 481–487. [Google Scholar]
  2. Iqbal, S.; Pečarić, J.; Samraiz, M. Hardy-type Inequalities in Quotients Involving Fractional Calculus Operators. J. Math. Anal. 2017, 8, 47–70. [Google Scholar]
  3. Irshad, N.; Khan, A.R. Generalization of Ostrowski Inequality for Differentiable Functions and its Applications to Numerical Quadrature Rules. J. Math. Anal. 2017, 8, 79–102. [Google Scholar]
  4. Rabier, P. Steffensen’s inequality and L1L estimates of weighted integrals. Proc. Am. Math. Soc. 2012, 140, 665–675. [Google Scholar]
  5. Nosheen, A.; Bibi, R.; Pečarić, J. Jensen-Steffensen inequality for diamond integrals, its converse and improvements via Green function and Taylor’s formula. Aequat. Math. 2018, 92, 289–309. [Google Scholar]
  6. Loss, M.; Sloane, C. Hardy inequalities for fractional integrals on general domains. J. Funct. Anal. 2010, 259, 1369–1379. [Google Scholar]
  7. Steffensen, J.F. On certain inequalities between mean values, and their application to actuarial problems. Scand. Actuar. J. 1918, 1, 82–97. [Google Scholar]
  8. Pečarić, J.; Proschan, F.; Tong, Y.L. Convex Functions, Partial Orderings and Statistical Applications; Academic Press: New York, NY, USA, 1992. [Google Scholar]
  9. Pečarić, J.; Smoljak Kalamir, K.; Varošanec, S. Steffensen’s and Related Inequalities (A Comprehensive Survey and Recent Advances); Element: Zagreb, Croatia, 2014. [Google Scholar]
  10. Fahad, A.; Jakšetić, J.; Pečarić, J. On Rabier’s result and nonbounded Montgomery’s identity. Math. Inequal. Appl. 2019, 22, 175–180. [Google Scholar]
  11. Pečarić, J. Connections among some inequalities of Gauss, Steffensen and Ostrowski. Southeast Asian Bull. Math. 1989, 13, 89–91. [Google Scholar]
  12. Hewitt, E.; Stromberg, K. Real and Abstract Analysis, 3rd ed.; Springer: New York, NY, USA, 1975. [Google Scholar]
  13. Fahad, A.; Pečarić, J.; Praljak, M. Hermite Interpolation of composition function and Steffensen-type Inequalities. J. Math. Inequal. 2016, 10, 1051–1062. [Google Scholar]
  14. Fahad, A.; Pečarić, J.; Qureshi, M.I. Generalized Steffensen’s Inequaliy by Lidstone Interpolation and Montgomery Identity. J. Inequal. Appl. 2018, 2018, 237. [Google Scholar]
  15. Mehmood, N.; Agrwal, R.P.; Butt, S.I.; Pečarić, J. New Generalizations of Popoviciu-type inequalities via new Green’s functions and Montgomery identity. J. Inequal. Appl. 2017, 2017, 108. [Google Scholar]
  16. Fink, A.M. Bounds of the deviation of a function from its averages. Czechoslovak Math. 1992, 42, 289–310. [Google Scholar]
  17. Cerone, P.; Dragomir, S.S. Some new Ostrowski-type bounds for the Čebyšev functional and applications. J. Math. Inequal. 2014, 8, 159–170. [Google Scholar]
  18. Pečarić, J.; Praljak, M.; Witkowski, A. Linear operator inequality for n-convex functions at a point. Math. Inequal. Appl. 2015, 18, 1201–1217. [Google Scholar]
  19. Jakšetić, J.; Pečarić, J. Exponential Convexity method. J. Convex Anal. 2013, 20, 181–187. [Google Scholar]
  20. Butt, S.I.; Khan, K.A.; Pečarić, J. Popoviciu Type Inequalities via Green Function and Generalized Montgomery Identity. Math. Inequal. Appl. 2015, 18, 1519–1538. [Google Scholar]

Share and Cite

MDPI and ACS Style

Fahad, A.; Butt, S.I.; Pečarić, J. Generalized Steffensen’s Inequality by Fink’s Identity. Mathematics 2019, 7, 329. https://doi.org/10.3390/math7040329

AMA Style

Fahad A, Butt SI, Pečarić J. Generalized Steffensen’s Inequality by Fink’s Identity. Mathematics. 2019; 7(4):329. https://doi.org/10.3390/math7040329

Chicago/Turabian Style

Fahad, Asfand, Saad Ihsan Butt, and Josip Pečarić. 2019. "Generalized Steffensen’s Inequality by Fink’s Identity" Mathematics 7, no. 4: 329. https://doi.org/10.3390/math7040329

APA Style

Fahad, A., Butt, S. I., & Pečarić, J. (2019). Generalized Steffensen’s Inequality by Fink’s Identity. Mathematics, 7(4), 329. https://doi.org/10.3390/math7040329

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop