For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide (Q1399171)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide |
scientific article |
Statements
For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide (English)
0 references
30 July 2003
0 references
A monoid \(M\) is said to be \(\text{bi-FP}_k\) for some integer \(k\geq 1\), if there exists an exact sequence of finitely generated free \(A\)-bimodules of the form \(C_k@>\delta_k>>C_{k-1}@>\delta_{k-1}>>\cdots@>\delta_1>>C_0\to A\to 0\) where \(A\) denotes the monoid ring \(\mathbb{Z} M\). For a finite alphabet \(\Sigma\), the presentation \((\Sigma;R)\) is said to be of finite homological type (FHT), if the bimodule \(\Pi\) in the exact sequence of \(A\)-bimodules \(0\to\Pi@>\overline{\varrho}>>A\cdot R\cdot A@>\mu>>{\mathcal M}\to 0\) where \(A\cdot R\cdot A\) denotes the free \(A\)-bimodule generated by the set of defining relations \(R\) and \(\mathcal M\) denotes the relation bimodule of \((\Sigma,R)\), is finitely generated. It is proved that a finitely generated monoid is \(\text{bi-FP}_3\) if and only if it has the property FHT.
0 references
monoid rings
0 references
presentations of finite homological type
0 references
exact sequences
0 references
relation bimodules
0 references
rewriting systems
0 references
homological finiteness conditions FP\(_n\) and bi-FP\(_n\)
0 references
finitely generated monoids
0 references
0 references
0 references