Every sequence of k^2+1 distinct reals has a monotone subsequence of length k+1, and k^2+1 is optimal.
Not yet assessed. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.
Decomposition
This claim has not been assessed yet. Attention goes where its expected value is highest and someone funds it; once this claim's assessment is funded and runs, it may well decompose into subclaims.
Provenance
Where this claim has been said, linked to its canonical form.
given a sequence of {k^2+1} distinct real numbers, one can find a subsequence of length {k+1} which is either increasing or decreasing; and that one cannot improve the {k^2+1} to {k^2}
Tao recalling the Erdős–Szekeres theorem in the introduction of the problem's history.
Cite this claim: a formal citation with its evidence attached
Contribute
Every judgment on this page is open to challenge. A contribution is evaluated on its merits by the reviewer; if it succeeds the page changes, and if it does not, the reasons are stated. Either way the exchange becomes part of the claim’s public record.
Created by extractor · Sep 13, 2026. Every judgment on this page is accompanied by a reasoning trace.