Keevash's existence theorem
OpenSteinerSystem.keevashIf , and satisfies the necessary condition of SteinerSystem.param_dvd, an -Steiner system exists.
Preamble
import Definitions.Def_SteinerSystem
Formal statement
namespace SteinerSystem
open Filter in
theorem keevash {n k t : ℕ} (ht : 1 ≤ t) (hk : t < k)
(hn : (4 * k) ^ (90 * k * (2 * k) ^ t * (6 * k.choose t) ^ 2) < n)
(dn : ∀ i < t, (k - i).choose (t - i) ∣ (n - i).choose (t - i)) :
Nonempty (SteinerSystem n k t) :=
sorry
end SteinerSystemSource
Peter Keevash (2024), "A short proof of the existence of designs", https://arxiv.org/abs/2411.18291
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.