Abstract embeddability ranks
Abstract
We describe several ordinal indices that are capable of detecting, according to various metric notions of faithfulness, the embeddability between pairs of Polish spaces. These embeddability ranks are of theoretical interest but seem difficult to estimate in practice. Embeddability ranks, which are easier to estimate in practice, are embeddability ranks generated by Schauder bases. These embeddability are inspired by the nonlinear indices \`a la Bourgain from BLMSFM. In particular, we resolve a problem [Problem 3.10]BLMSFM regarding the necessity of additional set-theoretic axioms regarding the main coarse universality result of BLMSFM.
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.