Equational proofs of Jacobson's Theorem

TL;DR

This paper develops a general method to construct equational proofs of Jacobson's Theorem, showing that rings satisfying $x^n=x$ are commutative, by reducing to prime power cases and characteristic p, with detailed examples.

Contribution

It provides a unified approach to derive equational proofs for Jacobson's Theorem for all n, extending previous partial results and introducing new reduction techniques.

Findings

Reduction to prime power cases and characteristic p

Proofs for the cases k=1 and k=2

Series of constructive Wedderburn Theorems

Abstract

A classical theorem by Jacobson says that a ring in which every element $x$ satisfies the equation $x^n=x$ for some $n>1$ is commutative. According to Birkhoff's Completeness Theorem, if $n$ is fixed, there must be an equational proof of this theorem. But equational proofs have only appeared for some values of $n$ so far. This paper is about finding such a proof in general. We are able to make a reduction to the case that $n$ is a prime power $p^k$ and the ring has characteristic $p$. We then prove the special cases $k=1$ and $k=2$. The general case is reduced to a series of constructive Wedderburn Theorems, which we can prove in many special cases. Several examples of equational proofs are discussed in detail.