Unit Circle Cyclic Successor Arcs
ProvedUnitCircleCyclicSuccessorArcscrossing-consequencestrellis-port
Let , and let be a finite set of points with
There are a successor map , carrier sets , relative-interior sets , and parametrizations , indexed by , such that:
for every , the map is continuous and injective, all points of lie in ,
no point of lies in any ; distinct indices have disjoint interiors,
and the unordered endpoint pair determines the index,
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 UnitCircleCyclicSuccessorArcs.
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.Algebra.Group.Fin.Basic import Mathlib.Data.Finset.Sort import Mathlib.Analysis.SpecialFunctions.Complex.Arg import Definitions.Def_UnitCircle open Classical noncomputable section
Formal statement
lemma UnitCircleCyclicSuccessorArcs
(p : EuclideanSpace ℝ (Fin 2))
(S : Finset (EuclideanSpace ℝ (Fin 2)))
(hS : (↑S : Set (EuclideanSpace ℝ (Fin 2))) ⊆ UnitCircle p)
(hcard : 3 ≤ S.card) :
∃ (succ :
{x : EuclideanSpace ℝ (Fin 2) // x ∈ S} →
{x : EuclideanSpace ℝ (Fin 2) // x ∈ S})
(carrier arcInterior :
{x : EuclideanSpace ℝ (Fin 2) // x ∈ S} →
Set (EuclideanSpace ℝ (Fin 2)))
(γ :
(x : {x : EuclideanSpace ℝ (Fin 2) // x ∈ S}) →
Set.Icc (0 : ℝ) 1 → EuclideanSpace ℝ (Fin 2)),
Function.Bijective succ ∧
(∀ x, x.1 ≠ (succ x).1) ∧
(∀ x,
Continuous (γ x) ∧
Function.Injective (γ x) ∧
(∀ t, γ x t ∈ UnitCircle p) ∧
γ x ⟨0, by simp⟩ = x.1 ∧
γ x ⟨1, by simp⟩ = (succ x).1 ∧
carrier x = Set.range (γ x) ∧
arcInterior x =
Set.range
(fun t : {t : ℝ // 0 < t ∧ t < 1} =>
γ x ⟨t.1, ⟨le_of_lt t.2.1, le_of_lt t.2.2⟩⟩)) ∧
(∀ x y : {y : EuclideanSpace ℝ (Fin 2) // y ∈ S},
y.1 ∉ arcInterior x) ∧
(∀ x y,
x ≠ y → arcInterior x ∩ arcInterior y = ∅) ∧
(∀ x y,
(Sym2.mk x.1 (succ x).1 :
Sym2 (EuclideanSpace ℝ (Fin 2))) =
Sym2.mk y.1 (succ y).1 →
x = y) := by sorrySource