The complexity of some ordinal determined classes of operators
Abstract
We compute the complexity of the classes of operators G, ζ L and M, ζ L in the coding of operators between separable Banach spaces. We also prove the non-existence of universal factoring operators for both G, ζ and M, ζ. The latter result is an ordinal extension of a result of Johnson and Girardi.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.