English

Schatten $p$-norm and numerical radius inequalities with applications

Functional Analysis 2024-07-09 v3

Abstract

We develop a new refinement of the Kato's inequality and using this refinement we obtain several upper bounds for the numerical radius of a bounded linear operator as well as the product of operators, which improve the well known existing bounds. Further, we obtain a necessary and sufficient condition for the positivity of 2×22\times 2 certain block matrices and using this condition we deduce an upper bound for the numerical radius involving a contraction operator. Furthermore, we study the Schatten pp-norm inequalities for the sum of two n×nn\times n complex matrices via singular values and from the inequalities we obtain the pp-numerical radius and the classical numerical radius bounds. We show that for every p>0p>0, the pp-numerical radius wp():Mn(C)Rw_p(\cdot): \mathcal{M}_n(\mathbb C)\to \mathbb R satisfies wp(T)12T2(1t)+T2(1t)T2t+T2tp/2 w_p(T) \leq \frac12 \sqrt{\left\| |T|^{2(1-t)}+|T^*|^{2(1-t)} \right\|^{} \, \big \||T|^{2t}+|T^*|^{2t} \big\|_{p/2}^{} } for all t[0,1]t\in [0,1]. Considering pp\to \infty, we get a nice refinement of the well known classical numerical radius bound w(T)12TT+TT.w(T) \leq \sqrt{\frac12 \left\| T^*T+TT^* \right \|}. As an application of the Schatten pp-norm inequalities we develop a bound for the energy of graph. We show that E(G)2mmax1in{j,vivjdj}, \mathcal{E}(G) \geq \frac{2m}{ \sqrt{ \max_{1\leq i \leq n} \left\{ \sum_{j, v_i \sim v_j}d_j\right\}} }, where E(G)\mathcal{E}(G) is the energy of a simple graph GG with mm edges and nn vertices v1,v2,,vnv_1,v_2,\ldots,v_n such that degree of viv_i is did_i for each i=1,2,,n.i=1,2,\ldots,n.

Keywords

Cite

@article{arxiv.2407.01962,
  title  = {Schatten $p$-norm and numerical radius inequalities with applications},
  author = {Pintu Bhunia and Satyajit Sahoo},
  journal= {arXiv preprint arXiv:2407.01962},
  year   = {2024}
}

Comments

19 pages. There is a typo in the abstract in V2, in this version we have corrected this

R2 v1 2026-06-28T17:26:00.148Z