Automatic continuity of order bases in Banach lattices
A basis expands each vector uniquely as a series. In a Banach lattice, an order basis requires the error in its partial sums to be bounded by terms decreasing to zero in the lattice order. The question is whether this condition also forces the expansion to converge in norm.
Why it matters and what counts as progress
Why it matters: Norm convergence makes the expansion a Schauder basis and gives continuous coordinate functionals. A maximal inequality gives quantitative control of all partial sums at once.
What counts as progress: Prove automatic norm convergence under stated order assumptions, establish a maximal inequality, or separate the notions by an example outside the hypotheses.
How the problem developed
- 2024 · A result under analytic determinacy [1]
A. Avilés, C. Rosendal, M. A. Taylor, P. Tradacete Avilés, Rosendal, Taylor and Tradacete proved uniformity of sigma-order bases assuming analytic determinacy.
- 24 Oct 2026 · Coordinate systems and maximal order complexity in Banach lattices [2]
A. Avilés, C. Rosendal, M. A. Taylor, P. Tradacete with AI assistance The same authors used GPT-5.5 to develop a Mazur-style proof in ZFC. They report Lean checks of the maximal inequality and the Schauder-basis statements.
AI contribution
Coordinate systems and maximal order complexity in Banach lattices
Proves that every order or sigma-order basis of a Banach lattice is automatically a Schauder basis in ZFC. The proof establishes a maximal inequality for the partial-sum projections and gives uniformity as a further consequence.
Sources
Publication history
Coordinate systems and maximal order complexity in Banach lattices
Daily emails by default, only when there’s an update.