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 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) in a vector lattice E is called Buo-Cauchy if for every strictly increasing sequence (nk) the differences xnk+1-xnk converge to 0 in order in E. We first show that sequential Buo-completeness forces σ-order completeness. Thus every non-σ-order complete vector lattice fails sequential -completeness. In particular, free Banach lattices FBL(E) are not sequentially Buo-complete whenever E>1. On the positive side, we prove that the classical sequence lattices c0 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 Lipb(X) of bounded Lipschitz functions on a metric space (X,d) is sequentially Buo-complete if and only if X is uniformly discrete.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…