Finite Polygonal Set Complement Components
OpenFinitePolygonalSetComplementComponentscrossing-consequencestrellis-port
Let be a finite polygonal set in the plane. The connected components of are indexed by a finite type of faces. More precisely, there are a finite type and sets , , such that each listed set is a complement component of , every complement component is listed exactly once, and every point of lies in exactly one listed set.
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 FinitePolygonalSetComplementComponents.
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.Normed.Affine.AddTorsorBases import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas import Mathlib.Topology.Baire.Lemmas import Mathlib.Data.Finset.Sort 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_FinitePolygonalSet import Definitions.Def_PlaneFaceData open Classical noncomputable section
Formal statement
lemma FinitePolygonalSetComplementComponents (K : FinitePolygonalSet) :
∃ Face : Type, ∃ _ : Fintype Face,
∃ faceSet : Face → Set (EuclideanSpace ℝ (Fin 2)),
(∀ F : Face, ComplementComponent K.carrier (faceSet F)) ∧
(∀ C : Set (EuclideanSpace ℝ (Fin 2)),
ComplementComponent K.carrier C → ∃! F : Face, faceSet F = C) ∧
(∀ p : EuclideanSpace ℝ (Fin 2),
p ∈ K.carrierᶜ → ∃! F : Face, p ∈ faceSet F) := by sorrySource