Ordinary Drawing Image Finite Polygonal Set
ProvedOrdinaryDrawingImageFinitePolygonalSetcrossing-consequencestrellis-port
For every ordinary polygonal drawing of a finite graph , the drawing
image admits a finite polygonal-set presentation in the sense of
FinitePolygonalSet.
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 OrdinaryDrawingImageFinitePolygonalSet.
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 Definitions.Def_FinitePolygonalSet import Definitions.Def_OrdinaryPolygonalDrawing import Definitions.Def_PlaneFaceData open Classical noncomputable section
Formal statement
lemma OrdinaryDrawingImageFinitePolygonalSet {V : Type*} [Fintype V]
(G : SimpleGraph V) [Fintype G.edgeSet] (D : OrdinaryPolygonalDrawing G) :
∃ K : FinitePolygonalSet, K.carrier = OrdinaryDrawingImage G D := by sorrySource