What was already known
Earlier sigma-order basis results under analytic determinacy and Mazur’s classical weak-basis proof.
AI involvement
A. Avilés, C. Rosendal, M. A. Taylor and P. Tradacete report that GPT-5.5 largely produced the proof after the suggestion to adapt Mazur’s weak-basis argument. Rosendal had suspected the result. Claude Opus 4.8 and GPT-5.6 Sol helped verify in Lean.
- Coordinate systems and maximal order complexity in Banach latticesCoordinate systems and maximal order complexity in Banach lattices
Importance
The proof obtains the Schauder-basis conclusion in ZFC for the specified order bases and gives a bound on the partial sums.
Technical verification
The authors report Lean 4 verification of the maximal inequality and both Schauder-basis forms at a fixed DSTBL3 revision. They carefully reviewed the formal statements. The paper discusses the final uniformity implication separately.
Formal checking
The authors report Lean 4 verification of the maximal inequality and both Schauder-basis forms at a fixed DSTBL3 revision. They carefully reviewed the formal statements. The paper discusses the final uniformity implication separately.
- Checker
- Avilés, Rosendal, Taylor and Tradacete via Lean 4
- Scope
- Maximal inequality and Schauder-basis forms of Theorem A. Authors reviewed statement correspondence. The uniform-basis implication uses the external theorem cited in the proof.
- Basis
- Reported by the linked checker
Human understanding
The authors explain the Mazur-style route and compare the formal statements with the manuscript. The paper attributes much of the central proof to GPT-5.5.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision