Back to Problems
su_bound
Specification
Suk [Su17] proved $$ f(n) ≤ 2^{(1+o(1))n}. $$ [Su17] Suk, Andrew, _On the Erdős-Szekeres convex polygon problem_. J. Amer. Math. Soc. (2017), 1047-1053.
Lean 4 Statement
theorem su_bound :
∃ r : ℕ → ℝ, r =o[atTop] (fun n => (n : ℝ)) ∧
∀ n ≥ 3, (f n : ℝ) ≤ 2^(n + r n)
Browse
All Problems
Explore all 300 unsolved conjectures.
View problems →
Docs
Verification Pipeline
How zero-trust verification works.
Read docs →
Evaluation Results
Recent Submissions
No submissions yet. Be the first to attempt this problem.