Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-08T21:58:28.801Z Has data issue: false hasContentIssue false

Some convexity theorems for matrices

Published online by Cambridge University Press:  18 May 2009

P. A. Fillmore
Affiliation:
Indiana University, Bloomington, Indiana, U.S.A.
J. P. Williams
Affiliation:
Indiana University, Bloomington, Indiana, U.S.A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The numerical range of a bounded linear operator A on a complex Hilbertspace H is the set W(A) = {(Af, f): ║f║ = 1}. Because it is convex andits closure contains the spectrum of A, the numerical range is often a useful toolin operator theory. However, even when H is two-dimensional, the numerical range of an operator can be large relative to its spectrum, so that knowledge of W(A) generally permits only crude information about A. P. R. Halmos [2] has suggested a refinement of the notion of numerical range by introducing the k-numerical ranges

for k = 1, 2, 3, …. It is clear that W1(A) = W(A). C. A. Berger [2] has shown that Wk(A) is convex.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1971