Abstract
In this paper, we employ a generalization of the Boas–Bellman inequality for inner products, as developed by Mitrinović–Pečarić–Fink, to derive several upper bounds for the -th power with of the numerical radius of the off-diagonal operator matrix for any bounded linear operators A and B on a complex Hilbert space . While the general matrix is not symmetric, a special case arises when , where the matrix becomes symmetric. This symmetry plays a crucial role in the derivation of our bounds, illustrating the importance of symmetric structures in operator theory.
Keywords:
power inequalities; operator norm; numerical radius; off-diagonal 2 × 2-operator matrix; Hilbert space MSC:
46C05; 47A63; 47A99; 15A39; 26D15
1. Introduction
Block matrix techniques play a pivotal role in matrix analysis and operator theory, offering theorems that characterize the properties of a matrix A, such as its norm, in terms of the properties of a larger matrix, in which A is embedded as a block. In areas like the theory of the Schur complement and the study of positive linear maps, particularly relevant in quantum information, block matrices are fundamental. Key theorems in these areas are framed in terms of such block matrices (see, e.g., [1] and the survey article [2] in the book [3]).
This present article aims to illustrate this technique through a specific problem concerning the numerical radius. By utilizing a generalization of the Boas–Bellman inequality for inner products, as developed by Mitrinović–Pečarić–Fink, we derive several power bounds for the numerical radius of the off-diagonal operator matrix.
Before presenting our results, we introduce relevant notions and notations. Throughout this paper, we consider as a complex Hilbert space equipped with an inner product and the corresponding norm . Specifically, for all . We denote the -algebra of bounded linear operators on as . Let . The adjoint of A is denoted by , and the positive square root of is expressed as . The real part and imaginary part of are defined as and , respectively. Furthermore, if , then the norm of A is defined as
while the numerical radius of A is given by
The numerical radius is also a norm on . Comparing the numerical radius and the operator norm, we have the inequalities:
which hold for every . For further details, see, e.g., [4,5,6,7,8,9,10].
Kittaneh [11] established an improved version of these inequalities, demonstrating the following:
To explore further progress regarding (1) and (2), interested individuals may consult [12,13,14,15,16,17,18].
Let us examine the off-diagonal part, denoted as , of a operator matrix defined on the direct sum space .
For every , it is well established that
In 2011, Hirzallah, Kittaneh, and Shebrawi [19] established several results, including the following double inequality:
Additionally, they demonstrated that
Furthermore, they derived several other notable inequalities of this kind.
In a significant publication by Kittaneh, Moslehian, and Yamazaki [20], they presented a refined version of the triangle inequality, which can be expressed as follows:
for all Several upper and lower bounds for the numerical radius of the operator matrix
were provided, considering different assumptions for the operators involved.
From a different perspective, in 2022, Bhunia and Paul obtained the following result, as stated in ([21], Lemma 2.4):
Motivated by the above results, in this paper, by utilizing a generalization of the Boas–Bellman inequality for inner products due to Mitrinović–Pečarić–Fink ([22], p. 392), we obtain several upper bounds for the power of the numerical radius of the off-diagonal operator matrix for any operators and . Applications in the case when are also provided. Although the matrix is typically non-symmetric, it becomes symmetric in the special case where . This symmetry is essential in deriving our bounds, highlighting the significance of symmetric structures in operator theory.
A key aspect of our results lies in providing general power inequalities that offer more comprehensive and diverse upper bounds for the numerical radius of off-diagonal operator matrices compared to those presented in recent papers [19,20,21]. Since our bounds for the specific case have distinct analytic expressions from those in [19,21], they are not directly comparable.
The novelty of our approach is in the application of a Mitrinović–Pečarić–Fink generalization of the well-known Boas–Bellman inequality for two vectors, a technique not previously employed by other authors to derive such bounds.
As highlighted in [5], upper bounds for the numerical radius can be useful in approximating polynomial solutions or estimating the numerical radius of the Frobenius companion matrix, as discussed in [17]. However, these applications require extensive research beyond the scope of this work and may be explored in future papers.
2. Some Preliminary Facts
In this section, we recall and establish some preliminary results that will be used in this work. We begin with the following generalization of Bessel’s inequality, which states that if are elements of , then the following inequality holds:
The inequality (3) is known as the Boas–Bellman inequality (see [23,24]).
A generalization of the Boas–Bellman inequality was provided by Mitrinović–Pečarić–Fink ([22], p. 392). They proved that, if are vectors in and , then the following inequality holds:
For in (4), we have
for complex numbers and vectors .
By using this result, we can establish the following operator norm inequalities:
Lemma 1.
Let , and . Then, we have
Proof.
If we take the power then we get
for all
Using the elementary inequality that follows from the convexity of the power function,
we get
and
for all
By utilizing (7) we derive
for all
Therefore, by taking the supremum over with , we derive
which proves (6). □
Corollary 1.
With the assumptions of Lemma 1, we have
and
3. Inequalities for Off-Diagonal Operator Matrix
In this section, we aim to establish some inequalities for the off-diagonal operator matrix. Our first investigation focuses on stating a result concerning upper bounds for the power of the numerical radius of the operator matrix. Before stating it, we need to recall from [20] the following lemma.
Lemma 2.
Let . Then
Now, we can prove the following result.
Theorem 1.
Let and then
and
Proof.
Further, observe that
for .
Another result is as follows:
Theorem 2.
Let and then
where
and
Proof.
Consider
Observe that
which implies that
for .
By taking the norm, we have
for .
By using the convexity of the power function, we have
for .
The following remark provides a special case of the above theorem and is of interest.
Remark 1.
For we get
where
and
Our next result reads as follows.
Theorem 3.
Let and Then
where
and
Proof.
Remark 2.
The case gives that
where
and
Moreover, we can state the following result as well:
Theorem 4.
Let and Then
where
and
Proof.
From (11) we have
for .
If we take the norm in (18), we get
for .
Further, if we take the power and use the convexity of the power function, we obtain
for .
For , we obtain the simpler inequality
where
and
We conclude this section with the following result.
Theorem 5.
Let and Then for , we have
where
and
4. Inequalities for One Operator
In this section, we present some applications of our results. By setting in Theorems 1 and 2, we obtain the following upper bounds for the power of the numerical radius for :
and
where
Now, if we utilize the inequalities from Theorems 3 and 5 for the same choice , we have:
where
and
and
where
and
Moreover, we have
where
and
for .
Finally, from (22) we get for that
5. Conclusions
In this paper, we have used a generalization of the Boas–Bellman inequality, known as the Mitrinović–Pečarić–Fink inequality, to find new upper bounds for the -th power of the numerical radius of off-diagonal operator matrices. Our results provide more varied and comprehensive bounds compared to those found in recent papers like [19,20,21]. Specifically, for the case , our bounds have different forms, making them unique and not directly comparable to those in the other papers.
The key innovation in our work is the use of the Mitrinović–Pečarić–Fink generalization, which has not been applied before in this context. This approach has allowed us to discover new inequalities, especially when the matrix becomes symmetric.
While our results add to the understanding of numerical radius inequalities, they also open up possibilities for future research. As noted in [5], upper bounds for the numerical radius can be useful in areas like approximating polynomial solutions or estimating the numerical radius of the Frobenius companion matrix, as discussed in [17]. These potential applications go beyond the scope of this paper and could be explored in future studies.
In summary, this work serves as a starting point for further research. We hope that the methods and results presented here will inspire more studies that continue to explore power inequalities and their uses in operator theory.
Author Contributions
The authors confirm that they have made equal contributions to this article. Each author played a significant role in its creation and provided valuable contributions. All authors have reviewed and approved the final version of the manuscript for publication.
Funding
Researchers Supporting Project number (RSP2024R187), King Saud University, Riyadh, Saudi Arabia.
Data Availability Statement
Data are contained within the article.
Acknowledgments
The authors sincerely thank the reviewers for their valuable comments and suggestions, which have significantly enhanced this paper. Furthermore, the first author wishes to express her deep appreciation for the support received from the Distinguished Scientist Fellowship Program under the Researchers Supporting Project number (RSP2024R187), King Saud University, Riyadh, Saudi Arabia.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Bhatia, R. Positive Definite Matrices; Princeton University Press: Princeton, NJ, USA, 2007. [Google Scholar]
- Zhang, F. Block Matrix Techniques. In The Schur Complement and its Applications; Zhang, F., Ed.; Springer: New York, NY, USA, 2005; pp. 83–110. [Google Scholar]
- Zhang, F. The Schur Complement and its Applications; Springer: New York, NY, USA, 2005. [Google Scholar]
- Ando, T.; Li, C.K. Special Issue: The Numerical Range and Numerical Radius. Linear Multilinear Algebra 1994, 37, 1–238. [Google Scholar] [CrossRef]
- Bhunia, P.; Bag, S.; Paul, K. Numerical radius inequalities and its applications in estimation of zero of plynomials. Linear Algebra Appl. 2019, 573, 166–177. [Google Scholar] [CrossRef]
- Bhunia, P.; Dragomir, S.S.; Moslehian, M.S.; Paul, K. Lectures on Numerical Radius Inequalities; Springer: Cham, Switzerland, 2022. [Google Scholar] [CrossRef]
- Gustafson, K.E.; Rao, D.K.M. Numerical Range, the Field of Values of Linear Operators and Matrices; Springer: New York, NY, USA, 1997. [Google Scholar]
- Halmos, P.R. A Hilbert Space Problem Book, 2nd ed.; Springer: New York, NY, USA, 1982. [Google Scholar]
- Horn, R.A.; Johnson, C.R. Topics in Matrix Analysis; Corrected reprint of the 1991 original; Cambridge University Press: Cambridge, UK, 1994. [Google Scholar]
- Wu, P.Y.; Gau, H.L. Numerical Ranges of Hilbert Space Operators; Cambridge University Press: Cambridge, UK, 2021. [Google Scholar]
- Kittaneh, F. Numerical radius inequalities for Hilbert space operators. Stud. Math. 2005, 168, 73–80. [Google Scholar] [CrossRef]
- Bag, S.; Bhunia, P.; Paul, K. Bounds of numerical radius of bounded linear operators using t-Aluthge transform. Math. Inequal. Appl. 2020, 23, 991–1004. [Google Scholar] [CrossRef]
- Bhunia, P.; Paul, K. Furtherance of numerical radius inequalities of Hilbert space operators. Arch. Math. 2021, 117, 537–546. [Google Scholar] [CrossRef]
- Bhunia, P.; Paul, K. Development of inequalities and characterization of equality conditions for the numerical radius. Linear Algebra Appl. 2021, 630, 306–315. [Google Scholar] [CrossRef]
- Bhunia, P.; Paul, K. Proper improvement of well-known numerical radius inequalities and their applications. Results Math. 2021, 76, 177. [Google Scholar] [CrossRef]
- Bhunia, P.; Paul, K. New upper bounds for the numerical radius of Hilbert space operators. Bull. Sci. Math. 2021, 167, 102959. [Google Scholar] [CrossRef]
- Kittaneh, F. A numerical radius inequality and an estimate for the numerical radius of the Frobenius companion matrix. Stud. Math. 2003, 158, 11–17. [Google Scholar] [CrossRef]
- Yamazaki, T. On upper and lower bounds for the numerical radius and an equality condition. Stud. Math. 2007, 178, 83–89. [Google Scholar] [CrossRef]
- Hirzallah, O.; Kittaneh, F.; Shebrawi, K. Numerical radius inequalities for certain 2 × 2 operator matrices. Integr. Equ. Oper. Theory 2011, 71, 129–147. [Google Scholar] [CrossRef]
- Kittaneh, F.; Moslehian, M.S.; Yamazaki, T. Cartesian decomposition and numerical radius inequalities. Linear Algebra Appl. 2015, 471, 46–53. [Google Scholar] [CrossRef]
- 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]
- Mitrinović, D.S.; Pečarić, J.E.; Fink, A.M. Classical and New Inequalities in Analysis; Kluwer Academic: Dordrecht, The Netherlands, 1993. [Google Scholar]
- Boas, R.P. A general moment problem. Am. J. Math. 1941, 63, 361–370. [Google Scholar] [CrossRef]
- Bellman, R. Almost orthogonal series. Bull. Am. Math. Soc. 1944, 50, 517–519. [Google Scholar] [CrossRef]
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. |
© 2024 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/).