Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polygonal Arc Interior Two Ray Sector Chart Transport

Proved
PolygonalArcInteriorTwoRaySectorChartTransport

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

crossing-consequencestrellis-port

[Transported interior two-ray sector] Let p∈R2p\in\mathbb R^2p∈R2, let ρ>0\rho>0ρ>0, and let u,v∈R2u,v\in\mathbb R^2u,v∈R2 be nonzero directions such that vvv is not a positive scalar multiple of uuu. Then one can choose one of the two ordered frames (u,v)(u,v)(u,v) or (v,u)(v,u)(v,u). Writing the second direction in the chosen frame as

other=c base+s rot⁡90(base),\mathrm{other}=c\,\mathrm{base}+s\,\operatorname{rot}_{90}(\mathrm{base}),other=cbase+srot90​(base),

we have either s>0s>0s>0, or s=0s=0s=0 and c<0c<0c<0. Put

a=ρ/∥base∥,Φ(x,y)=p+x base+y rot⁡90(base).a=\rho/\|\mathrm{base}\|,\qquad \Phi(x,y)=p+x\,\mathrm{base} +y\,\operatorname{rot}_{90}(\mathrm{base}).a=ρ/∥base∥,Φ(x,y)=p+xbase+yrot90​(base).

Let C=B(0,a)C=B(0,a)C=B(0,a), let GbaseG_{\mathrm{base}}Gbase​ be the positive xxx-axis germ inside CCC, let GotherG_{\mathrm{other}}Gother​ be the positive germ in direction (c,s)(c,s)(c,s) inside CCC, and define the coordinate sectors

L={(x,y)∈C:y>0, cy−sx<0},R={(x,y)∈C:y<0 or cy−sx>0}.L=\{(x,y)\in C:y>0,\ cy-sx<0\}, \qquad R=\{(x,y)\in C:y<0\text{ or }cy-sx>0\}.L={(x,y)∈C:y>0, cy−sx<0},R={(x,y)∈C:y<0 or cy−sx>0}.

Then a>0a>0a>0, Φ(C)=B(p,ρ)\Phi(C)=B(p,\rho)Φ(C)=B(p,ρ), and Φ(Gbase)\Phi(G_{\mathrm{base}})Φ(Gbase​) and Φ(Gother)\Phi(G_{\mathrm{other}})Φ(Gother​) are exactly the two corresponding positive radial germs in B(p,ρ)B(p,\rho)B(p,ρ). Moreover Φ(L)\Phi(L)Φ(L) and Φ(R)\Phi(R)Φ(R) are open connected disjoint subsets of the actual disk, both are disjoint from the two transported germs and from ppp, and

B(p,ρ)∖(Φ(Gbase)∪Φ(Gother)∪{p})=Φ(L)∪Φ(R).B(p,\rho)\setminus \bigl(\Phi(G_{\mathrm{base}})\cup\Phi(G_{\mathrm{other}})\cup\{p\}\bigr) = \Phi(L)\cup\Phi(R).B(p,ρ)∖(Φ(Gbase​)∪Φ(Gother​)∪{p})=Φ(L)∪Φ(R).

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.

Preamble
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
Formal statement
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
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/PolygonalArcInteriorTwoRaySectorChartTransport.lean#L1-L783

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me