AFTD Auto-Formalizing Theoretical Domains

k9_affine_triangle_cover

theoremverifiedformalization

In the affine-plane four-colouring of K9: (1) any three monochromatic triangles k9_affine_triangle covering all nine vertices must share the same colour and have pairwise distinct lines; and (2) any four monochromatic triangles k9_affine_triangle c₁ j₁, k9_affine_triangle c₂ j₂, k9_affine_triangle c₃ j₃, k9_affine_triangle c₄ j₄ covering all nine vertices either contain all three triangles of some colour c : Fin 4, or have four pairwise distinct colours and share a common vertex v : ZMod 3 × ZMod 3 (repetitions allowed).

Statement

theorem k9_affine_triangle_cover :
    (∀ (c₁ c₂ c₃ : Fin 4) (j₁ j₂ j₃ : ZMod 3),
      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₃) ∧
    (∀ (c₁ c₂ c₃ c₄ : Fin 4) (j₁ j₂ j₃ j₄ : ZMod 3),
      k9_affine_triangle c₁ j₁ ∪ k9_affine_triangle c₂ j₂ ∪
      k9_affine_triangle c₃ j₃ ∪ k9_affine_triangle c₄ j₄ = Finset.univ →
        (∃ c : Fin 4, ∀ j : ZMod 3,
          (c, j) = (c₁, j₁) ∨ (c, j) = (c₂, j₂) ∨ (c, j) = (c₃, j₃) ∨ (c, j) = (c₄, j₄)) ∨
        ((c₁ ≠ c₂ ∧ c₁ ≠ c₃ ∧ c₁ ≠ c₄ ∧ c₂ ≠ c₃ ∧ c₂ ≠ c₄ ∧ c₃ ≠ c₄) ∧
          ∃ v : ZMod 3 × ZMod 3,
            v ∈ k9_affine_triangle c₁ j₁ ∧ v ∈ k9_affine_triangle c₂ j₂ ∧
            v ∈ k9_affine_triangle c₃ j₃ ∧ v ∈ k9_affine_triangle c₄ j₄))
Formalizes
arXiv:2611.06362 Lemma 2.1
Verified
09 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • k9_affine_triangleThe monochromatic triangle k9_affine_triangle indexed by color : Fin 4 and line : ZMod 3, defined as the finite set of vertices…
  • k9_affine_triangles_diff_color_inter_cardFor any two distinct colours c₁, c₂ : Fin 4 with c₁ ≠ c₂ and any lines j₁, j₂ : ZMod 3, the intersection of…
  • k9_affine_triangles_three_coverIf three monochromatic triangles k9_affine_triangle c₁ j₁, k9_affine_triangle c₂ j₂, and k9_affine_triangle c₃ j₃ cover all nine…

Read back from the Lean

The theorem asserts a conjunction of two statements about covering the 9-element set ZMod 3 × ZMod 3 with sets of the form k9_affine_triangle c j: 1. For all c₁, c₂, c₃ : Fin 4 and j₁, j₂, j₃ : ZMod 3, if the union of k9_affine_triangle c₁ j₁, k9_affine_triangle c₂ j₂, and k9_affine_triangle c₃ j₃ equals Finset.univ (all of ZMod 3 × ZMod 3), then the three directions are all equal (c₁ = c₂ and c₂ = c₃) and the three line parameters are pairwise distinct (j₁ ≠ j₂, j₁ ≠ j₃, and j₂ ≠ j₃). 2. For all c₁, c₂, c₃, c₄ : Fin 4 and j₁, j₂, j₃, j₄ : ZMod 3, if the union of k9_affine_triangle c₁ j₁, k9_affine_triangle c₂ j₂, k9_affine_triangle c₃ j₃, and k9_affine_triangle c₄ j₄ equals Finset.univ, then at least one of the following two alternatives holds: - There exists c : Fin 4 such that for every j : ZMod 3, (c, j) equals at least one of (c₁, j₁), (c₂, j₂), (c₃, j₃), or (c₄, j₄) (i.e., the four sets include all three parallel lines of direction c). - The four directions are pairwise distinct (c₁ ≠ c₂, c₁ ≠ c₃, c₁ ≠ c₄, c₂ ≠ c₃, c₂ ≠ c₄, and c₃ ≠ c₄), and there exists a point v : ZMod 3 × ZMod 3 that belongs to all four sets k9_affine_triangle cᵢ jᵢ for i ∈ {1, 2, 3, 4} (i.e., the four lines are concurrent at v).

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 classifies monochromatic triangle coverings of the 9 vertices of K9 in the affine-plane four-colouring. For three triangles, covering requires them to be disjoint, which means they must form a complete parallel class. For four triangles, exhaustive finite verification shows that they either contain a complete parallel class or consist of four concurrent lines of distinct colours.

  1. Any four monochromatic triangles covering all nine vertices either contain a complete parallel class (all three lines of one colour) or consist of four concurrent lines with distinct colours. automation

    The search space of all choices of four lines (out of 12 lines total, with $4^4 \times 3^4 = 20736$ combinations) is finite. The tactic `decide` verifies by exhaustive computation that whenever the union of four lines equals the entire affine plane $(\mathbb{Z}/3\mathbb{Z})^2$, either all three lines of some parallel class are present, or the four lines have four distinct directions and intersect at a common point.

    line 14

      decide
  2. Both the three-triangle and four-triangle covering characterisations hold simultaneously.

    Combine the previously established three-triangle covering theorem `k9_affine_triangles_three_cover` with the four-triangle covering theorem `k9_affine_triangle_cover_four` into a single conjunction using the pair constructor.

    line 29

    uses k9_affine_triangles_three_cover

                v ∈ k9_affine_triangle c₃ j₃ ∧ v ∈ k9_affine_triangle c₄ j₄)) := ⟨k9_affine_triangles_three_cover, k9_affine_triangle_cover_four⟩
k9_affine_triangles_three_cover
Any three monochromatic triangles covering all nine vertices of K9 in the affine plane four-colouring must belong to the same parallel class (same colour) with distinct line indices.

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

set_option synthInstance.maxHeartbeats 1000000 inset_option synthInstance.maxSize 10000 inset_option maxHeartbeats 20000000 inprivate theorem k9_affine_triangle_cover_four :    ∀ (c₁ c₂ c₃ c₄ : Fin 4) (j₁ j₂ j₃ j₄ : ZMod 3),      k9_affine_triangle c₁ j₁ ∪ k9_affine_triangle c₂ j₂ ∪      k9_affine_triangle c₃ j₃ ∪ k9_affine_triangle c₄ j₄ = Finset.univ →        (∃ c : Fin 4, ∀ j : ZMod 3,          (c, j) = (c₁, j₁) ∨ (c, j) = (c₂, j₂) ∨ (c, j) = (c₃, j₃) ∨ (c, j) = (c₄, j₄)) ∨        ((c₁ ≠ c₂ ∧ c₁ ≠ c₃ ∧ c₁ ≠ c₄ ∧ c₂ ≠ c₃ ∧ c₂ ≠ c₄ ∧ c₃ ≠ c₄) ∧          ∃ v : ZMod 3 × ZMod 3,            v ∈ k9_affine_triangle c₁ j₁ ∧ v ∈ k9_affine_triangle c₂ j₂ ∧            v ∈ k9_affine_triangle c₃ j₃ ∧ v ∈ k9_affine_triangle c₄ j₄) := by  decide/-- Monochromatic triangle coverings in the affine-plane four-colouring of K9 (Lemma 2.1). -/theorem k9_affine_triangle_cover :    (∀ (c₁ c₂ c₃ : Fin 4) (j₁ j₂ j₃ : ZMod 3),      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₃) ∧    (∀ (c₁ c₂ c₃ c₄ : Fin 4) (j₁ j₂ j₃ j₄ : ZMod 3),      k9_affine_triangle c₁ j₁ ∪ k9_affine_triangle c₂ j₂ ∪      k9_affine_triangle c₃ j₃ ∪ k9_affine_triangle c₄ j₄ = Finset.univ →        (∃ c : Fin 4, ∀ j : ZMod 3,          (c, j) = (c₁, j₁) ∨ (c, j) = (c₂, j₂) ∨ (c, j) = (c₃, j₃) ∨ (c, j) = (c₄, j₄)) ∨        ((c₁ ≠ c₂ ∧ c₁ ≠ c₃ ∧ c₁ ≠ c₄ ∧ c₂ ≠ c₃ ∧ c₂ ≠ c₄ ∧ c₃ ≠ c₄) ∧          ∃ v : ZMod 3 × ZMod 3,            v ∈ k9_affine_triangle c₁ j₁ ∧ v ∈ k9_affine_triangle c₂ j₂ ∧            v ∈ k9_affine_triangle c₃ j₃ ∧ v ∈ k9_affine_triangle c₄ j₄)) := ⟨k9_affine_triangles_three_cover, k9_affine_triangle_cover_four⟩
See it in the graphDiscuss this resultChallenge it