Polish spaces of separable Banach lattices
Abstract
We study the descriptive complexity of classes of separable Banach lattices. Building on the theory of coding spaces for separable Banach spaces, we introduce two Polish space encodings of separable Banach lattices: one via closed sublattices of the universal lattice C=C(Δ;L1), and one via closed order ideals of the free Banach lattice FBL[1]. We prove that, for every separable Banach lattice E, the spaces of closed sublattices and of closed order ideals of E are Polish subspaces of the hyperspace of closed subsets of E. We also prove that the Fremlin projective tensor-product operation on ideal codes is Σ02-measurable and has a Gδ graph.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.