Table of Contents
Fetching ...

Bourgain-uo sequential completeness in vector lattices

Tomasz Kania, Jarosław Swaczyna

Abstract

We revisit Bourgain's 1981 counterexample to the sequential completeness of the `pointwise plus domination' convergence on $\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 $(x_n)$ in a vector lattice $E$ is called Buo-Cauchy if for every strictly increasing sequence $(n_k)$ the differences $x_{n_{k+1}}-x_{n_k}$ 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 \Buo-completeness. In particular, free Banach lattices $\mathrm{FBL}(E)$ are not sequentially Buo-complete whenever $\dim E>1$. On the positive side, we prove that the classical sequence lattices $c_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 $\mathrm{Lip}_b(X)$ of bounded Lipschitz functions on a metric space $(X,d)$ is sequentially Buo-complete if and only if $X$ is uniformly discrete.

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.

Paper Structure

This paper contains 6 sections, 13 theorems, 71 equations.

Key Result

Proposition 2.6

For a sequence $(x_n)$ in a vector lattice $E$ and $x\in E$ the following are equivalent:

Theorems & Definitions (38)

  • Definition 2.1: Order convergence
  • Remark 2.2
  • Definition 2.3: Unbounded order convergence
  • Remark 2.4
  • Definition 2.5: Bourgain--uo convergence
  • Proposition 2.6
  • proof
  • Definition 2.7: Order-Cauchy
  • Definition 2.8
  • Lemma 2.9
  • ...and 28 more