Erdős 1947: for
ProvedErdos77.erdos_lower_bound_1947For every integer , the diagonal Ramsey number satisfies
This is Erdős's 1947 lower bound, one of the first applications of the probabilistic method. It shows , so any limit in Erdős Problem 77 is at least .
import Mathlib import Definitions.Def_Erdos77_diagonal_ramsey open Filter Topology
namespace Erdos77
theorem erdos_lower_bound_1947 (k : ℕ) (hk : 3 ≤ k) :
(2 : ℝ) ^ ((k : ℝ) / 2) < (diagonalRamsey 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.
For every natural number with , the statement asserts the strict inequality of real numbers
where is the real power of with real exponent (so for odd it is irrational, e.g. ), and is the natural number Erdos77.diagonalRamsey k (the infimum of all such that every simple graph on has a -clique or a -clique in its complement, or if there were no such ), viewed as a real number. The only hypothesis is ; the cases are excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.