1. Introduction
Convex and concave functions are crucial in mathematics. The formal definition of these functions is given below.
Definition 1.1 (Convex and concave functions).
Let a, b ∈ ℝ with a < b and f : [a, b] → ℝ be a function.
Convex function: We say that f is convex if and only if, for any ϵ ∈ [0, 1] and x, y ∈ [a, b], we have
If f is twice differentiable, this inequality is equivalent to f″(x) ≥ 0 for any x ∈ [a, b].
Concave function: We say that f is concave if and only if, for any ϵ ∈ [0, 1] and x, y ∈ [a, b], we have
If f is twice differentiable, this inequality is equivalent to f″(x) ≤ 0 for any x ∈ [a, b].
Further details on convex and concave functions can be found in [2 , 3, 7, 8, 9, 10, 11, 13, 14, 15, 19]. One of their interests is the derivation of sharp integral inequalities, which is the focus of this article. Two examples are the Jensen integral inequalities and the Hermite–Hadamard integral inequalities, as formally presented in the two theorems below.
Theorem 1.2 (Jensen integral inequalities).
Let a, b ∈ ℝ with a < b, and f : [a, b] → ℝ and g : ℝ → ℝ be two functions.
Convex part: If g is convex, then the following holds:
Concave part: If g is concave, then the following holds:
Theorem 1.3 (Hermite–Hadamard integral inequalities).
Let a, b ∈ ℝ with a < b, and f : [a, b] → ℝ be a function.
Convex part: If f is convex, then the following holds:
Concave part: If f is concave, then the following holds:
These integral inequalities serve as fundamental tools in approximation theory, numerical analysis and optimization. The Hermite–Hadamard integral inequalities, in particular, have been studied extensively, leading to numerous generalizations, variants and refinements. Some of them can be found in [1, 4, 5, 6, 12, 16, 17, 18, 20, 21, 22, 23, 24]. We emphasize an original variant given by [22, Theorem 2.6], as recalled below.
Theorem 1.4 ([22, Theorem 2.6]).
Let a, b ∈ ℝ with a < b, and f : [a, b] → [0, +∞) and g : [a, b] → [1, +∞) be two functions. We suppose that f and log(g) are monotonic with an opposite monotonicity, f is convex and log(g) is convex. Then the following holds:
The contributions of this article are inspired by the framework of this theorem, which remains relatively unexplored in the existing literature. In the first part, we critically examine the validity of [22, Theorem 2.6] by presenting a counterexample and identifying a gap in the proof. This gap is closely related to a misapplication of the concave part of the Jensen integral inequalities. We then propose an alternative statement of this theorem under varying monotonicity and convexity assumptions. In the second part, we derive new and sharper lower and upper bounds for the main integral, i.e.,
while still relying on monotonicity and convexity assumptions. Our approach is based on a convex property of “a positive function raised to the power of another positive function”, i.e., gf, and the use of refined Hermite–Hadamard integral inequalities as given in [21]. A variant considering “a positive function raised to the power of another minus positive function”, i.e., g−f, is also proposed. By revisiting an existing theorem and providing sharper bounds, we fill a gap in the literature on convex-type integral inequalities and extend the scope of previous results.The remainder of this article is structured as follows: In Section 2, we revisit [22, Theorem 2.6], analyzing its proof and limitations. Section 3 presents refined results and alternative inequalities. Finally, Section 4 concludes the article with a summary and discussion of potential future research directions.
2. Revisit of Theorem 1.4
2.1. A counterexample
A counterexample to [22, Theorem 2.6], as recalled in Theorem 1.4, is now elaborated. For simplicity, we take a = 0 and b = 1. We consider
which is obviously non-decreasing and convex. We also define satisfying g(x) ≥ 1 for any x ∈ [0, 1], with log[g(x)] = log[7 + exp(−x)], which is non-increasing because, for any x ∈ [0, 1], and convex because, for any x ∈ [0, 1], Note that f and log(g) are of opposite monotonicity. Let us now calculate the two main terms in the inequality of [22, Theorem 2.6]. By numerical integration, we find that On the other hand, we have We thus obtain which contradicts the result in [22, Theorem 2.6]. In fact, the constant “7” in the definition of g was tuned for this.On analysis, the first inequality step in the proof of this theorem states that
However, this is an incorrect application of the concave part of the Jensen integral inequalities to the concave function log(x), x > 0; a correct application of it would give the reverse inequality. While the subsequent inequality steps are derived correctly, they are based on this initial assumption, which is incorrect. This motivates the development of a corrected statement in the section below.2.2. Corrected statement
A possible corrected and improved version of [22, Theorem 2.6], with more flexibility on the convexity assumptions, is given below. The proof mainly uses the concave part of the Jensen integral inequalities, the Chebyshev integral inequality for functions of the same monotonicity, and the concave and convex parts of the Hermite–Hadamard integral inequalities.
Theorem 2.1.
Let a, b ∈ ℝ with a < b, and f : [a, b] → [0, +∞) and g : [a, b] → [1, +∞) be two functions. We suppose that f and log(g) are monotonic with the same monotonicity. Furthermore,
(1) if f and log(g) are concave, then the following holds:
(2) if f is concave and log(g) is convex, then the following holds:
(3) if f is convex and log(g) is concave, then the following holds:
(4) if f and log(g) are convex, then the following holds:
Proof of Theorem 2.1.
The four points share the same mathematical foundation. To simplify the developments, we work with the logarithm of the main integral. Applying the concave part of the Jensen integral inequalities to the concave function log(x), x > 0, as recalled in Theorem 1.2, we have
Since f and log(g) are of the same monotonicity, the Chebyshev integral inequality applied to f and log(g) reads as It follows from inequalities ( 2.1) and (2.2) that Let us now distinguish the assumptions in the four distinct points.Since f and log(g) are non-negative and concave, the left-hand side of the concave part of the Hermite–Hadamard integral inequalities applied to f and log(g), as recalled in Theorem 1.3, gives
Combining inequalities (2.3) and (2.4), we obtain
so, by the non-decreasing property of the exponential function,The point (1) is established.
Since f and log(g) are non-negative, f is concave and log(g) is convex, the left-hand sides of the concave and convex parts of the Hermite–Hadamard integral inequalities applied to f and log(g), respectively, as recalled in Theorem 1.3, give
It follows from inequalities (2.3) and (2.5) that
so thatThe point (2) is proved.
Since f and log(g) are non-negative, f is convex and log(g) is concave, the left-hand sides of the convex and concave parts of the Hermite–Hadamard integral inequalities applied to f and log(g), respectively, as recalled in Theorem 1.3, give
Combining inequalities (2.3) and (2.6), we get
so thatThe point (3) is proved.
Since f and log(g) are non-negative and convex, the left-hand side of the convex part of the Hermite–Hadamard integral inequalities applied to f and log(g), as recalled in Theorem 1.3, gives
It follows from inequalities (2.3) and (2.7) that
so thatThe point (4) is proved.
This ends the proof of Theorem 2.1.
Note that the point (1) gives the same bound as in [22, Theorem 2.6], as recalled in Theorem 1.4, but is defined as a lower bound, and is subject to different monotonicity and convexity assumptions on f and log(g). To the best of our knowledge, the other points offer new integral inequalities in the literature. In a sense, these results rectify and complete [22, Theorem 2.6], while maintaining the same mathematical approach.
3. Additional contributions
3.1. New results
The theorem below refinds the lower bound of the point (4) of Theorem 2.1 under a different convexity assumption, with a new statement of a sharp upper bound. The proof is innovated by an intermediate convexity result and the use of the Hermite–Hadamard integral inequalities.
Theorem 3.1.
Let a, b ∈ ℝ with a < b, and f : [a, b] → [1, +∞) and g : [a, b] → [1, +∞) be two two-times differentiable functions. We suppose that f and g are monotonic with the same monotonicity and convex. Then the following holds:
Proof of Theorem 3.1.
Using standard differentiation rules, for any x ∈ [a, b], we have
Similarly, with an appropriate factorization, for any x ∈ [a, b], we obtain
Thanks to the assumptions made on f and g, all the terms in the sum are non-negative. Just note that, for any x ∈ [a, b], f(x) ≥ 1 implies that f(x) − 1 ≥ 0, g(x) ≥ 1 implies that log[g(x)] ≥ 0, the fact that f and g are of the same monotonicity implies that f′(x)g′(x) ≥ 0, and the fact that f and g are convex implies that f″(x) ≥ 0 and g″(x) ≥ 0. So we have {[g(x)]f(x)}″ ≥ 0, which means that gf is convex. It follows from the convex part of the Hermite–Hadamard integral inequalities applied to gf thatThis concludes the proof of Theorem 3.1.
Note that if log(g) is convex, then g = exp[log(g)] is convex as a composite function of a convex function with a non-decreasing convex function. Therefore, the framework of this theorem is more flexible than that in the point (4) of Theorem 2.1. Furthermore, we emphasize the novelty of the upper bound, i.e.,
The convexity approach used in the proof is also original, and will be reused in some refinements presented in the subsection below.
3.2. Refinements
The result below is a well-known improvement of the right-hand side of the Hermite–Hadamard integral inequalities. We refer to the work in [21], which gives a complete study of this.
Theorem 3.2 ([21, Theorem 1]).
Let a, b ∈ ℝ with a < b and f : [a, b] → ℝ be a function.
Convex part: If f is convex, then the following holds:
Concave part: If f is concave, then the following holds:
The theorem below uses this result to refine the points (1), (2) and (3) of Theorem 2.1.
Theorem 3.3.
Let a, b ∈ ℝ with a < b, and f : [a, b] → [0, +∞) and g : [a, b] → [1, +∞) be two functions. We suppose that f and log(g) are monotonic with the same monotonicity. Furthermore,
(1) if f and log(g) are concave, then the following holds:
(2) if f is concave and log(g) is convex, then the following holds:
(3) if f is convex and log(g) is concave, then the following holds:
Proof of Theorem 3.3.
The first steps of the proof follow those of the proof of Theorem 2.1. In particular, inequality (2.3) ensures that
Let us now distinguish the assumptions in the three distinct points.
Since f and log(g) are non-negative and concave, the concave part of Theorem 3.2 applied to f and log(g) gives
It follows from inequalities (3.1) and (3.2) that
so thatThe point (1) is established.
Since f and log(g) are non-negative, f is concave and log(g) is convex, the concave part of Theorem 3.2 applied to f and the left-hand sides of the convex part of the Hermite–Hadamard integral inequalities applied to log(g), as recalled in Theorem 1.3, give
It follows from inequalities (3.1) and (3.3) that
so thatThe point (2) is proved.
Since f and log(g) are non-negative, f is convex and log(g) is concave, the left-hand sides of the convex part of the Hermite–Hadamard integral inequalities applied to f, as recalled in Theorem 1.3, and the concave part of Theorem 3.2 applied to log(g) give
so that The point (3) is proved.
This ends the proof of Theorem 3.3.
The theorem below uses Theorem 3.2 to refine the upper bound determined in Theorem 3.1.
Theorem 3.4.
Let a, b ∈ ℝ with a < b, and f : [a, b] → [1, +∞) and g : [a, b] → [1, +∞) be two two-times differentiable functions. We suppose that f and g are monotonic with the same monotonicity and convex. Then the following holds:
Proof of Theorem 3.4.
The first steps of the proof follow those of the proof of Theorem 3.1. In particular, the assumptions made imply that gf is convex. It follows from the convex part of Theorem 3.2 applied to gf that
This concludes the proof of Theorem 3.4.In the case where f and g are monotonic with the same monotonicity and convex, the upper bound obtained in this theorem is preferable to that in Theorem 3.1 because it is sharper, i.e., we have
3.3. A variant
The result below presents an integral inequality result dealing with the function g−f. It can be seen as a lower bound variant of Theorem 3.4.
Theorem 3.5.
Let a, b ∈ ℝ with a < b, and f : [a, b] → [1, +∞) and g : [a, b] → [1, +∞) be two two-times differentiable functions. We suppose that f and g are monotonic with the same monotonicity and convex. Then the following holds:
Proof of Theorem 3.5.
A suitable decomposition and an application of the Cauchy-Schwarz integral inequality give
so that Note that this result can also be obtained by applying the convex part of the Jensen integral inequalities to the convex function 1/x.On the other hand, Theorem 3.4 ensures that
This implies that It follows from inequalities (3.5) and (3.6) thatThis ends the proof of Theorem 3.5.
The lower bound obtained has an original form that does not correspond to that of any existing general integral inequality. To the best of our knowledge, it is new to the literature.
Other possible variants can be obtained by using different techniques. For example, we can think of using the Bernoulli inequality. More specifically,
if f : [a, b] → [1, +∞) and g : [a, b] → [1, +∞), the Bernoulli inequality gives, for any x ∈ [a, b],
if f : [a, b] → [0, 1] and g : [a, b] → [1, +∞), the Bernoulli inequality gives, for any x ∈ [a, b],
4. Conclusion
In this article, we have critically examined the validity of [22, Theorem 2.6], focusing on an upper bound for an integral of the form
In particular, we presented a counterexample and identified the gap in its proof, which results from a misapplication of the concave part of the Jensen integral inequalities. We then proposed a corrected version of the theorem under more appropriate convexity assumptions. We also established new lower and upper bounds for the main integral using an original convex property and refined Hermite–Hadamard integral inequalities. A variant based on the function g−f is also demonstrated. With these results, we contribute to the development of integral inequalities with potential applications in various fields, such as approximation theory, numerical analysis and optimization. We also provide some techniques that may be useful for future research on the topic, beyond the scope of the article.