Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One Edge Endpoint Radius Refinement

Proved
OneEdgeEndpointRadiusRefinement

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

crossing-consequencestrellis-port

Let a≠ba\ne ba=b be the endpoints of a new edge in a finite straight-line complex. Suppose positive radii ρa,ρb\rho_a,\rho_bρa​,ρb​ have already been chosen so that B(a,ρa)B(a,\rho_a)B(a,ρa​) misses every old vertex other than aaa and every old edge not incident with aaa, and similarly B(b,ρb)B(b,\rho_b)B(b,ρb​) misses every old vertex other than bbb and every old edge not incident with bbb. Then there are smaller positive radii ra,rbr_a,r_bra​,rb​ such that

ra≤ρa,rb≤ρb,ra<∣a−b∣3,rb<∣a−b∣3,ra+rb<∣a−b∣,r_a\le \rho_a,\qquad r_b\le \rho_b,\qquad r_a<\frac{|a-b|}{3},\qquad r_b<\frac{|a-b|}{3},\qquad r_a+r_b<|a-b|,ra​≤ρa​,rb​≤ρb​,ra​<3∣a−b∣​,rb​<3∣a−b∣​,ra​+rb​<∣a−b∣,

and the same vertex-avoidance and nonincident-edge-avoidance conclusions hold with ra,rbr_a,r_bra​,rb​ in place of ρa,ρb\rho_a,\rho_bρa​,ρb​.

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 OneEdgeEndpointRadiusRefinement.

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

open Classical
noncomputable section
Formal statement
lemma OneEdgeEndpointRadiusRefinement
    (V : Finset (EuclideanSpace ℝ (Fin 2)))
    (E : Finset (EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2)))
    (a b : EuclideanSpace ℝ (Fin 2))
    (ρa ρb : ℝ)
    (hab : a ≠ b)
    (hρa_pos : 0 < ρa) (hρb_pos : 0 < ρb)
    (hρa_vertices :
      ∀ v : EuclideanSpace ℝ (Fin 2),
        v ∈ V → v ≠ a → v ∉ Metric.ball a ρa)
    (hρa_edges :
      ∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
        e ∈ E → e.1 ≠ a → e.2 ≠ a →
          Disjoint (Metric.ball a ρa) (segment ℝ e.1 e.2))
    (hρb_vertices :
      ∀ v : EuclideanSpace ℝ (Fin 2),
        v ∈ V → v ≠ b → v ∉ Metric.ball b ρb)
    (hρb_edges :
      ∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
        e ∈ E → e.1 ≠ b → e.2 ≠ b →
          Disjoint (Metric.ball b ρb) (segment ℝ e.1 e.2)) :
    ∃ ra rb : ℝ,
      0 < ra ∧ 0 < rb ∧
        ra ≤ ρa ∧ rb ≤ ρb ∧
        ra < dist a b / 3 ∧ rb < dist a b / 3 ∧
        ra + rb < dist a b ∧
        (∀ v : EuclideanSpace ℝ (Fin 2),
          v ∈ V → v ≠ a → v ∉ Metric.ball a ra) ∧
        (∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
          e ∈ E → e.1 ≠ a → e.2 ≠ a →
            Disjoint (Metric.ball a ra) (segment ℝ e.1 e.2)) ∧
        (∀ v : EuclideanSpace ℝ (Fin 2),
          v ∈ V → v ≠ b → v ∉ Metric.ball b rb) ∧
        (∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
          e ∈ E → e.1 ≠ b → e.2 ≠ b →
            Disjoint (Metric.ball b rb) (segment ℝ e.1 e.2)) := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/OneEdgeEndpointRadiusRefinement.lean#L1-L84

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