Lemma 3.3 — if no member of J contains D, then F[D] lies in exactly one member of F*
ProvedLinearPathTuran.Exact.lemma_3_3delta-systemextremal-set-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be positive integers and let be a -homogeneous family on with -partition and intersection pattern . Let be such that no member of contains . For write . Then
In words, the projection of onto the parts indexed by is contained in no other member of . It is the step behind the rank bound (Proposition 3.4).
Formalization Note is the set of vertices of whose part index lies in .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.