Bourgain-uo sequential completeness in vector lattices
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 the positive side, we prove that the classical sequence lattices and are sequentially Buo-complete: every Buo-Cauchy sequence converges in order, and hence in the Buo sense. Finally, we obtain a sharp metric characterisation for bounded Lipschitz function lattices: the vector lattice of bounded Lipschitz functions on a metric space is sequentially Buo-complete if and only if is uniformly discrete.
Cite
@article{arxiv.2512.14949,
title = {Bourgain-uo sequential completeness in vector lattices},
author = {Tomasz Kania and Jarosław Swaczyna},
journal= {arXiv preprint arXiv:2512.14949},
year = {2026}
}