A four-mean theorem and its application to pseudospectra
Thomas Ransford, Nathan Walsh

TL;DR
This paper proves a new inequality relating means of positive numbers and applies it to matrices with similar pseudospectra, establishing a sharp bound on polynomial norms of such matrices.
Contribution
Introduces a four-mean theorem and applies it to derive a sharp bound on polynomial norms for matrices with super-identical pseudospectra.
Findings
Established a new inequality for positive numbers with equal means.
Showed that matrices with super-identical pseudospectra satisfy a specific polynomial norm inequality.
Proved the inequality is sharp for the case N=4.
Abstract
Let . We show that, if and are -tuples of strictly positive numbers whose arithmetic, geometric and harmonic means agree, then \[ \max_j x_j <(N-2)\max_j y_j \quad\text{and}\quad \min_j x_j <(N-2)\min_j y_j. \] This is used to show that, if and are matrices with super-identical pseudospectra, then, for every polynomial , we have \[ \|p(A)\|< \sqrt{N-2}\|p(B)\|, \] unless . This improves a previously known inequality to the point of being sharp, at least for .
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.
Taxonomy
TopicsMathematical Inequalities and Applications · Matrix Theory and Algorithms · Mathematics and Applications
