Rao's bound
ProvedErdos20.rao_boundLet be the sunflower threshold. There is a universal constant such that for all integers and ,
i.e. every family of more than sets of size contains a -sunflower (Rao 2020, Theorem 1, with petals and set size ).
Formalization Note is the natural logarithm (Rao uses base ; the change of base only rescales and preserves ). "More than sets forces a sunflower" is encoded as in .
import Definitions.Def_Erdos20_defs import Mathlib
namespace Erdos20
theorem rao_bound :
∃ C : ℝ, 1 < C ∧ ∀ n k : ℕ, 0 < n → 2 ≤ k →
(f n k : ℝ) ≤ (C * k * Real.log ((k : ℝ) * n)) ^ n + 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: there exists a real number with such that for all natural numbers with and ,
where is regarded as a real number, is the natural logarithm, and the power is a natural-number exponent. Since , the logarithm is positive. 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.