Finite Sorted Real Cut List Covers Unit Interval
ProvedFiniteSortedRealCutListCoversUnitIntervalcrossing-consequencestrellis-port
Let be a strictly increasing finite list of real numbers. Suppose , , and every entry of lies in the interval . Then every lies in one of the closed consecutive gaps .
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 FiniteSortedRealCutListCoversUnitInterval.
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.Tactic open Classical noncomputable section
Formal statement
lemma FiniteSortedRealCutListCoversUnitInterval
(L : List ℝ)
(hSorted : L.SortedLT)
(hzero : (0 : ℝ) ∈ L) (hone : (1 : ℝ) ∈ L)
(hbounds : ∀ t : ℝ, t ∈ L → 0 ≤ t ∧ t ≤ 1)
(t : ℝ) (ht : t ∈ Set.Icc (0 : ℝ) 1) :
∃ k, ∃ hk : k + 1 < L.length,
t ∈ segment ℝ (L[k]'(Nat.lt_of_succ_lt hk)) (L[k + 1]'hk) := by sorrySource