Some Refinement of Holder’s and Its Reverse Inequality

Abstract

Holder’s inequality, its refinement, and reverse have received considerable attention in the theory of mathematical analysis and differential equations. In this paper, we give some refinements of Holder’s inequality and its reverse using a simple analytical technique of algebra and calculus. Our results show many results related to holder’s inequality as special cases of the inequalities presented.

Share and Cite:

Tijani, M. , Ojo, A. and Akinsola, O. (2023) Some Refinement of Holder’s and Its Reverse Inequality. Advances in Pure Mathematics, 13, 597-609. doi: 10.4236/apm.2023.139039.

1. Introduction

Holder’s inequality is a fundamental inequality in mathematical analysis that generalizes the Cauchy-Schwarz inequality to multiple sequences and different exponents. It is used in many areas of mathematics such as probability theory, functional analysis, and differential equations [1] . The inequality has been refined and reversed in many ways over the years [2] . For example, the reverse Holder inequality is used to deal with square (or higher-power) roots of expressions in inequalities since those can be eliminated through successive multiplication [3] . Both the holder’s inequality and Cauchy play an important role in many areas of mathematics [1] . Several authors have studied and obtained the generalization, refinement, sharpening, variation, and application of this inequality in the literature. A family of inequalities concerning inner products of vectors and functions began with Cauchy [4] . The extension and generalizations later led to inequalities of Schwarz, Minkowski, and Holder. Inequalities appear frequently in algebra, geometry, and analysis; they are powerful mathematical tools that appear across different areas of mathematics, helping mathematicians and scientists describe relationships, establish limits and bounds, and solve a wide variety of problems [2] . Many researchers have worked on generalization of Holder, its reverse, and refinement (see for example [1] - [19] ).

At the heart of Holder’s inequality lies a remarkable mathematical relationship. Given real number p, q, and r such that 1 < p , q , r and 1 p + 1 q = 1 r , and measurable functions f and g defined on a measurable space, Holder’s inequality can be succinctly stated as follows:

| f ( x ) g ( x ) | d x ( | f ( x ) | p d x ) 1 p ( | g ( x ) | q d x ) 1 q (1)

Holder’s inequality has significant implications in various branches of mathematics and analysis, including functional analysis, probability theory, and partial differential equations [1] . It is particularly useful in proving convergence properties of sequences of functions, estimating norms of integral operators, and establishing relationships between different function spaces. Holder’s inequality is a crucial concept in mathematics, providing a connection between norms, integrals, and inner products of functions and vectors. Refinements of Holder’s inequality involve adjusting the exponents or introducing additional terms to obtain more accurate upper bounds for specific situations [3] [5] . These refinements are valuable when dealing with particular types of functions or when extra information about the functions is available. By tailoring the inequality, refinements yield sharper estimates and reveal nuanced relationships between functions [5] [6] [7] . On the other hand, reverses of Holder’s inequality focus on establishing lower bounds for the given expression [1] [5] [8] . While the original inequality provides an upper bound, a reverse inequality gives insight into the minimum possible value. Reverses contribute to proving the optimality of Holder’s inequality and understanding the tightness of the bounds it establishes. They’re especially useful when trying to characterize scenarios in which functions are interdependent in specific ways.

The aim of this paper is achieved through the following objectives: 1) to use algebraic and calculus techniques to improve upper bounds by refining Holders inequality; 2) to explore lower bounds through the reverse of Holders’ inequalities refinement. The study is of great importance in Mathematical analysis, information theory, theory of elasticity, and others. In order to prove the main results, we need the following lemma.

2. Lemmas

The following two lemmas will be needed throughout the proof of our theorems.

Lemma 2.1 Let a , b 1 and λ ( 0 , 1 ) we have

s ( a b ) 2 + A ( λ ) log 2 ( a b ) λ a + ( 1 λ ) b a λ b 1 λ ( 1 s ) ( a b ) 2 + B ( λ ) log 2 ( a b ) ,

where s = min { λ , 1 λ } , A ( λ ) = λ ( 1 λ ) 2 s 4 and B ( λ ) = λ ( 1 λ ) 2 1 s 4 .

Lemma 2.2 Let 0 < a , b 1 , and λ ( 0 , 1 ) we have

s ( a b ) 2 + A ( λ ) a b log 2 ( a b ) λ a + ( 1 λ ) b a λ b 1 λ ( 1 s ) ( a b ) 2 + B ( λ ) a b log 2 ( a b ) ,

where s , A ( λ ) , B ( λ ) are given in lemma 2.1.

3. Main Results

Theorem 2.1. Let 1 < p < , 1 < q < , 1 r < , with 1 p + 1 q = 1 r . If f and g are two positive functions which admit integral on [a, b] for which there exist a b f p ( x ) d x and a b g q ( x ) d x finite with a b f p ( x ) d x > 0 , a b g q ( x ) d x and

1 < f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) M , x [ a , b ] .

Then, we have

1 a b f ( x ) ( g ( x ) ) q ( 1 1 p ) d x ( a b f p ( x ) d x ) 1 p ( a b g q ( x ) d x ) 1 1 p 2 min { 1 p , p 1 p } [ 1 a b f p 2 ( x ) g q 2 ( x ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 ] + ( p 1 2 p 2 1 4 min { 1 p , p 1 p } ) log 2 ( M ) (2)

Proof: From lemma 2.1, let b = 1 , λ = 1 p , 1 λ = 1 1 p , we have

1 p a + ( 1 1 p ) a 1 p ( 1 1 max { 1 p , p 1 p } ) ( a 1 ) 2 + [ p 1 2 p 2 1 4 ( 1 1 max { 1 p , p 1 p } ) ] log 2 M (3)

Substituting a = f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) > 1 into (3), we get

1 p f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) + ( 1 1 p ) ( f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) ) 1 p ( 1 1 max { 1 p , p 1 p } ) [ f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) 2 f p 2 ( x ) ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 g q 2 ( x ) + 1 ] + [ p 1 2 p 2 1 4 ( 1 1 max { 1 p , p 1 p } ) ] log 2 ( M ) (4)

Simplifying (4) completely, we have

1 p f p ( x ) a b f p ( x ) d x + g q ( x ) a b g q ( x ) d x 1 p g q ( x ) a b g q ( x ) d x f ( x ) ( a b f p ( x ) d x ) 1 1 p ( 1 1 max { 1 p , p 1 p } ) [ f p ( x ) a b f p ( x ) d x 2 f p 2 ( x ) g q 2 ( x ) ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 + g q ( x ) a b g q ( x ) d x ] + [ p 1 2 p 2 1 4 ( 1 1 max { 1 p , p 1 p } ) ] log 2 ( M ) g q ( x ) a b g q ( x ) d x (5)

By integrating inequality (5), we obtain

1 p + 1 1 p a b f ( x ) ( g ( x ) ) 2 ( 1 1 p ) d x ( a b f p ( x ) d x ) 1 p ( a b g q ( x ) d x ) 1 1 p ( 1 1 max { 1 p , p 1 p } ) [ 2 2 a b f p 2 ( x ) g q 2 ( x ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) ] + [ p 1 2 p 2 1 4 ( 1 1 max { 1 p , p 1 p } ) ] log 2 ( M ) (6)

Using the fact that, 1 1 max { 1 p , p 1 p } = 1 min { 1 p , p 1 p } , in (6) to get 

1 a b f ( x ) ( g ( x ) ) q ( 1 1 p ) d x ( a b f p ( x ) d x ) 1 p ( a b g q ( x ) d x ) 1 1 p 2 min { 1 p , p 1 p } [ 1 a b f p 2 ( x ) g q 2 ( x ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 ] + ( p 1 2 p 2 1 4 min { 1 p , p 1 p } ) log 2 ( M ) (7)

This completes the proof.

Theorem 2.2: Let 1 < p < , 1 < q < , 1 r < , with 1 p + 1 q = 1 r . If f and g are two positive functions which admits integral on [a, b] for which there exit a b f p ( x ) d x and a b g q ( x ) d x finite with a b f p ( x ) d x > 0 , a b g q ( x ) d x > 0 and

m < f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) < 1 , x [ a , b ] .

Then we have

1 a b f ( x ) ( g ( x ) ) q ( 1 1 p ) d x ( a b f p ( x ) d x ) 1 p ( a b g q ( x ) d x ) 1 1 p 2 min { 1 q , q 1 q } [ 1 a b f p 2 ( x ) g q 2 ( x ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 ] + ( q 1 2 q 2 1 4 min { 1 q , q 1 q } ) log 2 ( 1 m ) (8)

Proof: From lemma 2.2 let λ = 1 q , 1 λ = 1 1 q and a = 1 we get

1 q + ( 1 1 q ) b b 1 p [ 1 1 max { 1 q , q 1 q } ] ( 1 b ) 2 + [ q 1 2 q 2 1 4 ( 1 1 max { 1 q , q 1 q } ) ] log 2 ( 1 m ) (9)

Substituting b = f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) > 1 into (9) we get

1 q + ( 1 1 q ) ( f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) ) ( f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) ) 1 p ( 1 1 max { 1 q , q 1 q } ) [ 1 ( f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( c ) ) 1 2 ] 2 + [ q 1 2 q 2 1 4 ( 1 1 max { 1 q , q 1 q } ) ] log 2 ( 1 m ) (10)

Simplifying Equation (10) to obtain

1 q g q ( x ) a b g q ( x ) d x + f p ( x ) a b f p ( x ) d x 1 q f p ( x ) a b f p ( x ) d x f ( x ) ( a b f p ( x ) d x ) 1 p { g ( x ) } q ( 1 1 p ) ( a b g q ( x ) d x ) 1 1 p ( 1 1 max { 1 q , q 1 q } ) [ g q ( x ) a b g q ( x ) d x 2 f p 2 ( x ) g q 2 ( x ) ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 + f p ( x ) a b f p ( x ) d x ] + g q ( x ) a b g q ( x ) d x [ q 1 2 q 2 1 4 ( 1 1 max { 1 q , q 1 q } ) ] log 2 ( 1 m ) (11)

On integrating inequality (11), then (11) becomes

1 q + 1 1 q a b f ( x ) [ g ( x ) ] 2 ( 1 1 p ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 1 p ( 1 1 max { 1 q , q 1 q } ) [ 1 2 f p 2 ( x ) g q 2 ( x ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 + 1 ] + [ q 1 2 q 2 1 4 ( 1 1 max { 1 q , q 1 q } ) ] log 2 ( 1 m ) (12)

Using the fact that, 1 1 max [ 1 q , q 1 q ] = 1 min { 1 q , q 1 q } , in (12) we have

1 a b f ( x ) ( g ( x ) ) q ( 1 1 p ) d x ( a b f p ( x ) d x ) 1 p ( a b g q ( x ) d x ) 1 1 p 2 min { 1 q , q 1 q } [ 1 f p 2 ( x ) g q 2 ( x ) ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 ] + [ q 1 2 q 2 1 4 min { 1 q , q 1 q } ] log 2 ( 1 m ) (13)

This completes the proof.

Theorem 2.3. Let 1 < p < , 1 < q < , 1 r < , with 1 p + 1 q = 1 r . If f and g are two positive functions which admit integral on [a, b] for which there exist a b f p ( x ) d x and a b g q ( x ) d x finite with a b f p ( x ) d x > 0 , and a b g q ( x ) d x > 0

m < f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) < 1

1 a b f ( x ) ( g ( x ) ) q ( 1 1 p ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 1 p 2 min ( 1 q , q 1 q ) [ 1 2 f p 2 ( x ) g q 2 ( x ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 ] + ( q 1 2 q 2 1 4 min { 1 q , q 1 q } ) log 2 ( 1 m ) (14)

Proof: From lemma 2.2 let λ = 1 q , 1 λ = 1 1 q and a = 1 we have

1 q + ( 1 1 q ) b b 1 p ( 1 1 max { 1 q , q 1 q } ) ( 1 b ) 2 + ( q 1 2 q 2 1 4 ( 1 1 max { 1 q , q 1 q } ) ) log 2 ( 1 m )

Substituting b = f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) > 1 into (14) we get

1 q + ( 1 1 q ) f p ( x ) a p f p ( x ) d x a b g q ( x ) d x g q ( x ) ( f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) ) 1 p ( 1 1 max { 1 q , q 1 q } ) ( 1 ( f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) ) 1 2 ) 2 + ( q 1 2 q 2 1 4 ( 1 1 max { 1 p , p 1 p } ) ) log 2 ( 1 m ) (15)

Simplifying (15) completely to have

( 1 q g q ( x ) a b g q ( x ) d x + f p ( x ) a b f p ( x ) d x 1 q f p ( x ) a b f p ( x ) d x f ( x ) ( a b f p ( x ) d x ) 1 p ( g ( x ) ) q ( 1 1 p ) ( a b g q ( x ) d x ) 1 1 p ) ( 1 1 max { 1 q , q 1 q } ) [ g q ( x ) a b g q ( x ) d x 2 f p 2 ( x ) g q 2 ( x ) ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 + f p ( x ) a b f p ( x ) d x ] + g q ( x ) a b g q ( x ) d x ( q 1 2 q 2 1 4 ( 1 1 max ( 1 q , q 1 q ) ) ) log 2 ( 1 m ) (16)

On integrating Equation (16) with respect to x, we get

1 q + 1 1 q a b f ( x ) ( g ( x ) ) q ( 1 1 p ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 1 p ( 1 1 max { 1 q , q 1 q } ) [ 1 2 f p 2 ( x ) g q 2 ( x ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 + 1 ] + ( q 1 2 q 2 1 4 ( 1 1 max { 1 q , q 1 q } ) ) log 2 ( 1 m ) (17)

Using the fact that, 1 1 max [ 1 q , q 1 q ] = 1 min { 1 q , q 1 q } , in (17) we have

1 a b f ( x ) ( g ( x ) ) q ( 1 1 p ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 1 p 2 min ( 1 q , q 1 q ) [ 1 2 f p 2 ( x ) g q 2 ( x ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 ] + ( q 1 2 q 2 1 4 min { 1 q , q 1 q } ) log 2 ( 1 m ) (18)

This completes the proof.

Theorem 2.4. Let 1 < p < , 1 < q < , 1 r < with 1 p + 1 q = 1 r . If f and g are two positive functions which admit integral on [a, b] for which there exist a b f p ( x ) d x and a b g q ( x ) d x are finite with a b f p ( x ) d x > 0 , a b g q ( x ) d x > 0 , then

m < k f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) < 1 , x [ a , b ] , k > 0

Proof: Taking lemma 2.1, let a = 1 , λ = 1 q , 1 λ = 1 1 q we have

1 q + ( 1 1 q ) b b 1 p ( 1 1 max { 1 q , q 1 1 } ) ( 1 b ) 2 + ( q 1 2 q 2 1 4 ( 1 1 max { 1 q , q 1 q } ) ) log 2 ( 1 m ) (19)

Substituting b = f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) > 1 into (19) we get

1 q + ( 1 1 q ) k f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) ( k f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) ) 1 p ( 1 1 max { 1 q , q 1 q } ) ( 1 ( k f p ( x ) a b f p ( x ) d x a b g q ( x ) d x g q ( x ) ) 1 2 ) 2 + ( q 1 2 q 2 1 4 ( 1 1 max { 1 q , q 1 q } ) ) log 2 ( 1 m ) (20)

Simplifying Equation (20) completely to have

[ 1 q g q ( x ) a b g q ( x ) d x + k f p ( x ) a b f p ( x ) d x 1 q f p ( x ) a b f p ( x ) d x k p f ( x ) ( a b f p ( x ) d x ) 1 p ( g ( x ) ) q ( 1 1 p ) ( a b g q ( x ) d x ) 1 1 p ] ( 1 1 max { 1 q , q 1 q } ) ( g q ( x ) a b g q ( x ) d x 2 k f p 2 ( x ) ( a b f p ( x ) d x ) 1 2 g q 2 ( x ) ( a b g q ( x ) d x ) 1 2 + g q ( x ) a b g q ( x ) d x ) + g q ( x ) a b g q ( x ) d x [ q 1 2 q 2 1 4 ( 1 1 max ( 1 q , q 1 q ) ) ] log 2 ( 1 m ) (21)

On integrating Equation (21) with respect to x, we have

1 q + k 1 q k p f ( x ) ( a b f p ( x ) d x ) 1 p ( g ( x ) ) q ( 1 1 p ) d x ( a b g q ( x ) d x ) 1 1 p ( 1 1 max { 1 q , q 1 q } ) [ 1 2 k f p 2 ( x ) g q 2 ( x ) ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 + 1 ] + ( q 1 2 q 2 1 4 ( 1 1 max { 1 q , q 1 q } ) ) log 2 ( 1 m ) (22)

Using the fact that 1 1 max { 1 q , q 1 q } = 1 min { 1 q , q 1 q } in Equation (22) we have

k k P f ( x ) ( a b f p ( x ) d x ) 1 p ( g ( x ) ) q ( 1 1 p ) d x ( a b g q ( x ) d x ) 1 1 p 2 min { 1 q , q 1 q } [ 1 k f p 2 ( x ) g q 2 ( x ) d x ( a b f p ( x ) d x ) 1 2 ( a b g q ( x ) d x ) 1 2 ] + ( q 1 2 q 2 1 min { 1 q , q 1 q } ) log 2 ( 1 m ) (23)

This completes the proof.

Theorem 2.5. Let 1 < p < , 1 < q < , 1 r < , with 1 p + 1 q = 1 r . If f and g are two positive function f L p , g L q with f p > 0 , g > 0 for which there exist

1 < f p f p p g q q g q M , x [ a , b ] , M > 0

Proof: Taking in theorem 2.2, b = 1 , λ = 1 p , 1 λ = 1 1 p , we will obtain

1 p a + ( 1 1 p ) a 1 p ( 1 1 max ( 1 p , p 1 p ) ) ( a 1 ) 2 + ( p 1 2 p 2 1 4 ( 1 1 max ( 1 p , p 1 p ) ) ) log M (24)

Putting a = f p f p p g q q g q > 1 we will have

1 p f p f g q q g q + ( 1 1 p ) ( f p f p p g q q g q ) 1 p ( 1 1 max ( 1 p , p 1 p ) ) [ ( f p f p p g q q g q ) 1 2 1 ] 2 + ( p 1 2 p 2 1 4 ( 1 1 max ( 1 p , p 1 p ) ) ) log 2 ( M ) (25)

Simplifying (25) completely we get

( 1 p f p f p p + g q g q q 1 p g q g q q f f p g q ( 1 1 p ) ( g q q ) 1 1 p ) ( 1 1 max ( 1 p , p 1 p ) ) ( f p f p p 2 f p 2 g q 2 f p p 2 g g q 2 + g q g q q ) + [ p 1 2 p 2 1 4 ( 1 1 max ( 1 p , p 1 p ) ) ] log 2 ( M ) (26)

On Integrating both sides we have;

1 p + 1 1 p f g q ( 1 1 p ) f p ( g q q ) 1 1 p ( 1 1 max ( 1 p , p 1 p ) ) [ 1 2 Ω f p 2 g q 2 d μ f p p 2 g g q 2 + 1 ] + ( p 1 2 p 2 1 4 ( 1 1 max ( 1 p , p 1 p ) ) ) log 2 ( M ) (27)

Using the fact that 1 1 max { 1 p , p 1 p } = 1 min { 1 p , p 1 p } in Equation (27) we have

1 f g q ( 1 1 p ) f p ( g q q ) 1 1 p 2 min ( 1 p , p 1 p ) [ 1 Ω f p 2 g q 2 d μ f p p 2 g g q 2 ] + ( p 1 2 p 2 1 4 min ( 1 p , p 1 p ) ) log 2 ( M )

This completes the proof.

The refinement of Hoders’ inequality explain the fact that 1/∞ means zero. In the above proof, if p = , it means that f is equivalent to essential supremum of | f | ; also, in the Holder’s inequality, 0 × and × 0 means 0. The above mathematical analysis finds application in both algebra and calculus in the area of mathematics.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Benaissa, B. and Budak, H. (2020) More on Reverse of Holder’s Integral Inequality. Korean Journal of Mathematics, 28, 9-15.
[2] Ojo, A. and Olanipekun, P.O. (2023) Refinements of Generalised Hermite-Hadamard Inequality. Bulletin des Sciences Mathématiques, 188, Article ID: 103316.
https://doi.org/10.1016/j.bulsci.2023.103316
[3] Nikolova, L., Persson, L.-E. and Varošanec, S. (2023) Some New Refinements of the Young, Hölder, and Minkowski Inequalities. Journal of Inequalities and Applications, 2023, Article No. 28.
https://doi.org/10.1186/s13660-023-02934-0
[4] Finner, H. (1992) A Generalization of Holder’s Inequality and Some Probability Inequalities. The Annals of Probability, 20, 1893-1901.
https://doi.org/10.1214/aop/1176989534
[5] Ighachane, M.A., Benabdi, E H. and Akkouchi, M. (2022) A New Refinement of the Generalized Hölder’s Inequality with Applications. Proyecciones, 41, 643-661.
https://doi.org/10.22199/issn.0717-6279-4538
[6] Tian, J. (2013) A New Refinement of Generalized Hölder’s Inequality and Its Application. Journal of Function Spaces, 2013, Article ID: 686404.
https://doi.org/10.1155/2013/686404
[7] Tian, J. (2012) Reversed Version of a Generalized Sharp Hölder’s Inequality and Its Applications. Information Sciences, 201, 61-69.
https://doi.org/10.1016/j.ins.2012.03.002
[8] Frühwirth, L. and Prochno, J. (2022) Hölder’s Inequality and Its Reverse—A Probabilistic Point of View. Mathematische Nachrichten.
https://doi.org/10.1002/mana.202200411
[9] Abramorich, S., Pečarić, J. and Varošanec, S. (2005) continuous Sharpening of Hölder’s and Minkowski’s Inequality. Mathematical Inequality and Application, 8, 179-190.
https://doi.org/10.7153/mia-08-18
[10] Ash, R.B. (2014) Measure, Integration, and Functional Analysis. Academic Press, Cambridge.
[11] Beckenbach, E.F. and Bellman, R. (2012) Inequalities. Vol. 30, Springer Science & Business Media, Berlin.
[12] Clarke, F.H. (1981) Generalized Gradients of Lipschitz Functionals. Advances in Mathematics, 40, 52-67.
https://doi.org/10.1016/0001-8708(81)90032-3
[13] Furuichi, S. and Minculete, N. (2021) Refined Young Inequality and Its Application to Divergences. Entropy, 23, Article No. 514.
https://doi.org/10.3390/e23050514
[14] Furuichi, S. and Minculete, N. (2011) Alternative Reverse Inequalities for Young’s Inequality. Journal of Mathematical Inequalities, 5, 595-600.
https://doi.org/10.7153/jmi-05-51
[15] Hill, R. (1950) The Mathematical Theory of Plasticity. Oxford University Press. Oxford, 613-614.
[16] Kittaneh, F. and Manasrah, Y. (2011) Reverse Young and Heinz Inequalities for Matrices. Linear and Multilinear Algebra, 59, 1031-1037.
https://doi.org/10.1080/03081087.2010.551661
[17] Liao, W., Wu, J. and Zhao, J. (2015) New Versions of Reverse Young and Heinz Mean Inequalities with the Kantorovich Constant. Taiwanese Journal of Mathematics, 19, 467-479.
https://doi.org/10.11650/tjm.19.2015.4548
[18] Nolder, C.A. (1999) Hardy-Littlewood Theorems for A-Harmonic Tensors. Illinois Journal of Mathematics, 43, 613-632.
https://doi.org/10.1215/ijm/1256060682
[19] Olanipekun, P.O., Mogbademu, A.A. and Omotoyinbo, O. (2016) Jensen-Type Inequalities for a Class of Convex Functions. Facta Universitatis, Series: Mathematics and Informatics, 31, 655-666.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.