Polygonal Arc Interior Vertex Mem Relative Interior
ProvedPolygonalArcInteriorVertexMemRelativeInteriorcrossing-consequencestrellis-port
Let be a polygonal arc with listed vertices . If is a listed vertex index with and , then
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 PolygonalArcInteriorVertexMemRelativeInterior.
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 Definitions.Def_PolygonalArc open Classical noncomputable section
Formal statement
lemma PolygonalArcInteriorVertexMemRelativeInterior (γ : PolygonalArc)
(i : Fin γ.vertices.length) (hpos : 0 < i.1)
(hnext : i.1 + 1 < γ.vertices.length) :
γ.vertices[i.1] ∈ γ.relativeInterior := by sorrySource