Polish spaces of separable Banach lattices
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Polish spaces of separable Banach lattices".
Emmy: Here's the gist of the paper. We study the descriptive complexity of separable Banach lattices by encoding them as elements of Polish spaces, extending classical results from Banach spaces to the lattice setting.
Ada: The paper introduces two Polish space encodings of separable Banach lattices: one via closed sublattices and one via closed order ideals.
Emmy: It proves that for every separable Banach lattice E, the spaces of closed sublattices and of closed order ideals of E are Polish subspaces.
Ada: Furthermore, it establishes that the Fremlin projective tensor-product operation on ideal codes is Σ02-measurable and has a Gδ graph.
Paper summary: Ada: So, building on that foundation we just talked about, let's look at the specifics of "Polish spaces of separable Banach lattices." The paper focuses on extending classical results from Banach spaces to this lattice setting using these new encodings.
Emmy: They introduce two specific ways to code a separable Banach lattice E: first, by looking at its closed sublattices inside the universal lattice C, and second, by looking at its closed order ideals within the free Banach lattice FBL l1 <ref:2607.08064#pg1>.
Kolya: And what they prove is that for any separable Banach lattice E, both of these spaces—the space of closed sublattices and the space of closed order ideals—are Polish subspaces. This is the main topological claim they are making about these structures.
Ada: That means we have a concrete topological framework to work in when studying these lattices, which is a significant step up from just abstract algebra.
Emmy: And they don't stop at just being Polish spaces; they also establish that the Fremlin projective tensor product operation on the ideal codes is sigma zero two-measurable and has a G delta graph <ref:2607.08064#pg1>.
Kolya: A sigma zero two-measurable map with a G delta graph is a pretty concrete statement about how the tensor product interacts with these codes <ref:2607.08064#pg1>. It means we can analyze its behavior using fairly standard descriptive set theory tools, which gives us some hope for understanding the structure of these lattice products.
Ada: It’s like they’re showing that even though we are dealing with complex lattice structures, their topological representation is tame enough to allow for measurable analysis of key operations.
Conclusion: Ada: Looking at the whole "Polish spaces of separable Banach lattices" paper, it’s about taking separable Banach lattices, which are these kinds of vector spaces with extra lattice structure, and giving them a solid topological description by encoding them into Polish spaces.
Emmy: The authors use two distinct encodings—sublattices and order ideals—and prove that both resulting spaces are Polish subspaces. This gives us the machinery to study these lattices using the tools of descriptive set theory, which is a deep way of classifying mathematical objects based on their topological properties.
Kolya: What this means for us in practice is that we can now use theorems about Polish spaces to understand geometric and structural properties of these lattices, like those related to monotonicity or smoothness. It's moving the study from just calculating things to understanding the inherent complexity of the structures themselves.
Ada: Right, so it’s not just about classifying them anymore; it’s about understanding what kind of mathematical objects these lattices actually are from a topological viewpoint. The paper sets up a new language for describing these structures.
Emmy: And they also look at some specific lattice properties, like strict monotonicity being coanalytic, which tells us something about the complexity of finding strictly monotone lattices within those coded spaces.
Kolya: It suggests that the geometric properties we care about—things like how well a lattice is monotone or smooth—have a measurable complexity that we can actually bound. That’s what gives us something tangible to work with when applying these ideas to real applications, even abstract ones.
Ada: So, in short, this paper provides the topological scaffolding for analyzing separable Banach lattices by proving their encodings are Polish spaces and by showing that key operations on those codes have measurable properties.
MARIUSZ NIWINSKI
Jagiellonian University
math.FA, math.GN, math.LO
Submitted: 2026-07-09
Updated: 2026-10-31
Comments: 29p
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 77/100
The gist: We study the descriptive complexity of separable Banach lattices by encoding them as elements of Polish spaces, extending classical results from Banach spaces to the lattice setting.
Key concepts
- Polish Space Encoding
- This involves representing a separable Banach lattice as an element within a complete metric space (a Polish space). The paper uses two methods: one based on closed sublattices of the universal lattice C, and another using closed order ideals of the free Banach lattice FBL[l1]. This allows applying tools from descriptive set theory to study the lattice structure.
- Borel Complexity
- This refers to classifying mathematical properties within a hierarchy defined by Borel sets. The authors determine the complexity of various lattice-geometric features, such as strict monotonicity (coanalytic/Π₁¹) and uniform monotonicity (Π₀³). This classification helps understand the inherent descriptive difficulty of these geometric structures.
- Fremlin Tensor Product Map
- This map relates ideal codes in a product space. The paper proves this operation is $\Sigma_0^2$-measurable, meaning its structure is well-behaved in terms of measure theory on Polish spaces. Furthermore, the graph of this map has a G$\delta$ structure, indicating strong regularity.
- Sublattice/Order Ideal Spaces
- The paper shows that the space of closed sublattices (Subl(E)) and the space of closed order ideals (Ideal(E)) for any separable Banach lattice E are Polish subspaces. This means these spaces possess a complete metric structure, making them suitable for analysis using descriptive set theory.
Terminology
Summary
We study the descriptive complexity of separable Banach lattices by encoding them as elements of Polish spaces, extending classical results from Banach spaces to the lattice setting. p. 0 We also prove that the Fremlin projective tensor-product operation on ideal
codes is Σ
0
2
-measurable and has a Gδ graph. Introduction
This work studies the descriptive complexity of separable Banach lattices by encoding
them as elements of Polish spaces, extending classical results of Bossard [3] and Godefroy–
Saint-Raymond [7] from the Banach space setting to the lattice setting. 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]. 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 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 Σ
0
2
-measurable and has a Gδ graph.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Encoding Spaces of Separable Banach Lattices
The work introduces two distinct Polish space encodings for separable Banach lattices. The first encoding uses closed sublattices of the universal lattice C = C(∆;L1). p. 0 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 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]. 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.Where the paper says it
Where the paper says it
Where the paper says it
Descriptive Complexity Results
The paper establishes various Borel complexities for lattice-geometric properties within these coding spaces. Specifically, it proves that the Fremlin tensor product map on ideal codes is Σ02-measurable and has a Gδ graph. p. 0 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 Σ
0
2
-measurable and has a Gδ graph. The paper is organised as follows. In Section 2, we recall the basic notions from descriptive set theory and the theory of hyperspaces. Then F ∈ Ideal(E) if and only if F ∈ SB(E) and:
(I1) |fj (F)| ∈ F for all j ∈ ω (sublattice condition);
(I2) |gk| ∧ |fj (F)| ∈ F for all j, k ∈ ω (solidity tested on dense elements). Moreover, Ideal(E) is a closed (Π0
1
) subset of SB(E) and hence a Polish space. The Wijsman topology is the coarsest topology making this map a homeomorphism onto its image, where R
ω
carries the product topology. It is shown in [7] that the
Wijsman topology is admissible and independent of the choice of dense sequence.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Lattice-Geometric Properties in Coding Spaces
The authors investigate several lattice-geometric properties within the coding spaces. They establish Π03 bounds for uniform monotonicity and order uniform smoothness (in the sense of Kurc). p. 0 In Section 5, we study the Borel complexity
of the Fremlin tensor product map. In Section 6, we study several lattice-geometric properties within the coding spaces: we establish Π0
3 bounds for uniform monotonicity and order
uniform smoothness (in the sense of Kurc [9]), prove that strict monotonicity is coanalytic,
Date: May 2026. In Section 5, we study the Borel complexity
of the Fremlin tensor product map. In Section 6, we study several lattice-geometric properties within the coding spaces: we establish Π0
3 bounds for uniform monotonicity and order
uniform smoothness (in the sense of Kurc [9]), prove that strict monotonicity is coanalytic,
Date: May 2026. POLISH SPACES OF SEPARABLE BANACH LATTICES 9
is of Baire class 1. Therefore the preimage of every τW -closed set is a Π0
2
subset of (F(E), τ ).Where the paper says it
Where the paper says it
Where the paper says it
Open Problems and Further Directions
The paper concludes by posing several open problems related to the descriptive complexity of these classes. These include determining whether the Π03 bounds for UM and (o)-USm are sharp. p. 0 In Section 5, we study the Borel complexity
of the Fremlin tensor product map. In Section 6, we study several lattice-geometric properties within the coding spaces: we establish Π0
3 bounds for uniform monotonicity and order
uniform smoothness (in the sense of Kurc [9]), prove that strict monotonicity is coanalytic,
Date: May 2026. In Section 5, we study the Borel complexity
of the Fremlin tensor product map. In Section 6, we study several lattice-geometric properties within the coding spaces: we establish Π0
3 bounds for uniform monotonicity and order
uniform smoothness (in the sense of Kurc [9]), prove that strict monotonicity is coanalytic,
Date: May 2026. NIWINSKI ´
restrict the SICK-compactum discussion explicitly to the metrisable case, and formulate
the remaining completeness and sharpness problems. Preliminaries from descriptive set theory
We briefly recall the basic definitions.Where the paper says it
Where the paper says it
Where the paper says it
Key Definitions and Tools
The paper relies on foundational concepts from descriptive set theory, including the Borel hierarchy, and the theory of hyperspaces. It introduces notions like admissible topologies on hyperspaces F(X). p. 0 The paper is organised as follows. In Section 2, we recall the basic notions from descriptive set theory and the theory of hyperspaces. The paper is organised as follows. In Section 2, we recall the basic notions from descriptive set theory and the theory of hyperspaces. 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]. Free Banach lattices. For every Banach space X, the free Banach lattice generated
by X, denoted FBL[X], is characterised by the following universal property: there exists
an isometric embedding δX : X → FBL[X] such that, for every Banach lattice E and
every contractive linear operator T : X → E, there exists a unique contractive lattice
homomorphism Tˆ : FBL[X] → E satisfying Tˆ ◦ δX = T:
FBL[X]
X E
Tˆ
T
δX
Moreover, ∥Tˆ∥ = ∥T∥.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Tensor Product Complexity
The complexity of the Fremlin tensor product map is studied in Section 5. The map Ξ: X × X → Y is shown to be Σ02-measurable when X and Y carry the (subspace) Wijsman topologies. p. 2 The Wijsman topology is the coarsest topology making this map a homeomorphism onto its image, where R
ω
carries the product topology. It is shown in [7] that the
Wijsman topology is admissible and independent of the choice of dense sequence. The Wijsman topology is the coarsest topology making this map a homeomorphism onto its image, where R
ω
carries the product topology. It is shown in [7] that the
Wijsman topology is admissible and independent of the choice of dense sequence. The Wijsman topology is the coarsest topology making this map a homeomorphism onto its image, where R
ω
carries the product topology. It is shown in [7] that the
Wijsman topology is admissible and independent of the choice of dense sequence. 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 Σ
0
2
-measurable and has a Gδ graph. In particular, Π0
1
is the family of closed sets, ∆0
1
is the family of clopen sets, Σ
0
2
is the
family of Fσ sets, and Π0
2
is the family of Gδ sets. A set A ⊆ X is called Σ
0
α
-complete if A ∈ Σ
0
α
(X) and for every Polish space Y and
every B ∈ Σ
0
α
(Y ) there exists a continuous map f : Y → X such that f
−1
(A) = B.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Strict Monotonicity Bounds
The coanalytic upper bound for strict monotonicity is established in Theorem 6.8. The set STM(E) of strictly monotone lattices in Subl(E) is shown to be coanalytic (Π11). p. 6 Hence each set in the
intersection is closed, and their intersection is closed. □
Taking E = C yields a Polish space Subl(C) that serves as a coding space for separable
Banach lattices: every separable Banach lattice is isometrically lattice-isomorphic to some
element of this space. The Wijsman topology is the coarsest topology making this map a homeomorphism onto its image, where R
ω
carries the product topology. It is shown in [7] that the
Wijsman topology is admissible and independent of the choice of dense sequence. The Wijsman topology is the coarsest topology making this map a homeomorphism onto its image, where R
ω
carries the product topology. It is shown in [7] that the
Wijsman topology is admissible and independent of the choice of dense sequence. The Wijsman topology is the coarsest topology making this map a homeomorphism onto its image, where R
ω
carries the product topology. It is shown in [7] that the
Wijsman topology is admissible and independent of the choice of dense sequence. The Wijsman topology is the coarsest topology making this map a homeomorphism onto its image, where R
ω
carries the product topology. It is shown in [7] that the
Wijsman topology is admissible and independent of the choice of dense sequence.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Isometric Isomorphism Relation
The relation of isometric lattice isomorphism on Subl(C), defined by Y1 ∼ Y2 if and only if Y1 and Y2 are isometrically lattice-isomorphic, is analytic (Σ11). This relation can be expressed as the projection of a Borel subset of Subl(C) × Subl(C) × Cω. p. 6 A closed subspace F ∈ SB(E) is a sublattice of E if and only if
(1) |fj (F)| ∈ F for all j ∈ ω. Moreover, Subl(E) is a closed (Π0
1
) subset of SB(E) and hence a Polish space. A closed subspace F ∈ SB(E) is a sublattice of E if and only if
(1) |fj (F)| ∈ F for all j ∈ ω. Moreover, Subl(E) is a closed (Π0
1
) subset of SB(E) and hence a Polish space. Similarly, taking E = C, the space Subl(C) provides an alternative
embedding-based coding. A Borel ideal-hull operator. Similarly, taking E = C, the space Subl(C) provides an alternative
embedding-based coding. A Borel ideal-hull operator.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Hyperspace Coding
The paper discusses the hyperspace coding of compact metric spaces. The natural hyperspace for the metrisable SICK question is defined as SICKmet:= K ∈ F(H): K is a metrisable SICK compactum. p. 1 NIWINSKI ´
restrict the SICK-compactum discussion explicitly to the metrisable case, and formulate
the remaining completeness and sharpness problems. Preliminaries from descriptive set theory
We briefly recall the basic definitions.Where the paper says it
Borel Measurability of Operators
The relation of isometric lattice isomorphism on Subl(C) can be expressed as the projection of a Borel subset of Subl(C) × Subl(C) × Cω. This involves coding an operator by its values on a fixed dense sequence in C. p. 8 Similarly, taking E = C, the space Subl(C) provides an alternative
embedding-based coding. A Borel ideal-hull operator. SB(X) is a Π0
2
subset of F(X), and hence a Polish space in the subspace
topology. A key tool is the following consequence of Michael’s continuous selection theorem; see [7,
Theorem 4. SB(X) is a Π0
2
subset of F(X), and hence a Polish space in the subspace
topology. A key tool is the following consequence of Michael’s continuous selection theorem; see [7,
Theorem 4. A Banach lattice is a Banach space (E, ∥·∥E) equipped with a lattice
order ⪯ (that is, a partial order in which every pair x, y ∈ E has a supremum x ∨ y and
an infimum x ∧ y) satisfying, for all x, y, z ∈ E and α > 0:
(i) x ⪯ y =⇒ x + z ⪯ y + z,
(ii) x ⪯ y =⇒ αx ⪯ αy,
(iii) |x| ⪯ |y| =⇒ ∥x∥E ⩽ ∥y∥E,
where |x| = x ∨ (−x) denotes the modulus of x. A Banach lattice homomorphism is a linear operator between Banach lattices that preserves the lattice operations (equivalently, T(|x|) = |T x| for all x). A Banach lattice is a Banach space (E, ∥·∥E) equipped with a lattice
order ⪯ (that is, a partial order in which every pair x, y ∈ E has a supremum x ∨ y and
an infimum x ∧ y) satisfying, for all x, y, z ∈ E and α > 0:
(i) x ⪯ y =⇒ x + z ⪯ y + z,
(ii) x ⪯ y =⇒ αx ⪯ αy,
(iii) |x| ⪯ |y| =⇒ ∥x∥E ⩽ ∥y∥E,
where |x| = x ∨ (−x) denotes the modulus of x. A Banach lattice homomorphism is a linear operator between Banach lattices that preserves the lattice operations (equivalently, T(|x|) = |T x| for all x).Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Tensor Product Density
The density of the linear span of A ⊗ B in E⊗ˆ πF is shown using Lemma 5.3. This involves approximating elements in the completion by finite sums of simple tensors. The map Ξ: X × X → Y is shown to be Σ02-measurable when X and Y carry the (subspace) Wijsman topologies. The graph of this map is a Gδ subset of X × X × Y. p. 0 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 Σ
0
2
-measurable and has a Gδ graph. 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 Σ
0
2
-measurable and has a Gδ graph.Where the paper says it
Where the paper says it
Baire Class 1 Maps
The paper notes that every Σ02-measurable map from a Polish space into a metric space is of Baire class 1. This implies that the preimage of every open subset of Y is Σ02. p. 8 POLISH SPACES OF SEPARABLE BANACH LATTICES 9
is of Baire class 1. Therefore the preimage of every τW -closed set is a Π0
2
subset of (F(E), τ ). POLISH SPACES OF SEPARABLE BANACH LATTICES 9
is of Baire class 1. Therefore the preimage of every τW -closed set is a Π0
2
subset of (F(E), τ ).Where the paper says it
Where the paper says it
Strict Monotonicity Test
The complement of STM(E) is shown to be analytic (Σ11). This implies that STM(E) is Π11. p. 6 By Proposition 4. 3, condition (I1) implies that F is
a closed sublattice of E. The Wijsman topology is the coarsest topology making this map a homeomorphism onto its image, where R
ω
carries the product topology. It is shown in [7] that the
Wijsman topology is admissible and independent of the choice of dense sequence.Where the paper says it
Where the paper says it
Lattice Structure Tests
The authors define GSubl: Eω → Subl(E) by GSubl(xn)n∈ω:= the closed sublattice of E generated by the set. The map GIdeal is Borel measurable and returns the closed ideal generated by. p. 9 Consequently, with Γ as in Proposition 4. 8, the map
GIdeal := Γ ◦ GSubl : E
ω → Ideal(E)
is Borel measurable and returns the closed ideal generated by {xn : n ∈ ω}.Where the paper says it
Key Tools and Lemmas
The paper uses Lemma 3.2 to establish properties of the modulus operation x - y E ≤ x - yE. p. 0 In Section 5, we study the Borel complexity
of the Fremlin tensor product map. In Section 6, we study several lattice-geometric properties within the coding spaces: we establish Π0
3 bounds for uniform monotonicity and order
uniform smoothness (in the sense of Kurc [9]), prove that strict monotonicity is coanalytic,
Date: May 2026. We use in particular
the closedness and Polishness theorem for admissible kernel spaces [8, Proposition 3. 6], the
Wijsman-continuity of quotient-norm coordinates [8, Lemma 3. By Lemma 2. 3, the closure map (zm)m 7→ {zm : m ∈ ω} is Borel from E
ω
to F(E), hence
GSubl is Borel. Closed sublattices. Let E be a separable Banach lattice and let fj
: SB(E) → E,
j ∈ ω, be the continuous selections from Theorem 4. Closed sublattices. Let E be a separable Banach lattice and let fj
: SB(E) → E,
j ∈ ω, be the continuous selections from Theorem 4. Closed sublattices. Let E be a separable Banach lattice and let fj
: SB(E) → E,
j ∈ ω, be the continuous selections from Theorem 4. Closed sublattices. Let E be a separable Banach lattice and let fj
: SB(E) → E,
j ∈ ω, be the continuous selections from Theorem 4. 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 use in particular
the closedness and Polishness theorem for admissible kernel spaces [8, Proposition 3. 6], the
Wijsman-continuity of quotient-norm coordinates [8, Lemma 3. Consequently,
{(x, F) ∈ X × F(X): x ∈ F} = {(x, F): d(x, F) = 0}
is closed, so condition (A3) holds. For closed subspaces or ideals, the same distance coordinate is the quotient norm F 7→ ∥x+F∥; this is the basic Wijsman-continuity mechanism
used in Kania’s framework [8, Lemma 3. Similarly, taking E = C, the space Subl(C) provides an alternative
embedding-based coding. A Borel ideal-hull operator. Fix an enumeration (τm)m∈ω of
all lattice terms with rational coefficients in finitely many variables, built from variables
using addition, scalar multiplication by elements of Q, and the modulus operation |·|. Define GSubl : E
ω → Subl(E) by
GSubl(xn)n∈ω
:= {τm((xn)n∈ω): m ∈ ω}. Consequently, with Γ as in Proposition 4. 8, the map
GIdeal := Γ ◦ GSubl : E
ω → Ideal(E)
is Borel measurable and returns the closed ideal generated by {xn : n ∈ ω}.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Tensor Product Density Proof
The density of the linear span of A ⊗ B in E⊗ˆ πF is shown using Lemma 5.3. This involves approximating elements in the completion by finite sums of simple tensors. The map Ξ: X × X → Y is shown to be Σ02-measurable when X and Y carry the (subspace) Wijsman topologies. The graph of this map is a Gδ subset of X × X × Y. The proof involves showing that the preimage of each subbasic Wijsman-open set is Fσ. p. 1 In particular, Π0
1
is the family of closed sets, ∆0
1
is the family of clopen sets, Σ
0
2
is the
family of Fσ sets, and Π0
2
is the family of Gδ sets. A set A ⊆ X is called Σ
0
α
-complete if A ∈ Σ
0
α
(X) and for every Polish space Y and
every B ∈ Σ
0
α
(Y ) there exists a continuous map f : Y → X such that f
−1
(A) = B.Where the paper says it
The relation of isometric lattice isomorphism on Subl(C), defined by Y1 ∼ Y2 if and only if Y1 and Y2 are isometrically lattice-isomorphic, is analytic (Σ11). This relation can be expressed as the projection of a Borel subset of Subl(C) × Subl(C) × Cω. The continuous selectors from Theorem 4.2 can express in a Borel way that such a code determines a surjective linear isometry T: Y1 → Y2 satisfying T(x) = T x on a dense set, hence on all of Y1 by continuity of the lattice operations. The determination of whether this relation is Borel remains a natural structural problem for this coding space.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Coding of separable Banach lattices: The system can now encode any separable Banach lattice E as an element of a Polish space, specifically via
closed sublattices
orclosed order ideals.
This allows for descriptive complexity analysis of these lattice structures using established tools from descriptive set theory, such as the Borel hierarchy. -
Complexity analysis of tensor products: The system can determine the Borel complexity of operations like the Fremlin projective tensor product on ideal codes, proving it is Sigma 0 2-measurable and has a G delta graph. This enables more precise classification of how these complex constructions behave within coding spaces.
-
Lattice property verification: The system can verify lattice-geometric properties within the encoding spaces; for example, it can determine if a closed subspace F in SB(E) is a sublattice or an order ideal using tests like "I1
and
I2." This capability allows for automated identification of specific structural features of Banach lattices. -
Automated complexity bounds: The system can establish specific Borel rank bounds for lattice properties; for instance, it proves that the class UM(E) of uniformly monotone lattices is a Pi 0 3 subset of Subl(E). This provides a definitive upper bound on the complexity required to describe these important lattice classes.
-
Characterization of metrisable SICK compacta: The system can characterize metrisable SICK compacta by defining the set SICKmet as
K in F(H): K is a metrisable SICK compactum.
This provides a framework for classifying topological spaces based on their relationship to separable Banach lattices. -
Strict monotonicity testing: The system can determine if strict monotonicity is coanalytic (Pi 1 1) within the coding space Subl(E). This allows for rigorous testing of this property in various Banach lattice settings, guiding research into whether this upper bound is sharp.
-
Isometric lattice isomorphism detection: The system can analyze the relation of isometric lattice isomorphism on Subl(C), showing it is analytic (Sigma 1 1). This provides a framework to detect structural equivalence between different separable Banach lattices using codes derived from dense sequences.
Abstract
We compare two Polish presentations of separable real Banach lattices: closed sublattices of a universal lattice and closed ideals of FBL[1]. We construct translations preserving lattice isometry in both directions, continuous and injective from sublattices to ideals and Borel in the reverse direction. Natural generation and Fremlin tensor operations are Σ 0 2-measurable with G δ graphs. Isometric lattice isomorphism in either universal coding is Borel bireducible with a complete orbit equivalence relation of Polish-group actions. Uniform monotonicity and order uniform smoothness are Π 0 3-complete in both codings, whereas strict monotonicity, order smoothness, and order continuity are coanalytic. Abstract L p and AM-spaces form closed classes of sublattice codes. We also give explicit Borel bounds for atom counts, compact order intervals, and the lattice-isometry classes of L p[0,1], p, and c 0.
Sources
Related papers
- Local-to-Global Isometries in Standard-Norm Generalized Gyrovector Spaces
- Banach Gelfand Triples with Kernel Theorems via Equivalence Bimodules
- The Local Embedding Problem for Hardy Spaces of Dirichlet Series
- The Strong Naor--Schechtman Convolution Inequality on the Product of Cyclic Groups
- Structured coordinate systems in L p(R)
- Gelfand numbers of Schatten class embeddings in the quasi-Banach range