2000 character limit reached
Semirings generated by idempotents (2404.07623v1)
Published 11 Apr 2024 in math.RA
Abstract: We prove that a semiring multiplicatively generated by its idempotents is commutative and Boolean, if every idempotent in the semiring has an orthogonal complement. We prove that a semiring additively generated by its idempotents is commutative, if every idempotent in the semiring has an orthogonal complement and all the nilpotents in the semirings are central. We also provide examples that the assumptions on the existence of orthogonal complements of idempotents and the centrality of nilpotents cannot be omitted.