Finite Sorted Real Cut List Endpoint Entries
ProvedFiniteSortedRealCutListEndpointEntriescrossing-consequencestrellis-port
[Endpoint entries of a sorted cut list] Let be a strictly increasing finite list of real numbers. Suppose , , and every entry of lies in the interval . Then has length at least . Moreover its first entry is , and its last entry is .
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 FiniteSortedRealCutListEndpointEntries.
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 open Classical noncomputable section
Formal statement
lemma FiniteSortedRealCutListEndpointEntries
(L : List ℝ)
(hSorted : L.SortedLT)
(hzero : (0 : ℝ) ∈ L) (hone : (1 : ℝ) ∈ L)
(hbounds : ∀ t : ℝ, t ∈ L → 0 ≤ t ∧ t ≤ 1) :
2 ≤ L.length ∧
(∀ h : 0 < L.length, L[0]'h = 0) ∧
(∀ h : L.length - 1 < L.length, L[L.length - 1]'h = 1) := by sorrySource