Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Dart Successor From Local Clockwise Next

Proved
DartSuccessorFromLocalClockwiseNext

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

crossing-consequencestrellis-port

Let GGG be a finite simple graph. Suppose that for every vertex vvv we are given a permutation cvc_vcv​ of the darts whose tail is vvv, and suppose that cvc_vcv​ fixes a dart exactly when that dart is the only dart with tail vvv. Then there is a permutation succ⁡\operatorname{succ}succ of all darts such that, for every dart ddd, the tail of succ⁡(d)\operatorname{succ}(d)succ(d) is the head of ddd, and

succ⁡(d)=chead⁡(d)(dˉ),\operatorname{succ}(d)=c_{\operatorname{head}(d)}(\bar d),succ(d)=chead(d)​(dˉ),

where dˉ\bar ddˉ is the reversed dart. Moreover, if the only dart with tail head⁡(d)\operatorname{head}(d)head(d) is dˉ\bar ddˉ, then succ⁡(d)=dˉ\operatorname{succ}(d)=\bar dsucc(d)=dˉ.

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 sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/DartSuccessorFromLocalClockwiseNext.lean#L1-L83

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