Plane Drawing Dart Geometric Clockwise Sectors
OpenPlaneDrawingDartGeometricClockwiseSectorscrossing-consequencestrellis-port
Let be a finite simple graph, let be a crossing-free ordinary polygonal drawing of , and let be dart-arc data for . Then there exists a dart vertex-sector geometry package for with the following explicit local sector model. For each dart , let , put
and write . If is the only outgoing dart at , then is the slit disk
Otherwise there are real numbers , with or , such that
and, for ,
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 PlaneDrawingDartGeometricClockwiseSectors.
Preamble
import Mathlib.Tactic 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.Combinatorics.SimpleGraph.DegreeSum import Mathlib.Algebra.Group.Fin.Basic import Mathlib.Analysis.SpecialFunctions.Complex.Arg import Mathlib.Topology.Order.Compact import Mathlib.Analysis.Normed.Module.Convex import Definitions.Def_OrdinaryPolygonalDrawing import Definitions.Def_PlanarRot90 import Definitions.Def_PlaneDrawingDartArcData import Definitions.Def_PlaneDrawingDartVertexSectorGeometry open Classical noncomputable section
Formal statement
lemma PlaneDrawingDartGeometricClockwiseSectors {V : Type*} [Fintype V]
(G : SimpleGraph V) [Fintype G.edgeSet] [DecidableRel G.Adj]
(D : OrdinaryPolygonalDrawing G) (hD : D.crossingSet.card = 0)
(A : PlaneDrawingDartArcData G D) :
∃ C : PlaneDrawingDartVertexSectorGeometry G D A,
∀ d : G.Dart,
let rev : {e : G.Dart // e.toProd.1 = d.toProd.2} :=
⟨d.symm, by simp [SimpleGraph.Dart.symm]⟩
let nxt : {e : G.Dart // e.toProd.1 = d.toProd.2} :=
⟨C.star.successor d, C.star.successor_tail d⟩
((∀ e : {e : G.Dart // e.toProd.1 = d.toProd.2}, e = rev) ∧
C.successorSector d =
Metric.ball (D.vertexPlacement d.toProd.2)
(C.star.localDiskRadius d.toProd.2) \
({q | ∃ t : ℝ, 0 < t ∧
q = D.vertexPlacement d.toProd.2 +
t • C.star.germDirection d.toProd.2 rev} ∪
({D.vertexPlacement d.toProd.2} :
Set (EuclideanSpace ℝ (Fin 2)))))
∨
(∃ c s : ℝ,
(s ≠ 0 ∨ c < 0) ∧
C.star.germDirection d.toProd.2 nxt =
c • C.star.germDirection d.toProd.2 rev -
s • PlanarRot90 (C.star.germDirection d.toProd.2 rev) ∧
C.successorSector d =
(let base : EuclideanSpace ℝ (Fin 2) :=
C.star.germDirection d.toProd.2 rev
let baseChart : EuclideanSpace ℝ (Fin 2) →
EuclideanSpace ℝ (Fin 2) :=
fun z => D.vertexPlacement d.toProd.2 +
z 0 • base + z 1 • PlanarRot90 base
if 0 < s then
baseChart ''
{z : EuclideanSpace ℝ (Fin 2) |
z 0 ^ 2 + z 1 ^ 2 <
(C.star.localDiskRadius d.toProd.2 / ‖base‖) ^ 2 ∧
z 1 < 0 ∧ 0 < c * z 1 + s * z 0}
else if s < 0 then
baseChart ''
{z : EuclideanSpace ℝ (Fin 2) |
z 0 ^ 2 + z 1 ^ 2 <
(C.star.localDiskRadius d.toProd.2 / ‖base‖) ^ 2 ∧
(z 1 < 0 ∨ 0 < c * z 1 + s * z 0)}
else
baseChart ''
{z : EuclideanSpace ℝ (Fin 2) |
z 0 ^ 2 + z 1 ^ 2 <
(C.star.localDiskRadius d.toProd.2 / ‖base‖) ^ 2 ∧
z 1 < 0})) := by sorrySource