Abstract
This paper introduces several generalized extensions of some recent numerical radius inequalities of Hilbert space operators. More preciously, these inequalities refine the recent inequalities that were proved in literature. It has already been demonstrated that some inequalities can be improved or restored by concatenating some into one inequality. The main idea of this paper is to extend the existing numerical radius inequalities by providing a unified framework. We also present a numerical example to demonstrate the effectiveness of the proposed approach. Roughly, our approach combines the existing inequalities, proved in literature, into a single inequality that can be used to obtain improved or restored results. This unified approach allows us to extend the existing numerical radius inequalities and show their effectiveness through numerical experiments.
MSC:
47A12; 47A30; 47A63
1. Introduction
The concepts of numerical range and numerical radius play a crucial role in linear algebra. The numerical range of a matrix is the set of all its eigenvalues, while the numerical radius is defined as the largest absolute value of the eigenvalues. These concepts are used to measure the stability and accuracy of a given matrix. They have applications in solving problems such as the numerical solution of differential equations, the numerical solution of integral equations and the approximation of functions. They also play a role in the study of linear operators, such as the spectral theory of linear operators. Numerical range and numerical radius have also been used to study the stability of solutions to linear and nonlinear differential equations. The numerical radius of a matrix is the largest magnitude of its eigenvalues, while the numerical range is the set of all values obtained by taking the inner product of the matrix with a unit vector. Both of these concepts are used to measure the stability of a matrix. Numerical range and numerical radius are used to analyze matrix behavior and can be utilized to determine the convergence or divergence of an iterative process. For example, the numerical radius of a matrix can be used to determine the convergence rate of the power method, which is a popular iterative algorithm used to calculate eigenvalues. They also provide insight into the structure of a matrix, its eigenvectors, and the nature of its eigenvalues. For example, if the numerical radius of a matrix is zero, then all eigenvalues of the matrix are real and the matrix is stable [1,2,3,4,5].
We let be the Banach algebra of all bounded linear operators defined on a complex Hilbert space with the identity operator in . Then, for a bounded linear operator on a Hilbert space , the numerical range of a bounded operator is defined by Additionally, the numerical radius is defined to be
We recall that the usual operator norm of an operator is defined to be
It is well known that the numerical radius defines an operator norm on , which is equivalent to the operator norm . Moreover, we have
for any .
Two years later, Kittaneh [7] proved his celebrated two-sided inequality
for any . These inequalities are sharp.
In [8], Dragomir established an upper bound for the numerical radius of the product of two Hilbert space operators, as follows:
In his recent work [1], Alomari refined the right-hand side of (3) and the recent results of Kittaneh and Moradi [2], as follows:
for any operator , , and . In particular, it was shown that
The first inequality in (6) was proven by Alomari in [1] and the second inequality by Kittaneh and Moradi in [2].
In particular, it was shown that
In [3], Sababheh and Moradi presented some new numerical radius inequalities. Among others, the well-known Hermite–Hadamard inequality was used to perform the following result:
for every and increasing the operator convex function .
On the other hand, Moradi and Sababheh, in [4], proved the following refinement of (9):
for all increasing convex functions . In particular, they proved
The constant is the best possible.
For more generalizations and recent related results concerning numerical radius, the reader may refer to [9,10,11,12,13,14,15,16,17,18,19] and the references therein. In addition, a survey of the numerical radius can be found in [20]. Other topics related to the numerical radius are discussed in [20,21,22]. Finally, readers should consult [23] for an overview of the most recent results and applications.
In this paper, we present several generalized extensions of numerical radius inequalities for Hilbert space operators that have been recently established. These extensions refine inequalities that were previously proven in [1,2]. It has been demonstrated that combining certain inequalities can lead to improvements or restorations of other inequalities. The main objective of this study is to provide a unified framework for certain numerical radius inequalities by extending the existing ones. Additionally, a numerical example is provided to showcase the effectiveness of the proposed approach.
Our approach involves combining the existing inequalities proven in [1,2] into a single inequality that can yield improved or restored results. This unified approach enables us to extend the existing numerical radius inequalities and validate their effectiveness through numerical examples. Specifically, this work explores several new extensions and generalizations of the inequalities stated in Equation (9), building upon the Sababheh–Moradi inequality (9). Notably, we prove that the middle term in Equation (9) is bounded by a generalized extension of the first inequality in Equation (5), thereby improving upon the second bound of the same inequality. Furthermore, Equation (9) itself is extended and refined. Similarly, we provide generalized extensions for Equations (10) and (11), as well as establish extensions for Equations (7) and (8).
2. Refinement of the Cauchy–Schwarz Inequality
To prove our results, we need a sequence of lemmas.
Lemma 1
([24]). (Theorem 1.4) Let be a positive operator. Then,
for any vector . Inequality (12) is reversed if .
Lemma 2
([25]). (Theorem 2.3) Let g be a non-negative convex function on , and let be two positive operators. Then,
Lemma 3
([24]). (Theorem 1.4) Let g be a convex function on a real interval J, then
for every self-adjoint operator whose spectrum contained in J.
The following two lemmas are key lemmas that are used as primary results in the whole of the presented results of this work. The author of [1] proved the following refinement of the mixed Cauchy–Schwarz inequality:
Lemma 4
([1]). Let . Then,
for all .
Lemma 5
([1]). Let , then
for any vectors and all .
The following two results generalize the main results in [26].
Proposition 1.
Let . If is an increasing and operator convex function, then
for all .
Proof.
By utilizing the classical mixed Schwarz inequality (15) (with ), we obtain
Since g is increasing,
taking the supremum over all unit vector in all previous inequalities, we obtain the required result. □
Proposition 2.
Let . If is an increasing and convex function, then
for all .
Proof.
Taking the supremum over all unit vector in all previous inequalities, we obtain the required result. □
The following result establishes a generalized extension of [1] (Theorem 6) that refines both the second inequality in (5) and (9) as well as merges the second inequality in (5) with (9).
Theorem 1.
Let . If is an increasing, submultiplicative, and operator convex function, then
for all .
Proof.
Since g is an increasing and operator convex, then, by Jensen’s inequality, we have
On the other hand, we have
Similarly, we have
Taking the supremum over all unit vector in all previous inequalities, we obtain the required result. To obtain the third inequality, from (20), we have
and this completes the proof of the Theorem. □
Corollary 1.
Let . Then, for any ,
for all .
Proof.
Applying Theorem 1 for the increasing, submultiplicative, and operator convex function, , . □
Remark 1.
A generalized extension that refines [1] (Theorem 5) and refines the middle term in (9) is incorporated in the following result.
Theorem 2.
Let . If is an increasing, submultiplicative and operator convex function, then
for all .
Proof.
Integrating with respect to over , we obtain
Taking the supremum over all unit vector in all previous inequalities, we obtain the first two inequalities, i.e.,
as desired, and this completes the proof of the Theorem. □
In the following result, we establish a generalized extension of [1] (Theorem 6) for the first inequality in (5) and the second inequality in (9), as well as merging the second inequality of (5) and (9). The following result simply refines Theorem 1.
Corollary 2.
Let . If is an increasing, submultiplicative, and operator convex function, then
for all .
Proof.
From the proof of the Theorem 2, we have
Applying the increasing operator convex function , we obtain
Taking the supremum over all unit vector , we obtain the desired result. The third inequality follows by applying (17) to the second term in the second inequality. □
Example 1.
Consider . It is easy to observe that . Applying the inequalities in (28) with for the increasing, submultiplicative, and operator convex function , we obtain
We may rewrite this in a more appropriate manner as follows:
A generalization of (23) could be extended in the following result.
Corollary 3.
Let . If is an increasing, submultiplicative and operator convex function, then
for all .
Proof.
From the proof of the Theorem 2, we have
Applying the operator convex function , we obtain
Taking the supremum over all unit vector , we obtain the desired result. □
Corollary 4.
Let . If is an increasing, submultiplicative and convex, then
for all .
Proof.
An improved extension of (10) and thus (11) and all previous inequalities could be stated as follows:
Theorem 3.
Let . If is an increasing and convex, then
for all . In a particular case, we have
Proof.
Since g is increasing and convex, then, by Jensen’s inequality, we have
Taking the supremum over all unit vector in all previous inequalities, we obtain the first and second inequalities (16).
The following result refines the chain of inequalities stated in Theorem 3. The new chain of inequalities is tighter and yields a better bound. It improves the accuracy of the numerical radius and yields more accurate predictions.
Corollary 5.
Let . If is an increasing, submultiplicative and operator convex, then
for all .
Proof.
The first two inequalities follow from the proof of Theorem 3. The last two inequalities follow from Theorem 1. □
Example 2.
Consider . It is easy to observe that . Applying the inequalities in (28) with and for the increasing, submultiplicative, and operator convex function , we obtain
which shows that (28) is a non-trivial refinement of (5) and thus (6). Indeed, this example shows that the main results in [1,2] are refined and improved.
In the following two results, we prove two nontrivial generalized extensions of the numerical radius inequalities for Hilbert space operators. In the next result, a refined generalization of (4) and (7) could be extended as in the following result.
Theorem 4.
Let . If g is an increasing, submultiplicative and operator convex function, then
for all .
Proof.
Let be a unit vector since g is increasing; then, by the refined Cauchy–Schwarz inequality (16), we have
On the other hand,
Also, and similarly, we have
The following result generalizes and extends the second inequality in (29).
Theorem 5.
Let . If is an increasing and operator convex, then
for all .
Proof.
Remark 2.
Further results concerning the numerical radius inequalities for the product of two Hilbert space operators could be deduced from Theorems 1–3 and Corollaries 1–5. For instance, setting and replacing by in Theorem 1, we obtain
for all . We leave further construction and the details to the interested reader.
3. Conclusions
This work provides several generalized extensions of some recent numerical radius inequalities of Hilbert space operators. The presented inequalities refine some recently proven inequalities in [1,2]. It has already been shown that concatenating certain inequalities can improve or restore some. By extending the existing numerical radius inequalities, the paper aims to provide a unified framework for numerical radius inequalities. We also present a numerical example to demonstrate the effectiveness of the proposed method. Our method combines the existing inequalities proven in [1,2] into a single inequality that can be used to obtain improved or restored results. This unified approach allows us extending the existing numerical radius inequalities and showing their effectiveness through numerical examples. Namely, in light of Sababheh–Moradi inequality (9), this work discusses several new extensions and generalizations of inequalities (5). Namely, it is shown that
for all and , such that is an increasing, submultiplicative and operator convex. Similar inequalities for the numerical radius of a product of two Hilbert space operators are established.
Author Contributions
Conceptualization, A.H., M.W.A. and R.S.; methodology, A.H.; software, A.Q.; validation, R.S. and A.Q.; formal analysis, A.H. and M.W.A. investigation, A.Q., R.H. and R.S.; resources, M.W.A.; data curation; M.W.A.; writing—original draft preparation, A.H.; writing—review and editing, A.H., M.W.A., A.Q., R.H. and R.S.; visualization, A.H.; supervision, M.W.A.; project administration, A.H.; funding acquisition, A.Q. and R.S. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
The data used to support the findings of this study are included within the article.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Alomari, M.W. On Cauchy-Schwarz type inequalities and applications to numerical radius inequalities. Ricerche Mat. 2022, 1–18. [Google Scholar] [CrossRef] [Scilit]
- Kittaneh, F.; Moradi, H.R. Cauchy-Schwarz type inequalities and applications to numerical radius inequalities. Math. Ineq. Appl. 2020, 23, 1117–1125. [Google Scholar] [CrossRef] [Scilit]
- Sababheh, M.; Moradi, H.R. More accurate numerical radius inequalities (I). Linear Multilinear Algebra 2021, 69, 1964–1973. [Google Scholar] [CrossRef] [Scilit]
- Moradi, H.R.; Sababheh, M. More accurate numerical radius inequalities (II). Linear Multilinear Algebra 2021, 69, 921–933. [Google Scholar] [CrossRef] [Scilit]
- Abu-Ghuwaleh, M.; Saadeh, R.; Qazza, A. General master theorems of integrals with applications. Mathematics 2022, 10, 3547. [Google Scholar] [CrossRef] [Scilit]
- Kittaneh, F. Numerical radius inequalities for Hilbert space operators. Studia Math. 2005, 168, 73–80. [Google Scholar] [CrossRef] [Scilit]
- Kittaneh, F. A numerical radius inequality and an estimate for the numerical radius of the Frobenius companion matrix. Studia Math. 2003, 158, 11–17. [Google Scholar] [CrossRef] [Scilit]
- Dragomir, S.S. Power inequalities for the numerical radius of a product of two operators in Hilbert spaces. Sarajevo J. Math. 2009, 5, 269–278. [Google Scholar]
- Burqan, A.; Alkhalely, S.; Conde, C. Some generalizations of numerical radius inequalities including the off-diagonal parts of block matrices. Filomat 2023, 37, 6355–6363. [Google Scholar]
- Aici, S.; Frakis, A.; Kittaneh, F. Refinements of some numerical radius inequalities for operators. Rend. Circ. Mat. Palermo II Ser. 2023, 72, 1–14. [Google Scholar] [CrossRef] [Scilit]
- Feki, K. Some A-numerical radius inequalities for d × d operator matrices. Rend. Circ. Mat. Palermo II Ser. 2022, 71, 85–103. [Google Scholar] [CrossRef] [Scilit]
- Altwaijry, N.; Dragomir, S.S.; Feki, K. On the joint A-numerical radius of operators and related inequalities. Mathematics 2023, 11, 2293. [Google Scholar] [CrossRef] [Scilit]
- Conde, C.; Feki, K. Some numerical radius inequality for several semi-Hilbert space operators. Linear Multilinear Algebra 2023, 71, 1054–1071. [Google Scholar] [CrossRef] [Scilit]
- Altwaijry, N.; Feki, K.; Minculete, N. On some generalizations of Cauchy-Schwarz inequalities and their applications. Symmetry 2023, 15, 304. [Google Scholar] [CrossRef] [Scilit]
- Kittaneh, F.; Moradi, H.R.; Sababheh, M. Sharper bounds for the numerical radius. Linear Multilinear Algebra 2023. [Google Scholar] [CrossRef] [Scilit]
- Hatamleh, R.; Zolotarev, V.A. Triangular Models of Commutative Systems of Linear Operators Close to Unitary Ones. Ukr. Math. J. 2016, 68, 791–811. [Google Scholar] [CrossRef] [Scilit]
- Altwaijry, N.; Feki, K.; Minculete, N. Further inequalities for the weighted numerical radius of operators. Mathematics 2022, 10, 3576. [Google Scholar] [CrossRef] [Scilit]
- Bhunia, P.; Paul, K. Some improvements of numerical radius inequalities of operators and operator matrices. Linear Multilinear Algebra 2022, 70, 1995–2013. [Google Scholar] [CrossRef] [Scilit]
- Hatamleh, R. On the form of the correlation function for a class of nonstationary field with a zero spectrum. Rocky Mt. J. 2003, 33, 159–173. [Google Scholar] [CrossRef] [Scilit]
- Dragomir, S.S. Inequalities for the Numerical Radius of Linear Operators in Hilbert Spaces; Springer: Cham, Switzerland, 2013. [Google Scholar]
- Bhunia, P.; Dragomir, S.S.; Moslehian, M.S.; Paul, K. Lectures on Numerical Radius Inequalities; Springer: Cham, Switzerland, 2022. [Google Scholar]
- Burqan, A.; Dbabesh, H.; Qazza, A.; Khandaqi, M. New bounds for the eigenvalues of Matrix polynomials. Eur. J. Pure Appl. Math. 2023, 16, 808–818. [Google Scholar] [CrossRef] [Scilit]
- Elin, M.; Reich, S.; Shoikhet, D. Numerical Range of Holomorphic Mappings and Applications; Springer: Cham, Switzerland, 2019. [Google Scholar]
- Furuta, T.; Mićić, J.; Pečarić, J.; Seo, Y. Mond–Pečarić Method in Operator Inequalities; Ele-Math Element Publishinhg House: Zagreb, Croatia, 2005. [Google Scholar]
- Aujla, J.; Silva, F. Weak majorization inequalities and convex functions. Linear Algebra Appl. 2003, 369, 217–233. [Google Scholar] [CrossRef] [Scilit]
- El-Haddad, M.; Kittaneh, F. Numerical radius inequalities for Hilbert space operators. II. Studia Math. 2007, 182, 133–140. [Google Scholar] [CrossRef] [Scilit]
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. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).