Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finite local cuts around path--set occurrences

Proved
PolygonalPathFiniteOccurrenceLocalCuts

by xuanji · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

crossing-consequencesgeometrypolygonal

Let FFF meet the carrier of a polygonal path in finitely many points, let UUU be open around every interior occurrence, and assume all path vertices avoid FFF. Then there are before/after cut maps for every occurrence such that each short segment meets FFF only at that occurrence, distinct occurrence segments are disjoint, and every point of a path segment lying in FFF lies on one of the short segments.

Preamble
import Definitions.Def_PolygonalPath

open Classical
noncomputable section

set_option maxHeartbeats 1200000
Formal statement
lemma PolygonalPathFiniteOccurrenceLocalCuts
    (α : PolygonalPath) (F U : Set (EuclideanSpace ℝ (Fin 2))) :
    Set.Finite (α.carrier ∩ F) →
      IsOpen U →
        (∀ (i : ℕ) (hi : i + 1 < α.vertices.length)
            (x : EuclideanSpace ℝ (Fin 2)),
            x ∈ openSegment ℝ α.vertices[i] α.vertices[i + 1] →
              x ∈ F → x ∈ U) →
          (∀ v : EuclideanSpace ℝ (Fin 2), v ∈ α.vertices → v ∉ F) →
            ∃ (cutBefore cutAfter :
                ∀ (i : ℕ), i + 1 < α.vertices.length →
                  EuclideanSpace ℝ (Fin 2) →
                    EuclideanSpace ℝ (Fin 2)),
              (∀ (i : ℕ) (hi : i + 1 < α.vertices.length)
                  (x : EuclideanSpace ℝ (Fin 2)),
                  x ∈ openSegment ℝ α.vertices[i] α.vertices[i + 1] →
                    x ∈ F →
                      cutBefore i hi x ∈ openSegment ℝ α.vertices[i] x ∧
                        cutAfter i hi x ∈ openSegment ℝ x α.vertices[i + 1] ∧
                          cutBefore i hi x ∈ U \ F ∧
                            cutAfter i hi x ∈ U \ F ∧
                              segment ℝ (cutBefore i hi x) (cutAfter i hi x) ∩ F =
                                {x}) ∧
                (∀ (i : ℕ) (hi : i + 1 < α.vertices.length)
                    (x y : EuclideanSpace ℝ (Fin 2)),
                    x ∈ openSegment ℝ α.vertices[i] α.vertices[i + 1] →
                      y ∈ openSegment ℝ α.vertices[i] α.vertices[i + 1] →
                        x ∈ F →
                          y ∈ F →
                            x ≠ y →
                              Disjoint
                                (segment ℝ (cutBefore i hi x) (cutAfter i hi x))
                                (segment ℝ (cutBefore i hi y) (cutAfter i hi y))) ∧
                (∀ (i : ℕ) (hi : i + 1 < α.vertices.length)
                    (y : EuclideanSpace ℝ (Fin 2)),
                    y ∈ segment ℝ α.vertices[i] α.vertices[i + 1] →
                      y ∈ F →
                        ∃ x : EuclideanSpace ℝ (Fin 2),
                          x ∈ openSegment ℝ α.vertices[i] α.vertices[i + 1] ∧
                            x ∈ F ∧
                              y ∈ segment ℝ (cutBefore i hi x)
                                (cutAfter i hi x)) := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/PolygonalPathFiniteOccurrenceLocalCuts.lean#L1-484

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me