Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.4 (the rank bound) — a (k,s)-homogeneous family whose pattern has rank p has at most C(n,p) members

Proved
LinearPathTuran.Exact.proposition_3_4

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

delta-systemextremal-set-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

The rank bound. Let k,sk,sk,s be positive integers and let F∗\mathcal F^*F∗ be a (k,s)(k,s)(k,s)-homogeneous family on nnn vertices with intersection pattern J\mathcal JJ. If r(J)=pr(\mathcal J)=pr(J)=p, then

∣F∗∣≤(np).|\mathcal F^*|\le\binom{n}{p}.∣F∗∣≤(pn​).

This is why only homogeneous pieces whose pattern has rank k−1k-1k−1 or kkk can carry Θ(nk−1)\Theta(n^{k-1})Θ(nk−1) members; pieces of rank at most k−2k-2k−2 contribute O(nk−2)O(n^{k-2})O(nk−2).

Formalization Note The rank is the minimum size of a subset of [k][k][k] contained in no member of J\mathcal JJ; since the members of J\mathcal JJ are proper subsets of [k][k][k] this minimum exists.

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

open Finset

/-- Proposition 3.4 (the rank bound), p. 5. -/
theorem proposition_3_4 (k s : ℕ) (hk : 1 ≤ k) (hs : 1 ≤ s) {n : ℕ}
    (𝓕 : Finset (Finset (Fin n))) (χ : Fin n → Fin k) (J : Finset (Finset (Fin k)))
    (hH : IsHomogeneous s 𝓕 χ J) (p : ℕ) (hp : rank J = p) :
    #𝓕 ≤ n.choose p := 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. 5, Proposition 3.4
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