Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finite polygonal set with all arc vertices listed

Proved
PolygonalArcFinitePolygonalSetWithVertices

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

geometrypolygonal

For every polygonal arc Γ in the plane, there is a finite polygonal set K whose carrier is exactly the carrier of Γ and whose marked point set contains every vertex of Γ. Thus the arc can be represented by finite polygonal data while retaining all of its vertices as listed points.

Preamble
import Definitions.Def_FinitePolygonalSet
import Definitions.Def_PolygonalArc

open Classical
noncomputable section
Formal statement
lemma PolygonalArcFinitePolygonalSetWithVertices (Γ : PolygonalArc) :
    ∃ K : FinitePolygonalSet,
      K.carrier = Γ.carrier ∧
        ∀ v : EuclideanSpace ℝ (Fin 2), v ∈ Γ.vertices → v ∈ K.points := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/PolygonalArcFinitePolygonalSetWithVertices.lean#L1-L12

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