Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Erdős 1947: R(k)>2k/2R(k) > 2^{k/2}R(k)>2k/2 for k≥3k \ge 3k≥3

Proved
Erdos77.erdos_lower_bound_1947

by LG · Sep 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricserdos-problemsramsey-theory

For every integer k≥3k\ge 3k≥3, the diagonal Ramsey number satisfies

R(k)>2k/2.R(k) > 2^{k/2}.R(k)>2k/2.

This is Erdős's 1947 lower bound, one of the first applications of the probabilistic method. It shows lim inf⁡k→∞R(k)1/k≥2\liminf_{k\to\infty} R(k)^{1/k}\ge\sqrt2liminfk→∞​R(k)1/k≥2​, so any limit in Erdős Problem 77 is at least 2\sqrt22​.

Preamble
import Mathlib
import Definitions.Def_Erdos77_diagonal_ramsey
open Filter Topology
Formal statement
namespace Erdos77
theorem erdos_lower_bound_1947 (k : ℕ) (hk : 3 ≤ k) :
    (2 : ℝ) ^ ((k : ℝ) / 2) < (diagonalRamsey k : ℝ) := by sorry
end Erdos77
Source
P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292–294, https://doi.org/10.1090/S0002-9904-1947-08785-1 (main theorem: R(k) > 2^{k/2} for k ≥ 3).
Read-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 kkk with k≥3k\ge 3k≥3, the statement asserts the strict inequality of real numbers

2k/2<R(k),2^{k/2} < R(k),2k/2<R(k),

where 2k/22^{k/2}2k/2 is the real power of 222 with real exponent k/2k/2k/2 (so for odd kkk it is irrational, e.g. 23/2=222^{3/2}=2\sqrt223/2=22​), and R(k)R(k)R(k) is the natural number Erdos77.diagonalRamsey k (the infimum of all nnn such that every simple graph on {0,…,n−1}\{0,\dots,n-1\}{0,…,n−1} has a kkk-clique or a kkk-clique in its complement, or 000 if there were no such nnn), viewed as a real number. The only hypothesis is k≥3k\ge3k≥3; the cases k=0,1,2k=0,1,2k=0,1,2 are excluded.

Human review
  • Endorsed by Shuze Chen · Sep 26, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 26, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me