Planar Rot90 Clockwise Wedge Angle Criterion
ProvedPlanarRot90ClockwiseWedgeAngleCriterioncrossing-consequencestrellis-port
Let , let with and , and let . Put
Suppose
For , write
Then the displayed wedge sign condition
is equivalent to .
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 PlanarRot90ClockwiseWedgeAngleCriterion.
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 Definitions.Def_PlanarRot90 open Classical noncomputable section
Formal statement
lemma PlanarRot90ClockwiseWedgeAngleCriterion
(β ν α rb rn ra c s x y : ℝ)
(hβ0 : 0 ≤ β) (hβ2 : β < 2 * Real.pi)
(hν0 : 0 ≤ ν) (hν2 : ν < 2 * Real.pi)
(hα0 : 0 ≤ α) (hα2 : α < 2 * Real.pi)
(hrb : 0 < rb) (hrn : 0 < rn) (hra : 0 < ra)
(hαν : α ≠ β) (hνβ : ν ≠ β)
(hpoint :
let e : ℝ → EuclideanSpace ℝ (Fin 2) :=
fun t => WithLp.toLp 2
(fun k : Fin 2 => if k = 0 then Real.cos t else Real.sin t)
let base : EuclideanSpace ℝ (Fin 2) := rb • e β
ra • e α = x • base + y • PlanarRot90 base)
(hother :
let e : ℝ → EuclideanSpace ℝ (Fin 2) :=
fun t => WithLp.toLp 2
(fun k : Fin 2 => if k = 0 then Real.cos t else Real.sin t)
let base : EuclideanSpace ℝ (Fin 2) := rb • e β
rn • e ν = c • base - s • PlanarRot90 base) :
let τ : ℝ → ℝ :=
fun t => if t = β then 2 * Real.pi
else if t < β then β - t
else β - t + 2 * Real.pi
(if 0 < s then
y < 0 ∧ 0 < c * y + s * x
else if s < 0 then
y < 0 ∨ 0 < c * y + s * x
else
y < 0) ↔ τ α < τ ν := by sorrySource