Next Article in Journal
A Fast Integration Method of Analysis and Optimization for the Contact Performance Design of a Face Gear Split-Torque Transmission
Previous Article in Journal
Buoyant Convective Thermal Transport in a Discretely Heated–Cooled Porous Parallelogrammic Configuration Saturated with Nanofluids: A Tiwari and Das Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some New Boole-Type Inequalities via Modified Convex Functions with Their Applications and Computational Analysis

1
School of Science, Walailak University, Nakhon Si Thammarat 80160, Thailand
2
Research Center for Theoretical Simulation and Applied Research in Bioscience and Sensing, Walailak University, Nakhon Si Thammarat 80160, Thailand
3
School of Mathematical Sciences, Ministry of Education, Key Laboratory for NSLSCS, Nanjing Normal University, Nanjing 210023, China
4
Department of Information Technology, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
5
School of Mathematics, Hohai University, Nanjing 210098, China
6
Department of Mathematics, Politehnica University of Timișoara, 300006 Timișoara, Romania
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(21), 3517; https://doi.org/10.3390/math13213517
Submission received: 17 September 2025 / Revised: 28 October 2025 / Accepted: 29 October 2025 / Published: 3 November 2025

Abstract

In numerical analysis, the Boole’s formula serves as a pivotal tool for approximating definite integrals. The approximation of the definite integrals has a big role in numerical methods for differential equations; in particular, in the finite volume method, we need to use the best approximation of the integrals to obtain better results. This paper presents a rigorous proof of integral inequalities for first-time differentiable s-convex functions in the second sense. This paper has two main goals. The first is that the use of s-convex function extends the results for convex functions which cover a large class of functions and the second is the best approximation. To prove the main inequalities, we drive integral identity for differentiable functions. Then, with the help of this identity, we prove the error bounds of Boole’s formula for differentiable s-convex functions in the second sense. Some new midpoint-type inequalities for generalized convex functions are also given which can help us in finding better error bounds for midpoint integration formulas compared to the existing ones. Moreover, we provide some applications to quadrature formulas and special means for the real numbers of these newly established inequalities. Furthermore, we present numerical examples and computational analysis that show that these newly established inequalities are numerically valid.

1. Introduction

The concept of numerical integration was formally introduced in 1915 in a publication titled A Course in Interpolation and Numerical Integration for the Mathematical Laboratory by David Gibb [1]. In recent decades, numerical integration has become an essential component of scientific computing, engineering, and data analysis. The term quadrature is a traditional mathematical expression for finding areas. By constructing various interpolating polynomials, a broad class of quadrature rules can be derived. One of the simplest methods assumes the interpolating function to be constant (a zero-degree polynomial), known as the midpoint or rectangle rule. When the interpolating function is linear, the corresponding method is called the trapezoidal rule. If the interpolating polynomial is of the second degree, the resulting method is Simpson’s rule, named after mathematician Thomas Simpson (1710–1761), whose simplest form is known as Simpson’s 1 / 3 rule.
To achieve higher accuracy with smaller error bounds, a more advanced form known as the Boole rule is used, also known as Simpson’s 2 / 45 or third Simpson rule. Named after George Boole, this method extends Simpson’s approach by using a higher-degree polynomial, thereby providing improved precision in the numerical approximation of integrals.
g h Y ω d ω = 2 h 45 7 Y g + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y h + E Y .
where E Y is an error term. To know more about numerical integration and its applications one can refer to [2]. The error bound for Boole’s rule approximation is described as
E Y = 8 h g 8 945 M , Y ( v i ) ω M .
Convexity is a property of a function where any line segment joining two points on its graph will always lie above or on the graph. Convexity plays a vital role in calculus, optimization, and mathematical analysis. Additional results and related inequalities for convex functions are discussed in [3,4,5,6]. The formal definition is as follows:
Definition 1
([7]). A function Y : g , h R R is said to be convex if
Y ( μ g + ( 1 μ ) h ) μ Y ( g ) + ( 1 μ ) Y ( h ) ,
for each value of μ 0 , 1 .
Convex functions are involved in important mathematical inequalities known as Hermite–Hadamard-type inequalities, which are expressed as
Theorem 1.
For a convex function Y : g , h R R + the interval g , h . Then, we have
Y g + h 2 1 h g g h Y ω d ω Y g + Y h 2 .
The aforementioned inequalities likewise apply to concave functions, although they work in the other way. Kirmaci [8] introduced the following midpoint-type inequality along with its error bounds for differentiable convex mappings, one of which is as follows:
Theorem 2.
Let Y : g , h R R be a differentiable mapping on g , h ; then, we have
1 h g g h Y ω d ω Y g + h 2 h g 8 Y g + Y h .
In the literature, a Simpson-type inequality is outlined as follows:
Theorem 3.
Let Y : g , h R R be a four-times differentiable mapping on g , h ; then, we have
1 6 Y g + 4 Y g + h 2 + Y h 1 h g g h Y ω d ω h g ( 4 ) 2880 Y 4 ,
where Y ( 4 ) = sup ω g , h Y 4 ω < .
The study of error bounds for numerical quadrature formulas has attracted considerable attention in the literature. In their pioneering work, Dragomir and Agarwal [9] extended the classical inequality and obtained sharp estimates for the error term of the trapezoidal rule when the integrand is assumed to be a differentiable convex function. Building upon this framework, Kirmaci [8] focused on the midpoint rule and established corresponding error bounds under the same convexity setting. These initial contributions opened up a new direction for research, encouraging many scholars to investigate error estimates for various quadrature rules under broader assumptions and by means of different analytical tools. Subsequently, Alomari and Dragomir [10,11] considered the Simpson formula and derived error bounds not only for convex functions but also for the wider class of generalized convex functions. Their work also highlighted some practical applications, which emphasized the utility of such results. Parallel to these studies, other authors extended Simpson-type inequalities to multivariate settings. For example, in [12,13], the error bounds for Simpson’s rule were analyzed for functions of two variables, thereby enriching the scope of quadrature error analysis in higher dimensions. Furthermore, Du [14] utilized a general form of convexity in order to establish new estimates for Simpson’s formula, broadening the applicability of such inequalities beyond the standard convex case.
In a more comprehensive sense, a variety of fundamental inequalities, including those of a Hermite–Hadamard, Ostrowski, midpoint, Simpson, and trapezoidal type, provide the theoretical basis for deriving error bounds of integration formulas. Numerous results of this nature can be found in the works of [15,16,17,18,19,20], where these classical inequalities are employed as essential tools to analyze and refine the accuracy of numerical integration methods.
In 1979, Breckner introduced the notion of generalized convex functions [21], marking a substantial advancement in the field of mathematical analysis. This work was later expanded upon by Hudzik and collaborators [22], who investigated the concept of s-convexity in the first sense. Pycia [23] subsequently provided rigorous demonstrations of Breckner’s propositions in 2001. Analytical investigations have established that for a parameter s ( 0 , 1 ) , the condition of s-convexity in the second sense imposes a more restrictive and potent constraint than classical convexity, frequently producing sharper and more refined results. Furthermore, this framework provides a natural generalization of conventional convex functions, as the standard case is recovered by setting s = 1 . The class is formally characterized in the following manner:
Definition 2
([22]). Let Y : 0 , R + R be s-convex function in the second sense if
Y ( μ g + 1 μ h ) μ s Y g + 1 μ s Y h , g , h 0 , , μ 0 , 1 ,
for s 0 , 1 . When s = 1 in the above-outlined inequality (4), then we obtained inequality (1).
In [24], the Hermite–Hadamard inequality for s-convex functions is stated as
Theorem 4.
If Y : 0 , 0 , is an s-convex function in the second sense, where 0 < s < 1 , let g , h 0 , , g < h . If Y L 1 g , h , then the following inequality holds:
2 s 1 Y g + h 2 1 h g g h Y ω d ω Y g + Y h s + 1 .
Refer to [25,26,27,28,29,30,31,32] for more recent results and insights regarding Hadamard’s inequality.
The main motivation for using s-convexity is that it broadens the class of admissible functions for which integral inequalities can be established. Many functions that fail to satisfy the classical convexity condition may still satisfy the s-convexity condition for some s ( 0 , 1 ) . This makes it possible to derive more general and sharper inequalities that depend on the parameter s. The key advantages of employing s-convexity are summarized as follows:
  • It provides a unified framework that includes the classical convex case as a special instance when s = 1 ;
  • The parameter s offers flexibility to obtain sharper and more refined inequality bounds;
  • It allows the extension of classical results such as Hermite–Hadamard-, Simpson-, and Boole-type inequalities and other Newton–Cotes formulae-type inequalities to a broader class of functions;
  • The derived inequalities often yield improved error bounds in numerical integration and approximation theory.
Motivated by recent studies, a new identity for differentiable mappings based on generalized convexity is established. This identity is then used to derive Boole-type inequalities for differentiable convex functions, along with their applications. Numerical examples are presented to illustrate the validity of the results. This generalization unifies previous results and deepens the understanding of Boole-type inequalities for numerical integration and error estimation.
The structure of the paper is as follows. Section 2 presents the main results for differentiable s-convex functions in the second sense. Applications to numerical integration and special means are given in Section 3. Section 4 provides computational examples illustrating the new inequalities. Concluding remarks with future directions are given in Section 5.

2. Boole-Type Inequality for Modified Convex Function

We rely on the following Lemma to establish our main theorems for s- convex functions.
Lemma 1.
Consider Y : [ g , h ] R to be a differentiable function whose derivative is continuous ( g , h ) and Y L 1 [ g , h ] . Then, the subsequent equality is satisfied:
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω = h g 16 0 1 μ 28 90 Y 4 μ 4 g + μ 4 h d μ + 0 1 μ 44 60 Y 3 μ 4 g + 1 + μ 4 h d μ + 0 1 μ 24 90 Y 2 μ 4 g + 2 + μ 4 h d μ + 0 1 μ 62 90 Y 1 μ 4 g + 3 + μ 4 h d μ .
Proof. 
By considering the basic rules of integration, we have
I 1 = 0 1 μ 28 90 Y 4 μ 4 g + μ 4 h d μ = 4 μ 28 90 Y 4 μ 4 g + μ 4 h h g 0 1 4 h g 0 1 Y 4 μ 4 g + μ 4 h d μ = 4 h g 62 90 Y 3 g + h 4 + 28 90 Y ( g ) 4 h g 0 1 Y 4 μ 4 g + μ 4 h d μ .
Similarly,
I 2 = 0 1 μ 44 60 Y 3 μ 4 g + 1 + μ 4 h d μ = 4 h g 44 60 Y 3 g + h 4 + 16 90 Y g + h 2 4 h g 0 1 Y 3 μ 4 g + 1 + μ 4 h d μ ,
I 3 = 0 1 μ 24 90 Y 2 μ 4 g + 2 + μ 4 h d μ = 4 h g 66 90 Y g + 3 h 4 + 24 90 Y ( g + h 2 ) 4 h g 0 1 Y 2 μ 4 g + 2 + μ 4 h d μ ,
and
I 4 = 0 1 μ 62 90 Y 1 μ 4 g + 3 + μ 4 h d μ = 4 h g 28 90 Y h + 62 90 Y g + 3 h 4 4 h g 0 1 Y 1 μ 4 g + 3 + μ 4 h d μ .
Thus, we obtain following equality by adding (6) and (9) and a change in variable ω = 4 μ 4 g + μ 4 h .
h g 16 I 1 + I 2 + I 3 + I 4 = 1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω .
The desired equality is obtained. □
Theorem 5.
Assume that the premises established in Lemma 1 are fulfilled. If Y is s-convex on g , h , for some fixed s 0 , 1 , then the following inequality holds:
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω ( h g ) 16 2 1 2 s 45 s + 2 ( s + 1 ) ( s + 2 ) 45 s + 1 3 s + 1 + 7 4 s + 1 1 s 19 4 s + 2 45 s + 1 47 45 s + 1 133 135 s + 1 + 14 s + 2 + 78 s + 2 90 s + 2 + 102 s + 2 + 166 s + 2 Y ( g ) + Y ( h ) .
Proof. 
From Lemma 1 and taking the modulus, we obtain
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω h g 16 0 1 μ 28 90 Y 4 μ 4 g + μ 4 h d μ + 0 1 μ 44 60 Y 3 μ 4 g + 1 + μ 4 h d μ + 0 1 μ 24 90 Y 2 μ 4 g + 2 + μ 4 h d μ + 0 1 μ 62 90 Y 1 μ 4 g + 3 + μ 4 h d μ = h g 16 0 1 μ 28 90 Y 4 μ 4 g + 1 4 μ 4 h d μ + 0 1 μ 44 60 Y 3 μ 4 g + 1 3 μ 4 h d μ + 0 1 μ 24 90 Y 2 μ 4 g + 1 2 μ 4 h d μ + 0 1 μ 62 90 Y 1 μ 4 g + 1 1 μ 4 h d μ .
Now, using the s-convexity of Y in the second sense, we have
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 32 Y g + 3 h 4 + 7 Y ( h ) + 12 Y g + h 2 1 h g g h Y ( ω ) d ω h g 16 0 1 μ 28 90 4 μ 4 s d μ Y g + 0 1 μ 28 90 1 4 μ 4 s d μ | Y ( h ) | + 0 1 μ 44 60 3 μ 4 s d μ Y g + 0 1 μ 44 60 1 3 μ 4 s d μ | Y ( h ) | + 0 1 μ 24 90 2 μ 4 s d μ Y g + 0 1 μ 24 90 1 2 μ 4 s d μ | Y ( h ) | + 0 1 μ 62 90 1 μ 4 s d μ Y g + 0 1 μ 62 90 1 1 μ 4 s d μ | Y ( h ) | = h g 16 0 1 μ 28 90 4 μ 4 s d μ + 0 1 μ 44 60 3 μ 4 s d μ + 0 1 μ 24 90 2 μ 4 s d μ + 0 1 μ 62 90 1 μ 4 s d μ Y g + 0 1 μ 28 90 1 4 μ 4 s d μ + 0 1 μ 44 60 1 3 μ 4 s d μ + 0 1 μ 24 90 1 2 μ 4 s d μ + 0 1 μ 62 90 1 1 μ 4 s d μ | Y ( h ) | .
Here, we used the following equalities:
E 1 s = 0 1 μ 28 90 4 μ 4 s d μ = 0 28 90 28 90 μ 4 μ 4 s d μ + 28 90 1 μ 28 90 4 μ 4 s d μ = 4 s 45 s 2 45 s + 1 2 2 s + 3 ( 7 s 76 ) 3 s + 1 ( 31 s + 197 ) + 2 s + 3 83 s + 2 ( s + 1 ) ( s + 2 ) , E 2 s = 0 1 μ 62 90 1 1 μ 4 s d μ = 4 s 45 s 2 45 s + 1 2 2 s + 3 ( 7 s 76 ) 3 s + 1 ( 31 s + 197 ) + 2 s + 3 83 s + 2 ( s + 1 ) ( s + 2 ) , E 3 s = 0 1 μ 44 60 3 μ 4 s d μ = 4 s 15 s 2 2 s + 3 17 s + 2 15 s + 1 2 s + 2 ( 2 s + 19 ) + 3 s + 1 ( 23 11 s ) ( s + 1 ) ( s + 2 ) , E 4 s = 0 1 μ 24 90 1 2 μ 4 s d μ = 4 s 15 s 2 2 s + 3 17 s + 2 15 s + 1 2 s + 2 ( 2 s + 19 ) + 3 s + 1 ( 23 11 s ) ( s + 1 ) ( s + 2 ) , E 5 s = 0 1 μ 24 90 2 μ 4 s d μ = 4 s 15 s 2 15 s + 1 11 s + 2 s + 2 ( 2 s 11 ) 37 + 2 s + 3 13 s + 2 ( s + 1 ) ( s + 2 ) , E 6 s = 0 1 μ 44 60 1 3 μ 4 s d μ = 4 s 15 s 2 15 s + 1 11 s + 2 s + 2 ( 2 s 11 ) 37 + 2 s + 3 13 s + 2 ( s + 1 ) ( s + 2 ) , E 7 s = 0 1 μ 62 90 1 μ 4 s d μ = 4 s 45 s 2 45 s + 1 ( 31 s + 17 ) + 2 s + 3 7 s + 2 ( s + 1 ) ( s + 2 ) , E 8 s = 0 1 μ 28 90 1 4 μ 4 s d μ = 4 s 45 s 2 45 s + 1 ( 31 s + 17 ) + 2 s + 3 7 s + 2 ( s + 1 ) ( s + 2 ) .
Putting the above calculations into inequality (11), we then obtain
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω ( h g ) 16 2 1 2 s 45 s + 2 ( s + 1 ) ( s + 2 ) 45 s + 1 3 s + 1 + 7 4 s + 1 1 s 19 4 s + 2 45 s + 1 47 45 s + 1 133 135 s + 1 + 14 s + 2 + 78 s + 2 90 s + 2 + 102 s + 2 + 166 s + 2 Y ( g ) + Y ( h ) .
Thus, the proof of Theorem 5 has been finalized. □
Corollary 1.
By setting s = 1 in Theorem 5, the following inequality holds:
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω 239 ( h g ) 6480 Y ( g ) + Y ( h ) .
Corollary 2.
In Theorem 5, if Y ( g ) = Y g + h 2 = Y 3 g + h 4 = Y g + 3 h 4 = Y ( h ) , then we have the following new midpoint-type inequality for the s-convex function:
Y g + h 2 1 h g g h Y ( ω ) d ω ( h g ) 16 2 1 2 s 45 s + 2 ( s + 1 ) ( s + 2 ) 45 s + 1 3 s + 1 + 7 4 s + 1 1 s 19 4 s + 2 45 s + 1 47 45 s + 1 133 135 s + 1 + 14 s + 2 + 78 s + 2 90 s + 2 + 102 s + 2 + 166 s + 2 Y ( g ) + Y ( h ) .
Corollary 3.
By setting s = 1 in Corollary 2, we obtain
Y g + h 2 1 h g g h Y ( ω ) d ω 239 ( h g ) 6480 Y ( g ) + Y ( h ) .
Remark 1.
We observe that the inequality (13) gave better bounds for the midpoint compared to the inequality (3).
Theorem 6.
Assume that the premises established in Lemma 1 are fulfilled. If Y q is s-convex on g , h , for some fixed s 0 , 1 and p , q > 1 , then the following inequality holds:
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω h g 16 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 4 3 1 + s 4 s 1 + s Y g q + 4 s 1 + s Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 4 s 3 1 + s 2 1 + s 1 + s Y g q + 4 s 2 1 + s 1 1 + s Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 4 s 2 1 + s 1 1 + s Y g q + 4 s 3 1 + s 2 1 + s 1 + s Y h q 1 q + 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 4 s 1 + s Y g q + 4 3 1 + s 4 s 1 + s Y h q 1 q ,
where p 1 + q 1 = 1 .
Proof. 
From Lemma 1, and using Hölder’s inequality, we have
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω h g 16 0 1 μ 28 90 Y 4 μ 4 g + μ 4 h d μ + 0 1 μ 44 60 Y 3 μ 4 g + 1 + μ 4 h d μ + 0 1 μ 24 90 Y 2 μ 4 g + 2 + μ 4 h d μ + 0 1 μ 62 90 Y 1 μ 4 g + 3 + μ 4 h d μ h g 16 0 1 μ 28 90 p d μ 1 p 0 1 Y 4 μ 4 g + μ 4 h q d μ 1 q + 0 1 μ 44 60 p d μ 1 p 0 1 Y 3 μ 4 g + 1 + μ 4 h q d μ 1 q + 0 1 μ 24 90 p d μ 1 p 0 1 Y 2 μ 4 g + 2 + μ 4 h q d μ 1 q + 0 1 μ 62 90 p d μ 1 p 0 1 Y 1 μ 4 g + 3 + μ 4 h q d μ 1 q .
Because Y q is s-convex, we have
0 1 Y 4 μ 4 g + μ 4 h q d μ 0 1 4 μ 4 s d μ Y g q + 0 1 μ 4 s d μ Y h q 4 3 1 + s 4 s 1 + s Y g q + 4 s 1 + s Y h q .
Similarly,
0 1 Y 3 μ 4 g + 1 + μ 4 h q d μ 4 s 3 1 + s 2 1 + s 1 + s Y g q + 4 s 2 1 + s 1 1 + s Y h q ,
0 1 Y 2 μ 4 g + 2 + μ 4 h q d μ 4 s 2 1 + s 1 1 + s Y g q + 4 s 3 1 + s 2 1 + s 1 + s Y h q ,
and
0 1 Y 1 μ 4 g + 3 + μ 4 h q d μ 4 s 1 + s Y g q + 4 3 1 + s 4 s 1 + s Y h q .
By a simple computation, we obtain
(20) 0 1 μ 28 90 p d μ 0 28 90 28 90 μ p d μ + 28 90 1 μ 28 90 p d μ = 14 45 1 + p + 31 45 1 + p 1 + p , (21) 0 1 μ 62 90 p d μ = 14 45 1 + p + 31 45 1 + p 1 + p , (22) 0 1 μ 44 60 p d μ = 15 1 p 4 1 + p + 11 1 + p 1 + p , (23) 0 1 μ 24 90 p d μ = 15 1 p 4 1 + p + 11 1 + p 1 + p .
Substituting (16)–(23) into (15), we then obtain
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω h g 16 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 4 3 1 + s 4 s 1 + s Y g q + 4 s 1 + s Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 4 s 3 1 + s 2 1 + s 1 + s Y g q + 4 s 2 1 + s 1 1 + s Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 4 s 2 1 + s 1 1 + s Y g q + 4 s 3 1 + s 2 1 + s 1 + s Y h q 1 q + 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 4 s 1 + s Y g q + 4 3 1 + s 4 s 1 + s Y h q 1 q .
The demonstration of Theorem 6 has then been finalized. □
Corollary 4.
Setting s = 1 in Theorem 6, we have
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω h g 16 1 8 1 q 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 7 Y g q + Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 5 Y g q + 3 Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 3 Y g q + 5 Y h q 1 q + 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p Y g q + 7 Y h q 1 q .
The new midpoint-type inequality in terms of the first derivative is observed in the following result:
Corollary 5.
In Theorem 6, if Y ( g ) = Y g + h 2 = Y 3 g + h 4 = Y g + 3 h 4 = Y ( h ) , then we have the following midpoint-type inequality for the s-convex function:
Y g + h 2 1 h g g h Y ( ω ) d ω h g 16 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 4 3 1 + s 4 s 1 + s Y g q + 4 s 1 + s Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 4 s 3 1 + s 2 1 + s 1 + s Y g q + 4 s 2 1 + s 1 1 + s Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 4 s 2 1 + s 1 1 + s Y g q + 4 s 3 1 + s 2 1 + s 1 + s Y h q 1 q + 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 4 s 1 + s Y g q + 4 3 1 + s 4 s 1 + s Y h q 1 q .
Corollary 6.
In Corollary 5, setting s = 1 , we have
Y g + h 2 1 h g g h Y ( ω ) d ω h g 16 1 8 1 q 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 7 Y g q + Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 5 Y g q + 3 Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 3 Y g q + 5 Y h q 1 q + 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p Y g q + 7 Y h q 1 q .
Theorem 7.
Assume that the premises established in Lemma 1 are fulfilled. If Y q is s-convex on g , h , for some fixed s 0 , 1 and q 1 , then the following inequality holds:
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω h g 16 1157 4050 1 1 q E 1 s Y ( g ) q + E 8 s Y ( h ) q 1 q + 137 450 1 1 q E 3 s Y ( g ) q + E 6 s Y ( h ) q 1 q + 137 450 1 1 q E 5 s Y ( g ) q + E 4 s Y ( h ) q 1 q + 1157 4050 1 1 q E 7 s Y ( g ) q + E 2 s Y ( h ) q 1 q .
Proof. 
From Lemma 1, and using power mean inequality, we have
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω h g 16 0 1 μ 28 90 Y 4 μ 4 g + μ 4 h d μ + 0 1 μ 44 60 Y 3 μ 4 g + 1 + μ 4 h d μ + 0 1 μ 24 90 Y 2 μ 4 g + 2 + μ 4 h d μ + 0 1 μ 62 90 Y 1 μ 4 g + 3 + μ 4 h d μ h g 16 0 1 μ 28 90 d μ 1 1 q 0 1 μ 28 90 Y 4 μ 4 g + μ 4 h q d μ 1 q + 0 1 μ 44 60 d μ 1 1 q 0 1 μ 44 60 Y 3 μ 4 g + 1 + μ 4 h q d μ 1 q + 0 1 μ 24 90 d μ 1 1 q 0 1 μ 24 90 Y 2 μ 4 g + 2 + μ 4 h q d μ 1 q + 0 1 μ 62 90 d μ 1 1 q 0 1 μ 62 90 Y 1 μ 4 g + 3 + μ 4 h q d μ 1 q .
Since Y q is s-convex on the interval [ g , h ] , we have
0 1 μ 28 90 Y 4 μ 4 g + μ 4 h q d μ 0 1 μ 28 90 4 μ 4 s d μ Y ( g ) q + 0 1 μ 28 90 1 4 μ 4 s d μ Y ( h ) q = E 1 s Y ( g ) q + E 8 s Y ( h ) q ,
0 1 μ 44 90 Y 3 μ 4 g + 1 + μ 4 h q d μ 0 1 μ 44 60 3 μ 4 s d μ Y ( g ) q + 0 1 μ 44 60 1 3 μ 4 s d μ Y ( h ) q = E 3 s Y ( g ) q + E 6 s Y ( h ) q ,
0 1 μ 24 90 Y 2 μ 4 g + 2 + μ 4 h q d μ 0 1 μ 24 90 2 μ 4 s d μ Y ( g ) q + 0 1 μ 24 90 1 2 μ 4 s d μ Y ( h ) q = E 5 s Y ( g ) q + E 4 s Y ( h ) q ,
and
0 1 μ 62 90 Y 1 μ 4 g + 3 + μ 4 h q d μ 0 1 μ 62 90 1 μ 4 s d μ Y ( g ) q + 0 1 μ 62 90 1 1 μ 4 s d μ Y ( h ) q = E 7 s Y ( g ) q + E 2 s Y ( h ) q .
Here, we used the following equalities:
0 1 μ 28 90 d μ = 1157 4050 = 0 1 μ 62 90 d μ , and 0 1 μ 44 60 d μ = 137 450 = 0 1 μ 24 90 d μ .
Using (26) to (29) in (25), then we obtain the required result. Thus, the proof of Theorem 7 is completed. □

3. Applications

This section presents several applications of the newly established results to numerical quadrature formulas.

3.1. Application to Quadrature Formulas

Consider a partition Υ of the interval [ g , h ] , defined by Υ : g = ω 0 < ω 1 < < ω n = h , and let h j = ω j + 1 ω j . The associated Boole’s quadrature formula is given by
S ( Y , Υ ) = j = 0 n 1 h j 90 7 Y ( ω j ) + 12 Y ω j + ω j + 1 2 + 32 Y 3 ω j + ω j + 1 4 + 32 Y ω j + 3 ω j + 1 4 + 7 Y ( ω j + 1 ) .
The classical error analysis for this quadrature rule states that if Y C 6 [ g , h ] , then the integral can be expressed as
I = g h Y ( μ ) d μ = S ( Y , Υ ) + R B ( Y , Υ ) ,
with the remainder term satisfying the error bound
| R B ( Y , Υ ) | 239 6480 Y ( 6 ) j = 0 n 1 h j 7 ,
where Y ( 6 ) = max ω [ g , h ] | Y ( 6 ) ( ω ) | . We note that the bound (32) is proportional to Y ( 6 ) , as required for the dimensional consistency and linearity of the error functional.
However, this classical error estimate is inapplicable if Y lacks a sixth derivative or if Y ( 6 ) is unbounded. The following propositions provide alternative error bounds for the remainder term R B ( Y , Υ ) based on properties of the first derivative.
Proposition 1.
Assume the conditions of Lemma 1 hold. If Y is convex on [ g , h ] , then for any partition Υ of [ g , h ] , the following inequality holds:
| R B ( Y , Υ ) | 239 6480 j = 0 n 1 ( ω j + 1 ω j ) 2 Y ( ω j ) + Y ( ω j + 1 ) .
Proof. 
Applying Corollary 1 to each subinterval [ ω j , ω j + 1 ] for j = 0 , 1 , 2 , , n 1 yields:
ω j + 1 ω j 90 7 Y ( ω j ) + 32 Y 3 ω j + ω j + 1 4 + 12 Y ω j + ω j + 1 2 + 32 Y ω j + 3 ω j + 1 4 + 7 Y ( ω j + 1 ) ω j ω j + 1 Y ( ω ) d ω 239 ( ω j + 1 ω j ) 2 6480 Y ( ω j ) + Y ( ω j + 1 ) .
Summing the inequality (34) over all subintervals and employing the triangle inequality, together with the convexity of | Y | , we obtain
S ( Y , Υ ) g h Y ( μ ) d μ 239 6480 j = 0 n 1 ( ω j + 1 ω j ) 2 Y ( ω j ) + Y ( ω j + 1 ) ,
which completes the proof. □
Remark 2.
One can similarly derive an approximation based on Theorems 6 and 7, respectively; the details are omitted for brevity and are left to the interested reader.

3.2. Application to the Midpoint Formula

Consider a partition Υ of the interval [ g , h ] , defined by Υ : g = ω 0 < ω 1 < ω 2 < < ω n = h . The composite midpoint rule for numerical integration is given by
M ( Y , Υ ) = j = 0 n 1 ( ω j + 1 ω j ) Y ω j + ω j + 1 2 .
A standard result states that if Y : [ g , h ] R is a twice-differentiable function, such that its second derivative Y exists on ( g , h ) and is bounded, i.e., K = max ω ( g , h ) | Y ( ω ) | < , then the integral can be expressed as
I = g h Y ( μ ) d μ = M ( Y , Υ ) + R M ( Y , Υ ) ,
where the error term R M ( Y , Υ ) satisfies the bound
| R M ( Y , Υ ) | K 24 j = 0 n 1 ( ω j + 1 ω j ) 3 .
This classical error estimate requires the existence and boundedness of the second derivative. The following result provides an alternative error bound for the remainder term R M ( Y , Υ ) in terms of the first derivative, offering an improvement over previous results in certain contexts.
Proposition 2.
Assume that the conditions of Lemma 1 are satisfied. If | Y | is a convex function on [ g , h ] , then for any partition Υ of [ g , h ] , the following inequality holds:
| R M ( Y , Υ ) | 1 8 j = 0 n 1 ( ω j + 1 ω j ) 2 Y ( ω j ) + Y ( ω j + 1 ) .
Proof. 
Applying Corollary 3 to each subinterval [ ω j , ω j + 1 ] for j = 0 , 1 , 2 , , n 1 yields the following local error estimate:
( ω j + 1 ω j ) Y ω j + ω j + 1 2 ω j ω j + 1 Y ( ω ) d ω 1 8 ( ω j + 1 ω j ) 2 Y ( ω j ) + Y ( ω j + 1 ) .
Summing the inequality (39) over all subintervals and applying the triangle inequality, we obtain the global error bound:
| R M ( Y , Υ ) | = j = 0 n 1 ( ω j + 1 ω j ) Y ω j + ω j + 1 2 ω j ω j + 1 Y ( ω ) d ω j = 0 n 1 ( ω j + 1 ω j ) Y ω j + ω j + 1 2 ω j ω j + 1 Y ( ω ) d ω 1 8 j = 0 n 1 ( ω j + 1 ω j ) 2 Y ( ω j ) + Y ( ω j + 1 ) ,
which completes the proof. □
Remark 3.
The estimations for midpoint-type inequality given in this work provided better bounds compared to the estimation proved in [8].

3.3. Application to Special Means

Let s 0 , 1 and u 1 , u 2 , u 3 R . We define a function Y : 0 , R as
Y μ = u 1 , μ = 0 ; u 2 μ s + u 3 , μ > 0 .
If u 2 0 and 0 u 3 u 1 , then Y K s 2 (see [22]). Hence, for u 1 = u 3 = 0 and u 2 = 1 , we have a function Y : [ g , h ] R defined by Y ( u ) = u s , which belongs to K s 2 .
In [22], the following result is given. Let Y : I 1 R + be a non-decreasing and s-convex function on I 1 , and let G : J I 2 I 1 be a non-negative convex function on J. Then the composition Y G is s-convex on J.
A direct result of the previous finding can be stated as follows:
Corollary 7.
Suppose G : I I 1 0 , is a non-negative convex function on I, then G s t is s-convex on 0 , , 0 < s < 1 .
We shall consider the following special means. For arbitrary real numbers g , h , , h n ( g h ), we have the following:
The arithmetic mean: A = A ( g , h , , h n ) = g + h + + h n n .
The harmonic mean: H = H ( g , h ) = 2 1 g + 1 h , g , h > 0 .
The logarithm mean: L = L ( g , h ) = h g ln h ln g , g h , g , h R + .
The p-logarithmic mean: L p ( g , h ) = h p + 1 + g p + 1 ( p + 1 ) ( h g ) 1 p , g , h > 0 , g h and p R { 1 , 0 } . It is well-known that L p is monotonic non-decreasing over p R , with L 1 : = L and L 0 : = I . In particular, we have the following inequality L A .
Based on the outcomes presented in Section 2, we establish new inequalities for the means mentioned above.
Proposition 3.
Consider Y : g , h R , 0 < g < h , Y t = t s , s 0 , 1 . Then,
1 h g g h Y ω d ω = L s s g , h , Y g + Y h 2 = A ( g s , h s ) , Y g + h 2 = A s ( g , h ) , Y 3 g + h 2 = A s ( g , g , g , h ) , Y g + 3 h 2 = A s ( g , h , h , h ) .
(1) Using the inequality (10), we obtain
1 90 14 A ( g s , h s ) + 32 A s ( g , g , g , h ) + 12 A s ( g , h ) + 32 A s ( g , h , h , h ) L s s g , h s ( h g ) 16 2 1 2 s 45 s + 2 ( s + 1 ) ( s + 2 ) 45 s + 1 3 s + 1 + 7 4 s + 1 1 s 19 4 s + 2 45 s + 1 47 45 s + 1 133 135 s + 1 + 14 s + 2 + 78 s + 2 90 s + 2 + 102 s + 2 + 166 s + 2 g s 1 + | h | s 1 .
For instance, if s = 1 in (40), then we have
1 90 26 A ( g , h ) + 32 A ( g , g , g , h ) + 32 A ( g , h , h , h ) L g , h 239 ( h g ) 6480 .
(2) Using the inequality (12), we obtain
A s ( g , h ) L s s g , h s ( h g ) 16 2 1 2 s 45 s + 2 ( s + 1 ) ( s + 2 ) 45 s + 1 3 s + 1 + 7 4 s + 1 1 s 19 4 s + 2 45 s + 1 47 45 s + 1 133 135 s + 1 + 14 s + 2 + 78 s + 2 90 s + 2 + 102 s + 2 + 166 s + 2 g s 1 + | h | s 1 .
For instance, if s = 1 in (41), then we have
A ( g , h ) L g , h 239 ( h g ) 6480 .

4. Numerical Examples

In this section, a comprehensive numerical investigation is carried out to confirm the validity and efficiency of the newly established results. Several computational experiments are presented to highlight the applicability of the proposed inequalities, especially for the approximation of integrals involving differentiable s-convex functions. To better illustrate the outcomes, three-dimensional graphical models are employed, providing clear insights into the numerical behavior of the derived inequalities. These visual demonstrations play a crucial role in verifying the accuracy and practical significance of the theoretical contributions.
Example 1.
Let Y : g , h = 1 , 2 R be a function defined by Y μ = μ 5 s + 1 . Then by applying inequality (10) to the function Y μ = μ 5 s + 1 , the left-hand side of inequality (10) for s = 0.2 is
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω = 9 × 10 9 ,
and the right-hand side of inequality (10) for s = 0.2 is
( h g ) 16 2 1 2 s 45 s + 2 ( s + 1 ) ( s + 2 ) 45 s + 1 3 s + 1 + 7 4 s + 1 1 s 19 4 s + 2 45 s + 1 47 45 s + 1 133 135 s + 1 + 14 s + 2 + 78 s + 2 90 s + 2 + 102 s + 2 + 166 s + 2 Y ( g ) + Y ( h ) = 3.7177 × 10 1 .
From Equations (42) and (43), it is clear that the left-hand side is less than the right-hand side
9 × 10 9 < 3.7177 × 10 1 .
This demonstrates that the inequality (10) is valid. A visual confirmation of this result is provided in Figure 1.
Example 2.
Let Y : g , h = 1 , 2 R be a function defined by Y μ = e s μ . Then by applying inequality (10) to the function Y μ = e s μ , the left-hand side of inequality (10) for s = 0.2 is
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω = 4.4653 × 10 11 ,
and the right-hand side of inequality (10) for s = 0.2 is
( h g ) 16 2 1 2 s 45 s + 2 ( s + 1 ) ( s + 2 ) 45 s + 1 3 s + 1 + 7 4 s + 1 1 s 19 4 s + 2 45 s + 1 47 45 s + 1 133 135 s + 1 + 14 s + 2 + 78 s + 2 90 s + 2 + 102 s + 2 + 166 s + 2 Y ( g ) + Y ( h ) = 0.03362 .
From Equations (44) and (45), it is clear that the left-hand side is less than the right-hand side
4.4653 × 10 11 < 0.03362 .
This observation serves as a numerical verification of inequality (10). A visual confirmation of this result is provided in Figure 2.
Example 3.
Let Y : g , h = 0 , Π 2 R be a function defined by Y μ = 1 cos ( s μ ) . Then by applying inequality (10) to the function Y μ = 1 cos ( s μ ) , the left-hand side of inequality (10) for s = 1 2 is
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω = 1.1143459 × 10 7 ,
and the right-hand side of inequality (10) for s = 1 / 2 is
( h g ) 16 2 1 2 s 45 s + 2 ( s + 1 ) ( s + 2 ) 45 s + 1 3 s + 1 + 7 4 s + 1 1 s 19 4 s + 2 45 s + 1 47 45 s + 1 133 135 s + 1 + 14 s + 2 + 78 s + 2 90 s + 2 + 102 s + 2 + 166 s + 2 Y ( g ) + Y ( h ) = 0.027579 .
From Equations (46) and (47), it is clear that the left-hand side is less than the right-hand side
1.1143459 × 10 7 < 0.027579 .
This demonstrates that the inequality (10) is valid. A visual confirmation of this result is provided in Figure 3.
Example 4.
Let Y : g , h = 1 , 2 R be a function defined by Y μ = μ 5 s + 1 and p = q = 2 . Then by applying inequality (14) to the function Y μ = μ 5 s + 1 , the right-hand side of inequality (14) for s = 0.2 is
h g 16 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 4 3 1 + s 4 s 1 + s Y g q + 4 s 1 + s Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 4 s 3 1 + s 2 1 + s 1 + s Y g q + 4 s 2 1 + s 1 1 + s Y h q 1 q + 4 15 p + 1 + 11 15 p + 1 ( p + 1 ) 1 p 4 s 2 1 + s 1 1 + s Y g q + 4 s 3 1 + s 2 1 + s 1 + s Y h q 1 q + 14 45 p + 1 + 31 45 p + 1 ( p + 1 ) 1 p 4 s 1 + s Y g q + 4 3 1 + s 4 s 1 + s Y h q 1 q = 3.6528 × 10 1 .
From Equations (42) and (48), it is clear that the left-hand side is less than the right-hand side
9 × 10 9 < 3.6528 × 10 1 .
This observation serves as a numerical verification of inequality (14). A visual confirmation of this result is provided in Figure 4.
Example 5.
Let Y : g , h = 1 , 2 R be a function defined by Y μ = μ + 1 5 s + 1 and q = 2 . Then by applying inequality (24) to the function Y μ = μ + 1 5 s + 1 , then the left-hand side of inequality (24) for s = 1 2 is
1 90 7 Y ( g ) + 32 Y 3 g + h 4 + 12 Y g + h 2 + 32 Y g + 3 h 4 + 7 Y ( h ) 1 h g g h Y ( ω ) d ω = 2.6058 × 10 7 ,
and the right-hand side of inequality (24) for s = 1 2 is
h g 16 1157 4050 1 1 q E 1 s | Y ( g ) | q + E 8 s | Y ( h ) | q 1 q + 137 450 1 1 q E 3 s | Y ( g ) | q + E 6 s | Y ( h ) | q 1 q + 137 450 1 1 q E 5 s | Y ( g ) | q + E 4 s | Y ( h ) | q 1 q + 1157 4050 1 1 q E 7 s | Y ( g ) | q + E 2 s | Y ( h ) | q 1 q = 3.4874 .
From Equations (49) and (50), it is clear that the left-hand side is less than the right-hand side
2.6058 × 10 7 < 3.4874 .
This observation serves as a numerical verification of inequality (24).

5. Conclusions

The main focus of this study was to establish new Boole’s formula-type inequalities for single-time differentiable s-convex functions in the second sense. By employing an integral identity, several inequalities were derived that extend the classical framework and provide improved bounds for both Boole’s and midpoint formulas. The findings indicate that the proposed error estimates outperform some existing results, with s-convexity offering tighter approximations compared to standard convexity. In particular, the analysis demonstrates that as the parameter s varies, the obtained bounds surpass those of the classical case ( s = 1 ) , while the error tends to diminish as s 0 + . The study further validates its results through applications to quadrature formulas and special means of real numbers, supported by numerical examples, computational analysis, and graphical models. Evidence from Table 1 and Table 2 confirms the effectiveness of the proposed approach for generalized convex functions. These contributions enrich approximation theory, real analysis, and the study of functional inequalities by providing more precise error estimates for polynomial and functional approximations.
Looking ahead, this research can be extended by incorporating q-calculus, fractional calculus, higher-order derivatives, multidimensional frameworks, and alternative convexity structures. The outcomes presented here highlight the significance of Boole’s formula-type inequalities as powerful tools in the advancement of integral inequality theory.

Author Contributions

Conceptualization, A.M.; formal analysis, T.A., A.M., H.E. and L.C.; funding acquisition, L.C.; investigation, T.A., A.M., M.A.A. and L.C.; methodology, T.A., A.M., H.E. and M.A.A.; software, A.M.; supervision, M.A.A.; validation, T.A., A.M., H.E., M.A.A. and L.C.; visualization, T.A., A.M., H.E. and M.A.A.; writing—original draft, T.A. and A.M.; writing—review and editing, T.A., A.M., H.E., M.A.A. and L.C. All authors have read and agreed to the published version of the manuscript.

Funding

Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2025R747), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Data Availability Statement

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

Acknowledgments

Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2025R747), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Conflicts of Interest

We declare that we have no conflicts of interest in this work.

References

  1. Gibb, D. A Course in Interpolation and Numerical Integration for the Mathematical Laboratory; G. Bell & Sons, Limited: London, UK, 1915. [Google Scholar]
  2. Leader, J.J. Numerical Analysis and Scientific Computation; Chapman and Hall/CRC: Boca Raton, FL, USA, 2022. [Google Scholar]
  3. Ali, M.A.; Kara, H.; Tariboon, J.; Asawasamrit, S.; Budak, H.; Hezenci, F. Some new Simpson’s-formula-type inequalities for twice-differentiable convex functions via generalized fractional operators. Symmetry 2021, 13, 2249. [Google Scholar] [CrossRef]
  4. Ali, M.A.; Fečkan, M.; Mateen, A. Study of quantum Ostrowski’s-type inequalities for differentiable convex functions. Ukr. Math. J. 2023, 75, 7–27. [Google Scholar] [CrossRef]
  5. Vivas-Cortez, M.J.; Ali, M.A.; Qaisar, S.; Sial, I.B.; Jansem, S.; Mateen, A. On some new Simpson’s formula type inequalities for convex functions in post-quantum calculus. Symmetry 2021, 13, 2419. [Google Scholar] [CrossRef]
  6. Mateen, A.; Zhang, Z.; Ali, M.A. Some Milne’s rule type inequalities for convex functions with their computational analysis on quantum calculus. Filomat 2024, 38, 3329–3345. [Google Scholar] [CrossRef]
  7. Dwilewicz, R.J. A short history of convexity. Differ.-Geom.-Dyn. Syst. 2009, 11, 112–129. [Google Scholar]
  8. Kirmaci, U.S. Inequalities for differentiable mappings and applications to special means of real numbers and to midpoint formula. Appl. Math. Comput. 2004, 147, 137–146. [Google Scholar] [CrossRef]
  9. 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]
  10. Alomari, M.; Darus, M.; Dragomir, S.S. New inequalities of Simpson’s type for s-convex functions with applications. Res. Rep. Collect. 2009, 12, 50. [Google Scholar]
  11. Dragomir, S.S.; Agarwal, R.P.; Cerone, P. On Simpson’s inequality and applications. RGMIA Res. Rep. Collect. 2012, 2, 75. [Google Scholar] [CrossRef]
  12. Sarikaya, M.Z.; Set, E.; Özdemir, M.E. On new inequalities of Simpson’s type for convex functions. RGMIA Res. Rep. Collect. 2010, 13, 25. [Google Scholar] [CrossRef]
  13. Özdemir, M.E.; Akdemir, A.O.; Kavurmaci, H.; Avci, M. On the Simpson’s inequality for co-ordinated convex functions. Turk. J. Math. Anal. Number Theory 2014, 2, 165–169. [Google Scholar] [CrossRef]
  14. Du, T.; Li, Y.; Yang, Z. A generalization of Simpson’s inequality via differentiable mappings using extended (s,m)-convex functions. Appl. Math. Comput. 2017, 293, 358–369. [Google Scholar] [CrossRef]
  15. Sarikaya, M.Z.; Set, E.; Yaldiz, H.; Başak, N. Hermite–Hadamard’s inequalities for fractional integrals and related fractional inequalities. Math. Comput. Model. 2013, 57, 2403–2407. [Google Scholar] [CrossRef]
  16. İşcan, İ.; Wu, S. Hermite–Hadamard type inequalities for harmonically convex functions via fractional integrals. Appl. Math. Comput. 2014, 238, 237–244. [Google Scholar] [CrossRef]
  17. Sarikaya, M.Z.; Yildirim, H. On Hermite-Hadamard type inequalities for Riemann-Liouville fractional integrals. Miskolc Math. Notes 2016, 17, 1049–1059. [Google Scholar] [CrossRef]
  18. Sarikaya, M.Z.; Set, E.; Ozdemir, M.E. On new inequalities of Simpson’s type for s-convex functions. Comput. Math. Appl. 2010, 60, 2191–2199. [Google Scholar] [CrossRef]
  19. Chen, J.; Huang, X. Some new inequalities of Simpson’s type for s-convex functions via fractional integrals. Filomat 2017, 31, 4989–4997. [Google Scholar] [CrossRef]
  20. Budak, H.; Hezenci, F.; Kara, H. On parameterized inequalities of Ostrowski and Simpson type for convex functions via generalized fractional integrals. Math. Methods Appl. Sci. 2021, 44, 12522–12536. [Google Scholar] [CrossRef]
  21. Breckner, W.W. Stetigkeitsaussagen für eine klasse verallgemeinerter konvexer funktionen in topologischen linearen räumen. Publ. De L’Institut MathéMatique 1978, 23, 13–20. [Google Scholar]
  22. Hudzik, H.; Maligranda, L. Some remarks on s-convex functions. Aequationes Math. 1994, 48, 100–111. [Google Scholar] [CrossRef]
  23. Pycia, M. A direct proof of the s-Hölder continuity of Breckner s-convex functions. Aequationes Math. 2001, 61, 128–130. [Google Scholar] [CrossRef]
  24. Dragomir, S.S.; Fitzpatrick, S. The Hadamard’s inequality for s-convex functions in the second sense. Demonstr. Math. 1999, 32, 687–696. [Google Scholar]
  25. Kirmaci, U.S.; Bakula, M.K.; Özdemir, M.E.; Pečarić, J. Hadamard-type inequalities for s-convex functions. Appl. Math. Comput. 2007, 193, 26–35. [Google Scholar] [CrossRef]
  26. Alomari, M.; Darus, M.; Dragomir, S.S. Inequalities of Hermite-Hadamard’s type for functions whose derivatives absolute values are quasi-convex. Res. Rep. Collect. 2009, 12, 1. [Google Scholar]
  27. Alomari, M.; Darus, M.; Kirmaci, U.S. Refinements of Hadamard-type inequalities for quasi-convex functions with applications to trapezoidal formula and to special means. Comput. Math. Appl. 2010, 59, 225–232. [Google Scholar] [CrossRef]
  28. Kashuri, A.; Liko, R. Fractional trapezium type inequalities for twice differentiable preinvex functions and their applications. Int. J. Optim. Control. Theor. Appl. 2020, 10, 226–236. [Google Scholar] [CrossRef]
  29. Yildiz, Ç.; Yergöz, B.; Yergöz, A. On new general inequalities for s-convex functions and their applications. J. Inequalities Appl. 2023, 2023, 11. [Google Scholar] [CrossRef]
  30. Sezer, S. The Hermite-Hadamard inequality for s-convex functions in the third sense. AIMS Math. 2021, 6, 7719–7732. [Google Scholar] [CrossRef]
  31. Barsam, H.; Ramezani, S.M.; Sayyari, Y. On the new Hermite–Hadamard type inequalities for s-convex functions. Afr. Mat. 2021, 32, 1355–1367. [Google Scholar] [CrossRef]
  32. Zhan, X.; Mateen, A.; Toseef, M.; Ali, M.A. Some Simpson- and Ostrowski-type integral inequalities for generalized convex functions in multiplicative calculus with their computational analysis. Mathematics 2024, 12, 1721. [Google Scholar] [CrossRef]
Figure 1. The graphical evidence presented in Figures (ad) demonstrates that for every s ( 0 , 1 ) , the value of the left-hand side of inequality (10) is strictly bounded below by its right-hand side. This observation provides empirical confirmation of the result stated in Theorem 5.
Figure 1. The graphical evidence presented in Figures (ad) demonstrates that for every s ( 0 , 1 ) , the value of the left-hand side of inequality (10) is strictly bounded below by its right-hand side. This observation provides empirical confirmation of the result stated in Theorem 5.
Mathematics 13 03517 g001
Figure 2. Three-dimensional plot for Theorem 5 in Example 2, when g 1 , 3 , h 5 , 7 , and s = 0.2 , computed and plotted with Mathematica.
Figure 2. Three-dimensional plot for Theorem 5 in Example 2, when g 1 , 3 , h 5 , 7 , and s = 0.2 , computed and plotted with Mathematica.
Mathematics 13 03517 g002
Figure 3. Two-dimensional plot for Theorem 5 in Example 3, when g , h 0 , Π 2 , and s ( 0 , 1 ] , computed and plotted with Mathematica.
Figure 3. Two-dimensional plot for Theorem 5 in Example 3, when g , h 0 , Π 2 , and s ( 0 , 1 ] , computed and plotted with Mathematica.
Mathematics 13 03517 g003
Figure 4. Three-dimensional plot for Theorem 6 in Example 4, when g 1 , 3 , h 5 , 7 , and s = 0.2 , computed and plotted with Mathematica.
Figure 4. Three-dimensional plot for Theorem 6 in Example 4, when g 1 , 3 , h 5 , 7 , and s = 0.2 , computed and plotted with Mathematica.
Mathematics 13 03517 g004
Table 1. Computational analysis between the left-hand and the right-hand sides of inequality (10) for discretization of “s” in Example 1.
Table 1. Computational analysis between the left-hand and the right-hand sides of inequality (10) for discretization of “s” in Example 1.
sLeft PartRight Part
0.14.6039  × 10 7 0.2440
0.29.0000  × 10 9 0.3717
0.34.5617  × 10 7 0.5484
0.41.7000  × 10 8 0.7984
0.59.7969  × 10 7 1.1570
0.63.3000  × 10 8 1.6741
0.74.1696  × 10 6 2.4212
0.86.5000  × 10 8 3.5005
0.96.8820  × 10 5 5.0581
13.7200  × 10 4 7.3028
Table 2. Computational analysis between the left-hand and the right-hand sides of inequality (10) for discretization of “s” in Example 2.
Table 2. Computational analysis between the left-hand and the right-hand sides of inequality (10) for discretization of “s” in Example 2.
sLeft PartRight Part
0.16.0151  × 10 13 0.01567
0.24.4653  × 10 11 0.03362
0.35.9121  × 10 10 0.05451
0.43.8618  × 10 9 0.07915
0.51.7129  × 10 8 0.10843
0.65.9483  × 10 8 0.14348
0.71.7446  × 10 7 0.18563
0.84.5226  × 10 7 0.23651
0.91.0668  × 10 6 0.29809
12.3363  × 10 6 0.37279
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

Anwar, T.; Mateen, A.; Elmannai, H.; Ali, M.A.; Ciurdariu, L. Some New Boole-Type Inequalities via Modified Convex Functions with Their Applications and Computational Analysis. Mathematics 2025, 13, 3517. https://doi.org/10.3390/math13213517

AMA Style

Anwar T, Mateen A, Elmannai H, Ali MA, Ciurdariu L. Some New Boole-Type Inequalities via Modified Convex Functions with Their Applications and Computational Analysis. Mathematics. 2025; 13(21):3517. https://doi.org/10.3390/math13213517

Chicago/Turabian Style

Anwar, Talha, Abdul Mateen, Hela Elmannai, Muhammad Aamir Ali, and Loredana Ciurdariu. 2025. "Some New Boole-Type Inequalities via Modified Convex Functions with Their Applications and Computational Analysis" Mathematics 13, no. 21: 3517. https://doi.org/10.3390/math13213517

APA Style

Anwar, T., Mateen, A., Elmannai, H., Ali, M. A., & Ciurdariu, L. (2025). Some New Boole-Type Inequalities via Modified Convex Functions with Their Applications and Computational Analysis. Mathematics, 13(21), 3517. https://doi.org/10.3390/math13213517

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