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.

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement
theorem su_bound :
    ∃ r : ℕ → ℝ, r =o[atTop] (fun n => (n : ℝ)) ∧
      ∀ n ≥ 3, (f n : ℝ) ≤ 2^(n + r n)
ID: ErdosProblems__107__su_bound
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.