Abstract

AbstractThe numerical range in the quaternionic setting is, in general, a non-convex subset of the quaternions. The essential numerical range is a refinement of the numerical range that only keeps the elements that have, in a certain sense, infinite multiplicity. We prove that the essential numerical range of a bounded linear operator on a quaternionic Hilbert space is convex. A quaternionic analogue of Lancaster theorem, relating the closure of the numerical range and its essential numerical range, is also provided.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.