Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bound/uniqueness away from critical points

Open
AhlswedeKhachatrian.interval_bound_unique

by parclytaxel · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

If 1 ≤ t ≤ k ≤ n, r ≤ k - t and n lies in interval k t r, frankl n k t r is the unique maximal (n,k,t)-intersecting family up to isomorphism of the ground set. Setting r = 0 gives the Erdős–Ko–Rado theorem as proved by Wilson.

Preamble
import Definitions.Def_AhlswedeKhachatrian
Formal statement
namespace AhlswedeKhachatrian

open Finset

variable {n k t r : ℕ} {A : Family n}

/-- Ahlswede–Khachatrian theorem away from critical points.
Setting `r = 0` gives the Erdős–Ko–Rado theorem. -/
theorem interval_bound_unique (h₀ : 1 ≤ t ∧ t ≤ k ∧ k ≤ n ∧ r ≤ k - t)
    (h₁ : ↑n ∈ interval k t r) (hA : A.Sized k ∧ A.Inter t) :
    #A ≤ #(frankl n k t r) ∧ (#A = #(frankl n k t r) → A.PermutesTo (frankl n k t r)) := by
  sorry

end AhlswedeKhachatrian
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by parclytaxel · Nov 10, 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