The \(V\)-monoid of a weighted Leavitt path algebra (Q2279929)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The \(V\)-monoid of a weighted Leavitt path algebra
scientific article

    Statements

    The \(V\)-monoid of a weighted Leavitt path algebra (English)
    0 references
    0 references
    17 December 2019
    0 references
    To a row-finite directed graph \(E\), with vertices \(E^0\) and edges \(E^1\), one can naturally associate a commutative monoid \(M_E\), called the \textit{graph monoid} of \(E\). It is a free commutative monoid over the vertices, subject to identifying a vertex with the sum of vertices it is connected to: \[ M_E= \Big \langle \, v \in E^0 \, \, \Big \vert \, \, v= \sum_{v\rightarrow u \in E^1} u \, \Big \rangle, \] when \(v\) emits edges. The graph monoids were introduced by \textit{P. Ara} et al. [Algebr. Represent. Theory 10, No. 2, 157--178 (2007; Zbl 1123.16006)] in relation with the theory of Leavitt path algebras. It was shown that \(M_E\) coincides with the monoid \(\mathcal V(L_K(E))\) -- constructed from the finitely generated projective modules of a Leavitt path algebra \(L_K(E)\), where \(K\) is a coefficient field. Consequently, the group completion of \(M_E\) is the Grothendieck group \(K_0(L_K(E))\). The notion of weighted Leavitt path algebras generalises simultaneously the usual Leavitt path algebras and William Leavitt's algebras \(L(m,n)\). It was constructed from a weighted graph [\textit{R. Hazrat}, Isr. J. Math. 195, Part B, 833--895 (2013; Zbl 1308.16005)]. In this paper a version of graph monoids for weighted graphs is given and shown that it would coincide with \(\mathcal V (L_K(E,w))\), where \(L_K(E,w)\) is the weighted Leavitt path algebra associated to a weighted graph \(E\). Consequently, the group completion of this monoid would give \(K_0(L_K(E,w))\). In this paper, the author points out a mistake in the construction given in the above paper and introduces a modified graph monoid associated to a weighted graph. He shows that his graph monoid associated to the weighted graph \(E\) coincides with \(\mathcal V (L_K(E,w))\). The approach uses a very careful analysis of \textit{G. M. Bergman}'s universal ring construction machinery [Trans. Am. Math. Soc. 200, 33--88 (1974; Zbl 0264.16018)]. Curiously, the description of \(K_0\) of a weighted Leavitt path algebra that was given in [Hazrat, loc. cit.] is correct
    0 references
    Leavitt path algebras
    0 references
    weighted Leavitt path algebras
    0 references
    graph monoids
    0 references

    Identifiers