Documentation

LeanPool.RegtsSevenster.RS.Novel.Skein.GlueCrossDelta

The crossing-parity delta of the diagram gluing #

The crossing-count parity change of a label chord diagram across the Temperley–Lieb gluing glueChords i j — the chord-sign ratio the converse's per-cut splitting carries.

theorem RS.chordPairCross_comm {α : Type} [LinearOrder α] {x y u w : α} :

ChordPairCross is symmetric in its two chords: the two disjuncts swap.

noncomputable def RS.diagCrossCount {α : Type} [LinearOrder α] (P : Finset (α × α)) :

The abstract diagram crossing count: ordered pairs of chords that interleave, gated so the first-starting chord is listed first. On a well-formed diagram (IsChordDiagram) every crossing unordered pair of chords contributes exactly one ordered pair, so this is the plain crossing number.

Equations
Instances For

    Order helpers #

    The system bridge #

    The glue delta, crossing case #

    theorem RS.diagCrossCount_glue_cross {α : Type} [LinearOrder α] {P : Finset (α × α)} (hP : IsChordDiagram P) {i j x y : α} (hij : i < j) (hxj : x ≠ j) (hi : (min i x, max i x) ∈ P) (hj : (min j y, max j y) ∈ P) :
    (diagCrossCount (glueChords i j P) + diagCrossCount P) % 2 = ((Finset.filter (CrossesCut i j) ((P.erase (min i x, max i x)).erase (min j y, max j y))).card + if ChordPairCross (min i x) (max i x) (min j y) (max j y) then 1 else 0) % 2

    The glue delta, crossing case: gluing the cut {i, j} (i < j, chord (i,x) and chord (j,y) concatenating into (x,y), non-linked: x ≠ j) changes the diagram crossing count, mod 2, by the number of surviving third chords crossing the cut plus the mutual-crossing indicator of the two cut chords.