2000 character limit reached
On low-dimensional partial isometries
Published 5 Jun 2022 in math.FA | (2206.02141v1)
Abstract: Two statements concerning $n$-by-$n$ partial isometries are being considered: (i) these matrices are generic, if unitarily irreducible, and (ii) if nilpotent, their numerical ranges are circular disks. Both statements hold for $n\leq 4$ but fail starting with $n=5$.
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.