Next Article in Journal
Impulsive Effects and Complexity Dynamics in the Anti-Predator Model with IPM Strategies
Next Article in Special Issue
Convolution Properties of Meromorphic P-Valent Functions with Coefficients of Alternating Type Defined Using q-Difference Operator
Previous Article in Journal
Transformer-Based Parameter Estimation in Statistics
Previous Article in Special Issue
Fekete–Szegő and Zalcman Functional Estimates for Subclasses of Alpha-Convex Functions Related to Trigonometric Functions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized n-Polynomial p-Convexity and Related Inequalities

by
Serap Özcan
1 and
Luminiţa-Ioana Cotîrlă
2,*
1
Department of Mathematics, Faculty of Arts and Sciences, Kırklareli University, 39100 Kırklareli, Turkey
2
Department of Mathematics, Technical University of Cluj-Napoca, 400114 Cluj-Napoca, Romania
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(7), 1042; https://doi.org/10.3390/math12071042
Submission received: 26 February 2024 / Revised: 20 March 2024 / Accepted: 27 March 2024 / Published: 30 March 2024
(This article belongs to the Special Issue Current Topics in Geometric Function Theory)

Abstract

:
In this paper, we construct a new class of convex functions, so-called generalized n-polynomial p-convex functions. We investigate their algebraic properties and provide some relationships between these functions and other types of convex functions. We establish Hermite–Hadamard (H–H) inequality for the newly defined class of functions. Additionally, we derive refinements of H–H inequality for functions whose first derivatives in absolute value at certain power are generalized n-polynomial p-convex. When p = 1 , our definition evolves into a new definition for the class of convex functions so-called generalized n-polynomial harmonically convex functions. The results obtained in this study generalize regarding those found in the existing literature. By extending these particular types of inequalities, the objective is to unveil fresh mathematical perspectives, attributes and connections that can enhance the evolution of more resilient mathematical methodologies. This study aids in the progression of mathematical instruments across diverse scientific fields.

1. Introduction

Let   R be an interval. Then, a function Λ : R is said to be convex on if
Λ μ σ + ( 1 μ ) ξ μ Λ σ + 1 μ Λ ξ
holds for all σ , ξ and μ [ 0 , 1 ] .
Convex functions play a fundamental role in the realm of mathematical analysis, offering valuable insights into the principles of optimization, approximation and variational calculus. Their significance extends across a multitude of scientific and engineering disciplines, where they serve as indispensable tools for modeling complex phenomena and solving challenging problems.
The study of convex functions has garnered significant attention in recent decades, with researchers exploring their theoretical foundations, analytical properties and practical implications across various domains. For instance, in the realm of economics, convex functions play a pivotal role in modeling utility functions, production functions and cost functions, providing insights into consumer behavior, market equilibrium and resource allocation [1]. Moreover, convex optimization techniques have been extensively utilized in finance for portfolio optimization, risk management and option pricing, where convexity assumptions underpin many quantitative models [2].
In addition to these traditional applications, convexity concepts have found diverse and innovative applications in emerging fields such as quantum convexity and multiplicative convexity. In quantum information theory, for example, quantum convexity theory provides a framework for understanding the geometry of quantum states and operations, with applications in quantum communication, cryptography and computing [3,4]. Similarly, in the realm of multiplicative calculus, convexity theory offers novel perspectives on the behavior of multiplicative convex functions and their derivatives, leading to applications in various fields of pure and applied sciences [5,6,7,8,9]. In optimization theory, for instance, quasi-convex functions arise naturally in problems involving constraints that are not necessarily convex but possess certain desirable properties, leading to efficient algorithms for solving non-convex optimization problems [10]. Moreover, in image processing and computer vision, pseudo-convex optimization techniques are employed for image denoising, segmentation and reconstruction, leveraging the robustness and stability properties of pseudo-convex functions [11].
Among the pivotal discoveries in convexity theory is H–H inequality, unveiled by C. Hermite and J. Hadamard [12,13]. This inequality stands as one of the cornerstones in the broader framework of convexity and inequalities, contributing significantly to various scientific disciplines. It is stated as follows:
Let Λ : , R be a convex function in for , and < . If Λ L , , then
Λ + 2 1 Λ ( σ ) d σ Λ + Λ ( ) 2 .
In recent years, there has been considerable interest in the generalization of convex functions and H–H inequality. Researchers in this field are focusing on expanding the boundaries of traditional convex functions and related inequalities to discover new mathematical insights and relationships. Various articles published in recent years reflect the increasing interest and research efforts in this area. Some refinements, generalizations and enhancements of convex functions and inequality (2) can be found in recent papers [14,15,16,17,18,19,20,21,22,23]. These examples highlight the growing interest and importance of generalizing convex functions and related inequalities in contemporary mathematical research. By exploring new avenues of generalization, researchers aim to enhance our understanding of fundamental mathematical concepts and develop more powerful analytical tools with applications across various scientific disciplines.

2. Preliminaries

Throughout this study, will denote an interval and j will denote an integer between 1 and n.
Definition 1 
([24]). Let ℵ be an interval and p R 0 . Then, ℵ is called a p-convex set if μ σ p + ( 1 μ ) ξ p 1 p for all σ , ξ ,   p > 0 and μ 0 , 1 .
Definition 2 
([24]). A function Λ : R is said to be p-convex if
Λ μ σ p + ( 1 μ ) ξ p 1 p μ Λ σ + 1 μ Λ ξ
holds for all σ , ξ = , and μ 0 , 1 , where p > 0 .
It is obvious that, for p = 1 ,  p-convexity coincides with the classical convexity on 0 , .
Remark 1. 
An interval ℵ is called a p-convex set if μ σ p + ( 1 μ ) ξ p 1 p for all σ , ξ and μ 0 , 1 , where p = 2 r + 1 or p = s t ,   t = 2 u + 1 ,   s = 2 v + 1 and r , u , v N .
Remark 2. 
Let 0 , be a real interval and p R 0 . Then, μ σ p + ( 1 μ ) ξ p 1 p for all σ , ξ and μ 0 , 1 .
According to Remark 2, in [25], İşcan introduced a different version of p-convexity as follows:
Definition 3. 
Let 0 , be a real interval and p R 0 . A function Λ : R is called p-convex if
Λ μ σ p + ( 1 μ ) ξ p 1 p μ Λ σ + 1 μ Λ ξ
for all σ , ξ and μ 0 , 1 .
Definition 4 
([26]). Let R 0 be an interval. A function Λ : R is called harmonically convex if
Λ σ ξ μ σ + ( 1 μ ) ξ μ Λ ξ + 1 μ Λ σ
holds for all σ , ξ = , and μ 0 , 1 .
Definition 5 
([27]). Let n N . A non-negative function Λ : R is called n-polynomial convex if
Λ μ σ + ( 1 μ ) ξ 1 n j = 1 n 1 ( 1 μ ) j Λ σ + 1 n j = 1 n 1 μ j Λ ξ
for all σ , ξ and μ 0 , 1 .
Definition 6 
([28]). Let n N and 0 , be an interval. A non-negative function Λ : 0 , is called n-polynomial harmonically convex if
Λ σ ξ μ σ + ( 1 μ ) ξ 1 n j = 1 n 1 ( 1 μ ) j Λ ξ + 1 n j = 1 n 1 μ j Λ σ
for all σ , ξ and μ 0 , 1 .
Definition 7 
([29]). Let n N . A non-negative function Λ : R is called n-polynomial p-convex if
Λ μ σ p + ( 1 μ ) ξ p 1 p 1 n j = 1 n 1 ( 1 μ ) j Λ σ + 1 n j = 1 n 1 μ j Λ ξ
for all σ , ξ ,   p > 0 and μ 0 , 1 .
Remark 3. 
For n = 1 and p = 1 , Definition 7 reduces to the definition of classical convexity.
Remark 4. 
For n = 1 and p = 1 , Definition 7 reduces to Definition 4.
Remark 5. 
For p = 1 , Definition 7 reduces to Definition 5.
Remark 6. 
For p = 1 , Definition 7 reduces to Definition 6.
Definition 8 
([30]). Let n N and α j 0   j = 1 , n ¯ such that j = 1 n α j > 0 . A non-negative function Λ : R R is called generalized n-polynomial convex function if, for every σ , ξ and μ 0 , 1 ,
Λ μ σ + ( 1 μ ) ξ j = 1 n α j 1 1 μ j j = 1 n α j Λ σ + j = 1 n α j 1 μ j j = 1 n α j Λ ξ .
We note that every non-negative convex function is also generalized n-polynomial convex function [30].

3. Main Results

In this section, we first introduce the class of generalized n-polynomial p-convex functions and investigate some of their algebraic properties. Following this introduction, we present the H–H inequality for this newly defined class of functions. Subsequently, we establish several refinements of the H–H inequality for this novel generalization.
Definition 9. 
Let n N , α j 0   j = 1 , n ¯ such that j = 1 n α j > 0 and p R 0 . A non-negative function Λ : 0 , R is called generalized n-polynomial p-convex ( G P O L C p ) if for every σ , ξ and μ 0 , 1 ,
Λ μ σ p + ( 1 μ ) ξ p 1 p j = 1 n α j 1 1 μ j j = 1 n α j Λ σ + j = 1 n α j 1 μ j j = 1 n α j Λ ξ .
Remark 7. 
If Λ : 0 , R is a G P O L C p function, then Λ is a non-negative function. Indeed, since Λ is a G P O L C p function, one can write
Λ ( σ ) = Λ μ σ p + ( 1 μ ) σ p 1 p j = 1 n α j 1 1 μ j j = 1 n α j + j = 1 n α j 1 μ j j = 1 n α j Λ σ
for all σ and μ 0 , 1 . Therefore, one has
j = 1 n α j 1 1 μ j j = 1 n α j + j = 1 n α j 1 μ j j = 1 n α j 1 Λ σ 0
for all σ and μ 0 , 1 . But, since
j = 1 n α j 1 1 μ j j = 1 n α j μ and j = 1 n α j 1 μ j j = 1 n α j 1 μ
for all μ 0 , 1 in inequality (9), one can write
j = 1 n α j 1 1 μ j j = 1 n α j + j = 1 n α j 1 μ j j = 1 n α j 1 0 .
So, one obtains Λ ( σ ) 0 for all σ .
Remark 8. 
For n = 1 and p = 1 , Definition 9 reduces to the definition of classical convexity.
Remark 9. 
For α j = 1   j = 1 , n ¯ and p = 1 , Definition 9 reduces to Definition 5.
Remark 10. 
For p = 1 , Definition 9 reduces to Definition 8.
Remark 11. 
For α j = 1   j = 1 , n ¯ , Definition 9 reduces to Definition 7.
Remark 12. 
If one takes p = 1 in Definition 9, then one obtains
Λ σ ξ μ ξ + 1 μ σ j = 1 n α j 1 1 μ j j = 1 n α j Λ σ + j = 1 n α j 1 μ j j = 1 n α j Λ ξ .
Such functions are called generalized n-polynomial harmonically convex functions.
Remark 13. 
For n = 1 , Definition 9 reduces to Definition 3. So, one can say every p-convex function is generalized 1-polynomial p-convex.
Proposition 1. 
Let n N , α j 0   j = 1 , n ¯ such that j = 1 n α j > 0 ,   p R 0 and Λ , Θ : 0 , R be two non-negative G P O L C p functions. Then, the function Λ + Θ is G P O L C p .
Proof. 
Assume Λ and Θ are two G P O L C p functions, and then one has
Λ + Θ μ σ p + ( 1 μ ) ξ p 1 p = Λ μ σ p + ( 1 μ ) ξ p 1 p + Θ μ σ p + ( 1 μ ) ξ p 1 p j = 1 n α j 1 1 μ j j = 1 n α j Λ σ + j = 1 n α j 1 μ j j = 1 n α j Λ ξ + j = 1 n α j 1 1 μ j j = 1 n α j Θ σ + j = 1 n α j 1 μ j j = 1 n α j Θ ξ = j = 1 n α j 1 1 μ j j = 1 n α j Λ + Θ σ + j = 1 n α j 1 μ j j = 1 n α j Λ + Θ ξ
for all σ , ξ and μ 0 , 1 . This shows that Λ + Θ is a G P O L C p function. □
Proposition 2. 
Let n N , α j 0   j = 1 , n ¯ such that j = 1 n α j > 0 ,   p R 0 and Λ : 0 , R be a non-negative G P O L C p function and θ 0 . Then, the function θ Λ : R is a G P O L C p function.
Proof. 
Assume Λ is a G P O L C p function, and then one has
θ Λ μ σ p + ( 1 μ ) ξ p 1 p = θ Λ μ σ p + ( 1 μ ) ξ p 1 p θ j = 1 n α j 1 1 μ j j = 1 n α j Λ σ + j = 1 n α j 1 μ j j = 1 n α j Λ ξ = j = 1 n α j 1 1 μ j j = 1 n α j θ Λ σ + j = 1 n α j 1 μ j j = 1 n α j θ Λ ξ
for all σ , ξ and μ 0 , 1 . This ensures that θ Λ is a G P O L C p function. □
Proposition 3. 
Let n N , α j 0   j = 1 , n ¯ such that j = 1 n α j > 0 ,   p R 0 and the function Λ : 0 , R be non-negative G P O L C p function. Then,
Λ = max Λ k , k = 1 , 2 , , n
is also a G P O L C p function.
Proof. 
Take any σ , ξ and μ 0 , 1 . Denote Λ = max Λ k , where k = 1 , 2 , , n . Then, one obtains
Λ μ σ p + ( 1 μ ) ξ p 1 p = max Λ k μ σ p + ( 1 μ ) ξ p 1 p , k = 1 , 2 , , n = Λ i μ σ p + ( 1 μ ) ξ p 1 p j = 1 n α j 1 1 μ j j = 1 n α j Λ i σ + j = 1 n α j 1 μ j j = 1 n α j Λ i ξ = j = 1 n α j 1 1 μ j j = 1 n α j max Λ k σ + j = 1 n α j 1 μ j j = 1 n α j max Λ k ξ = j = 1 n α j 1 1 μ j j = 1 n α j Λ σ + j = 1 n α j 1 μ j j = 1 n α j Λ ξ ,
which is the desired outcome. □
Proposition 4. 
Let n N , α j 0   j = 1 , n ¯ such that j = 1 n α j > 0 ,   p R 0 and Λ : 0 , R be a non-negative G P O L C p function. Then,
Λ = sup Λ k , k = 1 , 2 , , n
is also a G P O L C p function.
Proof. 
Take any σ , ξ and μ 0 , 1 . Denote Λ = sup Λ k ,   k = 1 , 2 , , n . Then, one obtains
Λ μ σ p + ( 1 μ ) ξ p 1 p = sup Λ k μ σ p + ( 1 μ ) ξ p 1 p , k = 1 , 2 , , n j = 1 n α j 1 1 μ j j = 1 n α j sup Λ k σ + j = 1 n α j 1 μ j j = 1 n α j sup Λ k ξ = j = 1 n α j 1 1 μ j j = 1 n α j Λ σ + j = 1 n α j 1 μ j j = 1 n α j Λ ξ .
This justifies the supremum function is a G P O L C p function. □
Proposition 5. 
Let 0 , be a real interval, p R 0 and Λ : R is a function. Then,
1.
If p 1 and Λ is G P O L C p and non-decreasing function, then Λ is G P O L C p function.
2.
If p 1 and Λ is G P O L C p and non-decreasing function, then Λ is generalized n-polynomial convex function.
3.
If p 1 and Λ is generalized n-polynomial convex and non-decreasing function, then Λ is G P O L C p function.
4.
If p 1 and Λ is G P O L C p and non-decreasing function, then Λ is generalized n-polynomial convex function.
Proof. 
1. If p 1 then,
μ σ p + ( 1 μ ) ξ p 1 p μ σ + ( 1 μ ) ξ .
Also, if the function Λ is non-decreasing and generalized n-polynomial convex, then one has
Λ μ σ p + ( 1 μ ) ξ p 1 p Λ μ σ + ( 1 μ ) ξ j = 1 n α j 1 1 μ j j = 1 n α j Λ σ + j = 1 n α j 1 μ j j = 1 n α j Λ ξ .
So, Λ is a G P O L C p function.
2. If p 1 , then
μ σ p + ( 1 μ ) ξ p 1 p μ σ + ( 1 μ ) ξ .
Also, if the function Λ is non-decreasing and G P O L C p function, then one has
Λ μ σ + ( 1 μ ) ξ Λ μ σ p + ( 1 μ ) ξ p 1 p j = 1 n α j 1 1 μ j j = 1 n α j Λ σ + j = 1 n α j 1 μ j j = 1 n α j Λ ξ .
So, the function Λ is generalized n-polynomial convex.
One can obtain the proof of other items in a similar way. □
Now, we establish a novel generalization of H–H inequality for the G P O L C p function Λ .
Theorem 1. 
Let 0 < < and the function Λ : , R be G P O L C p function. If Λ L , , where p R 0 , then
1 2 j = 1 n α j j = 1 n α j 1 1 2 j Λ p + p 2 1 p p p p Λ σ σ 1 p d σ Λ + Λ ( ) j = 1 n α j j = 1 n α j j j + 1 .
Proof. 
Since Λ is a G P O L C p function, one has
Λ p + p 2 1 p = Λ μ p + ( 1 μ ) p + ( 1 μ ) p + μ p 2 1 p = Λ μ p + ( 1 μ ) p 2 + ( 1 μ ) p + μ p 2 1 p j = 1 n α j 1 1 1 2 j j = 1 n α j Λ μ p + ( 1 μ ) p 1 p + j = 1 n α j 1 1 2 j j = 1 n α j Λ ( 1 μ ) p + μ p 1 p .
Integrating the last inequality with respect to μ 0 , 1 , one obtains
Λ p + p 2 1 p j = 1 n α j 1 1 2 j j = 1 n α j 0 1 Λ μ p + ( 1 μ ) p 1 p d μ + j = 1 n α j 1 1 2 j j = 1 n α j 0 1 Λ ( 1 μ ) p + μ p 1 p d μ = j = 1 n α j 1 1 2 j j = 1 n α j × 0 1 Λ μ p + ( 1 μ ) p 1 p + Λ ( 1 μ ) p + μ p 1 p d μ .
So, one obtains
1 2 j = 1 n α j j = 1 n α j 1 1 2 j Λ p + p 2 1 p 1 p p Λ σ σ 1 p d σ .
On the other hand, one has
p p p Λ σ σ 1 p d σ = 0 1 Λ μ p + ( 1 μ ) p 1 p d μ 0 1 j = 1 n α j 1 1 μ j j = 1 n α j Λ ( ) + j = 1 n α j 1 μ j j = 1 n α j Λ ( ) d μ = Λ ( ) j = 1 n α j j = 1 n α j 0 1 1 ( 1 μ ) j d μ + Λ ( ) j = 1 n α j j = 1 n α j 0 1 1 μ j d μ = Λ ( ) + Λ ( ) j = 1 n α j j = 1 n α j j j + 1 .
This completes the proof. □
Remark 14. 
For n = 1 and p = 1 , inequality (10) reduces to inequality (2) for classical convex functions.
Remark 15. 
If one takes α j = 1   j = 1 , n ¯ and p = 1 in inequality (10), then one obtains H–H inequality for n-polynomial convex functions in ([27], Theorem 4).
Remark 16. 
If one takes p = 1 in inequality (10), then one obtains H–H inequality for generalized n-polynomial convex functions in ([30], Theorem 3.1).
Remark 17. 
If one takes n = 1 in inequality (10), then one obtains H–H inequality for p-convex functions in ([25], Theorem 6).
Remark 18. 
If one takes α j = 1   j = 1 , n ¯ in inequality (10), then one obtains H–H inequality for n-polynomial p-convex functions in ([29], Theorem 4.1).
Corollary 1. 
For p = 1 in Theorem 1, one obtains H–H type inequality for generalized n-polynomial harmonically convex functions as follows:
1 2 j = 1 n α j j = 1 n α j 1 1 2 j Λ 2 + Λ σ σ 2 d σ Λ + Λ ( ) j = 1 n α j j = 1 n α j j j + 1 .
Remark 19. 
If one takes n = 1 in inequality (11), then one obtains H–H inequality for harmonically convex functions in ([26], Theorem 2.4).
Now, we establish new refinements of H–H inequality for functions whose first derivatives in absolute value at certain power are G P O L C p .
Lemma 1 
([20]). Let Λ : = , R R be a differentiable mapping on with < . If Λ L , , then
Λ + Λ ( ) 2 p p p Λ σ σ 1 p d σ = p p 2 p 0 1 ( 1 2 μ ) μ p + ( 1 μ ) p 1 p 1 Λ μ p + ( 1 μ ) p 1 p d μ .
Theorem 2. 
Let Λ : 0 , R be a differentiable function on , , with < ,   p R 0 and Λ L , . If Λ is a generalized n-polynomial p-convex function on , , then for μ 0 , 1 :
Λ + Λ ( ) 2 p p p Λ σ σ 1 p d σ p p 2 p j = 1 n α j j = 1 n α j Λ κ p j + Λ η p j ,
where
κ p j = 0 1 1 2 μ 1 1 μ j μ p + ( 1 μ ) p 1 p 1 d μ
and
η p j = 0 1 1 2 μ 1 μ j μ p + ( 1 μ ) p 1 p 1 d μ .
Proof. 
Using Lemma 1 and the definition G P O L C p function, one obtains
Λ + Λ ( ) 2 p p p Λ σ σ 1 p d σ p p 2 p 0 1 1 2 μ μ p + ( 1 μ ) p 1 p 1 Λ μ p + ( 1 μ ) p 1 p d μ p p 2 p j = 1 n α j Λ 0 1 1 2 μ μ p + ( 1 μ ) p 1 p 1 j = 1 n α j 1 1 μ j d μ + p p 2 p j = 1 n α j Λ 0 1 1 2 μ μ p + ( 1 μ ) p 1 p 1 j = 1 n α j 1 μ j d μ = p p 2 p j = 1 n α j j = 1 n α j Λ κ p j + Λ η p j .
Remark 20. 
For n = 1 and p = 1 , inequality (12) reduces to the inequality in ([31], Theorem 2.2) for classical convex functions.
Remark 21. 
For α j = 1   j = 1 , n ¯ and p = 1 , inequality (12) reduces to the inequality in ([27], Theorem 5) for n-polynomial convex functions.
Remark 22. 
For p = 1 , inequality (10) reduces to the inequality in ([30], Theorem 4.2) for generalized n-polynomial convex functions.
Remark 23. 
For α j = 1   j = 1 , n ¯ , inequality (10) reduces to the inequality in ([29], Theorem 5.2) for n-polynomial p-convex functions.
Corollary 2. 
For p = 1 in Theorem 2, one obtains the following inequality for generalized n-polynomial harmonically convex functions:
Λ + Λ ( ) 2 Λ ( σ ) σ 2 d σ 2 j = 1 n α j j = 1 n α j Λ κ j + Λ η j ,
where
κ j = 0 1 1 2 μ 1 1 μ j μ + ( 1 μ ) 2 d μ ,
η j = 0 1 1 2 μ 1 μ j μ + ( 1 μ ) 2 d μ .
Theorem 3. 
Let Λ : 0 , R be a differentiable function on , , with < , p R 0 ,   q > 1 , 1 r + 1 q = 1 and assume that Λ L , . If Λ q is a G P O L C p function on , ; then, for μ 0 , 1 :
Λ + Λ ( ) 2 p p p Λ σ σ 1 p d σ p p 2 p ϱ p , r 1 r 2 j = 1 n α j j = 1 n α j j j + 1 1 q A 1 q Λ q , Λ q ,
where
ϱ p , r = 0 1 1 2 μ r μ p + ( 1 μ ) p 1 1 p r d μ ,
and A is the arithmetic mean.
Proof. 
Using Lemma 1, the definition of G P O L C p function and Hölder’s integral inequality, one obtains
Λ + Λ ( ) 2 p p p Λ σ σ 1 p d σ p p 2 p 0 1 1 2 μ μ p + ( 1 μ ) p 1 p 1 Λ μ p + ( 1 μ ) p 1 p d μ p p 2 p 0 1 1 2 μ r μ p + ( 1 μ ) p 1 1 p r d μ 1 r × 0 1 Λ μ p + ( 1 μ ) p q d μ 1 q p p 2 p ϱ p , r 1 r Λ q j = 1 n α j j = 1 n α j 0 1 1 1 μ j d μ + Λ q j = 1 n α j j = 1 n α j 0 1 1 μ j d μ 1 q = p p 2 p ϱ p , r 1 r 2 j = 1 n α j j = 1 n α j j j + 1 1 q A 1 q Λ q , Λ q ,
where
0 1 1 1 μ j d μ = 0 1 1 μ j d μ = j j + 1 .
Remark 24. 
For n = 1 and p = 1 , inequality (13) reduces to the inequality in ([31], Theorem 2.3) for classical convex functions.
Remark 25. 
For α j = 1   j = 1 , n ¯ and p = 1 , inequality (13) reduces to the inequality in ([27], Theorem 6) for n-polynomial convex functions.
Remark 26. 
For p = 1 , inequality (13) reduces to the inequality in ([30], Theorem 4.5) for generalized n-polynomial convex functions.
Remark 27. 
For α j = 1   j = 1 , n ¯ , inequality (13) reduces to the inequality in ([29], Theorem 5.7) for n-polynomial p-convex functions.
Corollary 3. 
If one takes p = 1 in Theorem 3, then one obtains the following inequality for generalized n-polynomial harmonically convex functions:
Λ + Λ ( ) 2 Λ ( σ ) σ 2 d σ 2 ϱ r 1 r 2 j = 1 n α j j = 1 n j j + 1 1 q A 1 q Λ q , Λ q ,
where
ϱ r = 0 1 1 2 μ r μ + ( 1 μ ) 2 r d μ .
Theorem 4. 
Let Λ : 0 , R be a differentiable function on , , with < ,   p R 0 ,   q 1 and assume that Λ L , . If Λ q is a G P O L C p function on , ; then, for μ 0 , 1 :
Λ + Λ ( ) 2 p p p Λ σ σ 1 p d σ p p 2 p ϱ p * 1 1 q Λ q j = 1 n α j ω p j + Λ q j = 1 n α j ϖ p j 1 q ,
where
ϱ p * = 0 1 1 2 μ μ p + ( 1 μ ) p 1 1 p d μ ,
ω p j = j = 1 n α j 0 1 1 2 μ 1 ( 1 μ ) j μ p + ( 1 μ ) p 1 1 p d μ ,
ϖ p j = j = 1 n α j 0 1 1 2 μ 1 μ j μ p + ( 1 μ ) p 1 1 p d μ
and A is the arithmetic mean.
Proof. 
Using the definition of G P O L C p function and Lemma 1, one obtains
Λ + Λ ( ) 2 p p p Λ σ σ 1 p d σ p p 2 p 0 1 1 2 μ μ p + ( 1 μ ) p 1 p 1 Λ μ p + ( 1 μ ) p 1 p d μ p p 2 p 0 1 1 2 μ μ p + ( 1 μ ) p 1 1 p d μ 1 1 q × 0 1 1 2 μ μ p + ( 1 μ ) p 1 1 p Λ μ p + ( 1 μ ) p 1 p q d μ 1 q p p 2 p ϱ p * 1 1 q Λ q j = 1 n α j j = 1 n α j 0 1 1 2 μ 1 ( 1 μ ) j μ p + ( 1 μ ) p 1 1 p d μ + Λ q j = 1 n α j j = 1 n α j 0 1 1 2 μ 1 μ j μ p + ( 1 μ ) p 1 1 p d μ 1 q = p p 2 p ϱ p * 1 1 q Λ q j = 1 n α j ω p j + Λ q j = 1 n α j ϖ p j 1 q .
Remark 28. 
For n = 1 and p = 1 , inequality (14) reduces to the inequality in ([32], Theorem 1) for classical convex functions.
Remark 29. 
For α j = 1   j = 1 , n ¯ and p = 1 , inequality (14) reduces to the inequality in ([27], Theorem 7) for n-polynomial convex functions.
Remark 30. 
For p = 1 , inequality (14) reduces to the inequality in ([30], Theorem 4.8) for generalized n-polynomial convex functions.
Remark 31. 
For α j = 1   j = 1 , n ¯ , inequality (14) reduces to the inequality in ([29], Theorem 5.10) for n-polynomial p-convex functions.
Corollary 4. 
For p = 1 in Theorem 4, one obtains the following inequality for generalized n-polynomial harmonically convex functions:
Λ + Λ ( ) 2 Λ σ σ 2 d σ 2 ϱ * 1 1 q Λ q j = 1 n α j ω j + Λ q j = 1 n α j ϖ j 1 q ,
where
ϱ * = 0 1 1 2 μ μ + ( 1 μ ) 2 d μ ,
ω j = 0 1 1 2 μ μ + ( 1 μ ) 2 j = 1 n α j 1 ( 1 μ ) j d μ ,
ϖ j = 0 1 1 2 μ μ + ( 1 μ ) 2 j = 1 n α j 1 μ j d μ .

4. Conclusions

In this work, the class of generalized n-polynomial p-convex functions is introduced and related properties are provided. Relationships between these functions and other kinds of convex functions are provided. New refinements of the well-known Hermite–Hadamard inequality are established. Several special cases have been discussed for the newly obtained results. For some special cases, the definition and results of generalized n-polynomial p-convex functions reduce to a new definition and new results for the class of convex functions, called generalized n-polynomial harmonically convex functions. Our methodology could have additional applications in the realm of convexity theory. It would be intriguing to broaden these discoveries to encompass other forms of convexities documented in the literature. Through the utilization of generalized convexities, novel integral inequalities can be derived. The concepts elucidated in this manuscript aim to inspire researchers with an interest in exploring alternative classes of convex functions and constructing related integral inequalities.

Author Contributions

Conceptualization, S.Ö. and L.-I.C.; Methodology, S.Ö. and L.-I.C.; Validation, S.Ö.; Resources, L.-I.C.; Writing—original draft, S.Ö. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Adams, J. Convex Functions in Economic Modeling. J. Econ. Lit. 2003, 41, 1063–1078. [Google Scholar]
  2. Boyd, S.; Vandenberghe, L. Convex Optimization; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar]
  3. Nielsen, M.A.; Chuang, I.L. Quantum Computation and Quantum Information; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
  4. Wilde, M.M. Quantum convexity theory: Foundations and applications. Quantum Inf. Process. 2017, 16, 72. [Google Scholar]
  5. Guan, K. Multiplicative convexity and its applications. J. Math. Anal. Appl. 2010, 362, 156–166. [Google Scholar] [CrossRef]
  6. Kadakal, H.; Kadakal, M. Multiplicatively preinvex P-Functions. J. Sci. Arts 2023, 23, 21–32. [Google Scholar]
  7. Özcan, S. Hermite-Hadamard type inequalities for exponential type multiplicatively convex functions. Filomat 2023, 37, 9777–9789. [Google Scholar]
  8. Xie, J.; Ali, M.A.; Sitthiwirattham, T. Some new midpoint and trapezoidal type inequalities in multiplicative calculus with applications. Filomat 2023, 37, 6665–6675. [Google Scholar]
  9. Zhang, L.; Peng, Y.; Du, T. On multiplicative Hermite–Hadamard- and Newton-type inequalities for multiplicatively (P, m)-convex functions. J. Math. Anal. Appl. 2024, 534, 128117. [Google Scholar] [CrossRef]
  10. Bertsekas, D.P. Nonlinear Programming; Athena Scientific: Nashua, NH, USA, 1999. [Google Scholar]
  11. Nikolova, M. Pseudo-Convex Optimization Techniques in Image Processing. IEEE Trans. Image Process. 2004, 13, 13–20. [Google Scholar]
  12. Dragomir, S.S.; Pearce, C.E.M. Selected Topics on Hermite-Hadamard Inequalities and Its Applications; RGMIA Monograph, Victoria University: Victoria, Australia, 2002. [Google Scholar]
  13. Hadamard, J. Étude sur les propriétés des fonctions entières en particulier d’une fonction considérée par Riemann. J. Mathiématiques Pures Appliquiées Série 1893, 4, 171–215. [Google Scholar]
  14. Akdemir, A.O.; Butt, S.I.; Nadeem, M.; Ragusa, M.A. Some new integral inequalities for a general variant of polynomial convex functions. AIMS Math. 2022, 7, 20461–20489. [Google Scholar] [CrossRef]
  15. Du, T.; Peng, Y. Hermite–Hadamard type inequalities for multiplicative Riemann–Liouville fractional integrals. J. Comput. Appl. Math. 2024, 440, 115582. [Google Scholar] [CrossRef]
  16. Kadakal, H. Harmonic trigonometrically convexity. Filomat 2023, 37, 8029–8038. [Google Scholar]
  17. Kadakal, H.; Kadakal, M. Strongly hyperbolic type convexity and some new inequalities. J. Sci. Arts 2023, 23, 587–602. [Google Scholar] [CrossRef]
  18. Latif, M.A. Mappings related to Hermite-Hadamard type inequalities for harmonically convex functions. Punjab Univ. J. Math. 2022, 54, 665–678. [Google Scholar] [CrossRef]
  19. Latif, M.A. Hermite–Hadamard-type inequalities for coordinated convex functions using fuzzy integrals. Mathematics 2023, 11, 2432. [Google Scholar] [CrossRef]
  20. Noor, M.A.; Awan, M.U.; Mihai, M.V.; Noor, K.I. Hermite-Hadamard inequalities for differentiable p-convex functions using hypergeometric functions. Publ. L’Institut Math. 2016, 100, 251–257. [Google Scholar] [CrossRef]
  21. Özcan, S. On refinements of some integral inequalities for differentiable prequasiinvex functions. Filomat 2019, 33, 4377–4385. [Google Scholar] [CrossRef]
  22. Xu, L.; Du, T. On the sub-η-n-polynomial convexity and its applications. Ital. J. Pure Appl. Math. 2023, 50, 414–439. [Google Scholar]
  23. Yıldız, Ç.; Valdes, J.E.N.; Cotîrlă, L.-I. A note on the new Ostrowski and Hadamard type inequalities via the Hölder–İşcan inequality. Axioms 2023, 12, 931. [Google Scholar] [CrossRef]
  24. Zhang, K.S.; Wan, J.P. p-convex functions and their properties. Pure Appl. Math. 2007, 23, 130–133. [Google Scholar]
  25. İşcan, İ. Hermite-Hadamard type inequalities for p-convex functions. Int. J. Anal. Appl. 2016, 11, 137–145. [Google Scholar]
  26. İşcan, İ. Hermite-Hadamard type inequalities for harmonically convex functions. Hacet. J. Math. Stat. 2014, 43, 935–942. [Google Scholar] [CrossRef]
  27. Toplu, T.; Kadakal, M.; İşcan, İ. On n-polynomial convexity and some related inequalities. Aims Math. 2020, 5, 1304–1318. [Google Scholar] [CrossRef]
  28. Awan, M.U.; Akhtar, N.; Iftikhar, S.; Noor, M.A.; Chu, Y.-M. New Hermite-Hadamard type inequalities for n-polynomial harmonically convex functions. J. Inequalities Appl. 2020, 2020, 125. [Google Scholar] [CrossRef]
  29. Park, C.; Chu, Y.-M.; Saleem, M.S.; Jahangir, N.; Rehman, N. On n-polynomial p-convex functions and some related inequalities. Adv. Differ. Equ. 2020, 666, 1–12. [Google Scholar] [CrossRef]
  30. Kadakal, M.; İşcan, İ.; Kadakal, H. Construction of a new generalization for n-polynomial convexity with their certain inequalities. Hacet. J. Math. Stat. 2023. [Google Scholar] [CrossRef]
  31. Dragomir, S.S.; Agarwal, R.P. Two inequalities for differentiable mappings and applications to special means of real numbers and to trapezoidal formula. Appl. Math. Lett. 1998, 11, 91–95. [Google Scholar] [CrossRef]
  32. Pearce, C.E.M.; Pecaric, J. Inequalities for differentiable mappings with application to special means and Quadrature formulae. Appl. Math. Lett. 2000, 13, 51–55. [Google Scholar] [CrossRef]
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

Özcan, S.; Cotîrlă, L.-I. Generalized n-Polynomial p-Convexity and Related Inequalities. Mathematics 2024, 12, 1042. https://doi.org/10.3390/math12071042

AMA Style

Özcan S, Cotîrlă L-I. Generalized n-Polynomial p-Convexity and Related Inequalities. Mathematics. 2024; 12(7):1042. https://doi.org/10.3390/math12071042

Chicago/Turabian Style

Özcan, Serap, and Luminiţa-Ioana Cotîrlă. 2024. "Generalized n-Polynomial p-Convexity and Related Inequalities" Mathematics 12, no. 7: 1042. https://doi.org/10.3390/math12071042

APA Style

Özcan, S., & Cotîrlă, L.-I. (2024). Generalized n-Polynomial p-Convexity and Related Inequalities. Mathematics, 12(7), 1042. https://doi.org/10.3390/math12071042

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