Cartesian decomposition and Numerical radius inequalities
arXiv:1511.02094 · doi:10.1016/j.laa.2014.12.016
Abstract
We show that if is the Cartesian decomposition of , then for , . We then apply it to prove that if and , then \begin{align*} m\Vert \mbox{Re}(A)-\mbox{Re}(B)\Vert & \leq w(\mbox{Re}(A)X-X\mbox{Re}(B)) \\ & \leq \frac{1}{2}\sup_{θ\in \mathbb{R}}\left\Vert (AX-XB)+e^{iθ}(XA-BX)\right\Vert \\ & \leq \frac{\Vert AX-XB\Vert +\Vert XA-BX\Vert }{2}, \end{align*} where $\mbox{Re}(T)$ denotes the real part of an operator . A refinement of the triangle inequality is also shown.
8 pages, appeared in Linear Algebra Appl
Cited by in corpus (11)
- Seminorm and numerical radius inequalities of operators in semi-Hilbertian spaces
- Numerical radius inequalities and its applications in estimation of zeros of polynomials
- -Numerical radius orthogonality and parallelism of semi-Hilbertian space operators and their applications
- Inequalities for operator space numerical radius of block matrices
- Orthogonality and Numerical radius inequalities of operator matrices
- Improvements of Some Numerical radius inequalities
- Numerical radius inequalities concerning with algebraic norms
- Some generalizations of numerical radius on off-diagonal part of operator matrices
- Characterization of numerical radius parallelism in -algebras
- Matricial Radius: A Relation of Numerical radius with Matricial Range
- Unitarily invariant norm inequalities involving operators