Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 (Erdős) — for large n, no t+1 pairwise disjoint k-sets implies |F| ≤ C(n,k) − C(n−t,k), with the star family unique

Proved
LinearPathTuran.Exact.theorem_1_1

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

erdos-matchingextremal-set-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Erdős' matching theorem for large nnn. Let k,tk,tk,t be positive integers. There is n(k,t)n(k,t)n(k,t) such that for every n>n(k,t)n>n(k,t)n>n(k,t): if F⊆([n]k)\mathcal F\subseteq\binom{[n]}{k}F⊆(k[n]​) contains no t+1t+1t+1 pairwise disjoint members, then

∣F∣≤(nk)−(n−tk),|\mathcal F|\le\binom{n}{k}-\binom{n-t}{k},∣F∣≤(kn​)−(kn−t​),

and equality holds only for the family of all kkk-subsets of [n][n][n] meeting some fixed set SSS of ttt elements.

In the paper it bounds, in equation (5), the (k−2)(k-2)(k−2)-uniform link families that arise near the exceptional set.

Formalization Note n(k,t)n(k,t)n(k,t) is an existential threshold chosen after k,tk,tk,t. The equality clause is an equivalence: a family under the hypotheses has exactly (nk)−(n−tk)\binom nk-\binom{n-t}k(kn​)−(kn−t​) members iff it is the star family of some ttt-set. The subtraction (nk)−(n−tk)\binom nk-\binom{n-t}k(kn​)−(kn−t​) is exact in N\mathbb NN. The theorem is cited from Erdős (1965).

Preamble
import Mathlib
import Definitions.Def_LinearPathTuran_Exact_Setting
Formal statement
namespace LinearPathTuran.Exact

open Finset

/-- Theorem 1.1 (Erdős 1965), p. 2: for large `n`, a `k`-uniform family on `[n]` with no `t + 1`
pairwise disjoint members has at most `C(n, k) - C(n - t, k)` members, with equality only for the
family of all `k`-sets meeting a fixed `t`-set. -/
theorem theorem_1_1 (k t : ℕ) (hk : 1 ≤ k) (ht : 1 ≤ t) :
    ∃ n₀ : ℕ, ∀ n > n₀, ∀ 𝓕 : Finset (Finset (Fin n)),
      𝓕 ⊆ (univ : Finset (Fin n)).powersetCard k →
      (¬ ∃ 𝓜 ⊆ 𝓕, #𝓜 = t + 1 ∧ (𝓜 : Set (Finset (Fin n))).PairwiseDisjoint id) →
      #𝓕 ≤ n.choose k - (n - t).choose k ∧
      (#𝓕 = n.choose k - (n - t).choose k ↔
        ∃ S : Finset (Fin n), #S = t ∧ 𝓕 = starFamily n k S) := by sorry

end LinearPathTuran.Exact
Source
Füredi, Jiang and Seiver, Exact solution of the hypergraph Turán problem for k-uniform linear paths, arXiv:1108.1247v1, p. 2, Theorem 1.1 (cited from Erdős, A problem on independent r-tuples, Ann. Univ. Sci. Budapest. 8 (1965))
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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