k9_affine_triangles_three_cover
If three monochromatic triangles k9_affine_triangle c₁ j₁, k9_affine_triangle c₂ j₂, and k9_affine_triangle c₃ j₃ cover all nine vertices of (ZMod 3) × (ZMod 3), then they share the same colour c₁ = c₂ ∧ c₂ = c₃ and their lines j₁, j₂, j₃ are pairwise distinct.
Statement
theorem k9_affine_triangles_three_cover (c₁ c₂ c₃ : Fin 4) (j₁ j₂ j₃ : ZMod 3)
(hcov : k9_affine_triangle c₁ j₁ ∪ k9_affine_triangle c₂ j₂ ∪ k9_affine_triangle c₃ j₃ = Finset.univ) :
c₁ = c₂ ∧ c₂ = c₃ ∧ j₁ ≠ j₂ ∧ j₁ ≠ j₃ ∧ j₂ ≠ j₃- Formalizes
- arXiv:2611.06362 Lemma 2.1
- Verified
- 09 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- k9_affine_triangleThe monochromatic triangle
k9_affine_triangleindexed bycolor : Fin 4andline : ZMod 3, defined as the finite set of vertices… - k9_affine_triangles_diff_color_inter_cardFor any two distinct colours
c₁, c₂ : Fin 4withc₁ ≠ c₂and any linesj₁, j₂ : ZMod 3, the intersection of…
- k9_affine_triangleThe monochromatic triangle
- Used by 1
- k9_affine_triangle_coverIn the affine-plane four-colouring of K9: (1) any three monochromatic triangles
k9_affine_trianglecovering all nine vertices must share…
- k9_affine_triangle_coverIn the affine-plane four-colouring of K9: (1) any three monochromatic triangles
Read back from the Lean
For all $c_1, c_2, c_3 \in \mathrm{Fin}(4)$ and $j_1, j_2, j_3 \in \mathbb{Z}/3\mathbb{Z}$, if the union of the three sets k9_affine_triangle c₁ j₁, k9_affine_triangle c₂ j₂, and k9_affine_triangle c₃ j₃ is equal to the universal set $\mathrm{Finset.univ}$ of $\mathbb{Z}/3\mathbb{Z} \times \mathbb{Z}/3\mathbb{Z}$ (i.e., all 9 points of $(\mathbb{Z}/3\mathbb{Z})^2$), then $c_1 = c_2$, $c_2 = c_3$, and $j_1, j_2, j_3$ are pairwise distinct ($j_1 \neq j_2$, $j_1 \neq j_3$, and $j_2 \neq j_3$).
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
The theorem states that three monochromatic triangles (lines in the affine plane $(\mathbb{Z}/3\mathbb{Z})^2$) can cover all nine vertices only if they belong to the same parallel class (colour) and are pairwise distinct. Since there are only 4 colours and 3 line offsets, the proof turns the goal into a universally quantified statement over finite domains and verifies it by exhaustive computation using the `decide` tactic.
Generalize the goal over all choices of colours $c_1, c_2, c_3$ and line indices $j_1, j_2, j_3$.
Moving the hypotheses and parameters back into the goal turns the problem into a closed universally quantified statement over the finite types $\mathrm{Fin}\ 4$ and $\mathbb{Z}/3\mathbb{Z}$.
revert c₁ c₂ c₃ j₁ j₂ j₃
Three affine lines cover the affine plane $(\mathbb{Z}/3\mathbb{Z})^2$ only if they share the same colour class and are pairwise distinct. automation
Since each colour ranges over $\mathrm{Fin}\ 4$ (4 values) and each line index over $\mathbb{Z}/3\mathbb{Z}$ (3 values), there are only $4^3 \times 3^3 = 1728$ possible triples of lines. Because membership and equality on these finite sets are decidable, the `decide` tactic exhausts all cases by direct evaluation in the kernel.
decide
- The proof relies entirely on computational reflection (`decide`) rather than a geometric argument about line intersections in the affine plane: Lean mechanically evaluates the boolean predicate over all 1728 combinations of three lines.
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.
/-- Three monochromatic triangles cover all nine vertices of K9 only if they are the three triangles of one colour. -/theorem k9_affine_triangles_three_cover (c₁ c₂ c₃ : Fin 4) (j₁ j₂ j₃ : ZMod 3) (hcov : k9_affine_triangle c₁ j₁ ∪ k9_affine_triangle c₂ j₂ ∪ k9_affine_triangle c₃ j₃ = Finset.univ) : c₁ = c₂ ∧ c₂ = c₃ ∧ j₁ ≠ j₂ ∧ j₁ ≠ j₃ ∧ j₂ ≠ j₃ := by revert c₁ c₂ c₃ j₁ j₂ j₃ decide