Monoidal Rewriting Systems: Coherence & Computation

• Monoidal rewriting systems are formal frameworks that define generators, relations, and higher coherence cells using polygraphs in categorical structures.
• They employ termination measures and critical pair analyses to ensure confluence and establish unique normal forms via algorithmic decision procedures.
• Extensions to symmetric and braided monoidal categories introduce additional generators and coherence diagrams, broadening applications in higher-dimensional rewriting.

A monoidal rewriting system (MRS) formalizes equational reasoning for algebraic structures such as monoids, monoidal categories, and their higher-dimensional generalizations, typically by specifying generators (operations), relations (rewriting steps), and higher coherence data (confluence diagrams). MRSs provide both a syntactic and homotopical (higher-dimensional) setting for describing, analyzing, and algorithmically deciding equality of terms, morphisms, or diagrams, especially in contexts where associativity, unit, and symmetry are only up to isomorphism and not strict equalities. The concept has developed through categorical techniques (polygraphs, track categories), classical string and term rewriting, and modern graphical and computational methods.

1. Formal Definition and Polygraphic Structure

A monoidal rewriting system is presented via a polygraph—a layered structure capturing objects, operations, coherence maps, and higher-dimensional fillers:

• n-Polygraph: For monoidal categories, the standard construction uses a 3-polygraph $\Sigma = (\Sigma_0, \Sigma_1, \Sigma_2, \Sigma_3)$, with:
  • $\Sigma_0 = \{*\}$, one object (the monoidal unit),
  • $\Sigma_1 = \{a\}$, the generating 1-cell (tensor wire),
  • $$\Sigma_2 = \{\mu: a\otimes a \Rightarrow a,\, \eta: I\otimes a \Rightarrow a,\, \eta': a\otimes I \Rightarrow a\}$$ (binary operation and unitors),
  • $$\Sigma_3 = \{\alpha: (x\otimes y)\otimes z \Rightarrow x\otimes (y\otimes z),\, \lambda: I\otimes x \Rightarrow x,\, \rho: x\otimes I \Rightarrow x\}$$ (associator, left and right unitor 3-cells).
• 4-cells are added for the classical Mac Lane pentagon and triangle identities:
  • Pentagon: fills the critical branching of associators,
  • Triangle: resolves overlaps of associator/unitors.

A track n-category is a strict n-category where all top-dimensional cells are invertible. Asphericity (triviality of all higher spheres) equates to coherence: all diagrams built from structural morphisms commute after quotienting by the given relations and fillers.

This polygraphic structure is interpreted as an MRS: objects are tensor words, 1-cells are compositions, 2-cells are rewriting steps (associators/unitors), and 3-cells are confluence diagrams resolving critical overlaps (Guiraud et al., 2010, Mimram, 2014).

2. Termination, Confluence, and the Homotopical Basis

Termination of an MRS is established using well-founded measures (e.g., lexicographic order on the number of $\mu$, $\eta$, $\eta'$ occurrences) so that every application of a rewrite strictly decreases the measure. Confluence—uniqueness of normal forms—follows from Newman's Lemma, by checking that all critical pairs (overlaps of left-hand sides of rules) are joinable. In the monoidal case, the only critical pairs are:

• Associator/associator overlap (resolved by the pentagon);
• Associator/unitor overlaps (resolved by triangles).

The set of 4-cells (pentagon and triangles) suffices as a homotopy basis: every higher homotopy sphere (i.e., composite of structural isomorphisms forming a loop) can be filled by these 4-cells, implying asphericity of the track category. Asphericity gives Mac Lane's coherence theorem: every diagram built from associators and unitors commutes (Guiraud et al., 2010).

For symmetric or braided monoidal categories, the system is extended with additional generators (symmetries, braidings) and coherence relations (hexagons, unit-symmetry squares), but the finite, convergent, critical-pair-resolution methodology is unchanged (Guiraud et al., 2010).

3. Algorithmic and Higher-Dimensional Features

The MRS formalism supports explicit computation of normal forms and decision procedures for diagrammatic equality:

• Rewriting algorithms operate on 2-cells, reducing composites to normal forms using the convergent set of rules.
• Critical pair analysis ensures confluence: all nontrivial overlaps are joined by explicit confluence diagrams (4-cells).
• Higher-dimensional rewriting supplies an algorithmic proof of coherence: all diagrams, no matter how complex, reduce via a finite set of rewriting and confluence steps to their unique normal form.

This approach generalizes classical (1-dimensional) term or string rewriting to n-dimensional rewriting, and establishes algorithmic control over coherence problems in categorical and homotopical algebra (Guiraud et al., 2010).

4. Extensions to Symmetric and Braided Monoidal Categories

Symmetric monoidal categories add a symmetry generator $\tau: x\otimes y \Rightarrow y\otimes x$ and impose symmetry and compatibility relations (hexagon, involutivity, naturality). Critical pairs arising from overlaps involving symmetries are resolved by hexagon and unit-symmetry coherence diagrams, yielding a finite homotopy basis.

Braided monoidal categories generalize symmetry to invertible but not involutive $\beta$, with hexagon-type 4-cells. The coherence problem reduces to equality in the corresponding braid group presentation: two diagrams are equal if and only if they induce the same braid (Guiraud et al., 2010).

5. Theoretical Results and Proof Strategy

The fundamental theorems established in this framework include:

• Homotopy Basis via Convergent Presentation: If a 3-polygraph $\Sigma_3$ is convergent and $\Sigma_4$ is the set of generating (critical-pair) confluences, then $\Sigma_4$ is a homotopy basis for the free track 3-category. All higher-dimensional spheres are filled by these coherence 4-cells.
• Asphericity Implies Coherence: If the monoidal track 3-pro admits such a finite convergent presentation, it is aspherical and hence all diagrams commute.
• Coherence for Variants: Mac Lane's coherence (monoidal and symmetric), as well as the coherence for braided monoidal categories, are consequences of these concrete convergent presentations (Guiraud et al., 2010).

The proof strategy is explicit:

1. Specify the generators and rewrite rules for the desired algebraic structure (associator, unitors, symmetries, braidings).
2. Prove termination via a suitable well-founded measure.
3. Compute all critical branchings; add 4-cell fillers for each.
4. Use Newman’s Lemma to deduce confluence.
5. Conclude the fillers form a finite homotopy basis, thus establish asphericity and coherence.

6. Practical Aspects and the Role of MRS in Categorical Rewriting

The higher-dimensional polygraphic/Homotopical presentation is intrinsically a Monoidal Rewriting System:

• Objects: tensor words,
• Morphisms/rewriting steps: formal composites and generating isomorphisms,
• Critical-pair resolutions: higher-dimensional confluence diagrams.

Convergence (i.e., noetherianity + confluence) is equivalent to the classical criterion for rewrite-based decision procedures in MRS. In practice, to construct an MRS:

• Choose generators and orient rules toward normal forms.
• Analyze and resolve all critical overlaps with explicit coherence cells.
• Use the convergent system to decide equality via reduction to normal forms.

The homotopical viewpoint makes classical coherence results fully algorithmic, and grounds modern developments in higher-categorical and computational category theory (Guiraud et al., 2010).

---

References:

• "Coherence in monoidal track categories" (Guiraud et al., 2010)