AFTD Auto-Formalizing Theoretical Domains

is_parallel_two_cut_consistent

def

Given a finite set of points P in ℝ × ℝ, an ℝ-linear map φ : (ℝ × ℝ) →ₗ[ℝ] ℝ, two thresholds t₁, t₂ ∈ ℝ, and an assignment function α : (ℝ × ℝ) → Fin 3, is_parallel_two_cut_consistent P φ t₁ t₂ α is defined as: t₁ ≤ t₂ and for every point p ∈ P, (1) if α(p) = 0 then φ(p) ≤ t₁, (2) if α(p) = 1 then t₁ ≤ φ(p) and φ(p) ≤ t₂, and (3) if α(p) = 2 then t₂ ≤ φ(p).

Statement

def is_parallel_two_cut_consistent (P : Finset (ℝ × ℝ)) (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (t₁ t₂ : ℝ)
    (α : (ℝ × ℝ) → Fin 3) : Prop
Defined in
arXiv:2610.27956, Section 1.1 and Section 4.1
Verified
21 Oct 2026
Axioms
none listed
Used by 3
  • is_parallel_two_cut_consistent_emptyFor any linear map φ : (ℝ × ℝ) →ₗ[ℝ] ℝ, thresholds t₁, t₂ ∈ ℝ satisfying t₁ ≤ t₂, and assignment α : (ℝ × ℝ) → Fin 3, the empty set of…
  • 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…
  • 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…

Read back from the Lean

A finite set of points $P \subseteq \mathbb{R}^2$, an $\mathbb{R}$-linear map $\varphi : \mathbb{R}^2 \to \mathbb{R}$, thresholds $t_1, t_2 \in \mathbb{R}$, and a labeling $\alpha : \mathbb{R}^2 \to \operatorname{Fin} 3$ satisfy is_parallel_two_cut_consistent if and only if: 1. $t_1 \le t_2$, and 2. For every point $p \in P$: - if $\alpha(p) = 0$, then $\varphi(p) \le t_1$; - if $\alpha(p) = 1$, then $t_1 \le \varphi(p)$ and $\varphi(p) \le t_2$; - if $\alpha(p) = 2$, then $t_2 \le \varphi(p)$.

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 assignment of points to three regions is consistent with two parallel cuts at thresholds t₁ ≤ t₂ along linear functional φ. -/
def is_parallel_two_cut_consistent (P : Finset (ℝ × ℝ)) (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) (t₁ t₂ : ℝ)
    (α : (ℝ × ℝ) → Fin 3) : Prop := t₁ ≤ t₂ ∧ ∀ p ∈ P, (α p = 0 → φ p ≤ t₁) ∧ (α p = 1 → t₁ ≤ φ p ∧ φ p ≤ t₂) ∧ (α p = 2 → t₂ ≤ φ p)
See it in the graphDiscuss this resultChallenge it