1. Introduction
The study of integral inequalities plays a fundamental role in mathematical analysis, numerical integration, and approximation theory. Among classical results, the well-known Hermite–Hadamard (HH) inequality occupies a central position in convex analysis, as comprehensively presented in the monograph by Dragomir and Pearce [
1]. For a convex function
, the inequality states that
A closely related result is the trapezoidal inequality, which provides limits for the error that arises in approximating definite integrals. Furthermore, the work of Dragomir and Agarwal [
2] on inequalities for differentiable mappings laid the groundwork for applications to special averages and refined trapezoidal formulas.
Over the last two decades, a vibrant field of research has emerged, focusing on extending classical inequalities through the powerful framework of fractional calculus, particularly via Riemann–Liouville and Caputo fractional integrals. The fundamental theory of these operators has been extensively documented in pioneering works such as Kilbas et al. [
3], Podlubny [
4], and Samko et al. [
5]. Due to their inherently non-local nature, fractional operators have enabled the derivation of flexible and generalized versions of the HH inequality. In particular, Sarikaya et al. [
6] have systematically presented fractional analogues of the HH inequality involving Riemann–Liouville integrals. This scope has been further extended to generalized HH-type inequalities [
7], new Riemann–Liouville fractional integral inequalities [
8], and various other fractional integral identities documented in the works of Farid [
9], Jleli and Samet [
10], and Lan [
11]. Furthermore, several authors have contributed to this field through the study of new integral versions and generalized operators [
12,
13,
14,
15]. Recent investigations have also explored advanced HH-type inequalities in broader contexts, such as fuzzy fractional calculus and generalized pre-invex functions in fuzzy-interval-valued settings [
16], demonstrating the adaptability of fractional techniques in complex analytical frameworks.
Despite this rich body of literature, many fractional integral identities involving remainder terms of quadrature formulas are often presented as isolated results. There remains a need for operator-based representations that unify classical remainder expressions, fractional integrals, and endpoint-based expansions within a single coherent structure. Most existing fractional operators primarily depend on the distance from a single endpoint (e.g., or ). In contrast, a unified formulation that scales with the total interval length offers a more flexible framework for measuring the discrepancy between function values and fractional-type integral means.
Motivated by these developments, we introduce a new class of operators, denoted by and . These operators bridge classical integral means and fractional structures by incorporating a symmetric Beta-type kernel of the form . The symmetric nature of this kernel is particularly suitable for establishing refined trapezoid-type bounds, as it aligns naturally with the symmetric error kernels appearing in classical quadrature formulas.
In this work, we construct several novel Hermite–Hadamard-type inequalities and trapezoidal-type bounds using the proposed operators. We show that our results not only generalize known inequalities but also provide a unified framework for various integral averages and re-obtain classical results as special bound cases.
2. Definition of the Operator
Let
be an interval with length
. To avoid notational confusion between the interval endpoints and the normalization constants, we introduce the following notation. For
and
, define the parameter
and the normalization constant
by
We introduce the left-sided operator (associated with the left endpoint
) by
and the right-sided operator (associated with the right endpoint
) by
These operators extend the classical one-sided Riemann–Liouville fractional integrals by incorporating the full geometry of the interval . In particular, instead of depending only on the distance from a single endpoint (such as or ), the kernels of and are scaled with respect to the total length . The symmetric Beta-type kernel allows the operators to interpolate between classical fractional integrals and remainder terms of quadrature formulas, thereby providing a unified and flexible framework.
Properties
Linearity. For any constants
and functions
,
Positivity. If
on
, then
Normalization. The constant
is chosen such that
which guarantees that the operator represents a properly weighted average of
.
Theorem 1. Let be an interval with length . For and , the operators and satisfy the following properties:
- (i)
For every , the operator norm satisfies Equivalently, the normalized functionals are bounded linear functionals on with norm 1.
- (ii)
For every , the normalized operators recover the endpoint values on shrinking intervals: - (iii)
For the special choice and , the normalized operators reduce to the standard Riemann integral mean:
3. Hermite–Hadamard Inequalities for
In this section, we establish generalized Hermite–Hadamard and trapezoid-type inequalities using the unified operators
and
. To facilitate clarity,
Table 1 summarizes the main results and the conditions under which they hold.
Theorem 2. Let be a convex function. Then, for the unified operators and defined in (
2)
and (
3)
with , the following inequality holds: Proof. Since
is convex on
, by the definition of convexity, for every
we have
Multiplying both sides by the weight function
, where
, and integrating over
, we obtain
Using the definitions of
and
, the right-hand side becomes
Multiplying both sides by
and using the normalization property
we obtain the lower bound
For the upper bound, convexity gives, for every
,
Adding these two inequalities yields
Multiplying by
and integrating over
, we obtain
Using the operator definitions and the normalization constant, this becomes
Multiplying both sides by
gives
Combining the lower and upper bounds completes the proof. □
The inequality in Theorem 2 provides a combined Hermite–Hadamard-type limit for convex functions. However, to obtain quantitative error estimates and trapezoidal-type inequalities, it is essential to obtain an exact representation of the divergence between the endpoint arithmetic mean and the normalized operator mean.
The following lemma reveals such an integral identity, which plays a central role in deriving more precise limits in subsequent results.
Lemma 1. Let . Then the following integral identity for the unified operators holds:where and is the normalization constant. Proof. From the definitions (
2) and (
3),
Hence,
Since
, by the Fundamental Theorem of Calculus,
Substituting these into the previous expression yields
Applying Fubini’s theorem to interchange the order of integration, we obtain
Using the symmetry of the kernel, an equivalent form is
This completes the proof. □
The integral identity in Lemma 1 expresses the deviation term in terms of the first derivative and a symmetric kernel function. This notation allows us to estimate the error by applying additional structural conditions to the derivative. In particular, assuming that is convex yields a trapezoidal-type inequality containing only the endpoint derivative values.
Theorem 3. Let φ be differentiable on with . If is convex on , then the following inequality holds:where and is defined by Proof. We begin the proof by utilizing the second integral identity established in Lemma 1. Let
denote the difference between the arithmetic mean of the function at the endpoints and the normalized operator average:
Define the auxiliary function
Taking absolute values, we obtain
Since
is convex on
and
we have
Substituting this bound gives
Since the kernel
is even, the function
satisfies
hence
Therefore,
Let
Then
This completes the proof of (
5). □
The previous result provides an estimate under the convexity of . It can be further improved by assuming the convexity of for some . By combining the integral identity of Lemma 1 with Hölder’s inequality, we obtain a more flexible inequality that separates the derivative term and the kernel term via conjugate exponents.
Theorem 4. Let and be conjugate exponents. If is convex on , then the following inequality for the unified fractional operators holds:where and Proof. Starting from the integral identity established in Lemma 1, we take the absolute value of the difference between the arithmetic mean and the normalized operator average:
Define the kernel difference function
Then inequality (
7) becomes
Applying Hölder’s inequality with conjugate exponents
q and
p, we obtain
Now perform the change of variables
, which implies
. Then
Since
is convex on
, the Hermite–Hadamard inequality yields
Hence,
Multiplying by
gives inequality (
6).
Finally, we derive the closed-form expression of
. For
,
Using the substitution
(so
), we obtain
This integral equals
Similarly,
Therefore,
Substituting this representation into the previous bound completes the proof. □
Theorems 3 and 4 show that the unified operator framework naturally produces trapezoid-type bounds whose structure depends explicitly on the symmetry of the Beta-type kernel.
4. Special Cases, Corollaries, and Remarks
In this section, we examine the behavior of the newly introduced operators and the derived inequalities under specific parameter choices. These particular configurations highlight the structural strength of the unified framework, showing that it both recovers well-known classical inequalities and provides explicit computable constants in concrete cases.
Corollary 1. Under the assumptions of Theorem 2, for the specific choice , the unified operators and reduce towhere and the normalization constant is given byIn this case, the Hermite–Hadamard-type inequality (
4)
simplifies to Proof. The result follows directly from Theorem 2 by substituting into the general definitions of the operators and .
When
, the kernel exponent becomes
and the length scaling factor satisfies
. Consequently, the operator reduces to a symmetric weighted fractional integral with the Beta-type weight
.
Since linearity, normalization, and positivity properties are preserved, the arguments used in the proof of Theorem 2 remain valid in this specialized setting. This completes the proof. □
The case corresponds to the purely fractional regime without length amplification. Increasing the parameter n introduces higher-order scaling effects, which we illustrate next in the quadratic case .
Corollary 2. Under the assumptions of Theorem 2, for the specific choice , the unified operators and incorporate a quadratic length scaling factor and reduce toand similarly,where the normalization constant is given by In this case, the refined Hermite–Hadamard-type inequality becomes Proof. The result follows directly from Theorem 2 by setting
in the general operator definitions. In this case, the kernel exponent becomes
and the scaling factor satisfies
.
The convexity of on guarantees the lower and upper bounds through the weighted integration of the midpoint inequality and the endpoint inequalities, respectively. The argument is identical in structure to that of Theorem 2, completing the proof. □
Among all parameter configurations, the most important limiting case is obtained when both the fractional and scaling effects vanish. This leads to a complete recovery of the classical Hermite–Hadamard inequality.
Remark 1. A fundamental property of the unified fractional operators and is their ability to recover classical integral structures under specific parameter settings.
By choosing and , the kernel reduces to unity, and the operators coincide with the standard Riemann integral mean, namely Substituting these expressions into the general inequality (
4)
, we immediately recover the classical Hermite–Hadamard inequality for convex functions: This reduction verifies that the proposed operators are fully consistent with the foundational theory of convex analysis and confirms that the generalized framework developed in this study extends the classical Hermite–Hadamard inequality.
We next examine the behavior of the trapezoid-type estimate in the classical parameter regime. This confirms that Theorem 3 generalizes the standard trapezoidal rule error bound.
Corollary 3. Consider Theorem 3 with the parameters and . In this specific case, the operator average reduces to the classical integral mean, and the kernel difference simplifies to s. Furthermore, sincewe recover the classical trapezoidal rule error estimate for functions whose derivative absolute value is convex: Proof. The proof follows by substituting the special case parameters and into the general inequality of Theorem 3.
For
and
, we have
and
. Hence, the weighted operator average reduces to the classical integral mean:
The right-hand side of Theorem 3 involves the kernel integral
For these parameters, the weight function becomes
, so the auxiliary kernel simplifies to
We compute
by splitting at
:
Substituting
,
, and
into Theorem 3, we obtain
This completes the proof. □
To further illustrate the computational utility of the framework, we compute an explicit constant in a nontrivial fractional configuration. The following result corresponds to the case and .
Corollary 4. For the parameter choices and in Theorem 3, we obtain the following refined higher-order error estimate: Proof. The proof follows by substituting the specialized parameters and into the general bound derived in Theorem 3.
For these values, the exponent of the weight function is
so that
The operator scaling factor becomes
.
The normalization constant corresponding to
is
Next, we evaluate the kernel integral
for the weight
. A direct computation of the auxiliary function
for the power
yields
Substituting
,
, and
into the inequality of Theorem 3, we obtain
Multiplying the numerical coefficients gives
This confirms the stated bound and completes the proof. □
Finally, we examine the limiting configuration of Theorem 4 to observe how the Hölder-based refinement behaves in the classical integral setting.
Corollary 5. Under the hypotheses of Theorem 4 with the specific parameter choices and , the general inequality (
6)
reduces toThis estimate illustrates the refinement of the error bound when higher-order derivative powers () are incorporated through Hölder’s inequality. Proof. For
and
, the kernel exponent becomes
Hence the weight function simplifies to
Starting from the integral representation given in Lemma 1 and proceeding as in the proof of Theorem 4, we obtain
where
and
Since
, we compute
so that
Applying Hölder’s inequality with conjugate exponents
and
yields
Using the substitution
, we obtain
By the convexity of
and the Hermite–Hadamard inequality,
For the second factor, symmetry about
gives
Therefore,
Combining all estimates and multiplying by the prefactor
completes the proof. □
These special cases confirm that the unified operator framework simultaneously preserves classical inequalities, extends fractional integral results, and provides explicit computable constants.
Hence, the proposed operators do not merely generalize existing inequalities but offer a structurally coherent and computationally effective extension of Hermite–Hadamard and trapezoid-type theories.
5. Applications to Classical Means
The inequalities established in the previous sections can be applied to derive quantitative relationships between classical means. Let with . We recall the standard means:
We now illustrate the applicability of Theorem 3 by considering power functions and estimating the deviation between the endpoint arithmetic mean and the unified operator average.
Proposition 1. Let and let , where . Let and consider the operators and . Define the quadrature deviation
- 1.
Linear case ().
If φ is linear, the deviation is proportional to the first moment of the symmetric kernel. In particular, for and , the symmetry of the kernel implies Hence, the unified operator exactly recovers the arithmetic mean in this limiting case.
- 2.
Quadratic case ().
For and , since is convex on , Theorem 3 yields This explicitly shows how the parameters α and n modify the classical trapezoidal-type error constant through the Beta-type kernel structure.
- 3.
General power case ().
The operator values can be expressed using the Beta function. Indeed, and the binomial expansion is understood in the generalized sense for real p.
This representation allows explicit numerical comparison between the operator mean and classical means such as and .
Proof. For the linear case with
and
, the kernel is symmetric about the midpoint, and its first moment vanishes. Hence the integral contribution of the linear term reduces exactly to the midpoint value, yielding
For the quadratic case, substituting
,
, and
into Theorem 3 gives
For the general power case, expand
via the generalized binomial theorem and apply the substitution
to integrals of the form
which yields the Beta function
. This completes the proof. □
6. Numerical Results and Graphical Error Analysis
In this section, we present numerical experiments and qualitative graphical observations in order to evaluate the performance of the proposed unified operator . We examine three representative situations: (i) convex but non-differentiable functions, (ii) smooth convex functions for error comparison, and (iii) non-convex functions.
6.1. Test on a Non-Differentiable Convex Function
Consider the function
on the interval
. This function is convex on
but is not differentiable at
.
Observation 1. The Hermite–Hadamard inequality in Theorem 2 remains applicable, since it requires only convexity. Numerical evaluation indicates thatholds for all tested values of and n.
Observation 2. Although Theorems 3 and 4 formally require differentiability, the operator remains numerically stable away from the singular point. The symmetric kernel structure attenuates the influence of the non-differentiable point through weighted averaging.
Recall that the kernel weight isAs n increases (with fixed), the exponent increases, and the weight becomes more concentrated near . Consequently, the operator average places greater emphasis on values near the midpoint of the interval. Numerical evidence suggests that this concentration improves the approximation of the integral mean, even in the presence of a non-differentiable point. 6.2. Graphical Error Comparison
To illustrate the sharpness of the bounds in Theorems 3 and 4, consider the smooth convex function
Let
. Define the absolute quadrature error by
Numerical computations indicate the following tendencies:
For fixed , increasing n tends to reduce in the tested parameter range.
The theoretical upper bounds derived in Theorems 3 and 4 remain valid and exhibit a decreasing numerical trend as n increases.
These observations suggest that the unified operator provides a flexible mechanism for refining error estimates, in comparison with classical fixed-order fractional operators.
6.3. Testing Non-Convex Functions
To examine the necessity of the convexity assumption, consider the non-convex function
In this case, numerical experiments indicate that the Hermite–Hadamard-type inequalities (e.g., (
4)) and the trapezoidal-type bounds derived in Theorems 3 and 4 are generally not satisfied.
This behavior highlights that convexity is an essential structural condition for the validity of the derived inequalities, rather than merely a technical assumption.
7. Conclusions
In this paper, we introduced a novel unified fractional remainder operator that effectively bridges classical Riemann integrals with fractional-order structures. By constructing a new exact integral identity (Lemma 1), we established a direct analytical connection between the endpoint arithmetic mean and the first derivative of the function. This identity provided the foundation for deriving refined error bounds for the Trapezoidal Rule under generalized convexity assumptions.
The proposed framework improves upon classical techniques by exploiting the symmetric structure of the Beta-type kernel together with the Hölder inequality. The main contributions of this study can be summarized as follows:
Refined Trapezoid-Type Inequalities: We derived sharp bounds for functions whose derivative absolute values, or their powers , satisfy suitable convexity conditions.
Generalization and Recovery: We showed that the proposed operator is consistent with the existing literature, recovering the classical trapezoidal error bound as a limiting case when and .
Computational Utility: The explicit error estimates expressed in terms of endpoint derivatives, and , provide computable and numerically stable tools for practical applications, as supported by our numerical experiments.
This operator-based methodology offers a flexible and powerful analytical framework. It opens new directions for future research involving higher-order derivatives, quasi-convexity, and the development of high-accuracy numerical schemes within the setting of fractional calculus. Moreover, the computational stability of the incomplete Beta kernels indicates that these operators may be effectively incorporated into practical modeling applications in physics and engineering.