generalized_kneser_chromatic_le_fourteen
For every natural number n ≥ 4, the chromatic number of the generalized Kneser graph KG(2n, n, 3) is at most 14.
Statement
theorem generalized_kneser_chromatic_le_fourteen (n : ℕ) (hn : 4 ≤ n) :
(generalized_kneser_graph n 3).chromaticNumber ≤ 14- Formalizes
- arXiv:2611.04486 Sec. 1 and Sec. 4.1
- Verified
- 05 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- generalized_kneser_graphThe generalized Kneser graph KG(2n, n, r) is the simple graph whose vertices are the n-element subsets of Fin (2 * n), where two distinct…
- generalized_kneser_graph_adjIn the generalized Kneser graph KG(2n, n, r), two vertices s and t are adjacent if and only if s ≠ t and the cardinality of their…
Read back from the Lean
For every natural number $n$ such that $4 \le n$, the chromatic number of the generalized Kneser graph with parameters $n$ and $r = 3$ is at most 14.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
We construct an explicit 14-coloring of the generalized Kneser graph KG(2n, n, 3) using the 7 lines of the Fano plane embedded into {0, ..., 2n - 1}, which is possible because 2n ≥ 8 > 7 for all n ≥ 4. By the monochromatic line property of the Fano plane, for every n-subset s there exists an embedded Fano line L such that either L ⊆ s (assigned color (L, true)) or L ∩ s = ∅ (assigned color (L, false)). If two adjacent vertices s and t shared the same color, their intersection would contain L in the first case, or by inclusion-exclusion with the ambient set of size 2n their intersection would have size at least |L| = 3 in the second case. Both cases contradict the adjacency condition |s ∩ t| < 3, showing the coloring is proper and the chromatic number is at most 14.
Each of the seven lines in the Fano plane contains exactly 3 points. automation
The definition explicitly lists the seven 3-element subsets of {0, ..., 6}. A case analysis over all seven indices i (`fin_cases`) followed by direct computation (`decide`) verifies that every line has cardinality 3.
uses
generalized_kneser_chromatic_le_fourteen_card_fanoLinestheorem generalized_kneser_chromatic_le_fourteen_card_fanoLines (i : Fin 7) : (generalized_kneser_chromatic_le_fourteen_fanoLines i).card = 3 := by fin_cases i <;> decide
For every subset S ⊆ {0, ..., 6}, there exists a Fano line entirely contained in S, or a Fano line entirely disjoint from S. automation
This monochromatic line property for 2-colorings of the Fano plane is checked by exhaustive decision (`decide`) across all 2^7 = 128 subsets of {0, ..., 6}.
uses
generalized_kneser_chromatic_le_fourteen_fano_monochromatictheorem generalized_kneser_chromatic_le_fourteen_fano_monochromatic : ∀ S : Finset (Fin 7), (∃ i : Fin 7, generalized_kneser_chromatic_le_fourteen_fanoLines i ⊆ S) ∨ (∃ i : Fin 7, ∀ x ∈ generalized_kneser_chromatic_le_fourteen_fanoLines i, x ∉ S) := by decide
The 7 points of the Fano plane embed injectively into {0, ..., 2n - 1} whenever n ≥ 4. automation
Since n ≥ 4, linear integer arithmetic (`omega`) verifies 7 ≤ 2n, providing a canonical inclusion from Fin 7 into Fin (2n).
def generalized_kneser_chromatic_le_fourteen_fanoEmb (n : ℕ) (_hn : 4 ≤ n) : Fin 7 ↪ Fin (2 * n) := Fin.castLEEmb (by omega)
Each embedded Fano line in Fin (2n) has cardinality 3.
Injective maps preserve finite set cardinality (`Finset.card_map`). Rewriting with `generalized_kneser_chromatic_le_fourteen_card_fanoLines` shows that the embedded line has size 3.
uses
Finset.card_map,generalized_kneser_chromatic_le_fourteen_card_fanoLinestheorem generalized_kneser_chromatic_le_fourteen_card_fanoLineEmb (n : ℕ) (hn : 4 ≤ n) (i : Fin 7) : (generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn i).card = 3 := by rw [generalized_kneser_chromatic_le_fourteen_fanoLineEmb, Finset.card_map, generalized_kneser_chromatic_le_fourteen_card_fanoLines]
An embedded Fano line is a subset of s in Fin (2n) if and only if the original line is contained in the restriction of s to Fin 7. automation
Unfolding the definitions of the line embedding and restriction, the simplifier confirms this equivalence by checking point-by-point membership via `Finset.subset_iff`.
uses
Finset.subset_ifftheorem generalized_kneser_chromatic_le_fourteen_fanoLineEmb_subset_iff (n : ℕ) (hn : 4 ≤ n) (i : Fin 7) (s : Finset (Fin (2 * n))) : generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn i ⊆ s ↔ generalized_kneser_chromatic_le_fourteen_fanoLines i ⊆ generalized_kneser_chromatic_le_fourteen_fanoRestrict n hn s := by simp [generalized_kneser_chromatic_le_fourteen_fanoLineEmb, generalized_kneser_chromatic_le_fourteen_fanoRestrict, Finset.subset_iff]
An embedded Fano line is disjoint from s in Fin (2n) if and only if the original line is disjoint from the restriction of s to Fin 7. automation
Unfolding the definitions, the simplifier establishes the equivalence using the criterion for disjointness (`Finset.disjoint_left`).
uses
Finset.disjoint_lefttheorem generalized_kneser_chromatic_le_fourteen_fanoLineEmb_disjoint_iff (n : ℕ) (hn : 4 ≤ n) (i : Fin 7) (s : Finset (Fin (2 * n))) : Disjoint (generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn i) s ↔ ∀ x ∈ generalized_kneser_chromatic_le_fourteen_fanoLines i, x ∉ generalized_kneser_chromatic_le_fourteen_fanoRestrict n hn s := by simp [generalized_kneser_chromatic_le_fourteen_fanoLineEmb, generalized_kneser_chromatic_le_fourteen_fanoRestrict, Finset.disjoint_left]
Every set s in Fin (2n) has at least one valid color (i, b) in Fin 7 × Bool.
Applying the monochromatic line property `generalized_kneser_chromatic_le_fourteen_fano_monochromatic` to the restriction of s yields a line index i. If line i is contained in the restriction, color (i, true) is valid by `generalized_kneser_chromatic_le_fourteen_fanoLineEmb_subset_iff`. If line i is disjoint from the restriction, color (i, false) is valid by `generalized_kneser_chromatic_le_fourteen_fanoLineEmb_disjoint_iff`.
uses
generalized_kneser_chromatic_le_fourteen_fano_monochromatic,generalized_kneser_chromatic_le_fourteen_fanoLineEmb_subset_iff,generalized_kneser_chromatic_le_fourteen_fanoLineEmb_disjoint_ifftheorem generalized_kneser_chromatic_le_fourteen_exists_fanoValidColor (n : ℕ) (hn : 4 ≤ n) (s : Finset (Fin (2 * n))) : ∃ c : Fin 7 × Bool, generalized_kneser_chromatic_le_fourteen_fanoValidColor n hn s c := by rcases generalized_kneser_chromatic_le_fourteen_fano_monochromatic (generalized_kneser_chromatic_le_fourteen_fanoRestrict n hn s) with ⟨i, hi⟩ | ⟨i, hi⟩ · use (i, true) dsimp [generalized_kneser_chromatic_le_fourteen_fanoValidColor] rwa [generalized_kneser_chromatic_le_fourteen_fanoLineEmb_subset_iff] · use (i, false) dsimp [generalized_kneser_chromatic_le_fourteen_fanoValidColor] rwa [generalized_kneser_chromatic_le_fourteen_fanoLineEmb_disjoint_iff]
To show the coloring is proper, assume for contradiction that adjacent vertices s and t receive the same color; adjacency implies |s ∩ t| < 3.
Vertices s and t are n-element subsets. We assume they are adjacent in KG(2n, n, 3) and receive the same color. By definition of the generalized Kneser graph adjacency (`generalized_kneser_graph_adj`), their intersection has size strictly less than 3.
uses
generalized_kneser_graph_adjSimpleGraph.Coloring.mk (generalized_kneser_chromatic_le_fourteen_fanoColor n hn) (by intro s t hadj h_eq have h_lt : (s.1 ∩ t.1).card < 3 := by have := (generalized_kneser_graph_adj n 3 s t).mp hadj exact this.2
Both s and t satisfy the validity condition for their shared color c = (i, b), where the associated embedded line L has size 3.
By `generalized_kneser_chromatic_le_fourteen_fanoColor_spec`, s and t both satisfy the color validity condition for color c. The corresponding embedded line L has cardinality 3 by `generalized_kneser_chromatic_le_fourteen_card_fanoLineEmb`.
uses
generalized_kneser_chromatic_le_fourteen_fanoColor_spec,generalized_kneser_chromatic_le_fourteen_card_fanoLineEmbhave hs_spec := generalized_kneser_chromatic_le_fourteen_fanoColor_spec n hn s have ht_spec := generalized_kneser_chromatic_le_fourteen_fanoColor_spec n hn t rw [h_eq] at hs_spec set c := generalized_kneser_chromatic_le_fourteen_fanoColor n hn t dsimp [generalized_kneser_chromatic_le_fourteen_fanoValidColor] at hs_spec ht_spec set L := generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn c.1 have hL : L.card = 3 := generalized_kneser_chromatic_le_fourteen_card_fanoLineEmb n hn c.1
In the case b = true, L is contained in both s and t, which implies |s ∩ t| ≥ 3 and contradicts |s ∩ t| < 3.
When the boolean flag is true (`if_pos`), L ⊆ s and L ⊆ t, so L ⊆ s ∩ t by `Finset.subset_inter`. Hence 3 = |L| ≤ |s ∩ t| by `Finset.card_le_card`, which linear arithmetic (`omega`) detects as a contradiction to |s ∩ t| < 3.
uses
if_pos,Finset.subset_inter,Finset.card_le_cardby_cases hc2 : c.2 · rw [if_pos hc2] at hs_spec ht_spec have h_sub : L ⊆ s.1 ∩ t.1 := Finset.subset_inter hs_spec ht_spec have h3 : 3 ≤ (s.1 ∩ t.1).card := by have := Finset.card_le_card h_sub rwa [hL] at this omega
In the case b = false, L is disjoint from s ∪ t, which implies by inclusion-exclusion that |s ∩ t| ≥ 3, contradicting |s ∩ t| < 3.
When the boolean flag is false (`if_neg`), L is disjoint from both s and t, hence disjoint from s ∪ t by `Finset.disjoint_union_right.mpr`. Since L ∪ (s ∪ t) is contained in the universe of size 2n (`Finset.subset_univ`), its size is at most 2n (`Finset.card_le_card`, `Finset.card_univ`, `Fintype.card_fin`). The disjoint union gives |L| + |s ∪ t| = 3 + |s ∪ t| ≤ 2n (`Finset.card_union_of_disjoint`). By inclusion-exclusion (`Finset.card_union_add_card_inter`), |s ∪ t| + |s ∩ t| = |s| + |t| = 2n. Substituting this into the inequality gives 3 ≤ |s ∩ t|, which linear arithmetic (`omega`) recognizes as contradicting |s ∩ t| < 3.
uses
if_neg,Finset.disjoint_union_right.mpr,Finset.subset_univ,Finset.card_le_card,Finset.card_univ,Fintype.card_fin,Finset.card_union_of_disjoint,Finset.card_union_add_card_inter· rw [if_neg hc2] at hs_spec ht_spec have hd_union : Disjoint L (s.1 ∪ t.1) := Finset.disjoint_union_right.mpr ⟨hs_spec, ht_spec⟩ have h_sub : L ∪ (s.1 ∪ t.1) ⊆ Finset.univ := Finset.subset_univ _ have h_card_le : (L ∪ (s.1 ∪ t.1)).card ≤ 2 * n := by have := Finset.card_le_card h_sub rwa [Finset.card_univ, Fintype.card_fin] at this have h_disj_card : (L ∪ (s.1 ∪ t.1)).card = L.card + (s.1 ∪ t.1).card := Finset.card_union_of_disjoint hd_union rw [h_disj_card, hL] at h_card_le have h_inter : (s.1 ∪ t.1).card + (s.1 ∩ t.1).card = s.1.card + t.1.card := Finset.card_union_add_card_inter s.1 t.1 rw [s.2, t.2] at h_inter omega)
The chromatic number of the generalized Kneser graph KG(2n, n, 3) is at most 14.
The coloring `generalized_kneser_chromatic_le_fourteen_kneserColoring` is a proper coloring using the set Fin 7 × Bool, which has 14 colors by finite computation (`decide`). Thus the graph is 14-colorable, which implies that its chromatic number is at most 14.
uses
generalized_kneser_chromatic_le_fourteen_kneserColoringtheorem generalized_kneser_chromatic_le_fourteen (n : ℕ) (hn : 4 ≤ n) : (generalized_kneser_graph n 3).chromaticNumber ≤ 14 := by have hc : (generalized_kneser_graph n 3).Colorable (Fintype.card (Fin 7 × Bool)) := (generalized_kneser_chromatic_le_fourteen_kneserColoring n hn).colorable have h_card : Fintype.card (Fin 7 × Bool) = 14 := by decide rw [h_card] at hc exact hc.chromaticNumber_le
Finset.card_map- An injective function between finite sets preserves cardinality: |f(s)| = |s|.
generalized_kneser_chromatic_le_fourteen_card_fanoLines- Each of the seven lines of the Fano plane contains exactly 3 points.
Finset.subset_iff- A set s₁ is a subset of s₂ if and only if every element of s₁ belongs to s₂.
Finset.disjoint_left- Two finite sets are disjoint if and only if no element of the first belongs to the second.
generalized_kneser_chromatic_le_fourteen_fano_monochromatic- For every subset S of the seven points of the Fano plane, there is a line contained in S or a line disjoint from S.
generalized_kneser_chromatic_le_fourteen_fanoLineEmb_subset_iff- An embedded Fano line is a subset of s in Fin (2n) if and only if the original line is a subset of the restriction of s to Fin 7.
generalized_kneser_chromatic_le_fourteen_fanoLineEmb_disjoint_iff- An embedded Fano line is disjoint from s in Fin (2n) if and only if the original line is disjoint from the restriction of s to Fin 7.
generalized_kneser_graph_adj- Two vertices s and t in the generalized Kneser graph KG(n, r) are adjacent if and only if s ≠ t and |s ∩ t| < r.
generalized_kneser_chromatic_le_fourteen_fanoColor_spec- The chosen color for any vertex s in KG(2n, n, 3) satisfies the valid color specification for s.
generalized_kneser_chromatic_le_fourteen_card_fanoLineEmb- For n ≥ 4, each embedded Fano line in Fin (2n) has cardinality 3.
if_pos- If condition c holds, the conditional expression (if c then t else e) reduces to t.
Finset.subset_inter- If a set is a subset of both s₂ and u, it is a subset of their intersection s₂ ∩ u.
Finset.card_le_card- If s ⊆ t, then |s| ≤ |t|.
if_neg- If condition c is false, the conditional expression (if c then t else e) reduces to e.
Finset.disjoint_union_right.mpr- If a set is disjoint from both s and t, then it is disjoint from their union s ∪ t.
Finset.subset_univ- Every finite subset of a finite type is contained in the universal set.
Finset.card_univ- The cardinality of the universal finset on a finite type equals the cardinality of the type.
Fintype.card_fin- The cardinality of the finite type Fin n is n.
Finset.card_union_of_disjoint- If s and t are disjoint finite sets, then |s ∪ t| = |s| + |t|.
Finset.card_union_add_card_inter- For any finite sets s and t, |s ∪ t| + |s ∩ t| = |s| + |t|.
generalized_kneser_chromatic_le_fourteen_kneserColoring- A proper coloring of the generalized Kneser graph KG(2n, n, 3) using 14 colors from Fin 7 × Bool.
- In the monochromatic line property of the Fano plane (lines 14–19), Lean verifies the claim by exhaustive decision (`decide`) over all 2^7 = 128 subsets of the 7 points, rather than by a manual case analysis.
- The vertex coloring function assigns each n-element subset a valid color using the classical axiom of choice (`Classical.choose`), selecting an arbitrary valid pair among possibly several candidates.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
def generalized_kneser_chromatic_le_fourteen_fanoLines : Fin 7 → Finset (Fin 7) | 0 => {0, 1, 2} | 1 => {0, 3, 4} | 2 => {0, 5, 6} | 3 => {1, 3, 5} | 4 => {1, 4, 6} | 5 => {2, 3, 6} | 6 => {2, 4, 5}theorem generalized_kneser_chromatic_le_fourteen_card_fanoLines (i : Fin 7) : (generalized_kneser_chromatic_le_fourteen_fanoLines i).card = 3 := by fin_cases i <;> decidetheorem generalized_kneser_chromatic_le_fourteen_fano_monochromatic : ∀ S : Finset (Fin 7), (∃ i : Fin 7, generalized_kneser_chromatic_le_fourteen_fanoLines i ⊆ S) ∨ (∃ i : Fin 7, ∀ x ∈ generalized_kneser_chromatic_le_fourteen_fanoLines i, x ∉ S) := by decidedef generalized_kneser_chromatic_le_fourteen_fanoEmb (n : ℕ) (_hn : 4 ≤ n) : Fin 7 ↪ Fin (2 * n) := Fin.castLEEmb (by omega)def generalized_kneser_chromatic_le_fourteen_fanoLineEmb (n : ℕ) (hn : 4 ≤ n) (i : Fin 7) : Finset (Fin (2 * n)) := (generalized_kneser_chromatic_le_fourteen_fanoLines i).map (generalized_kneser_chromatic_le_fourteen_fanoEmb n hn)theorem generalized_kneser_chromatic_le_fourteen_card_fanoLineEmb (n : ℕ) (hn : 4 ≤ n) (i : Fin 7) : (generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn i).card = 3 := by rw [generalized_kneser_chromatic_le_fourteen_fanoLineEmb, Finset.card_map, generalized_kneser_chromatic_le_fourteen_card_fanoLines]def generalized_kneser_chromatic_le_fourteen_fanoRestrict (n : ℕ) (hn : 4 ≤ n) (s : Finset (Fin (2 * n))) : Finset (Fin 7) := Finset.univ.filter (fun x => generalized_kneser_chromatic_le_fourteen_fanoEmb n hn x ∈ s)theorem generalized_kneser_chromatic_le_fourteen_fanoLineEmb_subset_iff (n : ℕ) (hn : 4 ≤ n) (i : Fin 7) (s : Finset (Fin (2 * n))) : generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn i ⊆ s ↔ generalized_kneser_chromatic_le_fourteen_fanoLines i ⊆ generalized_kneser_chromatic_le_fourteen_fanoRestrict n hn s := by simp [generalized_kneser_chromatic_le_fourteen_fanoLineEmb, generalized_kneser_chromatic_le_fourteen_fanoRestrict, Finset.subset_iff]theorem generalized_kneser_chromatic_le_fourteen_fanoLineEmb_disjoint_iff (n : ℕ) (hn : 4 ≤ n) (i : Fin 7) (s : Finset (Fin (2 * n))) : Disjoint (generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn i) s ↔ ∀ x ∈ generalized_kneser_chromatic_le_fourteen_fanoLines i, x ∉ generalized_kneser_chromatic_le_fourteen_fanoRestrict n hn s := by simp [generalized_kneser_chromatic_le_fourteen_fanoLineEmb, generalized_kneser_chromatic_le_fourteen_fanoRestrict, Finset.disjoint_left]def generalized_kneser_chromatic_le_fourteen_fanoValidColor (n : ℕ) (hn : 4 ≤ n) (s : Finset (Fin (2 * n))) (c : Fin 7 × Bool) : Prop := if c.2 then generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn c.1 ⊆ s else Disjoint (generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn c.1) stheorem generalized_kneser_chromatic_le_fourteen_exists_fanoValidColor (n : ℕ) (hn : 4 ≤ n) (s : Finset (Fin (2 * n))) : ∃ c : Fin 7 × Bool, generalized_kneser_chromatic_le_fourteen_fanoValidColor n hn s c := by rcases generalized_kneser_chromatic_le_fourteen_fano_monochromatic (generalized_kneser_chromatic_le_fourteen_fanoRestrict n hn s) with ⟨i, hi⟩ | ⟨i, hi⟩ · use (i, true) dsimp [generalized_kneser_chromatic_le_fourteen_fanoValidColor] rwa [generalized_kneser_chromatic_le_fourteen_fanoLineEmb_subset_iff] · use (i, false) dsimp [generalized_kneser_chromatic_le_fourteen_fanoValidColor] rwa [generalized_kneser_chromatic_le_fourteen_fanoLineEmb_disjoint_iff]noncomputable def generalized_kneser_chromatic_le_fourteen_fanoColor (n : ℕ) (hn : 4 ≤ n) (s : {s : Finset (Fin (2 * n)) // s.card = n}) : Fin 7 × Bool := Classical.choose (generalized_kneser_chromatic_le_fourteen_exists_fanoValidColor n hn s.1)theorem generalized_kneser_chromatic_le_fourteen_fanoColor_spec (n : ℕ) (hn : 4 ≤ n) (s : {s : Finset (Fin (2 * n)) // s.card = n}) : generalized_kneser_chromatic_le_fourteen_fanoValidColor n hn s.1 (generalized_kneser_chromatic_le_fourteen_fanoColor n hn s) := Classical.choose_spec (generalized_kneser_chromatic_le_fourteen_exists_fanoValidColor n hn s.1)noncomputable def generalized_kneser_chromatic_le_fourteen_kneserColoring (n : ℕ) (hn : 4 ≤ n) : (generalized_kneser_graph n 3).Coloring (Fin 7 × Bool) := SimpleGraph.Coloring.mk (generalized_kneser_chromatic_le_fourteen_fanoColor n hn) (by intro s t hadj h_eq have h_lt : (s.1 ∩ t.1).card < 3 := by have := (generalized_kneser_graph_adj n 3 s t).mp hadj exact this.2 have hs_spec := generalized_kneser_chromatic_le_fourteen_fanoColor_spec n hn s have ht_spec := generalized_kneser_chromatic_le_fourteen_fanoColor_spec n hn t rw [h_eq] at hs_spec set c := generalized_kneser_chromatic_le_fourteen_fanoColor n hn t dsimp [generalized_kneser_chromatic_le_fourteen_fanoValidColor] at hs_spec ht_spec set L := generalized_kneser_chromatic_le_fourteen_fanoLineEmb n hn c.1 have hL : L.card = 3 := generalized_kneser_chromatic_le_fourteen_card_fanoLineEmb n hn c.1 by_cases hc2 : c.2 · rw [if_pos hc2] at hs_spec ht_spec have h_sub : L ⊆ s.1 ∩ t.1 := Finset.subset_inter hs_spec ht_spec have h3 : 3 ≤ (s.1 ∩ t.1).card := by have := Finset.card_le_card h_sub rwa [hL] at this omega · rw [if_neg hc2] at hs_spec ht_spec have hd_union : Disjoint L (s.1 ∪ t.1) := Finset.disjoint_union_right.mpr ⟨hs_spec, ht_spec⟩ have h_sub : L ∪ (s.1 ∪ t.1) ⊆ Finset.univ := Finset.subset_univ _ have h_card_le : (L ∪ (s.1 ∪ t.1)).card ≤ 2 * n := by have := Finset.card_le_card h_sub rwa [Finset.card_univ, Fintype.card_fin] at this have h_disj_card : (L ∪ (s.1 ∪ t.1)).card = L.card + (s.1 ∪ t.1).card := Finset.card_union_of_disjoint hd_union rw [h_disj_card, hL] at h_card_le have h_inter : (s.1 ∪ t.1).card + (s.1 ∩ t.1).card = s.1.card + t.1.card := Finset.card_union_add_card_inter s.1 t.1 rw [s.2, t.2] at h_inter omega)/-- For every n ≥ 4, the chromatic number of the generalized Kneser graph KG(2n, n, 3) is at most 14. -/theorem generalized_kneser_chromatic_le_fourteen (n : ℕ) (hn : 4 ≤ n) : (generalized_kneser_graph n 3).chromaticNumber ≤ 14 := by have hc : (generalized_kneser_graph n 3).Colorable (Fintype.card (Fin 7 × Bool)) := (generalized_kneser_chromatic_le_fourteen_kneserColoring n hn).colorable have h_card : Fintype.card (Fin 7 × Bool) = 14 := by decide rw [h_card] at hc exact hc.chromaticNumber_le