Documentation

LeanPool.RegtsSevenster.RS.Novel.Coordinates.FlagEnum

The two flag enumerations #

The Definition 5 pair enumeration and the block-slot enumeration are duplicate-free lists of the participating flags at a vertex: the raw material for the canonical index permutation between them.

theorem RS.mem_pairBase {α : Type} {W : Fragment α} {F : EdgeSubset W} {κ : F.TransitionSystem} {o : κ.Orientation} {v : W.Vertex} {f : ↥F.flags} (hf : f ∈ (F.inFlagsAt o v).attachWith (fun (x : W.Flag) => x ∈ F.flags) ⋯) :
↑f ∈ F.inFlagsAt o v

Members of the pair base are incoming flags.

theorem RS.attach_of_mem_inFlagsAt {α : Type} {W : Fragment α} {F : EdgeSubset W} {κ : F.TransitionSystem} {o : κ.Orientation} {v : W.Vertex} {f : W.Flag} (hf : f ∈ F.inFlagsAt o v) :

Incoming flags attach to their vertex.

theorem RS.pairFlagList_nodup {α : Type} {W : Fragment α} {F : EdgeSubset W} {κ : F.TransitionSystem} (o : κ.Orientation) (v : W.Vertex) :

The pair enumeration is duplicate-free.

theorem RS.mem_pairFlagList {α : Type} {W : Fragment α} {F : EdgeSubset W} {κ : F.TransitionSystem} (o : κ.Orientation) (v : W.Vertex) (x : ↥F.flags) :

Membership in the pair enumeration is attachment at the vertex.

noncomputable def RS.blockOddFlagList (W : ClosedFragment) (F : EdgeSubset W) (v : Fin (ds W).length) :
List ↥F.flags

The block-slot enumeration: the participating slots of a block in slot order, as flags.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    The block-slot enumeration is duplicate-free.

    theorem RS.mem_blockOddFlagList (W : ClosedFragment) (F : EdgeSubset W) (v : Fin (ds W).length) (x : ↥F.flags) :

    Membership in the block-slot enumeration is attachment at the block's vertex.

    The two enumerations list the same flags.