Bourgain-uo sequential completeness in vector lattices
Tomasz Kania, Jaros{\l}aw Swaczyna

TL;DR
This paper explores Bourgain-uo convergence in vector lattices, showing its equivalence to order convergence for sequences, introduces a strengthened Cauchy notion, and characterizes sequential Buo-completeness in classical and Lipschitz function lattices.
Contribution
It introduces a new subsequence-invariant Buo-Cauchy concept, analyzes sequential Buo-completeness, and provides a metric characterization for Lipschitz function lattices.
Findings
Sequential Buo-completeness implies σ-order completeness.
Free Banach lattices are not sequentially Buo-complete when dimension > 1.
Lipschitz function lattices are sequentially Buo-complete iff the metric space is uniformly discrete.
Abstract
We revisit Bourgain's 1981 counterexample to the sequential completeness of the `pointwise plus domination' convergence on from the perspective of vector lattices. In this setting, we show that for sequences the associated notion of Bourgain--uo convergence coincides with ordinary order convergence. Motivated by Bourgain's construction, we introduce a strengthened, subsequence-invariant notion of Cauchy sequence: a sequence in a vector lattice is called Buo-Cauchy if for every strictly increasing sequence the differences converge to in order in . We first show that sequential Buo-completeness forces -order completeness. Thus every non--order complete vector lattice fails sequential \Buo-completeness. In particular, free Banach lattices are not sequentially Buo-complete whenever . On…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Banach Space Theory · Optimization and Variational Analysis · Fixed Point Theorems Analysis
