The problem
Let be a sequence of distinct real numbers. Determine
where the maximum is taken over all monotonic subsequences.
Statement quoted from erdosproblems.com/1026, maintained by Thomas Bloom. Original source: [Er71,p.107]. Current status there: solved (Lean).
AI contributions
As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.
| Date | Kind | AI systems | Humans | Outcome | Literature |
|---|---|---|---|---|---|
| 7 Dec, 2025 | AI on its own; related literature found afterwards | Aristotle | — | 🟢 Full solution (Lean) | 🟢 Tidor, Wang, and Yang (2016) |
| 8 Dec, 2025 | AI working with humans | AlphaEvolve, Aristotle, Gemini, GPT | Boris Alexeev, Stijn Cambie, Terence Tao, Lawrence Wu | 🟢 Full solution (Lean) | — |
Caveats
The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.
∎