Let 𝒰 be an (r − 1)(2n−r + 2)∕2
dimensional subspace of n × n real valued symmetric matrices. Then 𝒰 contains a
nonzero matrix whose greatest eigenvalue is at least of multiplicity r, if
2 ≦ r ≦ n − 1. This bound is best possible. We apply this result to prove the
Bohnenblust generalization of Calabi’s theorem. We extend these results to hermitian
matrices.
Mathematics, Statistics and Computer
Science
University of Illinois at Chicago
SEO 322 (m/c 249)
851 South Morgan Street
Chicago IL 60607
United States