Equational proofs of Jacobson's Theorem (2310.05301v1)
Abstract: A classical theorem by Jacobson says that a ring in which every element $x$ satisfies the equation $xn=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 $pk$ 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.