The complexity of some ordinal determined classes of operators

From MaRDI portal




Abstract: We compute the complexity of the classes of operators mathfrakGxi,zetacapmathcalL and mathfrakMxi,zetacapmathcalL in the coding of operators between separable Banach spaces. We also prove the non-existence of universal factoring operators for both complementmathfrakGxi,zeta and complementmathfrakMxi,zeta. The latter result is an ordinal extension of a result of Johnson and Girardi.









This page was built for publication: The complexity of some ordinal determined classes of operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174318)