Polygonal Arc Interior Two Ray Sector Chart Transport
ProvedPolygonalArcInteriorTwoRaySectorChartTransport[Transported interior two-ray sector] Let , let , and let be nonzero directions such that is not a positive scalar multiple of . Then one can choose one of the two ordered frames or . Writing the second direction in the chosen frame as
we have either , or and . Put
Let , let be the positive -axis germ inside , let be the positive germ in direction inside , and define the coordinate sectors
Then , , and and are exactly the two corresponding positive radial germs in . Moreover and are open connected disjoint subsets of the actual disk, both are disjoint from the two transported germs and from , and
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 PolygonalArcInteriorTwoRaySectorChartTransport.
import Mathlib.Analysis.Convex.PathConnected 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_PlanarRot90 open Set open Classical noncomputable section
lemma PolygonalArcInteriorTwoRaySectorChartTransport
(p u v : EuclideanSpace ℝ (Fin 2)) (rho : ℝ)
(hrho : 0 < rho) (hu : u ≠ 0) (hv : v ≠ 0)
(hnot_same : ¬ ∃ t : ℝ, 0 < t ∧ v = t • u) :
∃ (base other : EuclideanSpace ℝ (Fin 2)) (c s : ℝ),
((base = u ∧ other = v) ∨ (base = v ∧ other = u)) ∧
other = c • base + s • PlanarRot90 base ∧
(0 < s ∨ s = 0 ∧ c < 0) ∧
let a : ℝ := rho / ‖base‖
let chart : EuclideanSpace ℝ (Fin 2) → EuclideanSpace ℝ (Fin 2) :=
fun z => p + z 0 • base + z 1 • PlanarRot90 base
let C : Set (EuclideanSpace ℝ (Fin 2)) :=
Metric.ball (0 : EuclideanSpace ℝ (Fin 2)) a
let Gbase : Set (EuclideanSpace ℝ (Fin 2)) :=
{z | z ∈ C ∧ z 1 = 0 ∧ 0 < z 0}
let Gother : Set (EuclideanSpace ℝ (Fin 2)) :=
{z | z ∈ C ∧ ∃ t : ℝ, 0 < t ∧ z 0 = t * c ∧ z 1 = t * s}
let L : Set (EuclideanSpace ℝ (Fin 2)) :=
{z | z ∈ C ∧ 0 < z 1 ∧ c * z 1 - s * z 0 < 0}
let R : Set (EuclideanSpace ℝ (Fin 2)) :=
{z | z ∈ C ∧ (z 1 < 0 ∨ 0 < c * z 1 - s * z 0)}
0 < a ∧
IsOpen (chart '' C) ∧ IsOpen (chart '' L) ∧ IsOpen (chart '' R) ∧
IsConnected (chart '' L) ∧ IsConnected (chart '' R) ∧
Disjoint (chart '' L) (chart '' R) ∧
chart '' C = Metric.ball p rho ∧
chart '' Gbase =
{q | q ∈ Metric.ball p rho ∧ ∃ t : ℝ, 0 < t ∧ q = p + t • base} ∧
chart '' Gother =
{q | q ∈ Metric.ball p rho ∧ ∃ t : ℝ, 0 < t ∧ q = p + t • other} ∧
Disjoint (chart '' L)
((chart '' Gbase) ∪ (chart '' Gother) ∪
({p} : Set (EuclideanSpace ℝ (Fin 2)))) ∧
Disjoint (chart '' R)
((chart '' Gbase) ∪ (chart '' Gother) ∪
({p} : Set (EuclideanSpace ℝ (Fin 2)))) ∧
Metric.ball p rho \
((chart '' Gbase) ∪ (chart '' Gother) ∪
({p} : Set (EuclideanSpace ℝ (Fin 2)))) =
chart '' L ∪ chart '' R := by sorry