Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite Straight Line Complex One Edge Complement Components

Open
FiniteStraightLineComplexOneEdgeComplementComponents

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

crossing-consequencestrellis-port

Let A⊆R2A\subseteq\mathbb R^2A⊆R2 be the carrier of a finite normalized straight-line complex

A=V∪⋃e∈Ee,A=V\cup\bigcup_{e\in E} e,A=V∪e∈E⋃​e,

where VVV is a finite vertex set, EEE is a finite set of nondegenerate closed straight edges, the endpoints of every edge lie in VVV, no vertex lies in the relative interior of an edge, and distinct edge relative interiors are disjoint. Let σ=[a,b]\sigma=[a,b]σ=[a,b] be a nondegenerate closed straight segment with a,b∈Va,b\in Va,b∈V, and suppose that its relative interior σ∘\sigma^\circσ∘ is disjoint from AAA. If the complement of AAA has only finitely many complement components, then the complement of A∪σA\cup\sigmaA∪σ has only finitely many complement components.

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

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.Tactic
import Mathlib.Topology.Order.Compact
import Mathlib.Analysis.Normed.Affine.AddTorsor
import Mathlib.Algebra.Group.Fin.Basic
import Mathlib.Analysis.SpecialFunctions.Complex.Arg
import Mathlib.Analysis.Convex.Between
import Mathlib.Topology.MetricSpace.Thickening
import Mathlib.Topology.Order.IntermediateValue
import Definitions.Def_PlaneFaceData

open Classical
noncomputable section
Formal statement
lemma FiniteStraightLineComplexOneEdgeComplementComponents
    (A : Set (EuclideanSpace ℝ (Fin 2)))
    (V : Finset (EuclideanSpace ℝ (Fin 2)))
    (E : Finset (EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2)))
    (a b : EuclideanSpace ℝ (Fin 2))
    (hA :
      A =
        (V : Set (EuclideanSpace ℝ (Fin 2))) ∪
          ⋃ e : {e // e ∈ E}, segment ℝ e.1.1 e.1.2)
    (hEdgeSource :
      ∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
        e ∈ E → e.1 ∈ V)
    (hEdgeTarget :
      ∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
        e ∈ E → e.2 ∈ V)
    (hEdgeNondegenerate :
      ∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
        e ∈ E → e.1 ≠ e.2)
    (hNoVertexInEdgeInterior :
      ∀ e : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
        e ∈ E →
          ∀ v : EuclideanSpace ℝ (Fin 2),
            v ∈ V → v ∉ openSegment ℝ e.1 e.2)
    (hEdgeOpenInteriorsDisjoint :
      ∀ e f : EuclideanSpace ℝ (Fin 2) × EuclideanSpace ℝ (Fin 2),
        e ∈ E → f ∈ E → e ≠ f →
          Disjoint (openSegment ℝ e.1 e.2) (openSegment ℝ f.1 f.2))
    (haV : a ∈ V)
    (hbV : b ∈ V)
    (hab : a ≠ b)
    (hNewInteriorDisjoint : Disjoint (openSegment ℝ a b) A)
    (hFiniteA :
      ∃ comps : Finset (Set (EuclideanSpace ℝ (Fin 2))),
        (∀ C ∈ comps, ComplementComponent A C) ∧
          ∀ C : Set (EuclideanSpace ℝ (Fin 2)),
            ComplementComponent A C → C ∈ comps) :
    ∃ comps : Finset (Set (EuclideanSpace ℝ (Fin 2))),
      (∀ C ∈ comps, ComplementComponent (A ∪ segment ℝ a b) C) ∧
        ∀ C : Set (EuclideanSpace ℝ (Fin 2)),
          ComplementComponent (A ∪ segment ℝ a b) C → C ∈ comps := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/FiniteStraightLineComplexOneEdgeComplementComponents.lean#L1-L334

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