Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.3 — if no member of J contains D, then F[D] lies in exactly one member of F*

Proved
LinearPathTuran.Exact.lemma_3_3

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

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

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 [n][n][n] with kkk-partition (X1,…,Xk)(X_1,\dots,X_k)(X1​,…,Xk​) and intersection pattern J\mathcal JJ. Let D⊆[k]D\subseteq[k]D⊆[k] be such that no member of J\mathcal JJ contains DDD. For F∈F∗F\in\mathcal F^*F∈F∗ write F[D]=F∩⋃i∈DXiF[D]=F\cap\bigcup_{i\in D}X_iF[D]=F∩⋃i∈D​Xi​. Then

deg⁡F∗(F[D])=∣{F′∈F∗:F[D]⊆F′}∣=1.\deg_{\mathcal F^*}(F[D])=\big|\{F'\in\mathcal F^*: F[D]\subseteq F'\}\big|=1 .degF∗​(F[D])=​{F′∈F∗:F[D]⊆F′}​=1.

In words, the projection of FFF onto the parts indexed by DDD is contained in no other member of F∗\mathcal F^*F∗. It is the step behind the rank bound (Proposition 3.4).

Formalization Note F[D]F[D]F[D] is the set of vertices of FFF whose part index lies in DDD.

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

open Finset

/-- Lemma 3.3, p. 5: if no member of the intersection pattern contains `D`, then the projection
`F[D] = F ∩ ⋃_{i ∈ D} X_i` of a member `F` lies in no other member. -/
theorem lemma_3_3 (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)
    (D : Finset (Fin k)) (hD : ∀ B ∈ J, ¬ D ⊆ B) (F : Finset (Fin n)) (hF : F ∈ 𝓕) :
    #(𝓕.filter (fun F' => F.filter (fun v => χ v ∈ D) ⊆ F')) = 1 := 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, Lemma 3.3
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