Finite Planar Clockwise Successor Sectors
OpenFinitePlanarClockwiseSuccessorSectorsLet be a nonempty finite set, let , let , and assign to every a nonzero direction . Assume distinct indices determine distinct positive rays: if for some , then . Then there are a permutation of , a full clockwise turn , positive clockwise turns , and sets with the following properties.
The full turn occurs exactly on the same germ,
has minimal positive clockwise turn from , and
If is the only germ, then
Otherwise there are real numbers , with or , such that
Writing
the sector is
Each is open and connected, is contained in , and is disjoint from every positive ray . Finally, every point of which lies on none of the positive rays belongs to at least one of the sectors .
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 FinitePlanarClockwiseSuccessorSectors.
import Mathlib.Tactic import Mathlib.Algebra.Group.Fin.Basic 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.Analysis.SpecialFunctions.Complex.Arg import Definitions.Def_PlanarRot90 open Classical noncomputable section
lemma FinitePlanarClockwiseSuccessorSectors {ι : Type*} [Fintype ι] [Nonempty ι]
[DecidableEq ι]
(p : EuclideanSpace ℝ (Fin 2)) (ρ : ℝ)
(u : ι → EuclideanSpace ℝ (Fin 2))
(hρ : 0 < ρ)
(hu : ∀ i : ι, u i ≠ 0)
(hposRayDistinct :
∀ {i j : ι}, (∃ t : ℝ, 0 < t ∧ u j = t • u i) → i = j) :
∃ clockwiseNext : Equiv.Perm ι,
∃ fullClockwiseTurn : ℝ,
∃ clockwiseTurn : ι → ι → ℝ,
∃ sector : ι → Set (EuclideanSpace ℝ (Fin 2)),
fullClockwiseTurn = 2 * Real.pi ∧
0 < fullClockwiseTurn ∧
(∀ i j : ι, 0 < clockwiseTurn i j) ∧
(∀ i j : ι, clockwiseTurn i j ≤ fullClockwiseTurn) ∧
(∀ i j : ι, clockwiseTurn i j = fullClockwiseTurn ↔ j = i) ∧
(∀ i j : ι, j ≠ i →
clockwiseTurn i (clockwiseNext i) ≤ clockwiseTurn i j) ∧
(∀ i : ι, clockwiseNext i = i ↔ ∀ j : ι, j = i) ∧
(∀ i : ι,
if h : clockwiseNext i = i then
sector i =
Metric.ball p ρ \
({q | ∃ t : ℝ, 0 < t ∧ q = p + t • u i} ∪
({p} : Set (EuclideanSpace ℝ (Fin 2))))
else
∃ c s : ℝ,
(s ≠ 0 ∨ c < 0) ∧
u (clockwiseNext i) = c • u i - s • PlanarRot90 (u i) ∧
sector i =
(let base : EuclideanSpace ℝ (Fin 2) := u i
let baseChart : EuclideanSpace ℝ (Fin 2) →
EuclideanSpace ℝ (Fin 2) :=
fun z => p + z 0 • base + z 1 • PlanarRot90 base
if 0 < s then
baseChart ''
{z : EuclideanSpace ℝ (Fin 2) |
z 0 ^ 2 + z 1 ^ 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 < (ρ / ‖base‖) ^ 2 ∧
(z 1 < 0 ∨ 0 < c * z 1 + s * z 0)}
else
baseChart ''
{z : EuclideanSpace ℝ (Fin 2) |
z 0 ^ 2 + z 1 ^ 2 < (ρ / ‖base‖) ^ 2 ∧
z 1 < 0})) ∧
(∀ i : ι, IsOpen (sector i) ∧ IsConnected (sector i)) ∧
(∀ i : ι, sector i ⊆ Metric.ball p ρ) ∧
(∀ i j : ι,
Disjoint (sector i)
{q | ∃ t : ℝ, 0 < t ∧ q = p + t • u j}) ∧
(∀ q : EuclideanSpace ℝ (Fin 2),
q ∈ Metric.ball p ρ →
q ≠ p →
(∀ i : ι,
q ∉ {x | ∃ t : ℝ, 0 < t ∧ x = p + t • u i}) →
∃ i : ι, q ∈ sector i) := by sorry