Ordinary Drawing Image Without Edge
DefinitionOrdinaryDrawingImageWithoutEdgecrossing-consequencestrellis-port
For an ordinary polygonal drawing of a graph and an edge , is the union of all vertex placements of and the carriers of all drawn edge arcs except the carrier of .
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 OrdinaryDrawingImageWithoutEdge.
Definition code
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_OrdinaryPolygonalDrawing
open Classical
noncomputable section
-- [TABLET NODE: OrdinaryDrawingImageWithoutEdge]
def OrdinaryDrawingImageWithoutEdge {V : Type*} [Fintype V]
(G : SimpleGraph V) [Fintype G.edgeSet]
(D : OrdinaryPolygonalDrawing G) (e : G.edgeFinset) :
Set (EuclideanSpace ℝ (Fin 2)) :=
-- BODY
Set.range D.vertexPlacement ∪
⋃ f : {f : G.edgeFinset // f ≠ e}, (D.edgeArc f.1).carrier
Source