AFTD Auto-Formalizing Theoretical Domains

planar_necklace_two_cuts_refutation_of_instance

theoremverified

If there exists a finite planar point set P colored with red and blue counts divisible by 3 that admits no fair 3-agent division by at most 2 straight lines, then the universal two-cut splitting statement for 3 agents in the plane is false.

Statement

theorem planar_necklace_two_cuts_refutation_of_instance
    (P : Finset (ℝ × ℝ)) (c : (ℝ × ℝ) → Fin 2)
    (h_red : 3 ∣ (P.filter (fun p => c p = 0)).card)
    (h_blue : 3 ∣ (P.filter (fun p => c p = 1)).card)
    (h_nofair : ¬ ∃ (L : Finset StraightLine) (α : (ℝ × ℝ) → Fin 3),
      L.card ≤ 2 ∧
      is_straight_line_cut_consistent P L α ∧
      ∀ i : Fin 3,
        (P.filter (fun p => α p = i ∧ c p = 0)).card = (P.filter (fun p => c p = 0)).card / 3 ∧
        (P.filter (fun p => α p = i ∧ c p = 1)).card = (P.filter (fun p => c p = 1)).card / 3) :
    ¬ (∀ (P' : Finset (ℝ × ℝ)) (c' : (ℝ × ℝ) → Fin 2),
      3 ∣ (P'.filter (fun p => c' p = 0)).card →
      3 ∣ (P'.filter (fun p => c' p = 1)).card →
      ∃ (L : Finset StraightLine) (α : (ℝ × ℝ) → Fin 3),
        L.card ≤ 2 ∧
        is_straight_line_cut_consistent P' L α ∧
        ∀ i : Fin 3,
          (P'.filter (fun p => α p = i ∧ c' p = 0)).card = (P'.filter (fun p => c' p = 0)).card / 3 ∧
          (P'.filter (fun p => α p = i ∧ c' p = 1)).card = (P'.filter (fun p => c' p = 1)).card / 3)
Source
arXiv:2610.27956 Conjecture 2
Verified
10 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • StraightLineA straight line in the plane ℝ², given by an affine functional with nonzero linear part.
  • is_straight_line_cut_consistentGiven a finite set P of points in ℝ × ℝ, a finite set L of straight lines (StraightLine), a natural number k, and an allocation function α…

Read back from the Lean

Given: - a finite set of points in the plane $P \subseteq \mathbb{R} \times \mathbb{R}$, - a coloring function $c : (\mathbb{R} \times \mathbb{R}) \to \text{Fin } 2$, - a hypothesis $h_{\text{red}}$ that 3 divides the number of points in $P$ with $c(p) = 0$, - a hypothesis $h_{\text{blue}}$ that 3 divides the number of points in $P$ with $c(p) = 1$, - a hypothesis $h_{\text{nofair}}$ that there do *not* exist: - a finite set of straight lines $L$, - a function $\alpha : (\mathbb{R} \times \mathbb{R}) \to \text{Fin } 3$, such that: - $|L| \le 2$, - $\alpha$ is straight-line cut consistent with $L$ on $P$ (is_straight_line_cut_consistent P L α), - for all $i \in \text{Fin } 3$, the number of points $p \in P$ where $\alpha(p) = i$ and $c(p) = 0$ is equal to $\frac{1}{3}$ of the total points in $P$ with $c(p) = 0$, and the number of points $p \in P$ where $\alpha(p) = i$ and $c(p) = 1$ is equal to $\frac{1}{3}$ of the total points in $P$ with $c(p) = 1$, the theorem concludes the negation of the universal statement: It is not the case that for every finite set $P' \subseteq \mathbb{R} \times \mathbb{R}$ and coloring $c' : (\mathbb{R} \times \mathbb{R}) \to \text{Fin } 2$, if 3 divides the number of color-0 points in $P'$ and 3 divides the number of color-1 points in $P'$, then there exists a finite set of straight lines $L$ with $|L| \le 2$ and an assignment $\alpha : (\mathbb{R} \times \mathbb{R}) \to \text{Fin } 3$ consistent with $L$ on $P'$ such that each part $i \in \text{Fin } 3$ receives exactly one-third of the color-0 points of $P'$ and one-third of the color-1 points of $P'$.

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 proof proceeds by contradiction. Assuming the universal two-cut statement holds, we instantiate it with the specific counterexample point set $P$, coloring $c$, and the divisibility hypotheses $h_{\text{red}}$ and $h_{\text{blue}}$. This asserts the existence of a fair two-cut division for $P$, directly contradicting the hypothesis $h_{\text{nofair}}$ that no such division exists.

  1. Assume for contradiction that the universal 2-cut statement holds.

    To prove the negation of the universal claim, we assume for contradiction that the statement holds (introducing hypothesis $h$): namely, that every finite planar point set whose red and blue cardinalities are divisible by 3 admits a fair 3-agent division by at most 2 straight lines.

    line 21

      intro h
  2. Instantiating the universal statement on $(P, c)$ produces a contradiction.

    Applying the universal hypothesis $h$ to the specific point set $P$, coloring $c$, and the divisibility hypotheses $h_{\text{red}}$ and $h_{\text{blue}}$ asserts the existence of a fair 2-line division of $P$. Applying the hypothesis $h_{\text{nofair}}$ (which states that no such division exists) to this witness completes the refutation and yields a contradiction.

    line 22

      exact h_nofair (h P c h_red h_blue)

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

/-- A single counterexample instance refutes the universal 2-cut planar necklace splitting statement for 3 agents. -/theorem planar_necklace_two_cuts_refutation_of_instance    (P : Finset (ℝ × ℝ)) (c : (ℝ × ℝ) → Fin 2)    (h_red : 3 ∣ (P.filter (fun p => c p = 0)).card)    (h_blue : 3 ∣ (P.filter (fun p => c p = 1)).card)    (h_nofair : ¬ ∃ (L : Finset StraightLine) (α : (ℝ × ℝ) → Fin 3),      L.card ≤ 2 ∧      is_straight_line_cut_consistent P L α ∧      ∀ i : Fin 3,        (P.filter (fun p => α p = i ∧ c p = 0)).card = (P.filter (fun p => c p = 0)).card / 3 ∧        (P.filter (fun p => α p = i ∧ c p = 1)).card = (P.filter (fun p => c p = 1)).card / 3) :    ¬ (∀ (P' : Finset (ℝ × ℝ)) (c' : (ℝ × ℝ) → Fin 2),      3 ∣ (P'.filter (fun p => c' p = 0)).card →      3 ∣ (P'.filter (fun p => c' p = 1)).card →      ∃ (L : Finset StraightLine) (α : (ℝ × ℝ) → Fin 3),        L.card ≤ 2 ∧        is_straight_line_cut_consistent P' L α ∧        ∀ i : Fin 3,          (P'.filter (fun p => α p = i ∧ c' p = 0)).card = (P'.filter (fun p => c' p = 0)).card / 3 ∧          (P'.filter (fun p => α p = i ∧ c' p = 1)).card = (P'.filter (fun p => c' p = 1)).card / 3) := by  intro h  exact h_nofair (h P c h_red h_blue)
See it in the graphDiscuss this resultChallenge it