Dart Successor From Local Clockwise Next
ProvedDartSuccessorFromLocalClockwiseNextcrossing-consequencestrellis-port
Let be a finite simple graph. Suppose that for every vertex we are given a permutation of the darts whose tail is , and suppose that fixes a dart exactly when that dart is the only dart with tail . Then there is a permutation of all darts such that, for every dart , the tail of is the head of , and
where is the reversed dart. Moreover, if the only dart with tail is , then .
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 DartSuccessorFromLocalClockwiseNext.
Preamble
import Mathlib.Combinatorics.SimpleGraph.DegreeSum 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 open Classical noncomputable section
Formal statement
lemma DartSuccessorFromLocalClockwiseNext {V : Type*} [Fintype V]
(G : SimpleGraph V) [DecidableRel G.Adj]
(clockwiseNext : ∀ v : V, Equiv.Perm {d : G.Dart // d.toProd.1 = v})
(clockwiseNext_eq_self_iff_isolated :
∀ (v : V) (d : {d : G.Dart // d.toProd.1 = v}),
clockwiseNext v d = d ↔ ∀ e : {d : G.Dart // d.toProd.1 = v}, e = d) :
∃ successor : Equiv.Perm G.Dart,
(∀ d : G.Dart, (successor d).toProd.1 = d.toProd.2) ∧
(∀ d : G.Dart,
successor d =
(clockwiseNext d.toProd.2
⟨d.symm, by simp [SimpleGraph.Dart.symm]⟩).1) ∧
(∀ d : G.Dart,
(∀ e : {e : G.Dart // e.toProd.1 = d.toProd.2}, e.1 = d.symm) →
successor d = d.symm) := by sorrySource