Equational proofs of Jacobson's Theorem
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.