Next Article in Journal
Accelerated Spectral Deferred Correction Methods for Nonlinear Space Fractional Partial Differential Equations
Previous Article in Journal
Existence, Stability, and Circular Interactions in m-Cyclic Coupled Systems of Sequential (k,ψ)-Hilfer and (k,ψ)-Caputo Type with Boundary Conditions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Uniformly δ-Geometric Convex Functions

1
Department of Mathematics, Sirjan University of Technology, Sirjan P.O. Box 11155-9415, Iran
2
Department of Mathematics, Faculty of Science, University of Jiroft, Jiroft P.O. Box 78671-61167, Iran
3
Department of Mathematics, Politehnica University of Timisoara, 300006 Timisoara, Romania
*
Authors to whom correspondence should be addressed.
Fractal Fract. 2026, 10(5), 289; https://doi.org/10.3390/fractalfract10050289
Submission received: 21 December 2025 / Revised: 19 April 2026 / Accepted: 20 April 2026 / Published: 24 April 2026
(This article belongs to the Section General Mathematics, Analysis)

Abstract

In this paper, we give some new Jensen, Jensen–Mercer, and Hermite–Hadamard inequalities for uniformly δ -geometric convex functions. In addition, some limit bounds for Caputo–Fabrizio fractional integral operators are established as an application in the case of uniformly δ -geometric convex functions. Some new examples and graphical representations are provided in order to illustrate the validity of our results.

1. Introduction

One of the old concepts of analysis that exists in the geometric shapes used by the ancient Greeks is convexity. But today, it is used in many fields of mathematics, such as probability theory, geometry, graph theory, coding and calculus of variations. In fact, due to the simple and understandable geometric understanding of this concept, it will be easy to analyze. For example, it is easily possible to interpret or recognize a convex function with the help of its graph and its epigraph. Therefore, many researchers today use the concept of convexity to define new functions that simplify their analysis. Convex functions are widely used in optimization theory and can also be used in finance. Convex functions are employed in portfolio optimization to reduce risk while optimizing expected return.
Convex theory and inequalities are closely related and are research fields of interest to many mathematicians, with many articles having been written in these fields. In recent years, some other kinds [1,2,3,4,5] of Hermite–Hadamard- [1,2,3,4], Jensen-, and Jensen–Mercer-type [5,6,7] inequalities have been established [8,9,10,11].
Jensen’s inequality was discovered in the 19th century by Johan Jensen, and later, in 2003, A. M. Mercer provided a significant refinement in [6]. A global bound for Jensen’s inequality was given in 2008 in [12]. In 2009, M. Niezgoda generalized Mercer’s inequality in [13], and in 2006, Pecaric et al. introduced the idea of the Mercer–Jensen inequality for convex operators (see [14]). More applications and generalizations were established for interval-valued functions in last years.
The Jensen–Mercer inequality is a refinement of the classical Jensen inequality for convex functions, with applications in information theory, statistics, operator theory and fractal analysis.
The class of geometrically convex functions and P-geometrically convex functions [15] were used to establish novel Jensen–Mercer and integral inequalities, the results of which generalize some classical inequalities and have interesting applications to numerical inequalities in the case of exponential functions [16].
The Jensen–Mercer inequality (JM) provides tighter bounds for statistical estimates and helps to improve the accuracy of confidence intervals and approximation errors.
Jensen’s inequality for convex functions is the source of Minkowski’s inequality and Holder’s inequality. Jensen’s inequality is connected to the idea of convex functions. For such functions, the inequality asserts that the functional value at the average of a set of points is larger than or equal to the functional value of the average of these points.
These mathematical tools find various applications in diverse fields such as analysis, information theory [17] and Shannon theory [8,9,11]. For some results related to convexity [1,2,3] and Hermite–Hadamard-type inequalities [4,5,6,7], we refer [8,9,10] the reader to see [11,18,19].
Let q : [ a , b ] R be convex on I : = [ a , b ] ; then, the following inequality holds:
q a + b 2 1 b a a b q ( x ) d x q ( a ) + q ( b ) 2 .
Inequality (1) is known in the literature as the Hermite–Hadamard inequality [20,21]. The classical Jensen inequality states that if q is convex on I, then
q i = 1 n p i x i i = 1 n p i q ( x i ) ,
when x i I , and i = 1 n p i = 1 .
Theorem 1
(Mercer’s inequality [6]). If q is a convex function on an interval I : = [ a , b ] , x i I , 1 < i < n and i = 1 n p i = 1 , p i 0 , then
q a + b i = 1 n p i x i + n p i q ( x i ) q ( a ) + q ( b ) .
Many optimization algorithms in machine learning and numerical analysis exploit convexity. A better version of the Jensen–Mercer inequality can improve convergence analysis. Therefore, more refined Jensen–Mercer (JM) bounds ensure us that our calculated divergence is closer to the real value, so more accurate entropy will be found.
This paper is also a new continuation of the study reported in [11], where the Jensen–Mercer inequality was provided for a uniformly convex function. A combination between GA convexity and uniform convexity with modulus but to add a sort of delay ( δ ) is proposed here.
The aim of this paper is to introduce a new class of convex functions, i.e., the class of uniformly δ -geometric convex functions, and to give novel Jensen–Mercer-type inequalities. Several nontrivial examples are given in order to underline the difference between previously defined derived classes of geometric convex functions, geometrically–arithmetically convex functions and uniformly convex functions with their variants. The validations of some results presented here were obtained by graphical representations in particular cases of these examples. The version of software used here was MatlabR2023B. Such Jensen–Mercer-type inequalities are very important and a main tool in fractional calculus and in finding new error bounds for previously established and published results. A new integral inequality is given by using the Caputo–Fabrizio fractional integral operators starting from the inequality of Theorem 3 as an application to fractional calculus. In the future, research can be to extend these Jensen–Mercer-type inequalities in the framework of interval-valued convex functions.

2. Materials and Methods

First, we begin with the following definition:
Definition 1.
Let f : [ a , b ] R be a function and δ < a . Then, f is uniformly δ-geometric convex with modulus ϕ : R 0 [ 0 , + ) if ϕ is increasing, vanishes only at 0, and
f ( x δ ) t ( y δ ) 1 t + δ t f ( x ) + ( 1 t ) f ( y ) t ( 1 t ) ϕ ( | x y | )
for every t [ 0 , 1 ] and x , y [ a , b ] .

3. Results

Theorem 2.
Assume that f is a uniformly δ-geometric convex function on [ a , b ] with modulus ϕ. Also, i = 1 n t i = 1 , 0 t i 1 , and let { x i } i = 1 n be a monotone sequence in [ a , b ] . Then, we have
f Π i = 1 n ( x i δ ) t i + δ i = 1 n t i f ( x i ) i = 1 n 1 t i t i + 1 ϕ ( | x i + 1 x i | ) .
Proof. 
By induction on n, first, if n = 2 , then according to Definition 3, the result is obtained. Now, assume that for n = m , relation (4) holds. We will prove that relation (4) holds for n = m + 1 . Without less than generality, assume that a x 1 x 2 x m + 1 b and i = 1 m + 1 t i = 1 . Since x 1 x 2 x m 1 ( x m δ ) t m t m + t m + 1 ( x m + 1 δ ) t m + 1 t m + t m + 1 + δ , by assumption of induction, we have
I = f Π i = 1 m + 1 ( x i δ ) t i + δ = f Π i = 1 m 1 ( x i δ ) t i × ( x m δ ) t m t m + t m + 1 ( x m + 1 δ ) t m + 1 t m + t m + 1 t m + 1 + t m + δ i = 1 m 1 t i f ( x i ) + ( t m + t m + 1 ) f ( x m δ ) t m t m + t m + 1 ( x m + 1 δ ) t m + 1 t m + t m + 1 + δ t 1 t 2 ϕ ( x 2 x 1 ) t 2 t 3 ϕ ( x 3 x 2 ) t m 2 t m 1 ϕ ( x m 1 x m 2 ) t m 1 ( t m + t m + 1 ) ϕ ( x m δ ) t m t m + t m + 1 ( x m + 1 δ ) t m + 1 t m + t m + 1 x m 1 + δ ,
since f is a uniformly δ -geometric convex function with modulus ϕ . Then,
f ( x m δ ) t m t m + t m + 1 ( x m + 1 δ ) t m + 1 t m + t m + 1 + δ t m t m + t m + 1 f ( x m ) + t m + 1 t m + t m + 1 f ( x m + 1 ) t m t m + 1 ( t m + t m + 1 ) 2 ϕ ( x m + 1 x m ) ,
since
t m t m + 1 ( t m + t m + 1 ) 2 t m t m + 1 t m + t m + 1 .
Now, from (6), we have
f ( x m δ ) t m t m + t m + 1 ( x m + 1 δ ) t m + 1 t m + t m + 1 + δ t m t m + t m + 1 f ( x m ) + t m + 1 t m + t m + 1 f ( x m + 1 ) t m t m + 1 t m + t m + 1 ϕ ( x m + 1 x m ) .
Moreover, using relations (5) and (7), we conclude that
I = f Π i = 1 m + 1 ( x i δ ) t i + δ i = 1 m + 1 t i f ( x i ) i = 1 m 1 t i t i + 1 ϕ ( x i + 1 x i ) t m t m + 1 ϕ ( x m + 1 x m ) t m 1 ( t m + t m + 1 ) ϕ ( x m δ ) t m t m + t m + 1 ( x m + 1 δ ) t m + 1 t m + t m + 1 x m 1 + δ .
Since x m 1 x m x m + 1 , we have
( x m δ ) t m t m + t m + 1 ( x m + 1 δ ) t m + 1 t m + t m + 1 x m + 1 + δ x m x m 1 .
Now, since ϕ is increasing, using relations (8) and (9), we obtain
f Π i = 1 m + 1 ( x i δ ) t i + δ i = 1 m + 1 t i f ( x i ) i = 1 m t i t i + 1 ϕ ( x i + 1 x i ) .
In a similar case for a x n x 1 b , we can prove relation (3), which completes the proof. □
Theorem 3.
Assume that f is a uniformly δ-geometric convex function on [ a , b ] with modulus ϕ and a x b . Then, we obtain
f ( a δ ) ( b δ ) + δ + 1 4 1 / 2 1 / 2 ϕ 2 ( a δ ) ( b δ ) sinh u ln a δ b δ d u 1 ln b δ a δ a b f ( u ) u δ d u f ( a ) + f ( b ) 2 1 6 ϕ ( b a ) .
Proof. 
For all t [ 0 , 1 ] , according to Definition 1, we have
f ( a δ ) t ( b δ ) 1 t + δ t f ( a ) + ( 1 t ) f ( b ) t ( 1 t ) ϕ ( b a ) .
Integrating (10) with respect to t over [ 0 , 1 ] yields
0 1 f ( a δ ) t ( b δ ) 1 t + δ d t f ( a ) + f ( b ) 2 1 6 ϕ ( b a ) .
Now, using the substitution, i.e., u = ( a δ ) t ( b δ ) 1 t + δ , we have
t = ln u δ b δ ln a δ b δ , d t = 1 ln a δ b δ · d u u δ .
Thus,
0 1 f ( a δ ) t ( b δ ) 1 t + δ d t = 1 ln b δ a δ a b f ( u ) u δ d u .
From (11) and (12), we obtain the right-hand side of the inequality.
For the left-hand side, inputting t = 1 2 into Definition 1, we have
f ( ( x δ ) ( y δ ) + δ ) f ( x ) + f ( y ) 2 1 4 ϕ ( | x y | ) .
Now, inputting x = ( a δ ) t ( b δ ) 1 t + δ and y = ( a δ ) 1 t ( b δ ) t + δ in (14), we get
f ( ( a δ ) ( b δ ) + δ ) f ( ( a δ ) t ( b δ ) 1 t + δ ) + f ( ( a δ ) 1 t ( b δ ) t + δ ) 2 1 4 ϕ ( a δ ) t ( b δ ) 1 t ( a δ ) 1 t ( b δ ) t
for all t [ 0 , 1 ] . Finally, by integrating from t = 0 to t = 1 with respect to t, we have
f ( ( a δ ) ( b δ ) + δ ) 1 2 0 1 ( f ( ( a δ ) t ( b δ ) 1 t + δ ) d t + 1 2 0 1 f ( ( a δ ) 1 t ( b δ ) t + δ ) ) d t 1 4 0 1 ϕ ( a δ ) t ( b δ ) 1 t ( a δ ) 1 t ( b δ ) t d t .
Since
0 1 f ( ( a δ ) t ( b δ ) 1 t + δ ) d t = 0 1 f ( ( a δ ) 1 t ( b δ ) t + δ ) ) d t = 1 ln b δ a δ a b f ( u ) u δ d u
and
0 1 ϕ ( a δ ) t ( b δ ) 1 t ( a δ ) 1 t ( b δ ) t d t = 1 / 2 1 / 2 ϕ 2 ( a δ ) ( b δ ) sinh u ln a δ b δ d u ,
we have
f ( ( a δ ) ( b δ ) + 1 4 1 / 2 1 / 2 ϕ 2 ( a δ ) ( b δ ) sinh u ln a δ b δ d u 1 ln b δ a δ a b f ( u ) u δ d u .
Theorem 4.
Assume that f is uniformly δ-geometric convex with modulus ϕ and a x , y b such that ( x δ ) ( y δ ) = ( a δ ) ( b δ ) ; then, we get
f ( x ) f ( a ) + f ( b ) f ( y ) 2 ln x δ b δ ln y δ b δ ln a δ b δ 2 ϕ ( b a ) .
Proof. 
Assume that a x b . Let t [ 0 , 1 ] such that x δ = ( a δ ) t ( b δ ) 1 t so we have
f ( x ) = f ( ( a δ ) t ( b δ ) 1 t + δ ) t f ( a ) + ( 1 t ) f ( b ) t ( 1 t ) ϕ ( b a )
according to the assumption of y δ = ( a δ ) ( b δ ) x δ ; then, y δ = ( a δ ) 1 t ( b δ ) t , so
f ( y ) = f ( ( a δ ) t ( b δ ) 1 t + δ ) t f ( a ) + ( 1 t ) f ( b ) t ( 1 t ) ϕ ( b a ) .
Now, summarizing relations (17) and (18), we obtain
f ( x ) + f ( y ) f ( a ) + f ( b ) 2 t ( 1 t ) ϕ ( b a ) .
Note that using the relation expressed as x δ = ( a δ ) t ( b δ ) 1 t , we obtain t = ln ( x δ b δ ) ln ( a δ b δ ) . Also, using the relation expressed as y δ = ( a δ ) 1 t ( b δ ) t , we obtain 1 t = ln ( y δ b δ ) ln ( a δ b δ ) . Putting t and 1 t in the relation (19), the proof is completed. □
Theorem 5.
Assume that f is a uniformly δ-geometric convex function on [ a , b ] with modulus ϕ. Also, let i = 1 n t i = 1 , 0 t i 1 and { x i } i = 1 n be a monotone sequence in [ a , b ] . Then, we get
f ( a δ ) ( b δ ) Π i = 1 n ( x i δ ) t i + δ f ( a ) + f ( b ) i = 1 n t i f ( x i ) 2 ϕ ( b a ) ln a δ b δ 2 i = 1 n t i ln x i δ b δ ln a δ x i δ i = 1 n 1 t i t i + 1 ϕ ( a δ ) ( b δ ) | x i x i + 1 | ( x i δ ) ( x i + 1 δ ) .
Proof. 
Assume that a x i b . According to Theorem 4, we have
f ( a δ ) ( b δ ) x i δ + δ f ( a ) + f ( b ) f ( x i ) 2 ln ( x i δ b δ ) ln ( a δ x i δ ) ( ln a δ b δ ) 2 ϕ ( b a ) .
Since { x i } i = 1 n is a monotone sequence, { y i = ( a δ ) ( b δ ) x i δ + δ } i = 1 n is also monotone. Using Theorem (3) and that f is uniformly δ -geometric convex, we have
f ( a δ ) ( b δ ) Π i = 1 n ( x i δ ) t i + δ = f Π i = 1 n ( a δ ) ( b δ ) ( x i δ ) t i + δ i = 1 n t i f ( a δ ) ( b δ ) x i δ + δ t 1 t 2 ϕ ( a δ ) ( b δ ) | x 2 x 1 | ( x 1 δ ) ( x 2 δ ) p n 1 p n ϕ ( a δ ) ( b δ ) | x n x n 1 | ( x n δ ) ( x n 1 δ ) .
In view of (21) and (20), we conclude that
f ( a δ ) ( b δ ) Π i = 1 n ( x i δ ) t i + δ i = 1 n t i f ( a ) + f ( b ) f ( x i ) 2 ϕ ( b a ) ln a δ b δ 2 ln x i δ b δ ln a δ x i δ i = 1 n 1 t i t i + 1 ϕ ( a δ ) ( b δ ) | x i + 1 x i | ( x i δ ) ( x i + 1 δ ) = f ( a ) + f ( b ) i = 1 n t i f ( x i ) 2 ϕ ( b a ) ( ln ( a δ b δ ) ) 2 i = 1 n t i ln x i δ b δ ln a δ x i δ i = 1 n 1 t i t i + 1 ϕ ( a δ ) ( b δ ) | x i + 1 x i | ( x i δ ) ( x i + 1 δ )
which completes the proof. □
Several examples will be presented in order to underline the existence and difference between previously defined derived classes of geometric convex functions, geometrically–arithmetically convex functions and uniformly convex functions with their own variants.
Example 1.
Assume that b 1 δ < a < b 1 and ln a + a + 1 δ . Then, f ( x ) = x ln x is a uniformly δ-geometric convex function on ( 0 , 1 ] with a modulus expressed as ϕ ( x ) = ( a k ) ( ln a + a + 1 ) 2 x 2 . In fact, the function expressed as x ln x is increasing on ( 0 , 1 ] , so if 0 < x , y 1 , then | ln x ln y | > | x y | . Also, if ln a + a + 1 δ , then ( a δ ) ( ln a + a δ + 1 ) 2 > 0 . Hence, ϕ is a modulus. Now, let x a , b y . We define g : [ 0 , 1 ] R as
g ( t ) = ( x δ ) t ( y δ ) 1 t + δ ) ln ( ( x δ ) t ( y δ ) 1 t + δ
+ ( a k ) ( ln a + a + 1 ) 2 t ( 1 t ) ( x y ) 2 .
It is easy to see that g ( 0 ) = y ln y , g ( 1 ) = x ln x . Also,
g ( t ) = ln x δ y δ 2 ( x δ ) t ( y δ ) 1 t ( ln ( ( x δ ) t ( y δ ) 1 t + δ ) + ( x δ ) t ( y δ ) 1 t + 1 )
( a δ ) ( ln a + a δ + 1 ) ( x y ) 2 .
Since b 1 δ , 0 x δ , y δ 1 ; therefore, we conclude that | ln ( x δ y δ ) 2 | | x y | 2 . Also,
g ( t ) | x y | 2 ( x δ ) t ( y δ ) 1 t ( ln ( ( x δ ) t ( y δ ) 1 t + δ ) + ( x δ ) t ( y δ ) 1 t + 1 )
( a δ ) ( ln a + a δ + 1 ) ( x y ) 2 0 ;
hence, g ( t ) t x ln x + ( 1 t ) y ln y .
Example 2.
In Example 1, we consider a = 0.3 , δ = 0.02 , b = 1 ; then, the function expressed as x ln x is a uniformly 0.02 -geometric convex function with a modulus of Φ ( x ) = 0.02 x 2 on [ 0.3 , 1 ] .
Theorem 6.
If f is a uniformly δ-geometric convex function on [ a , b ] with a modulus of φ, a x , y b , then we obtain
ψ ( a δ ) ( b δ ) ( x δ ) ( y δ ) + δ + 1 4 ln y δ x δ x δ y δ φ ( a δ ) ( b δ ) ( x δ ) ( y δ ) z 2 ( x δ ) ( y δ ) z 2 d z 1 ln y δ x δ x δ y δ 1 z f ( a δ ) ( b δ ) z + δ d z f ( b ) + f ( a ) f ( x ) + f ( y ) 2 1 6 φ ( a δ ) ( b δ ) | x y | ( x δ ) ( y δ ) φ ( b a ) ln a δ b δ 2 ln x δ b δ ln a δ x δ + ln y δ b δ ln a δ y δ .
Proof. 
Let 0 t 1 . By definition, we deduce that
f ( a δ ) ( b δ ) ( x δ ) ( y δ ) + δ + 1 4 φ ( x δ ) t ( ( y δ ) 1 t ( x δ ) 1 t ( y δ ) t ( x δ ) ( y δ ) 1 2 f ( a δ ) ( b δ ) ( x δ ) t ( y δ ) 1 t + δ + 1 2 f ( a δ ) ( b δ ) ( x δ ) 1 t ( y δ ) t + δ .
Integrating the obtained inequality with respect to t over [ 0 , 1 ] , we obtain the left-hand inequality of (24) because
0 1 ψ ( a δ ) ( b δ ) ( x δ ) t ( y δ ) 1 t + δ d t = 0 1 ψ ( a δ ) ( b δ ) ( x δ ) 1 t ( y δ ) t + δ d t = ln y δ x δ x δ y δ 1 z ψ ( a δ ) ( b δ ) z + δ d z .
To prove the right-hand inequality of (24), according to Theorem ([6], Mercer page 12), we have
f ( ( a δ ) ( b δ ) ( x δ ) t ( y δ ) 1 t + δ f ( a ) + f ( b ) t f ( x ) ( 1 t ) f ( y ) 2 φ ( b a ) [ ln a δ b δ 2 t ln x δ b δ ln a δ x δ 2 φ ( b a ) ln a δ b δ 2 ( 1 t ) ln y δ b δ ln a δ y δ t ( 1 t ) φ ( a δ ) ( b δ ) | x y | ( x δ ) ( y δ ) .
Integrating the above inequality with respect to t over [ 0 , 1 ] gives the right-hand inequality of (24). □
Example 3.
Let 0 < a 1 . Since the function expressed as f ( x ) = ln x x is increasing on [ a , 1 ] , we have ln x ln a x a for all x [ a , 1 ] . Thus, we have
ln x y 2 ( x y ) 2
for all x , y ( 0 , 1 ] .
Example 4.
Let 0 < ϵ < 1 , n > 0 and δ be arbitrary. Then, the function expressed as f ( x ) = ( x δ ) n is uniformly δ-geometric convex on [ ϵ + δ , 1 + δ ] with a modulus of
ϕ ( x ) = n 2 ϵ 2 n 2 x 2 .
Proof. 
Then, we fix x , y [ ϵ + δ , 1 + δ ] and define function F on [ 0 , 1 ] as
F ( t ) = t ( x δ ) n + ( 1 t ) ( y δ ) n ( x δ ) n t ( y δ ) n ( 1 t ) t ( 1 t ) n 2 ϵ 2 n 2 ( x y ) 2 .
We have F ( 0 ) = F ( 1 ) = 0 and
F ( t ) = n 2 ϵ 2 n ( x y ) 2 n 2 ( y δ ) n ln 2 x δ y δ × x δ y δ n t .
According to Example 3, we get
F ( t ) n 2 ϵ 2 n ( x y ) 2 n 2 ( y δ ) n ( x y ) 2 × x δ y δ n t
for all x , y [ ϵ + δ , 1 + δ ] . Since ( y δ ) n ϵ n and x δ y δ n t ϵ n , for every x , y [ ϵ + δ , 1 + δ ] , F ( t ) 0 for all t [ 0 , 1 ] . Therefore, F ( t ) 0 for all t [ 0 , 1 ] ; thus,
( x δ ) n t ( y δ ) n ( 1 t ) t ( x δ ) n + ( 1 t ) ( y δ ) n t ( 1 t ) n 2 ϵ 2 n 2 ( x y ) 2 .
Let 0 < ϵ < 1 , δ < ϵ and n > 0 . Then, the function expressed as f ( x ) = ( x δ ) n is uniformly δ -geometric convex on [ ϵ + δ , 1 + δ ] with modulus ϕ . □
Example 5.
If we choose ϵ = δ = 1 2 in Example 4, then the function expressed as f ( x ) = ( x 1 2 ) n is uniformly 1 2 -geometric convex on [ 1 , 3 2 ] with a modulus of
ϕ ( x ) = n 2 2 2 n + 1 x 2 .
If we chose the function expressed as f ( x ) = x l n ( x ) , which is uniformly δ -geometric convex in the case from Example 2 when δ = 0.02 , a = 0.3 , and b = 1 with Φ ( x ) = 0.02 x 2 on the interval of [ 0.3 , 1 ] , and taking into account the hypothesis of Theorem 4, i.e., that ( x δ ) ( y δ ) = ( a δ ) ( b δ ) , then we get
x ln ( x ) 0.3 ln ( 0.3 ) y ln ( y ) 2.0 , 02 . ( 1 0 , 3 ) 2 ln x 0.02 1 0.02 ln y 0.02 1 0.02 ( ln 0.3 0.02 1 0.02 ) 2
when ( x 0.02 ) ( y 0.02 ) = ( 0.3 0.02 ) ( 1 0.02 ) . Then, the last inequality can be transformed into the following:
x ln ( x ) 0.3 ln ( 0.3 ) ( 0.02 + ( 0.3 0.02 ) ( 1 0.02 ) x 0.02 ) ln ( 0.02 + ( 0.3 0.02 ) ( 1 0.02 ) x 0.02 )
2.0 , 02 . ( 1 0 , 3 ) 2 ln x 0.02 1 0.02 ln ( 0.3 0.02 ) ( 1 0.02 ) ( 1 0.02 ) ( x 0.02 ) ( ln 0.3 0.02 1 0.02 ) 2
Figure 1 graphically represents the left member of this inequality (blue line) and the right member of this inequality (magenta line) considering the interval of [ 0.3 , 1 ] , confirming the validity of the previous inequality. MatlabR2023B software was used throughout this paper.
Now, for Example 5, where f ( x ) = ( x 1 2 ) n , ϵ = δ = 1 2 is 1 2 -geometric convex on [ 1 , 3 2 ] with a modulus of Φ ( x ) = n 2 2 2 n + 1 x 2 and n > 0 , the condition from Theorem 4 under the hypothesis that needs to be satisfied is ( x 1 2 ) ( y 1 2 ) = ( 1 1 2 ) ( 3 2 1 2 ) . Thus, the inequality from Theorem 4 becomes
( x 1 2 ) n 1 2 n + 1 1 ( 2 x 1 ) n n 2 2 4 n ln ( x 1 2 ) ln ( 1 2 x 1 ) ( ln ( 2 ) ) 2 .
We now consider the same interval [ 1 , 3 2 ] for the two variables (x and n) for 3D graphical representations of the left and right members of the previous inequality in order to check the validity of Theorem 4. This graphical representation is presented in Figure 2a. It can be seen that the left member, which is represented as a green surface, is below the right member, which is represented as a red surface. In Figure 2b, the same graphics are given but rotated.

4. Applications to Some Fractional Integrals

In this section, some new integral inequalities are given by using the Caputo–Fabrizio fractional integral operators starting from Theorem 3.
Definition 2
([22,23]). Let 0 < Φ < Ω and F H 1 ( Φ , Ω ) (Sobolev space) for all ρ [ 0 , 1 ] , where β ( ρ ) > 0 is a normalized function with β ( 0 ) = β ( 1 ) = 1 ; then, left and right Caputo–Fabrizio fractional integrals are defined respectively as follows:
I ρ F Φ C F ( z ) = 1 ρ β ( ρ ) F ( z ) + ρ β ( ρ ) Φ z F ( γ ) d γ
when z > Φ and
I Ω ρ F C F ( z ) = 1 ρ β ( ρ ) F ( z ) + ρ β ( ρ ) z Ω F ( γ ) d γ ,
when z < Ω .
Theorem 7.
Assume that f on [ a , b ] is a uniformly δ-geometric convex function with modulus ϕ, 0 < a < b , and f H 1 ( a , b ) for all ρ [ 0 , 1 ] , where β ( ρ ) > 0 is a normalized function with β ( 0 ) = β ( 1 ) = 1 ; then, we have
I ρ f a C F ( b ) 1 ρ β ( ρ ) f ( b ) + ρ β ( ρ ) { f ( b ) ( b δ ) f ( a ) ( a δ ) + b a ln ( a δ b δ ) [ f ( b ) f ( a ) ]
+ Φ ( b a ) ( ln ( a δ b δ ) ) 2 [ 2 ( b a ) + ( a + b 2 δ ) ln ( a δ b δ ) ] }
and
ρ β ( ρ ) { ( b a ) f ( ( a δ ) ( b δ ) + δ ) + 1 4 a b Φ ( u δ ( a δ ) ( b δ ) u δ ) d u }
1 2 [ I ρ f a C F ( b ) 1 ρ β ( ρ ) f ( b ) + ρ β ( ρ ) a b f ( a δ ) ( b δ ) u δ + δ d u ] .
Proof. 
Here, we consider inequality (3) multiplied by ( a δ ) t ( b δ ) 1 t ; then, we integrate the obtained inequality with respect to t over [ 0 , 1 ] and obtain
0 1 ( a δ ) t ( b δ ) 1 t f ( ( a δ ) t ( b δ ) 1 t + δ ) d t 0 1 ( a δ ) t ( b δ ) 1 t [ t f ( a ) + ( 1 t ) f ( b ) t ( 1 t ) Φ ( b a ) ] d t .
By using v = ( a δ ) t ( b δ ) 1 t + δ , we obtain
a b f ( v ) d v 1 ln ( a δ b δ ) f ( a ) a b ln ( v δ b δ ) d v + f ( b ) a b 1 ln ( v δ b δ ) ln ( a δ b δ ) d v Φ ( b a ) a b ln ( v δ b δ ) ln ( a δ b δ ) 1 ln ( v δ b δ ) ln ( a δ b δ ) d v .
Now, multiplying the previous expression by ρ β ( ρ ) , by calculus, we get
I ρ f a C F ( b ) 1 ρ β ( ρ ) f ( b ) ρ β ( ρ ) { f ( a ) 1 ln ( a δ b δ ) a b ln ( v δ b δ ) d v + f ( b ) [ ( b a ) 1 ln ( a δ b δ ) a b ln ( v δ b δ ) d v ] Φ ( b a ) 1 ln a δ b δ 2 a b ln ( v δ b δ ) ln ( a δ b δ ln ( v δ b δ ) d v } ,
or
I ρ f a C F ( b ) 1 ρ β ( ρ ) f ( b ) ρ β ( ρ ) { f ( a ) 1 ln ( a δ b δ ) I + f ( b ) [ ( b a ) 1 ln ( a δ b δ ) I ] Φ ( b a ) 1 ln a δ b δ 2 [ ln ( a δ b δ I J ] } ,
where I = a b ln ( v δ b δ ) d v and J = a b ln ( v δ b δ ) 2 d v . After calculus, we get the following:
I ρ f a C F ( b ) 1 ρ β ( ρ ) f ( b ) ρ β ( ρ ) { f ( b ) ( b δ ) f ( a ) ( a δ ) + b a ln ( a δ b δ ) [ f ( b ) f ( a ) ]
+ Φ ( b a ) ( ln ( a δ b δ ) ) 2 [ 2 ( b a ) + ( a + b 2 δ ) ln ( a δ b δ ) ] } ,
which gives inequality (25).
For the second inequality, we also take t = 1 2 in (3), obtaining
f ( ( x δ ) ( y δ ) + δ ) f ( x ) + f ( y ) 2 1 4 Φ ( | x y | ) .
Now, considering in previous relation, x = ( a δ ) t ( b δ ) 1 t + δ , and y = ( a δ ) 1 t ( b δ ) t + δ , we conclude that
f ( ( a δ ) ( b δ ) + δ ) f ( ( a δ ) t ( b δ ) 1 t + δ ) + f ( ( a δ ) 1 t ( b δ ) t + δ ) 2 1 4 Φ ( | ( a δ ) t ( b δ ) 1 t ( a δ ) 1 t ( b δ ) t | ) ,
and from here, by multiplication with ( a δ ) t ( b δ ) 1 t and integration from 0 to 1 with respect to t, we get
f ( ( a δ ) ( b δ ) + δ ) 0 1 ( a δ ) t ( b δ ) 1 t d t 0 1 ( a δ ) t ( b δ ) 1 t f ( ( a δ ) t ( b δ ) 1 t + δ ) + f ( ( a δ ) 1 t ( b δ ) t + δ ) 2 d t 1 4 0 1 ( a δ ) t ( b δ ) 1 t Φ ( | ( a δ ) t ( b δ ) 1 t ( a δ ) 1 t ( b δ ) t | ) d t ,
After calculus, we find
( b a ) f ( ( a δ ) ( b δ ) + δ ) 1 2 [ a b f ( u ) d u + a b f ( ( a δ ) ( b δ ) u δ + δ ) d u ] 1 4 a b Φ ( | ( u δ ( b δ ) ( a δ ) u δ | ) d u ,
and by multiplication with ρ β ( ρ ) , we obtain
ρ β ( ρ ) { ( b a ) f ( ( a δ ) ( b δ ) + δ ) + 1 4 a b Φ ( u δ ( a δ ) ( b δ ) u δ ) d u }
1 2 [ I ρ f a C F ( b ) 1 ρ β ( ρ ) f ( b ) + ρ β ( ρ ) a b f ( a δ ) ( b δ ) u δ + δ d u ] .

5. Discussion and Conclusions

The aim of this paper is to introduce a new class of convex functions, i.e., the class of uniformly δ -geometric convex functions, and to give novel Jensen–Mercer-type inequalities.
Several nontrivial examples were given in order to underline the difference between previously defined derived classes of geometric convex functions, geometrically–arithmetically convex functions and uniformly convex functions with their variants. The graphic representations presented for these examples also confirm the validity of these results. Such Jensen–Mercer-type inequalities are very important and a main tool in fractional calculus and in finding new error bounds for previously established and published results.
Future research could be conducted to extend these Jensen–Mercer-type inequalities within the framework of interval-valued convex functions.

Author Contributions

Conceptualization, Y.S. and H.B.; methodology, Y.S. and H.B.; software, H.B. and L.C.; validation, Y.S., H.B. and L.C.; formal analysis, Y.S., H.B., and L.C.; investigation, H.B. and L.C.; resources, H.B. and L.C.; data curation, Y.S.; writing—original draft preparation, Y.S., H.B. and L.C.; writing—review and editing, H.B. and L.C.; visualization, Y.S., H.B. and L.C.; supervision, Y.S., H.B. and L.C.; project administration, Y.S. and H.B.; funding acquisition, H.B. and L.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding authors.

Acknowledgments

The authors have reviewed and edited the output and take full responsibility for the content of this publication.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Barsam, H.; Sattarzadeh, A.R. Hermite-Hadamard inequalities for uniformly convex functions and its applications in means. Miskolc Math. Notes 2020, 21, 621–830. [Google Scholar] [CrossRef]
  2. Barsam, H.; Sayyari, Y. On some inequalities of differentiable uniformly convex mapping with applications. Numer. Funct. Anal. Optim. 2023, 44, 368–381. [Google Scholar] [CrossRef]
  3. Dragomir, S.S. Inequalities of Jensen type for HA-convex functions. An. Univ. Oradea Fasc. Mat. 2020, 27, 103–124. [Google Scholar]
  4. Işcan, I. Jensen–Mercer inequality for GA-convex functions and some related inequalities. J. Inequal. Appl. 2020, 2020, 212. [Google Scholar] [CrossRef]
  5. Niculescu, C.P. Convexity according to the geometric mean. Math. Inequal. Appl. 2000, 3, 155–167. [Google Scholar] [CrossRef]
  6. Mercer, A.M. A variant of Jensen’s inequality. J. Inequal. Pure Appl. Math. 2003, 4, 2. [Google Scholar]
  7. Niculescu, C.P. Convexity according to means. Math. Inequal. Appl. 2003, 6, 571–580. [Google Scholar] [CrossRef]
  8. Noor, M.A.; Noor, K.I.; Awan, M.U. Some inequalities for geometrically-arithmetically h-convex functions. Creat. Math. Inform. 2014, 23, 91–98. [Google Scholar] [CrossRef]
  9. Sayyari, Y. A refinement of the Jensen-Simic-Mercer inequality with applications to entropy. J. Korean Soc. Math. Educ. B Pure Appl. Math. 2022, 29, 51–57. [Google Scholar]
  10. Valdes, J.E.N.; Rabossi, F.; Samaniego, A.D. Convex functions: Ariadne’s thread or Charlottes’s spiderweb? Adv. Math. Model. Appl. 2020, 5, 176–191. [Google Scholar]
  11. Sayyari, Y.; Barsam, H. Jensen-Mercer inequality for uniformly convex functions with some applications. Afr. Mat. 2023, 34, 38. [Google Scholar] [CrossRef]
  12. Simic, S. On a global bound for Jensen’s inequality. J. Math. Anal. Appl. 2008, 343, 414–419. [Google Scholar] [CrossRef]
  13. Niezgoda, M. A generalization of Mercer’s result on convex functions. Nonlinear Anal. 2009, 71, 2771–2779. [Google Scholar] [CrossRef]
  14. Matkovic, A.; Pecaric, J.; Peric, I. A variant of Jensen’s inequality of Mercer type for operators with applications. Linear Algebra Appl. 2006, 418, 551–564. [Google Scholar] [CrossRef]
  15. Wang, S.H.; Liu, Q.; Qi, F. On P-geometrically convex sets and functions. J. Appl. Anal. Comput. 2026, 16, 1963–1977. [Google Scholar] [CrossRef]
  16. Furuichi, S.; Minculete, N.; Moradi, H.R.; Sababeh, M. Some new properties of geometrically-convex functions. Quaest. Math. 2024, 47, 831–849. [Google Scholar] [CrossRef]
  17. Fahad, A.; Wang, Y.; Ali, Z.; Hussain, R.; Furuichi, S. Exploring properties and inequalities for geometrically arithmetically -Cr-convex functions with Cr-order relative entropy. Inf. Sci. 2024, 662, 120219. [Google Scholar] [CrossRef]
  18. Sayyari, Y. New entropy bounds via uniformly convex functions. Chaos Solitons Fract. 2020, 141, 110360. [Google Scholar] [CrossRef]
  19. Taghavi, A.; Darvish, V.; Azimi, R.T. Hermite-Hadamard type inequalities for operator geometrically convex functions II. Kragujev. J. Math. 2021, 45, 115–125. [Google Scholar] [CrossRef]
  20. Hadamard, J. Etude sur les proprietes des founctions entieres et en particulier d’une fonction consideree par Riemann. J. Math. Purees Appl. 1893, 58, 171–215. [Google Scholar]
  21. Hermite, C. Sur deux limits d-une integrale definite. Mathesis 1883, 3, 82. [Google Scholar]
  22. Munir, A.; Kashuri, A. Analysis On Simpson’s Type Inequalities Through Generalized Convexity with Applications. Sahand Commun. Math. Anal. 2026, 23, 61–83. [Google Scholar]
  23. Caputo, M.; Fabrizio, M. On the singular kernels for fractional derivatives. Some applications to partial differential equations. Progr. Fract. Differ. Appl. 2021, 7, 1–4. [Google Scholar]
Figure 1. 2D graphical representation for the left member (blue line) and the right member (magenta line) of the inequality from Theorem 4 in the case of the following function: f ( x ) = x l n ( x ) , δ = 0.02 , a = 0.3 , b = 1 , with Φ ( x ) = 0.02 x 2 on the interval [ 0.3 , 1 ] .
Figure 1. 2D graphical representation for the left member (blue line) and the right member (magenta line) of the inequality from Theorem 4 in the case of the following function: f ( x ) = x l n ( x ) , δ = 0.02 , a = 0.3 , b = 1 , with Φ ( x ) = 0.02 x 2 on the interval [ 0.3 , 1 ] .
Fractalfract 10 00289 g001
Figure 2. (a) 3D graphical representation for the left member (green surface) and the right member (red surface) of the inequality from Theorem 4 in the case with the following functions and parameters: f ( x ) = ( x 1 2 ) n , ϵ = δ = 1 2 , a = 1 , b = 3 2 , Φ ( x ) = n 2 2 2 n + 1 x 2 , and n [ 1 , 3 2 ] . (b) The same representation as (a) but rotated.
Figure 2. (a) 3D graphical representation for the left member (green surface) and the right member (red surface) of the inequality from Theorem 4 in the case with the following functions and parameters: f ( x ) = ( x 1 2 ) n , ϵ = δ = 1 2 , a = 1 , b = 3 2 , Φ ( x ) = n 2 2 2 n + 1 x 2 , and n [ 1 , 3 2 ] . (b) The same representation as (a) but rotated.
Fractalfract 10 00289 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Sayyari, Y.; Barsam, H.; Ciurdariu, L. On Uniformly δ-Geometric Convex Functions. Fractal Fract. 2026, 10, 289. https://doi.org/10.3390/fractalfract10050289

AMA Style

Sayyari Y, Barsam H, Ciurdariu L. On Uniformly δ-Geometric Convex Functions. Fractal and Fractional. 2026; 10(5):289. https://doi.org/10.3390/fractalfract10050289

Chicago/Turabian Style

Sayyari, Yamin, Hasan Barsam, and Loredana Ciurdariu. 2026. "On Uniformly δ-Geometric Convex Functions" Fractal and Fractional 10, no. 5: 289. https://doi.org/10.3390/fractalfract10050289

APA Style

Sayyari, Y., Barsam, H., & Ciurdariu, L. (2026). On Uniformly δ-Geometric Convex Functions. Fractal and Fractional, 10(5), 289. https://doi.org/10.3390/fractalfract10050289

Article Metrics

Back to TopTop