The label chord diagram of a transition system #
The boundary pairing of a relative transition system, recorded as
a finite set of label chords (each low-to-high): the combinatorial
index over which the pairing-resolved open-sector values live.
SamePairing is exactly equality of chord diagrams.
The chord diagram of a system: for each participating boundary flag, the sorted pair of its label and its path match's label.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Membership: a pair is a chord exactly when it is the sorted label pair of some participating boundary flag.
The converse: equal chord diagrams force the same pairing. The
chord of δ in κ' is the chord of δ in κ (the only κ'
chord containing δ's label, by label injectivity), and the
partner's label determines the partner.
A well-formed chord diagram.
Every chord is recorded low end first.
- disjoint (p : α × α) : p ∈ P → ∀ q ∈ P, p ≠ q → PairDisjoint p q
Distinct chords share no end.
Instances For
On an all-internal subset the chord diagram is empty: there are no participating boundary flags.