is_straight_line_cut_consistent_of_parallel_cuts
Let 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 allocation function from ℝ × ℝ to Fin 3. If for every point p in P, α p = 0 implies φ p ≤ t₁, α p = 1 implies t₁ ≤ φ p and φ p ≤ t₂, and α p = 2 implies t₂ ≤ φ p, then there exists a finite set L of at most 2 straight lines such that α is consistent with L on P.
Statement
theorem is_straight_line_cut_consistent_of_parallel_cuts
(P : Finset (ℝ × ℝ)) (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) (t₁ t₂ : ℝ)
(α : (ℝ × ℝ) → Fin 3)
(ht : t₁ < t₂)
(hα : ∀ p ∈ P, (α p = 0 → φ p ≤ t₁) ∧ (α p = 1 → t₁ ≤ φ p ∧ φ p ≤ t₂) ∧ (α p = 2 → t₂ ≤ φ p)) :
∃ (L : Finset StraightLine), L.card ≤ 2 ∧ is_straight_line_cut_consistent P L α- Source
- arXiv:2610.27956 Section 4 (Splitting Planar Necklaces with Few Straight Cuts)
- Verified
- 25 Oct 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 α…
- Used by 2
- 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…
- 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…
Read back from the Lean
Let $P$ be a finite set of points in $\mathbb{R}^2$, let $\varphi : \mathbb{R}^2 \to \mathbb{R}$ be a non-zero $\mathbb{R}$-linear map, and let $t_1, t_2 \in \mathbb{R}$ with $t_1 < t_2$. Let $\alpha : \mathbb{R}^2 \to \mathrm{Fin}\ 3$ be a 3-labeling of $\mathbb{R}^2$. Assume that for every point $p \in P$: 1. If $\alpha(p) = 0$, then $\varphi(p) \le t_1$, 2. If $\alpha(p) = 1$, then $t_1 \le \varphi(p) \le t_2$, and 3. If $\alpha(p) = 2$, then $t_2 \le \varphi(p)$. Then there exists a finite set $L$ of straight lines (defined as affine maps from $\mathbb{R}^2$ to $\mathbb{R}$ with non-zero linear part) such that the cardinality of $L$ is at most $2$, and $L$ is cut-consistent with $\alpha$ on $P$ (meaning there exists a boolean labeling function $s$ assigning to each line $\ell \in L$ and point $p \in \mathbb{R}^2$ a boolean value such that: - for all $\ell \in L$ and $p \in P$, $s(\ell, p) = \mathrm{true}$ whenever $\ell.\mathrm{cut}(p) > 0$, and $s(\ell, p) = \mathrm{false}$ whenever $\ell.\mathrm{cut}(p) < 0$; and - for all $p, q \in P$, if $s(\ell, p) = s(\ell, q)$ for every line $\ell \in L$, then $\alpha(p) = \alpha(q)$).
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 is proved by explicitly choosing the candidate set of straight lines L = {ℓ₁, ℓ₂} to be the level lines φ(p) = t₁ and φ(p) = t₂, which has cardinality at most 2. A sign function s is defined so that ℓ₁ tests whether α(p) ≠ 0 and ℓ₂ tests whether α(p) = 2. On points strictly separated by the lines, the geometric bounds on φ(p) given by the hypothesis on α ensure that these boolean tests match the signs of the affine cuts φ(p) - t₁ and φ(p) - t₂. Finally, because two boolean queries (non-zeroness and equality to 2) uniquely determine any element of Fin 3, points with identical sign profiles on L receive identical labels under α.
For any threshold t, the map p ↦ φ(p) - t forms an affine map with linear part φ ≠ 0, defining a straight line whose cut function evaluates to φ(p) - t.
We construct an affine map by subtracting the constant t from the linear functional φ. Its linear part is φ, which is non-zero by assumption hφ, thereby satisfying the definition of a StraightLine. By construction, its cut function at any point p is φ(p) - t.
uses
is_straight_line_cut_consistent_of_parallel_cuts_cut_line_linearopen Classical def is_straight_line_cut_consistent_of_parallel_cuts_cut_line (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (t : ℝ) : (ℝ × ℝ) →ᵃ[ℝ] ℝ := φ.toAffineMap - AffineMap.const ℝ (ℝ × ℝ) t theorem is_straight_line_cut_consistent_of_parallel_cuts_cut_line_linear (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (t : ℝ) : (is_straight_line_cut_consistent_of_parallel_cuts_cut_line φ t).linear = φ := by simp [is_straight_line_cut_consistent_of_parallel_cuts_cut_line] def is_straight_line_cut_consistent_of_parallel_cuts_make_line (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) (t : ℝ) : StraightLine := ⟨is_straight_line_cut_consistent_of_parallel_cuts_cut_line φ t, by rw [is_straight_line_cut_consistent_of_parallel_cuts_cut_line_linear]; exact hφ⟩ theorem is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) (t : ℝ) (p : ℝ × ℝ) : (is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t).cut p = φ p - t := rfl
Two straight lines defined by the same functional φ at distinct thresholds t₁ < t₂ are distinct.
Assuming for contradiction that the two lines coincide, their cut values at the origin (0, 0) must be equal. Since the linear functional φ maps 0 to 0 by map_zero, this equality reduces to 0 - t₁ = 0 - t₂, or t₁ = t₂, contradicting the hypothesis t₁ < t₂.
uses
is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut,map_zerotheorem is_straight_line_cut_consistent_of_parallel_cuts_make_line_ne (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) {t₁ t₂ : ℝ} (ht : t₁ < t₂) : is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₁ ≠ is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₂ := by intro h have h_cut : (is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₁).cut 0 = (is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₂).cut 0 := by rw [h] rw [is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut, is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut] at h_cut have hz : φ 0 = 0 := map_zero φ rw [hz] at h_cut linarith
The sign assignment function s evaluates to decide (α p ≠ 0) on the first line ℓ₁, and to decide (α p = 2) on the second line ℓ₂ whenever ℓ₂ ≠ ℓ₁.
We define s by inspecting whether the line argument equals ℓ₁ or ℓ₂. When evaluated on ℓ₁, the conditional simplifies directly to decide (α p ≠ 0). When evaluated on ℓ₂, since ℓ₂ ≠ ℓ₁, the first branch is bypassed and the second branch simplifies to decide (α p = 2).
uses
if_pos,if_negnoncomputable def is_straight_line_cut_consistent_of_parallel_cuts_s (ℓ₁ ℓ₂ : StraightLine) (α : (ℝ × ℝ) → Fin 3) : StraightLine → (ℝ × ℝ) → Bool := fun ℓ p => if ℓ = ℓ₁ then decide (α p ≠ 0) else if ℓ = ℓ₂ then decide (α p = 2) else false theorem is_straight_line_cut_consistent_of_parallel_cuts_s_one (ℓ₁ ℓ₂ : StraightLine) (α : (ℝ × ℝ) → Fin 3) (p : ℝ × ℝ) : is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₁ p = decide (α p ≠ 0) := by dsimp [is_straight_line_cut_consistent_of_parallel_cuts_s] rw [if_pos rfl] theorem is_straight_line_cut_consistent_of_parallel_cuts_s_two {ℓ₁ ℓ₂ : StraightLine} (hne : ℓ₂ ≠ ℓ₁) (α : (ℝ × ℝ) → Fin 3) (p : ℝ × ℝ) : is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₂ p = decide (α p = 2) := by dsimp [is_straight_line_cut_consistent_of_parallel_cuts_s] rw [if_neg hne, if_pos rfl]
Every element of Fin 3 is 0, 1, or 2, and any two elements that agree on non-zeroness and on equality to 2 are equal. automation
Because Fin 3 has only three elements, exhaustive case analysis and the injectivity of the pair of boolean tests are verified by finite evaluation using the decide tactic.
lemma is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases (x : Fin 3) : x = 0 ∨ x = 1 ∨ x = 2 := by revert x; decide lemma is_straight_line_cut_consistent_of_parallel_cuts_fin3_eq {a b : Fin 3} (h1 : decide (a ≠ 0) = decide (b ≠ 0)) (h2 : decide (a = 2) = decide (b = 2)) : a = b := by revert a b decide
The pair of lines L = {ℓ₁, ℓ₂} defined at thresholds t₁ and t₂ has cardinality at most 2, and ℓ₂ ≠ ℓ₁.
We instantiate ℓ₁ and ℓ₂ as the straight lines defined by φ at thresholds t₁ and t₂. Because t₁ < t₂, the two lines are distinct by is_straight_line_cut_consistent_of_parallel_cuts_make_line_ne. We choose the set of lines L to be {ℓ₁, ℓ₂}; its cardinality is at most 2 by Finset.card_le_two.
uses
is_straight_line_cut_consistent_of_parallel_cuts_make_line_ne,Finset.card_le_two/-- Consistency with two parallel cuts at distinct thresholds implies consistency with at most two straight lines. -/ theorem is_straight_line_cut_consistent_of_parallel_cuts (P : Finset (ℝ × ℝ)) (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) (t₁ t₂ : ℝ) (α : (ℝ × ℝ) → Fin 3) (ht : t₁ < t₂) (hα : ∀ p ∈ P, (α p = 0 → φ p ≤ t₁) ∧ (α p = 1 → t₁ ≤ φ p ∧ φ p ≤ t₂) ∧ (α p = 2 → t₂ ≤ φ p)) : ∃ (L : Finset StraightLine), L.card ≤ 2 ∧ is_straight_line_cut_consistent P L α := by let ℓ₁ := is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₁ let ℓ₂ := is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₂ have hne : ℓ₂ ≠ ℓ₁ := by intro h exact (is_straight_line_cut_consistent_of_parallel_cuts_make_line_ne φ hφ ht) h.symm use {ℓ₁, ℓ₂} refine ⟨Finset.card_le_two, ?_⟩
To show consistency of α with L on P, it suffices to exhibit a sign function s that matches the cut signs on each line and separates points with distinct labels.
Unfolding the definition of is_straight_line_cut_consistent, we witness the existential sign assignment with s(ℓ₁, ℓ₂, α). This leaves two goals: showing that s is consistent with the cut values on all points of P for each line in L, and showing that any two points with identical sign profiles on L share the same label under α.
dsimp [is_straight_line_cut_consistent] use is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α refine ⟨?_, ?_⟩
The sign assignment s is consistent with the cut values of the first line ℓ₁ for all points p in P.
For the line ℓ₁, the cut value at p is φ(p) - t₁ and the assigned sign is the truth value of α(p) ≠ 0. If φ(p) - t₁ > 0, then α(p) cannot be 0, because the hypothesis on α guarantees that α(p) = 0 implies φ(p) ≤ t₁. Conversely, if φ(p) - t₁ < 0, testing all possible values of α(p) shows that α(p) = 1 implies φ(p) ≥ t₁ and α(p) = 2 implies φ(p) ≥ t₂ > t₁, both of which contradict φ(p) < t₁; therefore α(p) must be 0 and s evaluates to false.
uses
Finset.mem_insert,Finset.mem_singleton,is_straight_line_cut_consistent_of_parallel_cuts_s_one,is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut,decide_eq_true,decide_eq_false,is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases· intro ℓ hℓ p hp simp only [Finset.mem_insert, Finset.mem_singleton] at hℓ rcases hα p hp with ⟨h0, h1, h2⟩ rcases hℓ with rfl | rfl · rw [is_straight_line_cut_consistent_of_parallel_cuts_s_one, is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut] constructor · intro hpos apply decide_eq_true intro ha0 have := h0 ha0 linarith · intro hneg apply decide_eq_false intro ha rcases is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases (α p) with ha0 | ha1 | ha2 · contradiction · have := (h1 ha1).1 linarith · have := h2 ha2 linarith
The sign assignment s is consistent with the cut values of the second line ℓ₂ for all points p in P.
For ℓ₂, the cut value is φ(p) - t₂ and the assigned sign is the truth value of α(p) = 2. If φ(p) - t₂ > 0, testing cases for α(p) rules out α(p) = 0 (which implies φ(p) ≤ t₁ < t₂) and α(p) = 1 (which implies φ(p) ≤ t₂); thus α(p) must be 2 and s evaluates to true. If φ(p) - t₂ < 0, then α(p) cannot be 2, because α(p) = 2 would imply φ(p) ≥ t₂; thus s evaluates to false.
uses
is_straight_line_cut_consistent_of_parallel_cuts_s_two,is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut,decide_eq_true,is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases,decide_eq_false· rw [is_straight_line_cut_consistent_of_parallel_cuts_s_two hne, is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut] constructor · intro hpos apply decide_eq_true rcases is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases (α p) with ha0 | ha1 | ha2 · have := h0 ha0 linarith · have := (h1 ha1).2 linarith · exact ha2 · intro hneg apply decide_eq_false intro ha2 have := h2 ha2 linarith
Points in P with identical sign assignments on both ℓ₁ and ℓ₂ have the same label under α.
Let p and q be points in P. Specializing the assumption that s(ℓ, p) = s(ℓ, q) for all ℓ ∈ {ℓ₁, ℓ₂} to ℓ₁ and ℓ₂ yields decide (α p ≠ 0) = decide (α q ≠ 0) and decide (α p = 2) = decide (α q = 2). By is_straight_line_cut_consistent_of_parallel_cuts_fin3_eq, any two elements of Fin 3 that agree on these two boolean tests are equal, so α(p) = α(q).
uses
is_straight_line_cut_consistent_of_parallel_cuts_s_one,is_straight_line_cut_consistent_of_parallel_cuts_s_two,is_straight_line_cut_consistent_of_parallel_cuts_fin3_eq· intro p hp q hq hsame have hs1 : is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₁ p = is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₁ q := hsame ℓ₁ (by simp) have hs2 : is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₂ p = is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₂ q := hsame ℓ₂ (by simp) rw [is_straight_line_cut_consistent_of_parallel_cuts_s_one, is_straight_line_cut_consistent_of_parallel_cuts_s_one] at hs1 rw [is_straight_line_cut_consistent_of_parallel_cuts_s_two hne, is_straight_line_cut_consistent_of_parallel_cuts_s_two hne] at hs2 exact is_straight_line_cut_consistent_of_parallel_cuts_fin3_eq hs1 hs2
decide_eq_false- the boolean decision decide p equals false if and only if p is false
decide_eq_true- the boolean decision decide p equals true if and only if p holds
Finset.card_le_two- a doubleton set {a, b} has cardinality at most 2
Finset.mem_insert- an element x is in insert b s if and only if x = b or x ∈ s
Finset.mem_singleton- an element x is in the singleton {a} if and only if x = a
if_neg- an if-then-else evaluates to the else branch when its condition is false
if_pos- an if-then-else evaluates to the then branch when its condition is true
is_straight_line_cut_consistent_of_parallel_cuts_cut_line_linear- the linear part of the affine cut line φ - t is φ itself
is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases- every element of Fin 3 is either 0, 1, or 2
is_straight_line_cut_consistent_of_parallel_cuts_fin3_eq- two elements of Fin 3 are equal if they agree on whether they are non-zero and whether they equal 2
is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut- the cut function of the straight line constructed from functional φ and threshold t evaluated at p is φ p - t
is_straight_line_cut_consistent_of_parallel_cuts_make_line_ne- two straight lines defined by the same non-zero linear functional at distinct thresholds t₁ < t₂ are distinct
is_straight_line_cut_consistent_of_parallel_cuts_s_one- the sign assignment s evaluated on line ℓ₁ and point p equals the boolean decide (α p ≠ 0)
is_straight_line_cut_consistent_of_parallel_cuts_s_two- the sign assignment s evaluated on line ℓ₂ and point p equals the boolean decide (α p = 2), provided ℓ₂ ≠ ℓ₁
map_zero- any zero-preserving map (such as a linear map) sends 0 to 0
- The properties of Fin 3 (exhaustiveness of the three elements and injectivity of the two boolean tests) are verified computationally by the decide tactic without an explicit paper-style proof.
- The sign function s artificially defaults to false on any line other than ℓ₁ and ℓ₂, which suffices because consistency only checks lines belonging to L = {ℓ₁, ℓ₂}.
- The cardinality bound |L| ≤ 2 is immediate from the syntactic doubleton form {ℓ₁, ℓ₂} via Finset.card_le_two, regardless of whether ℓ₁ and ℓ₂ are distinct.
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.
open Classicaldef is_straight_line_cut_consistent_of_parallel_cuts_cut_line (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (t : ℝ) : (ℝ × ℝ) →ᵃ[ℝ] ℝ := φ.toAffineMap - AffineMap.const ℝ (ℝ × ℝ) ttheorem is_straight_line_cut_consistent_of_parallel_cuts_cut_line_linear (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (t : ℝ) : (is_straight_line_cut_consistent_of_parallel_cuts_cut_line φ t).linear = φ := by simp [is_straight_line_cut_consistent_of_parallel_cuts_cut_line]def is_straight_line_cut_consistent_of_parallel_cuts_make_line (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) (t : ℝ) : StraightLine := ⟨is_straight_line_cut_consistent_of_parallel_cuts_cut_line φ t, by rw [is_straight_line_cut_consistent_of_parallel_cuts_cut_line_linear]; exact hφ⟩theorem is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) (t : ℝ) (p : ℝ × ℝ) : (is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t).cut p = φ p - t := rfltheorem is_straight_line_cut_consistent_of_parallel_cuts_make_line_ne (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) {t₁ t₂ : ℝ} (ht : t₁ < t₂) : is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₁ ≠ is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₂ := by intro h have h_cut : (is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₁).cut 0 = (is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₂).cut 0 := by rw [h] rw [is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut, is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut] at h_cut have hz : φ 0 = 0 := map_zero φ rw [hz] at h_cut linarithnoncomputable def is_straight_line_cut_consistent_of_parallel_cuts_s (ℓ₁ ℓ₂ : StraightLine) (α : (ℝ × ℝ) → Fin 3) : StraightLine → (ℝ × ℝ) → Bool := fun ℓ p => if ℓ = ℓ₁ then decide (α p ≠ 0) else if ℓ = ℓ₂ then decide (α p = 2) else falsetheorem is_straight_line_cut_consistent_of_parallel_cuts_s_one (ℓ₁ ℓ₂ : StraightLine) (α : (ℝ × ℝ) → Fin 3) (p : ℝ × ℝ) : is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₁ p = decide (α p ≠ 0) := by dsimp [is_straight_line_cut_consistent_of_parallel_cuts_s] rw [if_pos rfl]theorem is_straight_line_cut_consistent_of_parallel_cuts_s_two {ℓ₁ ℓ₂ : StraightLine} (hne : ℓ₂ ≠ ℓ₁) (α : (ℝ × ℝ) → Fin 3) (p : ℝ × ℝ) : is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₂ p = decide (α p = 2) := by dsimp [is_straight_line_cut_consistent_of_parallel_cuts_s] rw [if_neg hne, if_pos rfl]lemma is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases (x : Fin 3) : x = 0 ∨ x = 1 ∨ x = 2 := by revert x; decidelemma is_straight_line_cut_consistent_of_parallel_cuts_fin3_eq {a b : Fin 3} (h1 : decide (a ≠ 0) = decide (b ≠ 0)) (h2 : decide (a = 2) = decide (b = 2)) : a = b := by revert a b decide/-- Consistency with two parallel cuts at distinct thresholds implies consistency with at most two straight lines. -/theorem is_straight_line_cut_consistent_of_parallel_cuts (P : Finset (ℝ × ℝ)) (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) (t₁ t₂ : ℝ) (α : (ℝ × ℝ) → Fin 3) (ht : t₁ < t₂) (hα : ∀ p ∈ P, (α p = 0 → φ p ≤ t₁) ∧ (α p = 1 → t₁ ≤ φ p ∧ φ p ≤ t₂) ∧ (α p = 2 → t₂ ≤ φ p)) : ∃ (L : Finset StraightLine), L.card ≤ 2 ∧ is_straight_line_cut_consistent P L α := by let ℓ₁ := is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₁ let ℓ₂ := is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ t₂ have hne : ℓ₂ ≠ ℓ₁ := by intro h exact (is_straight_line_cut_consistent_of_parallel_cuts_make_line_ne φ hφ ht) h.symm use {ℓ₁, ℓ₂} refine ⟨Finset.card_le_two, ?_⟩ dsimp [is_straight_line_cut_consistent] use is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α refine ⟨?_, ?_⟩ · intro ℓ hℓ p hp simp only [Finset.mem_insert, Finset.mem_singleton] at hℓ rcases hα p hp with ⟨h0, h1, h2⟩ rcases hℓ with rfl | rfl · rw [is_straight_line_cut_consistent_of_parallel_cuts_s_one, is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut] constructor · intro hpos apply decide_eq_true intro ha0 have := h0 ha0 linarith · intro hneg apply decide_eq_false intro ha rcases is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases (α p) with ha0 | ha1 | ha2 · contradiction · have := (h1 ha1).1 linarith · have := h2 ha2 linarith · rw [is_straight_line_cut_consistent_of_parallel_cuts_s_two hne, is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut] constructor · intro hpos apply decide_eq_true rcases is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases (α p) with ha0 | ha1 | ha2 · have := h0 ha0 linarith · have := (h1 ha1).2 linarith · exact ha2 · intro hneg apply decide_eq_false intro ha2 have := h2 ha2 linarith · intro p hp q hq hsame have hs1 : is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₁ p = is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₁ q := hsame ℓ₁ (by simp) have hs2 : is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₂ p = is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α ℓ₂ q := hsame ℓ₂ (by simp) rw [is_straight_line_cut_consistent_of_parallel_cuts_s_one, is_straight_line_cut_consistent_of_parallel_cuts_s_one] at hs1 rw [is_straight_line_cut_consistent_of_parallel_cuts_s_two hne, is_straight_line_cut_consistent_of_parallel_cuts_s_two hne] at hs2 exact is_straight_line_cut_consistent_of_parallel_cuts_fin3_eq hs1 hs2