Unit Circle Retained Arc Quotient Drawing
ProvedUnitCircleRetainedArcQuotientDrawingcrossing-consequencestrellis-port
Let be finite, and let
There are a finite type , a finite set , and an endpoint map such that
for every the unordered endpoint pair is not
diagonal, and every endpoint pair in the image has at most two
preimages in . Moreover, 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, with
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 UnitCircleRetainedArcQuotientDrawing.
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_GeometricArcDrawing import Definitions.Def_UnitCircle open Classical open scoped BigOperators open scoped Real noncomputable section
Formal statement
lemma UnitCircleRetainedArcQuotientDrawing
(P : Finset (EuclideanSpace ℝ (Fin 2))) :
∃ (ι : Type) (instF : Fintype ι) (instD : DecidableEq ι)
(A : Finset ι) (endpoint : ι → Sym2 P),
(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) ∧
(∀ (G : SimpleGraph P) [Fintype G.edgeSet],
G.edgeFinset = A.image endpoint →
∃ D : GeometricArcDrawing G,
(D.localPairCount : ℝ) ≤ 2 * (P.card : ℝ) ^ 2) := by sorrySource