Finite Elementary Segment Cut Parameter List
ProvedFiniteElementarySegmentCutParameterListcrossing-consequencestrellis-port
[Finite cut parameters on one elementary segment] Let be two points in the Euclidean plane, and let be a finite set of points. There is a finite list of real parameters such that:
and if are consecutive entries of , then
and no parameter with satisfies
Formalization Note This node is ported from the Trellis formalization of the crossing lemma and its consequences (wpegden/crossing-consequences, commit 8769d142, W. Pegden, Apache-2.0); the statement is the Trellis node FiniteElementarySegmentCutParameterList.
Preamble
import Mathlib.Analysis.InnerProductSpace.PiL2 import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Combinatorics.SimpleGraph.Finite import Mathlib.Data.Finset.Prod import Mathlib.Data.Set.Finite.Basic import Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Basic import Mathlib.Data.Finset.Sort open Classical noncomputable section
Formal statement
lemma FiniteElementarySegmentCutParameterList
(A B : EuclideanSpace ℝ (Fin 2)) (hAB : A ≠ B)
(T : Finset (EuclideanSpace ℝ (Fin 2))) :
∃ L : List ℝ,
L.Nodup ∧
L.SortedLT ∧
(∀ t : ℝ, t ∈ L ↔
t = 0 ∨ t = 1 ∨
(0 ≤ t ∧ t ≤ 1 ∧ AffineMap.lineMap A B t ∈ T)) ∧
(0 : ℝ) ∈ L ∧
(1 : ℝ) ∈ L ∧
(∀ t : ℝ, t ∈ L → 0 ≤ t ∧ t ≤ 1) ∧
(∀ n (hn : n + 1 < L.length), L[n] < L[n + 1]) ∧
(∀ n (hn : n + 1 < L.length) t,
0 ≤ t → t ≤ 1 →
AffineMap.lineMap A B t ∈ T →
¬ (L[n] < t ∧ t < L[n + 1])) := by sorrySource