is_straight_line_cut_consistent
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
- straight_line_bisection_of_cut_zeroIf every point lies on a given straight line and each of two colors has even size, that one line admits a consistent allocation bisecting…
- not_is_straight_line_cut_consistent_singleton_of_three_agentsLet P be a finite set of points in ℝ², ℓ a straight line, and α : ℝ² → Fin 3 an allocation function. If every agent in Fin 3 receives at…
- planar_necklace_three_agents_cuts_ge_twoLet P be a finite set of points in ℝ × ℝ colored with two colors c : (ℝ × ℝ) → Fin 2, L a finite set of straight lines, and α an…
- straight_line_bisection_of_side_card_boundsA straight line whose strictly positive and strictly negative sides each contain at most half of each color admits a consistent two-agent…
- planar_necklace_three_agents_two_cuts_emptyThe empty point set in the plane can be trivially fairly divided among 3 agents with at most 2 straight-line cuts (0 cuts suffice).
- planar_necklace_two_cuts_refutation_of_instanceIf 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…
- planar_necklace_three_agents_two_cuts_of_fair_parallel_cutsIf a finite point set P admits a fair 3-way partition by two parallel cuts with non-zero linear functional φ and thresholds t₁ < t₂, then…
- is_straight_line_cut_consistent_monoLet P be a finite set of points in ℝ², L and L' finite sets of straight lines with L ⊆ L', k a natural number, and α : ℝ² → Fin k an…
- planar_necklace_two_cuts_six_pointsFor any finite set P of 6 points in the plane ℝ × ℝ colored with two colors c : (ℝ × ℝ) → Fin 2 such that exactly 3 points are colored 0…
- is_straight_line_cut_consistent_of_parallel_cutsLet P be a finite set of points in ℝ × ℝ, φ a non-zero linear functional from ℝ × ℝ to ℝ, t₁ and t₂ real numbers with t₁ < t₂, and α an…
- not_is_straight_line_cut_consistent_empty_of_neFor any two points p, q in ℝ × ℝ, any natural number k, and any allocation α : (ℝ × ℝ) → Fin k, if α p ≠ α q, then the two-element finite…
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)