Algebraic polygraphs modulo and linear rewriting

Cyrille Chenavier (1) , Benjamin Dupont (2) , Philippe Malbos (2)

1 JKU - University of Linz - Johannes Kepler Universität Linz
2 ICJ - Institut Camille Jordan

Convergent rewriting systems on algebraic structures give methods to prove coherence results and compute homological invariants of these structures. These methods are based on higher-dimensional extensions of the critical pair lemma that characterizes local confluence from confluence of critical pairs. The analysis of local confluence of rewriting systems on algebraic structures, such as groups or linear algebras, is complicated because of the underlying algebraic axioms, and local confluence properties require additional termination conditions. This article introduces the structure of algebraic polygraph modulo that formalizes the interaction between the rules of the rewriting system and the inherent algebraic axioms, and we show a critical pair lemma for algebraic polygraphs. We deduce from this result a critical pair lemma for rewriting systems on algebraic structures specified by rewriting systems convergent modulo associativity and commutativity axioms. As an illustration, we explicit our constructions on linear rewriting systems.

Mots clés: Term rewriting modulo; algebraic polygraphs; linear rewriting

Domaines: Mathématiques [math]; Algorithme et structure de données [cs.DS]; Calcul formel [cs.SC]; Catégories et ensembles [math.CT]

Cyrille Chenavier, Benjamin Dupont, Philippe Malbos. Algebraic polygraphs modulo and linear rewriting. 2020. ⟨hal-02945665v1⟩