Context
Two-dimensional moves can connect every pair of histories while still leaving nontrivial loops between transformations. Coherence begins only after those loops are controlled.
Definitions
- The raw transformation graph has occurrence-labelled complete histories as vertices and disjoint or overlap moves as edges.
- The schedule quotient contracts the unique disjoint-scheduling edge in the arity-four raw graph.
Hypotheses and scope
- The fixed source in the occurrence-labelled system .
Proof or evidence
The six raw histories form a cycle ; contracting the single disjoint edge gives the five-vertex rotation cycle . Both are connected and both have fundamental group and first homology . Attaching one arity-four 3-cell along the raw hexagon, equivalently the quotient pentagon, fills the unique loop.
Verification notes
The durable failure and claim ledgers agree on the two presentations and on the one-cell repair. The site preserves the distinction between the raw hexagon and the quotient pentagon instead of using them interchangeably.
Limitations
- The result concerns the fixed arity-four component, not every rewriting presentation.
- One-cell necessity is relative to the fixed one-skeleton and counts newly attached higher cells.
- No all-arity coherence theorem is claimed.