Higher-rank Numerical Ranges and Kippenhahn Polynomials
Abstract
We prove that two n-by-n matrices A and B have their rank-k numerical ranges k(A) and k(B) equal to each other for all k, 1 k n/2+1, if and only if their Kippenhahn polynomials pA(x,y,z)(x Re A+y Im A+zIn) and pB(x,y,z)(x Re B+y Im B+zIn) coincide. The main tools for the proof are the Li-Sze characterization of higher-rank numerical ranges, Weyl's perturbation theorem for eigenvalues of Hermitian matrices and Bezout's theorem for the number of common zeros for two homogeneous polynomials.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.