AFTD Auto-Formalizing Theoretical Domains

is_straight_line_cut_consistent

deforiginal

Given a finite set P of points in ℝ × ℝ, a finite set L of straight lines (StraightLine), a natural number k, and an allocation function α : (ℝ × ℝ) → Fin k, is_straight_line_cut_consistent P L α asserts that there exists a function s : StraightLine → (ℝ × ℝ) → Bool such that for every line ℓ ∈ L and point p ∈ P, if 0 < ℓ.cut p then s ℓ p = true and if ℓ.cut p < 0 then s ℓ p = false, and for all points p, q ∈ P, if s ℓ p = s ℓ q for all ℓ ∈ L then α p = α q.

Statement

def is_straight_line_cut_consistent (P : Finset (ℝ × ℝ)) (L : Finset StraightLine) {k : ℕ}
    (α : (ℝ × ℝ) → Fin k) : Prop
Related work
arXiv:2610.27956 Section 1.1
Verified
22 Oct 2026
Axioms
none listed
Built on 1
  • StraightLineA straight line in the plane ℝ², given by an affine functional with nonzero linear part.
Used by 11

Read back from the Lean

Given a finite set of points P in ℝ × ℝ, a finite set of lines L of type StraightLine, and a coloring function α : (ℝ × ℝ) → Fin k for some natural number k, is_straight_line_cut_consistent P L α asserts that: There exists a function s : StraightLine → (ℝ × ℝ) → Bool such that: 1. For every line ℓ ∈ L and every point p ∈ P: - if 0 < ℓ.cut p, then s ℓ p = true; and - if ℓ.cut p < 0, then s ℓ p = false. (Note: if ℓ.cut p = 0, s ℓ p may be either true or false.) 2. For every pair of points p, q ∈ P, if s ℓ p = s ℓ q for all ℓ ∈ L, then α p = α q (that is, any two points in P that receive the same boolean sign under s for every line in L must have the same color under α).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- An allocation α of a finite set of points P to k agents is consistent with a finite set of straight lines L if points directly on cuts can be assigned boolean sides such that any two points sharing the same side vector across all lines in L receive the same agent. -/
def is_straight_line_cut_consistent (P : Finset (ℝ × ℝ)) (L : Finset StraightLine) {k : ℕ}
    (α : (ℝ × ℝ) → Fin k) : Prop := ∃ s : StraightLine → (ℝ × ℝ) → Bool,
    (∀ ℓ ∈ L, ∀ p ∈ P, (0 < ℓ.cut p → s ℓ p = true) ∧ (ℓ.cut p < 0 → s ℓ p = false)) ∧
    (∀ p ∈ P, ∀ q ∈ P, (∀ ℓ ∈ L, s ℓ p = s ℓ q) → α p = α q)
See it in the graphDiscuss this resultChallenge it