is_parallel_two_cut_consistent_empty
For any linear map φ : (ℝ × ℝ) →ₗ[ℝ] ℝ, thresholds t₁, t₂ ∈ ℝ satisfying t₁ ≤ t₂, and assignment α : (ℝ × ℝ) → Fin 3, the empty set of points in ℝ × ℝ satisfies is_parallel_two_cut_consistent ∅ φ t₁ t₂ α.
Statement
theorem is_parallel_two_cut_consistent_empty (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) {t₁ t₂ : ℝ} (ht : t₁ ≤ t₂)
(α : (ℝ × ℝ) → Fin 3) :
is_parallel_two_cut_consistent ∅ φ t₁ t₂ α- Source
- folklore
- Verified
- 22 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- 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
For any ℝ-linear map φ : ℝ × ℝ →ₗ[ℝ] ℝ, any real numbers t₁ and t₂ such that t₁ ≤ t₂, and any assignment α : ℝ × ℝ → Fin 3, the empty set ∅ is parallel two-cut consistent with respect to φ, t₁, t₂, and α.
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
To show that the empty set is consistent with any two parallel cuts, we must verify two conditions from the definition: that the thresholds satisfy t₁ ≤ t₂, and that every point in the set satisfies the region conditions. The threshold inequality is provided directly by the assumption ht. The condition on points holds vacuously because the empty set contains no elements.
The empty set ∅ satisfies the parallel two-cut consistency condition `is_parallel_two_cut_consistent ∅ φ t₁ t₂ α`.
By definition, consistency requires two things: that the threshold inequality t₁ ≤ t₂ holds, and that every point in the set satisfies the region conditions for the assignment α. The first conjunct is supplied directly by the hypothesis ht. The second conjunct holds vacuously: given any point p with the assumption hp : p ∈ ∅, simplifying hp yields a contradiction (False) because the empty set contains no elements.
refine ⟨ht, fun p hp => by simp at hp⟩
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.
/-- The empty set of points is consistent with any two parallel cuts with thresholds t₁ ≤ t₂. -/theorem is_parallel_two_cut_consistent_empty (φ : (ℝ × ℝ) →ₗ[ℝ] ℝ) {t₁ t₂ : ℝ} (ht : t₁ ≤ t₂) (α : (ℝ × ℝ) → Fin 3) : is_parallel_two_cut_consistent ∅ φ t₁ t₂ α := by refine ⟨ht, fun p hp => by simp at hp⟩