A Resolvent Criterion for Normality
Cara D. Brooks, Alberto A. Condori

TL;DR
This paper establishes new criteria for normality of matrices using pseudospectra and resolvent norms, showing that spectral properties can determine normality and providing practical tests for it.
Contribution
It introduces a resolvent-based criterion that is both necessary and sufficient for normality, linking spectrum and spectral norm in a novel way.
Findings
A distance formula for normality is proven to be both necessary and sufficient.
Spectral norm of a matrix's resolvent can be exactly recovered from its spectrum if the matrix is normal.
New criteria for normality are derived from pseudospectra and resolvent behavior.
Abstract
Given a normal matrix and an arbitrary square matrix (not necessarily of the same size), what relationships between and , if any, guarantee that is also a normal matrix? We provide an answer to this question in terms of pseudospectra and norm behavior. In doing so, we prove that a certain distance formula, known to be a necessary condition for normality, is in fact sufficient and demonstrates that the spectrum of a matrix can be used to recover the spectral norm of its resolvent precisely when the matrix is normal. These results lead to new normality criteria and other interesting consequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
