Abstract
This paper aims to present a generalized and extended notation of convexity by unifying reciprocally strong convexity with convexity. We introduce the concept of reciprocally strongly convex functions and establish some of their fundamental properties. In addition, we establish various inequalities, including Jensen, Hermite–Hadamard, and Fejér-type inequalities, for this generalized framework. Our findings are an extension of numerous existing results and provide a basis for developing novel methods for generalization in convexity.
1. Introduction
Convex analysis has a rich history, with Hermann Minkowski and Werner Fenchel among the pioneers who studied the geometric features of sets and functions in convexity. In the 1960s, R. Tryll Roker and Jean Joseph M. began the systematic study of convex analysis, and since then, this area of research has gained widespread attention due to its wide range of applications in control systems, estimation, signal processing, data analysis, economics, and more, as evidenced in works such as [1–3]. A real-valued function defined on an interval is said to be convex if, for any and any , we have
However, while classical convexity has proven to be a useful tool in engineering applications, it cannot always solve all problems, necessitating the development of various generalizations of convexity. The notable generalizations are -convexity [4], -convexity [5], -convexity [6], -convexity [7], -convexity [8], -convexity [9], and -convexity [10], among others [11, 12]. For further reading on convex functions and their applications, interested readers may refer to books such as [13–15]. The ongoing research in this field continues to push the boundaries of our understanding of convexity and its practical applications in various domains.
Inequality theory is a branch of mathematics that deals with the study of mathematical inequalities and their properties. This theory plays an important role in many areas of mathematics, including algebra, geometry, analysis, and probability theory. It involves the study of convexity, probability inequalities, and the behavior of inequalities under different operations. The most important inequality is the Hermite–Hadamard inequality, which states that for a convex function defined on the interval , we have
This inequality relates the values of a convex function on an interval to its arithmetic mean. It has important applications in many areas of mathematics, including analysis, geometry, optimization, and probability theory. The inequality is named after the mathematicians Charles Hermite and Jacques Hadamard, who made significant contributions to its development.
The Fejér inequality provides an estimate of the error in approximating a periodic function using its Fourier series. Specifically, the inequality relates the difference between the Fejér sum of order and the original function to the total variation of the function over one period. The Fejér inequality has important applications in many areas of mathematics and engineering, including signal processing, control theory, and partial differential equations. The inequality is named after the Hungarian mathematician Lipót Fejér, who discovered it in 1915, see [16, 17] and references therein.
The inequalities such as Jensen, Hermite–Hadamard, Fejér, and fractional integral inequalities are fundamental results in the field of convexity. These inequalities have significant applications in various areas of mathematics, including optimization, control theory, probability theory, and harmonic analysis. Several generalizations of these inequalities exist in the literature, reflecting their importance and versatility [18, 19]. For instance, the weighted versions of these inequalities, where weights are assigned to the function or its domain, have been studied extensively. Moreover, many recent studies have focused on the development of new inequalities that involve different types of functions or have more complex forms. These advancements in the theory of inequalities demonstrate the ongoing interest and relevance of these results in contemporary mathematics [20, 21].
This paper aims to introduce a novel concept of convexity and to establish Jensen, Hermite–Hadamard, and Fejér-type inequalities for this new notion. Specifically, the paper unifies -convex functions and reciprocally strongly convex functions to introduce the new notion of convexity. This new notion broadens the scope of convex functions and provides a more flexible framework for studying convexity. The established inequalities extend the classical results of convexity and have potential applications in many areas of mathematics, including optimization, analysis, and probability theory. This paper’s contributions demonstrate the importance of exploring new concepts in convexity and the potential benefits that can arise from doing so.
The paper is structured as follows: The Section 2 provides some preliminary material and discusses the basic properties of the new concept of convexity introduced in the paper. In Section 3, the main results are presented, focusing on the reciprocally strongly -convex functions. These results include Jensen, Hermite–Hadamard, and Fejér-type inequalities, which establish the usefulness of the new notion of convexity in extending classical results.
2. Definitions and Basic Results
This section serves as an introduction to the main results of the paper and provides readers with the necessary background information to understand the new concept of convexity and the established inequalities.
Definition 1 (see [22]). Let and let be a nonnegative function such that . A function is said to be -convex if for all and all , we haveThis inequality is similar to the definition of convex functions, except that a nonnegative weight function is introduced. The function controls the degree of convexity of the function . When is constant and equal to 1, the definition reduces to that of convex functions. The concept of -convex functions has applications in various fields, including optimization, economics, and physics. It provides a more flexible framework for studying convexity and can lead to more nuanced analyses of real-world problems.
Definition 2 (see [23]). Let and let be a constant. A function is said to be strongly convex if for all and all , we haveThis inequality requires that the function be more strongly convex than the definition of convexity. The additional term acts as a penalty term that becomes larger when the distance between and increases. The constant controls the degree of strong convexity of the function .
Definition 3 (see [24]). Let and be a nonnegative function with . A function is strongly -convex if for all and , the following inequality holds:In other words, is strongly -convex if it satisfies a generalized form of the convexity property, where the weights given to and are modulated by the function and an additional term involving and the squared difference . This term penalizes larger distances between and and thus promotes stronger convexity.
Definition 4 (see [25]). Let and be a nonempty interval of nonnegative real numbers. A function is -convex in the second sense if for all and , the following inequality holds:In other words, is -convex in the second sense if it satisfies a generalization of the convexity property, where the weights given to and are modulated by the exponent and the interpolation parameter . This property can be interpreted as a degree of concavity of the function with respect to its inputs and can be used to characterize various optimization problems involving nonlinear constraints. The interval is restricted to nonnegative real numbers to ensure that the function is well-defined and nonnegative on its domain.
Definition 5 (see [26]). Let be a nonempty interval, and let be a nonnegative function with . Let be a fixed exponent. A function is -convex if for all and , the following inequality holds:In other words, is -convex if it satisfies a generalization of the convexity property, where the weights given to and are modulated by the function and the exponent . This property can be used to characterize various optimization problems where the objective function is subject to nonlinear constraints represented by the function h. The interval is assumed to be nonempty to ensure that the function is well-defined and the function is nonzero on its domain.
Definition 6 (see [27]). Let be a nonempty interval, and let be a nonnegative function with . Let be a fixed constant, and let be a fixed exponent. A function is strongly -convex with parameter if for all and , the following inequality holds:In other words, is strongly -convex with parameter if it satisfies a generalization of the strongly convexity property, where the weights given to and are modulated by the function and the exponent , and an additional quadratic penalty term is added to the right-hand side of the inequality. The parameter controls the strength of the penalty term, and the interval is assumed to be nonempty to ensure that the function is well-defined and the function is nonzero on its domain. This property can be used to formulate optimization problems with strongly convex objective functions subject to nonlinear constraints represented by the function .
Definition 7 (see [28]). The function is said to be harmonic convex on if it satisfies the following conditions:(1) is continuous on (2)For all such that and , the inequalityholds.
Note that we exclude the points and in the definition, since the expression is not well-defined when or . For a detailed study about harmonic convex, we refer to the readers [29–31] and references therein.
Definition 8. Let the number . The function is reciprocally strongly -convex ifholds for all , , and . The class of all reciprocally strongly -convex is denoted by .
Remark 9. By setting in Definition 8, we obtain a reciprocally -convex function. Moreover, when , we obtain a reciprocally strongly -convex function. Similarly, if we set , , and , we obtain a classical convex function.
If a function is reciprocally strongly -convex, then it is also strongly -convex, but the converse is not always true. In other words, the class of reciprocally strongly -convex functions is a subset of the class of strongly -convex functions.
An example of a function that is strongly -convex but not reciprocally strongly -convex is on with and . To see that is strongly -convex, let and . Then,However, is not reciprocally strongly -convex. Let , , , and . Then,Therefore, is not reciprocally strongly -convex for any choice of , , and .
Proposition 10. If there exist two nonnegative functions and defined on the interval such that for all , then any function that is reciprocally strongly -convex on is also reciprocally strongly -convex on .
Proof. Let be a reciprocally strongly -convex function on . Then for any and , we havewhere the first inequality follows from the fact that is reciprocally strongly -convex, and the second inequality follows from for all . Therefore, is also reciprocally strongly -convex on .
Proposition 11. Assuming , if and are functions defined on and belong to the class of reciprocally strongly convex functions (RS), then the following hold:(1)The function also belongs to RS(2)The function also belongs to RS
Proof. (1)To show that is in RS, let and . Then using the definition of RS for and , we have where . Thus, is in RS.(2)To show that is in RS, let and . Then using the definition of RS for , we havewhere . Thus, is in RS.
3. Main Results
In this section, we establish Jensen, Hermite–Hadamard, and Fejér-type inequalities for functions in the class of reciprocally strongly convex functions.
Theorem 12. Assuming that the function given by is in RS, the following inequality holds for all , with , and :
This inequality can be called as the weighted Jensen inequality for reciprocally strongly -convex functions.
Proof. Take and then , where , such that .
Set and take a functionsupporting at , that is, and , . Then, we havefor every .
Multiply on both sides by and summing up, we obtainSince, equal to zero, then we havewhich completes the proof.
Remark 13. The inequality (16) implies Jensen’s inequality for the class of harmonic-convex functions when , , , and .
In this case, the inequality reduces towhich is Jensen’s inequality for harmonic-convex functions. For a detailed proof, refer to [28].
Proof. Starting from (16), substitute and , and note that and , which giveswhich is equivalent to Jensen’s inequality for harmonic-convex functions.
Theorem 14. Assuming that and , consider a function defined on that belongs to RS. Then, the following inequality holds:
Note that this inequality is valid for any .
Proof. Our proof starts with the fact that be in RS:for each and .
After integrating over [0, 1] with respect to , we obtainFor the left hand side of inequality (23) putting in (10),choosing and .
Since,Thus, the integration of above inequality over [0, 1] with respect to , we haveHence,This completes the proof.
Remark 15. We can derive two important inequalities from (23):(1)Setting and in (23), we obtain Hermite–Hadamard inequality for strongly reciprocally convex functions [32](2)Taking the limit as and setting and in (23), we obtain the Hermite–Hadamard type inequalities for harmonically convex functions [28]Note that the Remarks 13 and 15 (b) concern different types of inequalities and use different approaches to derive them. The Remark 13 concerns Jensen’s inequality for harmonic-convex functions and is derived by setting specific values for the parameters , , and in inequality (16), while the Remark 15 (b) concerns Hermite–Hadamard type inequalities for harmonically convex functions and is derived by taking the limit of inequality (23) as approaches zero and setting and . Both remarks involve using specific properties of harmonic-convex functions, but they result in different types of inequalities.
Theorem 16. Let be a function in the RS class with on . For , consider the function , which is nonnegative, integrable, and symmetric with respect to , satisfying . The weight function is a nonnegative, integrable function that satisfies the following two conditions: symmetry: for all . Nonnegativity: for all . The symmetry condition means that the value of at a point is equal to the value of at the corresponding point . Geometrically, this condition states that if we reflect the point across the vertical line , we get the point , and the weight function must have the same value at both points. Intuitively, the weight function measures how much emphasis to place on different parts of the interval . In the inequalities (30), the weight function is used to give more weight to certain parts of the interval where the function is expected to be more “important” in some sense. The specific form of the weight function in the inequalities is chosen to satisfy the symmetry condition and ensure that the integrals involved are well-defined and finite.
Then, we have the inequality
Proof. Since is reciprocally strongly -convex function, then for , we havefor all , suppose and in above inequality, then we obtainSince, is nonnegative, symmetric, we haveIntegrating above inequalities with respect over [0, 1] and then putting , we obtainAfter simplification, above inequalities becomeFor right hand side of (35), we haveIntegrating the inequality (36) with respect to over [0, 1] and then putting , we obtainAfter simplification, we haveThis completes the proof.
Remark 17. If we set and in (30), we obtain the Fejér-type inequality for strongly reciprocally convex functions [32].
4. Conclusion
Based on the inequalities presented in this paper, we can conclude that they provide useful tools for analyzing and estimating integrals involving various classes of functions. These inequalities have been derived using different techniques and assumptions, but they all share the common feature of providing bounds on the value of an integral in terms of certain properties of the integrand.
Moreover, the inequalities presented in this paper have a wide range of applications in different fields of mathematics and its applications, including analysis, probability theory, and mathematical physics. They can be used to derive various other results, such as inequalities for derivatives, series expansions, and more.
In addition, the paper highlights the importance of the concept of reciprocal convexity and its various generalizations, as they play a crucial role in deriving and establishing these inequalities. The paper also emphasizes the significance of special functions, such as harmonic and logarithmically convex functions, and their properties in the study of inequalities.
Finally, the paper encourages further research in this area, such as the development of new inequalities, the study of their applications in different fields, and the exploration of their connections with other areas of mathematics.
Data Availability
All data required for this research are included within the article.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Authors’ Contributions
During the revision process, Yujun Wang was added as an author and contributed to the study’s conception, design, data analysis, interpretation, manuscript drafting, and critical revisions. Muhammad Shoaib Saleem contributed to data analysis and supervision, while Zahida Perveen contributed to manuscript writing. Muhammad Imran provided the results. All authors have approved the final manuscript and are accountable for the work.
Acknowledgments
This research was funded by the University of Okara, Okara, Pakistan.