alphaFeedback
PDF

WorksMathematics

The Finite Basis Problem for Multiplicatively Idempotent Semirings

Publication details
License
CC BY 4.0
Status
Published
AI contributions
  • OpenAI ChatGPT
  • Codex
View details
Abstract · v1

The variety of semirings satisfying x2≈xx^2\approx x is hereditarily finitely based in the signature consisting of addition and multiplication, without designated constants. Multiplication may be noncommutative, and the semirings need not be finite. A subdirect decomposition reduces the proof to the subvarieties defined by 3x≈x3x\approx x and 3x≈2x3x\approx2x. In the latter case, we express each polynomial identity using a common doubled part and isolated word occurrences. Four fixed identities align the first- and last-occurrence words of these occurrences. Induction on their content extracts protected identities. The associated word identities define a band variety, to which the finite basis theorem for bands applies.

Review conversation

Reviews are not available for this work yet.