Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polygonal Arc Interior Outgoing Frame Signed Half Tube Sector Routing

Proved
PolygonalArcInteriorOutgoingFrameSignedHalfTubeSectorRouting

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

crossing-consequencestrellis-port

Let γ\gammaγ be a polygonal arc with collar control radii, middle segments, forbidden margins, and compatible oriented tube data. Fix consecutive listed segments [pj,pj+1][p_j,p_{j+1}][pj​,pj+1​] and [pj+1,pj+2][p_{j+1},p_{j+2}][pj+1​,pj+2​]. Put

p=pj+1,v=pj+2−pj+1,p=p_{j+1},\qquad v=p_{j+2}-p_{j+1},p=pj+1​,v=pj+2​−pj+1​,

and suppose that the incoming outward direction is represented in the outgoing frame by

pj−pj+1=c v+s rot⁡90(v),s>0.p_j-p_{j+1}=c\,v+s\,\operatorname{rot}_{90}(v),\qquad s>0.pj​−pj+1​=cv+srot90​(v),s>0.

Let

Φ(z)=p+z0v+z1rot⁡90(v),C=B ⁣(0,rj+1∥v∥),\Phi(z)=p+z_0v+z_1\operatorname{rot}_{90}(v),\qquad C=B\!\left(0,\frac{r_{j+1}}{\|v\|}\right),Φ(z)=p+z0​v+z1​rot90​(v),C=B(0,∥v∥rj+1​​),

and assume that Φ(C)=B(p,rj+1)\Phi(C)=B(p,r_{j+1})Φ(C)=B(p,rj+1​), as supplied by the transported two-ray sector chart. Define

L={z∈C: 0<z1, cz1−sz0<0},R={z∈C: z1<0 or 0<cz1−sz0}.L=\{z\in C:\ 0<z_1,\ c z_1-sz_0<0\},\qquad R=\{z\in C:\ z_1<0\ {\rm or}\ 0<c z_1-sz_0\}.L={z∈C: 0<z1​, cz1​−sz0​<0},R={z∈C: z1​<0 or 0<cz1​−sz0​}.

Then, after intersecting with the bend ball B(p,rj+1)B(p,r_{j+1})B(p,rj+1​), the positive half-tubes on the incoming and outgoing incident segments lie in Φ(L)\Phi(L)Φ(L), and the negative half-tubes on the incoming and outgoing incident segments lie in Φ(R)\Phi(R)Φ(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 PolygonalArcInteriorOutgoingFrameSignedHalfTubeSectorRouting.

Preamble
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.Convex.PathConnected
import Definitions.Def_PlanarRot90
import Definitions.Def_PolygonalArc
import Definitions.Def_PolygonalArcCollarCompatibleOrientedTubeData
import Definitions.Def_PolygonalArcCollarControlRadii
import Definitions.Def_PolygonalArcCollarMiddleForbiddenMargins
import Definitions.Def_PolygonalArcCollarMiddleSegmentData

open Set
open Classical
noncomputable section
Formal statement
lemma PolygonalArcInteriorOutgoingFrameSignedHalfTubeSectorRouting
    (γ : PolygonalArc) {η : ℝ}
    (controlRadii : PolygonalArcCollarControlRadii γ η)
    (middleSegments : PolygonalArcCollarMiddleSegmentData γ controlRadii)
    (forbiddenMargins :
      PolygonalArcCollarMiddleForbiddenMargins γ controlRadii middleSegments)
    (compatibleTubes :
      PolygonalArcCollarCompatibleOrientedTubeData γ controlRadii middleSegments
        forbiddenMargins)
    (j : ℕ) (hj : j + 1 < γ.vertices.length)
    (hnext : (j + 1) + 1 < γ.vertices.length)
    (c s : ℝ)
    (hrep : γ.vertices[j] - γ.vertices[j + 1] =
      c • (γ.vertices[j + 2] - γ.vertices[j + 1]) +
        s • PlanarRot90 (γ.vertices[j + 2] - γ.vertices[j + 1]))
    (hpos : 0 < s)
    (hCeq :
      let p : EuclideanSpace ℝ (Fin 2) := γ.vertices[j + 1]
      let v : EuclideanSpace ℝ (Fin 2) := γ.vertices[j + 2] - γ.vertices[j + 1]
      let rho : ℝ := controlRadii.radius ⟨j + 1, hj⟩
      let chart : EuclideanSpace ℝ (Fin 2) → EuclideanSpace ℝ (Fin 2) :=
        fun z => p + z 0 • v + z 1 • PlanarRot90 v
      let C : Set (EuclideanSpace ℝ (Fin 2)) :=
        Metric.ball (0 : EuclideanSpace ℝ (Fin 2)) (rho / ‖v‖)
      chart '' C = Metric.ball p rho) :
    let sep :=
      compatibleTubes.orientedTubes.toPolygonalArcCollarSeparatedTubeData
    let p : EuclideanSpace ℝ (Fin 2) := γ.vertices[j + 1]
    let v : EuclideanSpace ℝ (Fin 2) := γ.vertices[j + 2] - γ.vertices[j + 1]
    let rho : ℝ := controlRadii.radius ⟨j + 1, hj⟩
    let chart : EuclideanSpace ℝ (Fin 2) → EuclideanSpace ℝ (Fin 2) :=
      fun z => p + z 0 • v + z 1 • PlanarRot90 v
    let C : Set (EuclideanSpace ℝ (Fin 2)) :=
      Metric.ball (0 : EuclideanSpace ℝ (Fin 2)) (rho / ‖v‖)
    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)}
    sep.leftHalf j hj ∩ Metric.ball p rho ⊆ chart '' L ∧
      sep.leftHalf (j + 1) hnext ∩ Metric.ball p rho ⊆ chart '' L ∧
      sep.rightHalf j hj ∩ Metric.ball p rho ⊆ chart '' R ∧
      sep.rightHalf (j + 1) hnext ∩ Metric.ball p rho ⊆ chart '' R := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/PolygonalArcInteriorOutgoingFrameSignedHalfTubeSectorRouting.lean#L1-L519

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