A constructive analysis of a proof that the numerical range is convexAbstract: It is shown where the classical proof of the convexity of the numerical range of an operator on a Hilbert space breaks down by using principles that are not valid in intuitionistic logic. Those breakdowns are then repaired, as far as possible, to provide constructive versions of the convexity theorem. Finally, it is shown that our results are the best possible in a constructive setting. |
| This paper is available as | (128 KB). |
All papers published in the LMS JCM are covered by a copyright agreement with the authors. Access to the papers is bound by this agreement; click here for details.
Go to the Volume 3 index
Return to the LMS JCM Homepage