Characterizing Rickart and Baer ultragraph Leavitt path algebras (Q6146417)

Given a ring \(R\), the left annihilator of some subset \(J\) is \( \mathrm{ann}_l(J) = \{r \in R \ | \ rb = 0 \mbox{ for any } b \in J \}\). A ring \(R\) is a left Baer ring if the left annihilator of any subset of \(R\) is a left ideal generated by an idempotent and \(R\) is a left Rickart ring if the same condition is satisfied for all singleton sets in \(R\). This paper deals with the Baer, Rickart ring properties of an ultragraph Leavitt path algebra over a unital commutative semisimple ring \(R\). \textit{R. Hazrat} and \textit{L. Vaš} [J. Pure Appl. Algebra 222, No. 1, 39--60 (2018; Zbl 1383.16024)] characterized Leavitt path algebras over fields that are Rickart and Baer, locally Rickart (Baer), graded Rickart (Baer), and graded Rickart (Baer) *-rings. Using the Wedderburn-Artin Theorem, it is shown that an ultragraph Leavitt path algebra over a semisimple ring \(R\) can be decomposed into a finite direct product of Leavitt path algebras over fields in Section 4. By using this decomposition the Baer and Rickart characterizations of Leavitt path algebras over graphs is generalized to ultragraph Leavitt path algebras. Section 5 and 6 contain the main results on Rickart and Baer characterizations, respectively. Theorem 5.4 states the condition on the ultragraph such that the ultragraph Leavitt path algebra is a Rickart ring equivalently a graded Rickart ring. Theorem 6.2 states that \(G\) is a finite no-exit ultragraph where every infinite path ends in a sink or a cycle if and only if the ultragraph Leavitt path algebra \(L_R(G)\) is a Baer ring if and only if \(L_R(G)\) is a graded Baer ring. Theorem 6.9 gives the necessary and sufficient conditions for an ultragraph Leavitt path algebra to be 1) a locally Baer *-ring and 2) a Baer *-ring. Note that the authors remark the following typo in [\textit{R. Hazrat} and \textit{L. Vaš}, J. Pure Appl. Algebra 222, No. 1, 39--60 (2018; Zbl 1383.16024)] as Remark 6.8: ``In Theorem 6.9 below we extend [\textit{R. Hazrat} and \textit{L. Vaš}, J. Pure Appl. Algebra 222, No. 1, 39--60 (2018; Zbl 1383.16024), Theorem 16] to ultragraphs. Note that there is a typographical error in [loc. cit., Theorem 16]. In addition to the assumption that the graph \(E\) must be a disjoint union of graphs that are acyclic or isolated loops, all acyclic graphs must also be row-finite, as is evident from the assumptions in [loc. cit., Theorem 15] and the proof of [loc. cit., Theorem 16].''