Convergent presentations and polygraphic resolutions of associative algebras

Abstract

Several constructive homological methods based on noncommutative Gröbner bases are known to compute free resolutions of associative algebras. In particular, these methods relate the Koszul property for an associative algebra to the existence of a quadratic Gröbner basis of its ideal of relations. In this article, using a higher-dimensional rewriting theory approach, we give several improvements of these methods. We define polygraphs for associative algebras as higher-dimensional linear rewriting systems that generalise the notion of noncommutative Gröbner bases, and allow more possibilities of termination orders than those associated to monomial orders. We introduce polygraphic resolutions of associative algebras, giving a categorical description of higher-dimensional syzygies for presentations of algebras. We show how to compute polygraphic resolutions starting from a convergent presentation, and how these resolutions can be linked with the Koszul property.

65 pages

References in corpus (3)

• Polygraphs of finite derivation type
• Higher-dimensional categories with finite derivation type
• Higher categorified algebras versus bounded homotopy algebras

Cited by in corpus (8)

• Formal proofs of operator identities by a single formal computation
• Compatible rewriting of noncommutative polynomials for proving operator identities
• Algebraic coherent confluence and higher globular Kleene algebras
• Tangent complexes and the Diamond Lemma
• Topological closure of formal power series ideals and application to topological rewriting theory
• Strategies for linear rewriting systems: link with parallel rewriting and involutive divisions
• Higher Catoids, Higher Quantales and their Correspondences
• Categorification of infinite-dimensional ${\mathfrak{sl}}_2$-modules and braid group 2-actions I: tensor products