Campos–Griffiths–Morris–Sahasrabudhe 2023:
ProvedErdos77.cgms_exponential_improvementThere exists a constant such that for all sufficiently large ,
This is the main theorem of Campos, Griffiths, Morris and Sahasrabudhe (2023), the first exponential improvement over the Erdős–Szekeres bound . It shows .
import Mathlib import Definitions.Def_Erdos77_diagonal_ramsey open Filter Topology
namespace Erdos77
theorem cgms_exponential_improvement :
∃ ε : ℝ, 0 < ε ∧ ∀ᶠ k : ℕ in atTop, (diagonalRamsey k : ℝ) ≤ (4 - ε) ^ k := by sorry
end Erdos77Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — non-blind, same agent as drafter
Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement, with full knowledge of the source material and the intended meaning. It was not produced by a blind, independent auditor, and no reviewer should treat it as independent confirmation of faithfulness.
The statement asserts: there exist a real number with and a threshold such that for every natural number ,
as real numbers, where is the -th power (natural-number exponent) of the real number , and is Erdos77.diagonalRamsey k (infimum of the such that every simple graph on has a -clique or a -clique in its complement; if none) cast to .
Edge cases: the statement does not require ; if were chosen the base would be , but the claim is only that some works. The threshold may be arbitrary. As with every upper bound on , an empty infimum (value ) would make the inequality trivially true for .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.