Unit Circle Retained Arc Endpoint Quotient
ProvedUnitCircleRetainedArcEndpointQuotientcrossing-consequencestrellis-port
Let be finite, and put
There are a finite index type , a finite set , an endpoint map , and, for every index , data
with the following properties. First,
every endpoint pair , , is non-diagonal, and every endpoint pair in has at most two preimages in . Second, for every , the center is retained, , , and . The map is continuous and injective, lies on , starts at , ends at , and
No vertex of lies in any . If have the same center and , then . If have the same center 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 UnitCircleRetainedArcEndpointQuotient.
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 open scoped BigOperators open scoped Real noncomputable section
Formal statement
lemma UnitCircleRetainedArcEndpointQuotient
(P : Finset (EuclideanSpace ℝ (Fin 2))) :
∃ (ι : Type) (instF : Fintype ι) (instD : DecidableEq ι)
(A : Finset ι) (endpoint : ι → Sym2 P)
(center arcStart arcEnd : ι → P)
(carrier arcInterior : ι → Set (EuclideanSpace ℝ (Fin 2)))
(γ : ι → Set.Icc (0 : ℝ) 1 → EuclideanSpace ℝ (Fin 2)),
(A.card : ℝ) =
∑ p ∈ P.filter
(fun p => 3 ≤ (P.filter (fun q => q ∈ UnitCircle p)).card),
((P.filter (fun q => q ∈ UnitCircle p)).card : ℝ) ∧
(∀ i ∈ A, ¬ (endpoint i).IsDiag) ∧
(∀ e ∈ A.image endpoint,
(A.filter (fun i => endpoint i = e)).card ≤ 2) ∧
(∀ i ∈ A,
3 ≤ (P.filter
(fun q => q ∈ UnitCircle (center i : EuclideanSpace ℝ (Fin 2)))).card) ∧
(∀ i ∈ A, endpoint i = Sym2.mk (arcStart i) (arcEnd i)) ∧
(∀ i ∈ A,
(arcStart i : EuclideanSpace ℝ (Fin 2)) ≠
(arcEnd i : EuclideanSpace ℝ (Fin 2))) ∧
(∀ i ∈ A,
(arcStart i : EuclideanSpace ℝ (Fin 2)) ∈
UnitCircle (center i : EuclideanSpace ℝ (Fin 2)) ∧
(arcEnd i : EuclideanSpace ℝ (Fin 2)) ∈
UnitCircle (center i : EuclideanSpace ℝ (Fin 2))) ∧
(∀ i ∈ A,
Continuous (γ i) ∧
Function.Injective (γ i) ∧
(∀ t, γ i t ∈
UnitCircle (center i : EuclideanSpace ℝ (Fin 2))) ∧
γ i ⟨0, by simp⟩ =
(arcStart i : EuclideanSpace ℝ (Fin 2)) ∧
γ i ⟨1, by simp⟩ =
(arcEnd i : EuclideanSpace ℝ (Fin 2)) ∧
carrier i = Set.range (γ i) ∧
arcInterior i =
Set.range
(fun t : {t : ℝ // 0 < t ∧ t < 1} =>
γ i
⟨t.1, ⟨le_of_lt t.2.1,
le_of_lt t.2.2⟩⟩)) ∧
(∀ i ∈ A, carrier i ⊆
UnitCircle (center i : EuclideanSpace ℝ (Fin 2))) ∧
(∀ i ∈ A, ∀ v : P,
(v : EuclideanSpace ℝ (Fin 2)) ∉ arcInterior i) ∧
(∀ i ∈ A, ∀ j ∈ A,
center i = center j → i ≠ j →
arcInterior i ∩ arcInterior j = ∅) ∧
(∀ i ∈ A, ∀ j ∈ A,
center i = center j → endpoint i = endpoint j →
i = j) := by sorrySource