English

Bourgain-uo sequential completeness in vector lattices

Functional Analysis 2026-03-20 v2

Abstract

We revisit Bourgain's 1981 counterexample to the sequential completeness of the `pointwise plus domination' convergence on 1\ell_1 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 (xn)(x_n) in a vector lattice EE is called Buo-Cauchy if for every strictly increasing sequence (nk)(n_k) the differences xnk+1xnkx_{n_{k+1}}-x_{n_k} converge to 00 in order in EE. We first show that sequential Buo-completeness forces σ\sigma-order completeness. Thus every non-σ\sigma-order complete vector lattice fails sequential \Buo-completeness. In particular, free Banach lattices FBL(E)\mathrm{FBL}(E) are not sequentially Buo-complete whenever dimE>1\dim E>1. On the positive side, we prove that the classical sequence lattices c0c_0 and \ell_\infty 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 Lipb(X)\mathrm{Lip}_b(X) of bounded Lipschitz functions on a metric space (X,d)(X,d) is sequentially Buo-complete if and only if XX 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}
}
R2 v1 2026-07-01T08:28:18.371Z