2000 character limit reached
On the denseness of minimum attaining operators
Published 22 Sep 2016 in math.FA | (1609.06869v1)
Abstract: Let $H_1,H_2$ be complex Hilbert spaces and $T$ be a densely defined closed linear operator (not necessarily bounded). It is proved that for each $\epsilon>0$, there exists a bounded operator $S$ with $|S|\leq \epsilon$ such that $T+S$ is minimum attaining. Further, if $T$ is bounded below, then $S$ can be chosen to be rank one.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.