2000 character limit reached
A Beurling-Lax-Halmos theorem for spaces with a complete Nevanlinna-Pick factor
Published 14 May 2019 in math.FA and math.CV | (1905.05804v2)
Abstract: We provide a short argument to establish a Beurling-Lax-Halmos theorem for reproducing kernel Hilbert spaces whose kernel has a complete Nevanlinna-Pick factor. We also record factorization results for pairs of nested invariant subspaces.
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.