Unit Circle Retained Arc Drawing Assembly
ProvedUnitCircleRetainedArcDrawingAssemblyLet be finite. Let be a finite set of arc indices, let be an endpoint map, and suppose that each index is equipped with a center , endpoint vertices , a carrier , a relative interior , and a parametrization . Assume that
that and lie on , and that is a continuous injective parametrization lying on , starting at , ending at , with
Assume also that no vertex of lies in any , and that whenever two distinct indices of have the same center their relative interiors are disjoint.
Then, for every finite simple graph on vertex set whose edge set is
exactly , there is a finite geometric-arc drawing of
in the sense of GeometricArcDrawing such that
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 UnitCircleRetainedArcDrawingAssembly.
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_GeometricArcDrawing import Definitions.Def_UnitCircle open Classical open scoped BigOperators open scoped Real noncomputable section
lemma UnitCircleRetainedArcDrawingAssembly
(P : Finset (EuclideanSpace ℝ (Fin 2)))
{ι : Type} (A : Finset ι) (endpoint : ι → Sym2 P)
(center arcStart arcEnd : ι → P)
(carrier arcInterior : ι → Set (EuclideanSpace ℝ (Fin 2)))
(γ : ι → Set.Icc (0 : ℝ) 1 → EuclideanSpace ℝ (Fin 2))
(h_endpoint_eq : ∀ i ∈ A, endpoint i = Sym2.mk (arcStart i) (arcEnd i))
(h_endpoints_distinct : ∀ i ∈ A,
(arcStart i : EuclideanSpace ℝ (Fin 2)) ≠
(arcEnd i : EuclideanSpace ℝ (Fin 2)))
(h_endpoints_on_circle : ∀ i ∈ A,
(arcStart i : EuclideanSpace ℝ (Fin 2)) ∈
UnitCircle (center i : EuclideanSpace ℝ (Fin 2)) ∧
(arcEnd i : EuclideanSpace ℝ (Fin 2)) ∈
UnitCircle (center i : EuclideanSpace ℝ (Fin 2)))
(h_arc_param : ∀ 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⟩⟩))
(h_carrier_circle : ∀ i ∈ A, carrier i ⊆
UnitCircle (center i : EuclideanSpace ℝ (Fin 2)))
(h_no_vertex_in_interior : ∀ i ∈ A, ∀ v : P,
(v : EuclideanSpace ℝ (Fin 2)) ∉ arcInterior i)
(h_same_center_disjoint : ∀ i ∈ A, ∀ j ∈ A,
center i = center j → i ≠ j →
arcInterior i ∩ arcInterior j = ∅) :
∀ (G : SimpleGraph P) [Fintype G.edgeSet],
G.edgeFinset = A.image endpoint →
∃ D : GeometricArcDrawing G,
(D.localPairCount : ℝ) ≤ 2 * (P.card : ℝ) ^ 2 := by sorry