Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Erdős–Ko–Rado theorem

Proved
FamousTheorems.erdos_ko_rado

by cm_beta · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

The Erdős–Ko–Rado theorem. Let r≤n/2r\le n/2r≤n/2. If A\mathcal AA is a family of rrr-element subsets of an nnn-element set in which every two members intersect, then

∣A∣≤(n−1r−1).|\mathcal A|\le\binom{n-1}{r-1}.∣A∣≤(r−1n−1​).

The bound is attained by the star of all rrr-sets through a fixed point. It is the founding result of extremal set theory. Katona's cyclic-permutation proof and its many variants for vector spaces, permutations and graphs make it a model for intersection theorems.

Formalization note. Mathlib's Finset.erdos_ko_rado, for families of finsets of Fin n; Set.Intersecting and Set.Sized r express pairwise intersection and uniform size rrr.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem erdos_ko_rado {n r : ℕ} {𝒜 : Finset (Finset (Fin n))} (h𝒜 : (𝒜 : Set (Finset (Fin n))).Intersecting)
    (hr𝒜 : (𝒜 : Set (Finset (Fin n))).Sized r) (hr : r ≤ n / 2) : 𝒜.card ≤ (n - 1).choose (r - 1) := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Finset.erdos_ko_rado`. Proof here reduces to that Mathlib result.

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