Pith. sign in

REVIEW 1 major objections 6 minor 14 references

Polish spaces of separable Banach lattices

T0 review · 1 major / 6 minor · reviewed 2026-07-10 · glm-5.2

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Banach lattices get Polish coding; tensor product is Borel

desk verdict Solid infrastructure paper; coding spaces and tensor product measurability are the real results; Section 6 is thin read the letter →

arxiv 2607.08064 v1 pith:ASNQUBOZ submitted 2026-07-09 math.FA math.GNmath.LO

Mariusz Niwiński This is my paper
classification math.FAmath.GNmath.LO
keywords banachclosedseparablespaceslatticelatticespolishdelta
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper extends the descriptive-set-theoretic coding of separable Banach spaces to the lattice-ordered setting. It constructs two concrete Polish spaces whose elements parametrise all separable Banach lattices: one by coding each lattice as a closed sublattice of a single universal lattice C(Δ; L₁), and one by coding each lattice as a quotient of the free Banach lattice FBL[ℓ₁] — that is, by its kernel, a closed order ideal. The central structural result is that, inside the hyperspace of closed subsets of any separable Banach lattice E, the collection of closed sublattices Subl(E) and the collection of closed order ideals Ideal(E) are each closed (hence Polish) in the subspace topology inherited from the space of closed linear subspaces. The proof of closedness for ideals relies on a concrete solidity test: a closed subspace F is an ideal if and only if it is a sublattice and, for a fixed dense sequence (gₖ) and the Godefroy–Saint-Raymond continuous selections (fⱼ), one has |gₖ| ∧ |fⱼ(F)| ∈ F for all j, k. The paper then studies the Fremlin projective tensor product as an operation on ideal codes. The main analytic result is that the tensor product map Ξ: (J₁, J₂) ↦ J₁ ⊗̂|π| J₂ is Σ⁰₂-measurable (i.e., preimages of open sets are Fσ) and has a Gδ graph, when the coding spaces carry the Wijsman topology. The mechanism is that each Wijsman coordinate — the distance from a fixed dense point to the tensor product ideal — is an upper semicontinuous function of the input pair (J₁, J₂), because it is an infimum over countably many continuous functions built from dense simple tensors. Section 6 further establishes Π⁰₃ upper bounds for uniform monotonicity and order uniform smoothness within Subl(E), proves that strict monotonicity is coanalytic (Π¹₁), and leaves open whether these bounds are sharp.

What carries the argument

The Godefroy–Saint-Raymond continuous selections fⱼ: SB(E) → E, which provide a dense sequence in each closed subspace F and vary continuously with F in the Wijsman topology. These selections convert abstract lattice conditions (sublattice, ideal) into countable families of closed conditions involving the continuous lattice operations |·|, ∨, ∧. For the tensor product, the same selections produce a countable dense set of simple tensors in J₁ ⊗̂|π| J₂ that varies continuously with (J₁, J₂), reducing each Wijsman coordinate to an infimum of continuous functions and hence upper semicontinuity.

What would settle it

If the Godefroy–Saint-Raymond selections fⱼ: SB(E) → E, which are continuous for the Banach-space structure, fail to be compatible with the lattice operations in a way that breaks the approximation chain gₖₙ → u, fⱼₘ(F) → v, |gₖₙ| ∧ |fⱼₘ(F)| → u ∧ v = u, then the closedness of Ideal(E) in SB(E) could fail, undermining the Polish coding and the measurability results that depend on it.

Watch

Extended reading notes

Core claim

The spaces of closed sublattices and closed order ideals of any separable Banach lattice E are closed subsets of the space of closed linear subspaces SB(E), and are therefore Polish spaces. This yields two faithful coding spaces for all separable Banach lattices. On the quotient side, the Fremlin tensor product operation on ideal codes is Σ⁰₂-measurable with a Gδ graph, proved by showing each Wijsman distance coordinate is upper semicontinuous via approximation by dense simple tensors.

Load-bearing premise

The closedness of Ideal(E) depends on a specific approximation scheme: to verify solidity of a sublattice F, one approximates a positive element u ⪯ v ∈ F by a dense sequence gₖₙ → u and uses the selections fⱼₘ(F) → v, then applies condition (I2) — that |gₖ| ∧ |fⱼ(F)| ∈ F — together with the Lipschitz continuity of the lattice meet ∧ and the closedness of F. The argument requires that the selections fⱼ and the dense sequence gₖ interact compatibly with the lattice operations,

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 6 minor

Summary. The paper introduces two Polish space encodings of separable Banach lattices: one via closed sublattices of the universal lattice $C(Δ; L_1)$ and one via closed order ideals of the free Banach lattice $FBL[ℓ_1]$. The author proves that for every separable Banach lattice $E$, the spaces $Subl(E)$ and $Ideal(E)$ are closed ($Π^0_1$) subsets of $SB(E)$ and hence Polish (Proposition 4.3, Theorem 4.4). A Borel ideal-hull operator and Borel generation maps are constructed (Propositions 4.8, 4.9). The main analytic result is Theorem 5.4: the Fremlin projective tensor product map $Ξ: X × X → Y$ is $Σ^0_2$-measurable with a $G_δ$ graph. Section 6 establishes $Π^0_3$ upper bounds for uniform monotonicity and order uniform smoothness (Theorem 6.8), and a coanalytic upper bound for strict monotonicity. The proofs are detailed and follow established patterns from the Banach space coding literature (Bossard, Godefroy–Saint-Raymond, Kania).

Significance. The paper extends the descriptive set theory of separable Banach spaces to the Banach lattice setting. The two coding spaces are natural and well-motivated: the sublattice coding via the universal lattice $C(Δ; L_1)$ (using Leung–Li–Oikhberg–Tursi) and the ideal coding via $FBL[ℓ_1]$ (using Avilés–Rodríguez–Tradacete and Kania's quotient framework). The Fremlin tensor product measurability result (Theorem 5.4) is genuinely new and requires careful handling of the positive projective tensor norm and the ideal property. The complexity bounds for Kurc's lattice-geometric properties (Theorem 6.8) provide the first descriptive-complexity estimates for these properties. The proofs are self-contained where they need to be; the lattice-specific arguments (solidity test in Theorem 4.4, truncated normalizations in Theorem 6.8) are clearly presented.

major comments (1)
  1. Section 5.3 ('Open problems') is completely empty — it contains only the section header with no text. This appears to be an editorial oversight, but it disrupts the flow between Section 5 and Section 6. The author should either populate it with the relevant open questions (some of which currently appear in Section 6.5) or remove the header entirely and consolidate the open problems in Section 6.5.
minor comments (6)
  1. The paper relies heavily on Kania's framework [8], which is an arXiv preprint (2026). While the author is transparent about this dependency, several results (e.g., Theorem 4.4, the Wijsman-continuity mechanism) are described as Banach-lattice instances of Kania's general theorems. The author should briefly verify that the lattice-specific proofs given here do not depend on any unproven claims in [8] that go beyond standard results.
  2. In the proof of Theorem 6.8(a), the claim that $σ_F(ε) ≤ ε$ (used to handle the case $α=0$ or $β=0$) is stated without explicit justification. A one-line explanation (take $y = εx$ with $||x||=1$) would help the reader.
  3. Remark 5.6 provides a counterexample showing that the closure map $E_0^ω → F(E_0)$ is not continuous, using $E_0 = ℝ$. The example is correct but the remark could clarify that this obstruction is specific to the product topology on $E_0^ω$ and does not contradict the $Σ^0_2$-measurability established in Theorem 5.4.
  4. In Definition 6.6, the acronym SICK is expanded as 'Separable Ideal C(K)'. The original source [2] should be checked for the exact expansion; the parenthetical placement is slightly ambiguous.
  5. The convention $σ_{0}(ε) = 0$ and $ρ_{0}(τ) = 0$ for the zero lattice (stated before Theorem 6.8) is reasonable, but the remark that 'if one prefers to regard the zero lattice as uniformly monotone by vacuity, the corresponding class differs from ours by the singleton {{0}}' could note that this singleton is closed and hence does not affect the Borel complexity class.
  6. The paper would benefit from a brief remark on whether the two coding spaces (Subl(C) and Ideal(FBL[ℓ₁])) are Borel-isomorphic in a natural way, or whether they carry different structural information. This is not required for the main results but would contextualize the two encodings.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found; all proofs are self-contained with standard citations

full rationale

This is a pure mathematics paper in descriptive set theory and Banach lattice theory. The central results—Proposition 4.3 (closedness of Subl(E)), Theorem 4.4 (closedness of Ideal(E)), and Theorem 5.4 (Sigma^0_2-measurability and G_delta graph of the Fremlin tensor product map)—are proved from first principles using standard tools: Michael's continuous selection theorem (Theorem 4.2, cited from Godefroy-Saint-Raymond [7]), continuity of lattice operations (Lemma 3.2, proved in-text), the Wijsman topology construction (Example 2.2, self-contained), and the Fremlin tensor product norm (Section 5.1, standard definition). The citations to Kania's framework [8] are explicitly acknowledged as providing context and motivation (Section 1: 'The quotient-side coding used in this paper is the Banach-lattice instance of Kania's quotient-encoding programme'), and the author provides direct proofs rather than importing results by citation: 'The next theorem gives a direct lattice proof in our notation' (before Theorem 4.4). The ideal property of the Fremlin tensor product is cited from Nielsen [11], Fremlin [6], and Puglisi [12]—all independent external sources. No step in any derivation chain reduces to its own inputs by construction, no prediction is a fitted parameter renamed, and no uniqueness theorem is invoked to foreclose alternatives. The paper is entirely self-contained against external mathematical standards.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper introduces no new axioms or entities. All background results are cited from the literature. The constructions (coding spaces, approximant sequences) are built from standard tools.

assumptions (5)
  • standard math Michael's continuous selection theorem (Theorem 4.2, via Godefroy-Saint-Raymond [7])
    Provides continuous selections f_j: SB(E) -> E with dense image in each F. Used throughout Sections 4-6.
  • domain assumption FBL[l1] is a separable quotient generator for Banach lattices (Section 3.2, from Aviles-Rodriguez-Tradacete [1])
    Every separable Banach lattice is a quotient of FBL[l1] by a closed ideal. Underpins the ideal coding space.
  • domain assumption C(Delta; L1) is injectively universal for separable Banach lattices (Section 3.3, from Leung-Li-Oikhberg-Tursi [10])
    Every separable Banach lattice embeds as a closed sublattice of C. Underpins the sublattice coding space.
  • domain assumption Fremlin tensor product has the ideal property (Remark 5.1, from Nielsen [11]/Fremlin [6])
    If I, J are closed ideals, then I hat-tensor J is a closed ideal of E hat-tensor F. Required for the tensor product map to land in the ideal coding space.
  • standard math Wijsman topology is admissible and satisfies (A3) (Example 2.2, from Godefroy-Saint-Raymond [7])
    The membership relation {(x,F): x in F} is closed. Used in all closedness proofs for Subl(E) and Ideal(E).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Polish spaces of separable Banach lattices." pith.science (2026). https://pith.science/paper/ASNQUBOZ

@misc{pith2026260708064,
  author       = {Pith},
  title        = {Pith review of: Polish spaces of separable Banach lattices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ASNQUBOZ}},
  note         = {Machine review of arXiv:2607.08064}
}
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 $\mathcal{C}=C(\Delta;L_1)$, and one via closed order ideals of the free Banach lattice $\operatorname{FBL}[\ell_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 $\boldsymbol{\Sigma}^0_2$-measurable and has a $G_\delta$ graph.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

14 extracted references · 14 canonical work pages

  1. [1]

    Avil´ es, J

    A. Avil´ es, J. Rodr´ ıguez, and P. Tradacete,The free Banach lattice generated by a Banach space, J. Funct. Anal.274(2018), no. 10, 2955–2977

    work page 2018

  2. [2]

    Avil´ es, G

    A. Avil´ es, G. Mart´ ınez-Cervantes, A. Rueda Zoca, and P. Tradacete,Compact spaces associated to separable Banach lattices, Banach J. Math. Anal.16(2022), no. 4, Art. 67

    work page 2022

  3. [3]

    Bossard,A coding of separable Banach spaces

    B. Bossard,A coding of separable Banach spaces. Analytic and coanalytic families of Banach spaces, Fund. Math.172(2002), no. 2, 117–152

    work page 2002

  4. [4]

    de Pagter and A

    B. de Pagter and A. W. Wickstead,Free and projective Banach lattices, Proc. Roy. Soc. Edinburgh Sect. A145(2015), no. 1, 105–143

    work page 2015

  5. [5]

    Dodos,Banach Spaces and Descriptive Set Theory: Selected Topics, Lecture Notes in Mathematics, vol

    G. Dodos,Banach Spaces and Descriptive Set Theory: Selected Topics, Lecture Notes in Mathematics, vol. 1993, Springer-Verlag, 2010

    work page 1993

  6. [6]

    D. H. Fremlin,Tensor products of Banach lattices, Math. Ann.211(1974), 87–106

    work page 1974

  7. [7]

    Godefroy and J

    G. Godefroy and J. Saint-Raymond,Descriptive complexity of some isomorphism classes among Ba- nach spaces, J. Funct. Anal.275(2018), no. 4, 1008–1022

    work page 2018

  8. [8]

    Polish spaces for countable and separable structures through quotient encodings

    T. Kania,Polish spaces for countable and separable structures through quotient encodings, arXiv:2604.15843 [math.LO], 2026, doi:10.48550/arXiv.2604.15843

    work page Pith review arXiv doi:10.48550/arxiv.2604.15843 2026

Show all 14 references
  1. [9]

    Kurc,A dual property to uniform monotonicity in Banach lattices, Collect

    W. Kurc,A dual property to uniform monotonicity in Banach lattices, Collect. Math.44(1993), 155–165

    1993

  2. [10]

    D. H. Leung, L. Li, T. Oikhberg, and M. A. Tursi,Separable universal Banach lattices, Israel J. Math. 230(2019), 141–152

    2019

  3. [11]

    N. J. Nielsen,The ideal property of tensor products of Banach lattices with applications to the local structure of spaces of absolutely summing operators, Studia Math.74(1982), no. 3, 247–272

    1982

  4. [12]

    Puglisi,Fremlin tensor products of Banach lattices, Quaestiones Math.30(2007), no

    D. Puglisi,Fremlin tensor products of Banach lattices, Quaestiones Math.30(2007), no. 1, 45–56

    2007

  5. [13]

    H. H. Schaefer,Banach Lattices and Positive Operators, Grundlehren der mathematischen Wis- senschaften, vol. 215, Springer-Verlag, 1974

    1974

  6. [14]

    A. W. Wickstead,Banach lattices with the Nakano property, Positivity11(2007), no. 2, 329–339. Doctoral School of Exact and Natural Sciences, Faculty of Mathematics and Com- puter Science, Institute of Mathematics, Jagiellonian University, Lojasiewicza 6, 30-348 Krak´ow, Poland...

    2007

Pith tools

Reviewed July 10, 2026 · model on record in the stance chip above.