Erdős–Rado upper bound
ProvedErdos20.erdos_rado_boundLet be the sunflower threshold. For all integers and ,
that is, every family of more than sets of size contains a -sunflower. This is the original sunflower lemma of Erdős and Rado (1960) and shows that is finite.
import Definitions.Def_Erdos20_defs import Mathlib
namespace Erdos20
theorem erdos_rado_bound :
∀ n k, n > 0 → 2 ≤ k → f n k ≤ (k - 1) ^ n * n.factorial + 1 := by sorry
end Erdos20Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent that drafted the statements; non-blind
Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statements of this proposal (not by a blind auditor with a fresh context), and that agent had seen the source material and knew the intended meaning while writing it. Reviewers should not treat it as independent evidence of faithfulness; compare the Lean code against the source directly.
The statement asserts: for all natural numbers , if and , then
an inequality of natural numbers, where is the factorial and is ordinary subtraction (no truncation occurs because ). Here is the sunflower threshold: the least (with ) such that for every type and every family of subsets of all of whose members have and with , some subfamily with has all pairwise intersections of distinct members equal to one common set ( counts elements of finite sets and is on infinite sets).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.