Documentation

LeanPool.RegtsSevenster.RS.Novel.Coordinates.BlockParity

Block parity dictionary #

The parity bridge between vertex blocks of the sorted colouring and flag-degrees of the colouring's pattern: the v-th block of the sorted colouring is even iff the pattern-flags at the corresponding vertex have even count. Corollary: the master summand vanishes whenever any block is odd-parity.

noncomputable def RS.blockVertex (W : ClosedFragment) (v : Fin (degList (starAssignEnum W)).length) :

The vertex corresponding to the v-th block of the sorted colouring: applying the vertex enumeration to the block index.

Equations
Instances For
    @[reducible, inline]
    noncomputable abbrev RS.ds (W : ClosedFragment) :

    The degree list of the star assignment: one entry per vertex, recording how many slots it carries.

    Equations
    Instances For
      @[reducible, inline]
      noncomputable abbrev RS.cSorted {k ℓ : ℕ} (W : ClosedFragment) (c : MixedColouring k ℓ (edgeCount W + edgeCount W)) :

      A colouring read in block order: slot j of block v gets the colour the original colouring gave that vertex's jth flag.

      Equations
      Instances For
        noncomputable def RS.slotEmbed (W : ClosedFragment) (v : Fin (ds W).length) (j : Fin ((ds W).get v)) :

        The slot a block position occupies in the unsorted colouring.

        Equations
        Instances For
          theorem RS.blockRestrict_val {k ℓ : ℕ} (W : ClosedFragment) (c : MixedColouring k ℓ (edgeCount W + edgeCount W)) (v : Fin (ds W).length) (j : Fin ((ds W).get v)) :
          blockRestrict (ds W) (cSorted W c) v j = c (slotEmbed W v j)

          The sorted colouring at a block position equals the original colouring at the unsorted slot.

          theorem RS.assign_slotEmbed (W : ClosedFragment) (v : Fin (ds W).length) (j : Fin ((ds W).get v)) :

          The assignment at an embedded slot equals the block index (up to finCongr).

          theorem RS.vertexOf_slotEmbed (W : ClosedFragment) (v : Fin (ds W).length) (j : Fin ((ds W).get v)) :

          The vertex at an embedded slot is the block's vertex.

          The slot embedding is injective in its block-offset argument.

          theorem RS.slotEmbed_recover (W : ClosedFragment) (v : Fin (ds W).length) (s : Fin (edgeCount W + edgeCount W)) (jw : Fin ((ds W).get v)) (hq : ⟨v, jw⟩ = (sortSigma (starAssignEnum W)) s) :
          slotEmbed W v jw = s

          The slot embedding recovers the original slot from the sigma decomposition.

          theorem RS.blockRestrict_oddSet_card {k ℓ : ℕ} (W : ClosedFragment) (c : MixedColouring k ℓ (edgeCount W + edgeCount W)) (v : Fin (ds W).length) :
          (blockRestrict (ds W) (cSorted W c) v).oddSet.card = {g ∈ colourFlags W c | W.vertexOf g = blockVertex W v}.card

          Block parity: the v-th block of the sorted colouring has the same odd-set cardinality as the pattern-flags at the corresponding vertex.

          theorem RS.blockRestrict_parity {k ℓ : ℕ} (W : ClosedFragment) (c : MixedColouring k ℓ (edgeCount W + edgeCount W)) (v : Fin (ds W).length) :

          Block parity dictionary: the v-th block of the sorted colouring is even iff the pattern-flags at the corresponding vertex have even count.

          theorem RS.masterSummand_vanish_of_block_odd {k ℓ R : ℕ} (f : EdgeRankParameter R) (P : DelignePackage (SkeinObj f)) (e' : P.ω.obj { arity := 1 } ⟶ stdSuperPair k ℓ) (W : ClosedFragment) (c : MixedColouring k ℓ (edgeCount W + edgeCount W)) (v : Fin (degList (starAssignEnum W)).length) (hodd : ¬(blockRestrict (degList (starAssignEnum W)) ((c ∘ ⇑(finCongr ⋯)) ∘ ⇑(sortSplitPerm W)) v).IsEven) :
          masterSummand f P e' W c = 0

          Master summand vanishing: if any block of the sorted colouring is odd-parity, the master summand is zero, since the star coordinate vanishes on odd-parity colourings and the product absorbs the zero.