planar_necklace_two_cuts_six_points
For 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 and 3 points are colored 1, there exists a finite set L of at most 2 straight lines and an allocation function α : (ℝ × ℝ) → Fin 3 consistent with L on P such that each of the three agents receives exactly 1 point of color 0 and 1 point of color 1.
Statement
theorem planar_necklace_two_cuts_six_points (P : Finset (ℝ × ℝ)) (c : (ℝ × ℝ) → Fin 2) (hP_card : P.card = 6) (h_red : (P.filter (fun p => c p = 0)).card = 3) (h_blue : (P.filter (fun p => c p = 1)).card = 3) : ∃ (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 = 1 ∧ (P.filter (fun p => α p = i ∧ c p = 1)).card = 1
- Formalizes
- arXiv:2610.27956 Theorem 10 (Splitting Planar Necklaces with Few Straight Cuts)
- Verified
- 25 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- 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 α…
- planar_necklace_two_parallel_cuts_six_pointsLet P be a finite set of 6 points in ℝ × ℝ with a coloring c : (ℝ × ℝ) → Fin 2 having exactly 3 red points (color 0) in P and 3 blue…
- 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…
- is_parallel_two_cut_consistentGiven a finite set of points P in ℝ × ℝ, an ℝ-linear map φ : (ℝ × ℝ) →ₗ[ℝ] ℝ, two thresholds t₁, t₂ ∈ ℝ, and an assignment function α : (ℝ…
Read back from the Lean
Let $P$ be a finite set of points in the plane $\mathbb{R} \times \mathbb{R}$, and let $c : (\mathbb{R} \times \mathbb{R}) \to \text{Fin } 2$ be a coloring function.
Assume that:
1. $P$ has cardinality 6 ($|P| = 6$);
2. Exactly 3 points of $P$ have color 0 ($|\{p \in P \mid c(p) = 0\}| = 3$);
3. Exactly 3 points of $P$ have color 1 ($|\{p \in P \mid c(p) = 1\}| = 3$).
Then there exist a finite set of straight lines $L$ and a partitioning function $\alpha : (\mathbb{R} \times \mathbb{R}) \to \text{Fin } 3$ such that:
1. $L$ contains at most 2 lines ($|L| \le 2$);
2. $\alpha$ is consistent with the cuts made by $L$ on $P$ (is_straight_line_cut_consistent P L α);
3. For every part $i \in \text{Fin } 3$ (i.e., $i \in \{0, 1, 2\}$):
- Exactly one point $p \in P$ has $\alpha(p) = i$ and $c(p) = 0$;
- Exactly one point $p \in P$ has $\alpha(p) = i$ and $c(p) = 1$.
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 proves that six bicolored points in ℝ² (three of each color) can be fairly divided among three agents using at most two straight lines. It first invokes planar_necklace_two_parallel_cuts_six_points to find a non-zero linear functional φ and thresholds t₁ ≤ t₂ giving a fair allocation via parallel hyperplanes. When t₁ < t₂, two parallel lines directly yield the result; when t₁ = t₂ = s, the proof constructs two formally distinct lines with equations φ(p) - s = 0 and 2φ(p) - 2s = 0 whose signs α(p) ≠ 0 and α(p) = 2 consistently separate the points into three groups.
Scaling a non-zero linear form φ by 2 produces a non-zero linear form 2φ ≠ 0.
Assume for contradiction that 2φ = 0. Multiplying both sides by 1/2 gives ((1/2) * 2) • φ = (1/2) • (2 • φ) = (1/2) • 0 = 0. Since (1/2) * 2 = 1, this simplifies to φ = 0, contradicting φ ≠ 0.
uses
mul_smul,smul_zerointro h apply hφ have : ((1/2 : ℝ) * (2 : ℝ)) • φ = (0 : (ℝ × ℝ) →ₗ[ℝ] ℝ) := by rw [mul_smul, h, smul_zero] norm_num at this exact this
For any non-zero linear form φ, the doubled form 2φ is not equal to φ.
Assume for contradiction that 2φ = φ. Subtracting φ from both sides gives (2 - 1) • φ = 2 • φ - 1 • φ = φ - φ = 0. Since 2 - 1 = 1, this simplifies to φ = 0, contradicting φ ≠ 0.
uses
sub_smul,one_smul,sub_eq_zerointro h apply hφ have : ((2 : ℝ) - 1) • φ = (0 : (ℝ × ℝ) →ₗ[ℝ] ℝ) := by rw [sub_smul, one_smul, sub_eq_zero, h] norm_num at this exact this
The straight line defined by (φ, s) is distinct from the line defined by (2φ, 2s).
Assume for contradiction that the two lines are equal. Then their cut functions must have identical linear components. Unfolding the definition of the cut lines, their linear parts are φ - 0 and 2φ - 0, which reduces to φ = 2φ. This contradicts the preceding lemma that 2φ ≠ φ.
uses
planar_necklace_two_cuts_six_points_scale_linear_ne_zero,LinearMap.toAffineMap_linear,sub_zero,planar_necklace_two_cuts_six_points_scale_linear_neintro h have hlin : (is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ s).cut.linear = (is_straight_line_cut_consistent_of_parallel_cuts_make_line ((2:ℝ) • φ) (planar_necklace_two_cuts_six_points_scale_linear_ne_zero φ hφ) (2 * s)).cut.linear := by rw [h] dsimp [is_straight_line_cut_consistent_of_parallel_cuts_make_line, is_straight_line_cut_consistent_of_parallel_cuts_cut_line] at hlin change φ.toAffineMap.linear - 0 = ((2:ℝ) • φ).toAffineMap.linear - 0 at hlin simp only [LinearMap.toAffineMap_linear, sub_zero] at hlin exact (planar_necklace_two_cuts_six_points_scale_linear_ne φ hφ) hlin.symm
When the parallel cut thresholds coincide (t₁ = t₂ = s), we define two distinct straight lines ℓ₁, ℓ₂ forming a set of size at most 2, and introduce candidate signs for consistency.
Let ℓ₁ be the line defined by (φ, s) and ℓ₂ the line defined by (2φ, 2s). By the previous lemma, ℓ₂ ≠ ℓ₁, so L = {ℓ₁, ℓ₂} has cardinality at most 2. We use the sign function s(ℓ, p) that tests α(p) ≠ 0 on ℓ₁ and α(p) = 2 on ℓ₂, reducing consistency to verifying the sign condition and the separation condition.
uses
planar_necklace_two_cuts_six_points_scale_linear_ne_zero,planar_necklace_two_cuts_six_points_make_line_scale_ne,Finset.card_le_twoclassical let ℓ₁ := is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ s let ℓ₂ := is_straight_line_cut_consistent_of_parallel_cuts_make_line ((2:ℝ) • φ) (planar_necklace_two_cuts_six_points_scale_linear_ne_zero φ hφ) (2 * s) have hne : ℓ₂ ≠ ℓ₁ := (planar_necklace_two_cuts_six_points_make_line_scale_ne φ hφ s).symm use {ℓ₁, ℓ₂} refine ⟨Finset.card_le_two, ?_⟩ dsimp [is_straight_line_cut_consistent] use is_straight_line_cut_consistent_of_parallel_cuts_s ℓ₁ ℓ₂ α refine ⟨?_, ?_⟩
The sign condition holds on line ℓ₁: positive values imply α(p) ≠ 0 and negative values imply α(p) = 0.
On ℓ₁, the cut function evaluates to φ(p) - s and the sign evaluates to α(p) ≠ 0. If φ(p) - s > 0, then φ(p) > s, which precludes α(p) = 0 (since α(p) = 0 requires φ(p) ≤ s), so α(p) ≠ 0 is true. If φ(p) - s < 0, then φ(p) < s, which precludes α(p) = 1 and α(p) = 2 (both require φ(p) ≥ s), forcing α(p) = 0, so α(p) ≠ 0 is 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 condition holds on line ℓ₂: positive values imply α(p) = 2 and negative values imply α(p) ≠ 2.
On ℓ₂, the cut function evaluates to (2 • φ)(p) - 2s = 2(φ(p) - s), and the assigned sign evaluates to α(p) = 2. If 2(φ(p) - s) > 0, then φ(p) > s, ruling out α(p) = 0 and α(p) = 1 (both require φ(p) ≤ s) and leaving α(p) = 2, so the sign is true. If 2(φ(p) - s) < 0, then φ(p) < s, precluding α(p) = 2 (which requires φ(p) ≥ s), so the sign is false.
uses
is_straight_line_cut_consistent_of_parallel_cuts_s_two,is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut,LinearMap.smul_apply,smul_eq_mul,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] have hcut2 : ((2 : ℝ) • φ) p - 2 * s = 2 * (φ p - s) := by simp only [LinearMap.smul_apply, smul_eq_mul] ring rw [hcut2] 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 sharing the same signs on both ℓ₁ and ℓ₂ receive the same agent allocation.
If points p and q have matching signs on both lines, then their evaluations on ℓ₁ give decide(α(p) ≠ 0) = decide(α(q) ≠ 0), and their evaluations on ℓ₂ give decide(α(p) = 2) = decide(α(q) = 2). In Fin 3, whether a value is non-zero and whether it equals 2 uniquely identifies the element, 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
Any parallel-cut allocation with ordered thresholds t₁ ≤ t₂ is consistent with at most 2 straight lines.
We case split on t₁ < t₂ versus t₁ = t₂. When t₁ < t₂, the existing theorem is_straight_line_cut_consistent_of_parallel_cuts provides at most 2 lines. When t₁ = t₂, consistency is provided by the degenerate case lemma planar_necklace_two_cuts_six_points_of_parallel_cuts_eq.
uses
is_straight_line_cut_consistent_of_parallel_cuts,planar_necklace_two_cuts_six_points_of_parallel_cuts_eqrcases ht.lt_or_eq with hlt | heq · exact is_straight_line_cut_consistent_of_parallel_cuts P φ hφ t₁ t₂ α hlt hα · subst heq exact planar_necklace_two_cuts_six_points_of_parallel_cuts_eq P φ hφ t₁ α hα
There exist at most 2 straight lines and an allocation consistent with them giving each agent 1 red point and 1 blue point.
We invoke planar_necklace_two_parallel_cuts_six_points to obtain a non-zero functional φ, ordered thresholds t₁ ≤ t₂, and an equitable allocation α consistent with parallel cuts. Applying planar_necklace_two_cuts_six_points_of_parallel_cuts_le then turns the parallel cuts into a set L of at most 2 consistent straight lines while retaining the fair point allocation.
uses
planar_necklace_two_parallel_cuts_six_points,planar_necklace_two_cuts_six_points_of_parallel_cuts_leobtain ⟨φ, t₁, t₂, α, hφ, h_cons, h_fair⟩ := planar_necklace_two_parallel_cuts_six_points P c hP_card h_red h_blue rcases h_cons with ⟨ht, hα⟩ obtain ⟨L, hL_card, hL_cons⟩ := planar_necklace_two_cuts_six_points_of_parallel_cuts_le P φ hφ t₁ t₂ α ht hα exact ⟨L, α, hL_card, hL_cons, h_fair⟩
mul_smul- Multiplication of scalars associates with scalar multiplication.
smul_zero- Scalar multiplication of the zero vector by any scalar yields the zero vector.
sub_smul- Scalar multiplication distributes over scalar subtraction.
one_smul- Scaling by the scalar 1 is the identity map.
sub_eq_zero- The difference of two elements is zero if and only if they are equal.
planar_necklace_two_cuts_six_points_scale_linear_ne_zero- Scaling a non-zero linear functional on ℝ² by 2 yields a non-zero linear functional.
LinearMap.toAffineMap_linear- The linear part of the affine map induced by a linear map is the original linear map.
sub_zero- Subtracting zero leaves an element unchanged.
planar_necklace_two_cuts_six_points_scale_linear_ne- Scaling a non-zero linear functional by 2 yields a functional distinct from the original.
planar_necklace_two_cuts_six_points_make_line_scale_ne- The straight lines defined by the functional-threshold pairs (φ, s) and (2φ, 2s) are distinct.
Finset.card_le_two- A set with at most two elements has cardinality at most 2.
Finset.mem_insert- An element belongs to insert b s if and only if it equals b or is in s.
Finset.mem_singleton- An element belongs to the singleton {a} if and only if it equals a.
is_straight_line_cut_consistent_of_parallel_cuts_s_one- On the first line ℓ₁, the consistency sign function assigns true if α(p) ≠ 0 and false otherwise.
is_straight_line_cut_consistent_of_parallel_cuts_make_line_cut- The cut function of the line made from functional φ and threshold t evaluates at p to φ(p) - t.
decide_eq_true- A decidable proposition evaluates to true if the proposition holds.
decide_eq_false- A decidable proposition evaluates to false if the proposition is false.
is_straight_line_cut_consistent_of_parallel_cuts_fin3_cases- Every element of Fin 3 is equal to 0, 1, or 2.
is_straight_line_cut_consistent_of_parallel_cuts_s_two- For distinct lines ℓ₂ ≠ ℓ₁, the sign function on ℓ₂ assigns true if α(p) = 2 and false otherwise.
LinearMap.smul_apply- Evaluating a scalar multiple of a linear map at an argument equals the scalar multiple of the evaluated value.
smul_eq_mul- Scalar multiplication on ℝ coincides with real multiplication.
is_straight_line_cut_consistent_of_parallel_cuts_fin3_eq- Two elements of Fin 3 that agree on whether they are non-zero and whether they equal 2 are equal.
is_straight_line_cut_consistent_of_parallel_cuts- When parallel cut thresholds satisfy t₁ < t₂, there exists a set of at most 2 straight lines consistent with the allocation.
planar_necklace_two_cuts_six_points_of_parallel_cuts_eq- When parallel cut thresholds coincide (t₁ = t₂ = s), there exists a set of at most 2 straight lines consistent with the allocation.
planar_necklace_two_parallel_cuts_six_points- For 6 points in ℝ² (3 red, 3 blue), there exists a fair 3-agent allocation consistent with two parallel cuts.
planar_necklace_two_cuts_six_points_of_parallel_cuts_le- When parallel cut thresholds satisfy t₁ ≤ t₂, there exists a set of at most 2 straight lines consistent with the allocation.
- In the degenerate case where the two cut thresholds coincide (t₁ = t₂ = s), the two lines ℓ₁ and ℓ₂ represent the exact same geometric line φ(p) = s. Formally, StraightLine packages an affine cut function whose linear part must be non-zero; scaling the linear functional by 2 produces a formally distinct object ℓ₂ ≠ ℓ₁, yielding a set {ℓ₁, ℓ₂} of two lines and two independent boolean signs to classify the points into the three allocation bins.
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.
lemma planar_necklace_two_cuts_six_points_scale_linear_ne_zero (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) : (2 : ℝ) • φ ≠ 0 := by intro h apply hφ have : ((1/2 : ℝ) * (2 : ℝ)) • φ = (0 : (ℝ × ℝ) →ₗ[ℝ] ℝ) := by rw [mul_smul, h, smul_zero] norm_num at this exact thislemma planar_necklace_two_cuts_six_points_scale_linear_ne (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) : (2 : ℝ) • φ ≠ φ := by intro h apply hφ have : ((2 : ℝ) - 1) • φ = (0 : (ℝ × ℝ) →ₗ[ℝ] ℝ) := by rw [sub_smul, one_smul, sub_eq_zero, h] norm_num at this exact thislemma planar_necklace_two_cuts_six_points_make_line_scale_ne (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) (s : ℝ) : is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ s ≠ is_straight_line_cut_consistent_of_parallel_cuts_make_line ((2:ℝ) • φ) (planar_necklace_two_cuts_six_points_scale_linear_ne_zero φ hφ) (2 * s) := by intro h have hlin : (is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ s).cut.linear = (is_straight_line_cut_consistent_of_parallel_cuts_make_line ((2:ℝ) • φ) (planar_necklace_two_cuts_six_points_scale_linear_ne_zero φ hφ) (2 * s)).cut.linear := by rw [h] dsimp [is_straight_line_cut_consistent_of_parallel_cuts_make_line, is_straight_line_cut_consistent_of_parallel_cuts_cut_line] at hlin change φ.toAffineMap.linear - 0 = ((2:ℝ) • φ).toAffineMap.linear - 0 at hlin simp only [LinearMap.toAffineMap_linear, sub_zero] at hlin exact (planar_necklace_two_cuts_six_points_scale_linear_ne φ hφ) hlin.symmlemma planar_necklace_two_cuts_six_points_of_parallel_cuts_eq (P : Finset (ℝ × ℝ)) (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (hφ : φ ≠ 0) (s : ℝ) (α : (ℝ × ℝ) → Fin 3) (hα : ∀ p ∈ P, (α p = 0 → φ p ≤ s) ∧ (α p = 1 → s ≤ φ p ∧ φ p ≤ s) ∧ (α p = 2 → s ≤ φ p)) : ∃ (L : Finset StraightLine), L.card ≤ 2 ∧ is_straight_line_cut_consistent P L α := by classical let ℓ₁ := is_straight_line_cut_consistent_of_parallel_cuts_make_line φ hφ s let ℓ₂ := is_straight_line_cut_consistent_of_parallel_cuts_make_line ((2:ℝ) • φ) (planar_necklace_two_cuts_six_points_scale_linear_ne_zero φ hφ) (2 * s) have hne : ℓ₂ ≠ ℓ₁ := (planar_necklace_two_cuts_six_points_make_line_scale_ne φ hφ s).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] have hcut2 : ((2 : ℝ) • φ) p - 2 * s = 2 * (φ p - s) := by simp only [LinearMap.smul_apply, smul_eq_mul] ring rw [hcut2] 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 hs2lemma planar_necklace_two_cuts_six_points_of_parallel_cuts_le (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 rcases ht.lt_or_eq with hlt | heq · exact is_straight_line_cut_consistent_of_parallel_cuts P φ hφ t₁ t₂ α hlt hα · subst heq exact planar_necklace_two_cuts_six_points_of_parallel_cuts_eq P φ hφ t₁ α hα/-- Theorem 10 of arXiv:2610.27956: two straight lines suffice to fairly allocate six points (three red and three blue) among three agents. -/theorem planar_necklace_two_cuts_six_points (P : Finset (ℝ × ℝ)) (c : (ℝ × ℝ) → Fin 2) (hP_card : P.card = 6) (h_red : (P.filter (fun p => c p = 0)).card = 3) (h_blue : (P.filter (fun p => c p = 1)).card = 3) : ∃ (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 = 1 ∧ (P.filter (fun p => α p = i ∧ c p = 1)).card = 1 := by obtain ⟨φ, t₁, t₂, α, hφ, h_cons, h_fair⟩ := planar_necklace_two_parallel_cuts_six_points P c hP_card h_red h_blue rcases h_cons with ⟨ht, hα⟩ obtain ⟨L, hL_card, hL_cons⟩ := planar_necklace_two_cuts_six_points_of_parallel_cuts_le P φ hφ t₁ t₂ α ht hα exact ⟨L, α, hL_card, hL_cons, h_fair⟩