A Classification of Order Convergence via a Transfinite Fatou Hierarchy

Abstract

We investigate the descriptive complexity of order convergence in separable Banach lattices. While uniform convergence is Borel and $σ$-order convergence is known to be ${\bf Δ}^1_2$, it is unclear in general when $σ$-order convergence is analytic. We introduce a transfinite hierarchy of weakenings of the classical Fatou property, indexed by countable ordinals, and show that it provides a complete structural classification of this definability problem. For a separable Banach lattice $X$, we prove that the following are equivalent: (i) the set of decreasing positive sequences with infimum zero is Borel; (ii) $σ$-order convergence is analytic; and (iii) $X$ satisfies the $α$-Fatou property for some countable ordinal $α$. We further establish that the hierarchy is proper: for every countable ordinal $α$ there exists a separable Banach lattice with a countable $π$-basis that fails to be $α$-Fatou, but is $β$-Fatou for some $β>α$. Thus the Borel definability of order convergence is governed by a canonical ordinal invariant intrinsic to the lattice, and the descriptive complexity can be arbitrarily high below $ω_1$. These results identify projective complexity as a genuine structural invariant in Banach lattice theory.

Figures (1)

• Figure 1: Implications between convergence types.

Theorems & Definitions (20)

• Remark 1.1
• Theorem 1.2
• Theorem 1.3
• Proposition 2.1: Lemmas 2.1 & 2.3 ARTT
• Proposition 2.2: Proposition 2.4 ARTT
• Lemma 2.3
• proof
• Lemma 3.1
• proof
• Lemma 3.2