Computably Enumerable Semisimple Rings

Abstract

The theory of semisimple rings plays a fundamental role in noncommutative algebra. We study the complexity of the problem of semisimple rings using the tools of computability theory. Following the general idea of computably enumerable (c.e. for short) universal algebras, we define a c.e. ring as the quotient ring of a computable ring modulo a c.e. congruence relation and view such rings as structures in the language of rings, together with a binary relation. We formalize the problem of being semisimple for a c.e. ring by the corresponding index set and prove that the index set of c.e. semisimple rings is Σ30-complete. This reveals that the complexity of the definability of c.e. semisimple rings lies exactly in the Σ30 of the arithmetic hierarchy. As applications of the complexity results on semisimple rings, we also obtain the optimal complexity results on other closely connected classes of rings, such as the small class of finite direct products of fields and the more general class of semiperfect rings.

Keywords

• computability theory
• universal algebra
• arithmetic hierarchy
• computably enumerable ring
• semisimple ring