Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Algebraic polygraphs modulo and linear rewriting

Abstract : 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.
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download
Contributor : Benjamin Dupont <>
Submitted on : Tuesday, September 22, 2020 - 2:52:32 PM
Last modification on : Wednesday, October 14, 2020 - 4:08:03 AM


Files produced by the author(s)


  • HAL Id : hal-02945665, version 1


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



Record views


Files downloads