Elementary proofs of ring commutativity theorems
Pith reviewed 2026-05-16 13:35 UTC · model grok-4.3
The pith
Rings satisfying x^n = x for any fixed odd n are commutative via equational proofs.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
If a ring satisfies the identity x^{2k+1} equals x for every element x and for a fixed integer k, then the ring is commutative. The argument proceeds by first establishing that the element x^k lies in the center for each x, after which substitution back into the original identity yields that every pair of elements commutes. Parallel equational derivations establish the same conclusion when x^n minus x is central for each x and n is fixed at either 4 or 8.
What carries the argument
The lemma that x^k is central for each x whenever n equals 2k plus 1.
If this is right
- Every element x satisfies that x^k commutes with every ring element when n equals 2k plus 1.
- Commutativity of the ring follows by direct substitution and rearrangement from the power identity alone.
- The same conclusion holds when x^n minus x is required only to be central for fixed n equal to 4 or 8.
- All derivations remain valid uniformly without splitting into cases according to individual elements.
Where Pith is reading between the lines
- Similar equational arguments may succeed for other fixed even exponents beyond 4 and 8.
- The centrality of powers x^k could be examined in near-rings or other non-associative structures that obey analogous power laws.
- Fixed-n commutativity conditions might interact with known polynomial identities that force commutativity in other varieties of rings.
- The uniform treatment suggests that computational search for short equational derivations could be applied to additional specific exponents.
Load-bearing premise
The given power condition holds for one and the same fixed n on every element of the ring at once.
What would settle it
A non-commutative ring in which x^{2k+1} equals x for all x and some fixed odd integer greater than 1, or in which x^n minus x is central for all x when n is fixed at 4 or 8.
read the original abstract
Jacobson's commutativity theorem says that a ring is commutative if, for each $x$, $x^n = x$ for some $n > 1$. Herstein's generalization says that the condition can be weakened to $x^n-x$ being central. In both theorems, $n$ may depend on $x$. In this paper, in certain cases where $n$ is a fixed constant, we find equational proofs of each theorem. For the odd exponent cases $n = 2k+1$ of Jacobson's theorem, our main tool is a lemma stating that for each $x$, $x^k$ is central. For Herstein's theorem, we consider the cases $n=4$ and $n=8$, obtaining proofs with the assistance of the automated theorem prover Prover9.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims to deliver elementary equational proofs for the fixed-n cases of Jacobson's commutativity theorem when n is odd (n=2k+1), relying on a lemma that x^k is central for each x, and for Herstein's generalization in the specific cases n=4 and n=8, with the latter obtained via the automated theorem prover Prover9.
Significance. If the derivations are correct and fully verifiable, the work supplies explicit, checkable equational arguments for concrete instances of these classical results, which can serve as a pedagogical resource and illustrate the effective use of automated provers in ring theory without invoking heavier structural machinery.
major comments (2)
- [Lemma for odd exponents] The lemma asserting that x^k is central for each x (under the hypothesis x^{2k+1}=x) is load-bearing for all odd-exponent cases of Jacobson's theorem; its complete equational derivation from the ring axioms must be supplied in full, as the current text presents it as a stated tool without the intermediate steps.
- [Herstein cases n=4 and n=8] The proofs for Herstein's theorem at n=4 and n=8 rest on Prover9 output; the manuscript must include the exact input axioms, the generated equational sequence, or the prover files themselves, because the soundness assessment indicates these central steps cannot be checked directly from the presented text alone.
minor comments (2)
- [Abstract] The abstract's phrasing 'in certain cases' should be replaced by an explicit enumeration of the covered exponents to avoid ambiguity about the paper's scope.
- [Introduction] Standard citations to the original statements of Jacobson's theorem and Herstein's generalization should be added in the introduction for reader orientation.
Simulated Author's Rebuttal
We thank the referee for the careful reading and constructive suggestions. We address each major comment below and will revise the manuscript to improve the completeness and verifiability of the presented proofs.
read point-by-point responses
-
Referee: [Lemma for odd exponents] The lemma asserting that x^k is central for each x (under the hypothesis x^{2k+1}=x) is load-bearing for all odd-exponent cases of Jacobson's theorem; its complete equational derivation from the ring axioms must be supplied in full, as the current text presents it as a stated tool without the intermediate steps.
Authors: We agree that the full equational derivation is required for independent verification. The revised manuscript will include the complete step-by-step equational proof of the lemma that x^k is central, derived directly from the ring axioms with all intermediate steps shown explicitly. revision: yes
-
Referee: [Herstein cases n=4 and n=8] The proofs for Herstein's theorem at n=4 and n=8 rest on Prover9 output; the manuscript must include the exact input axioms, the generated equational sequence, or the prover files themselves, because the soundness assessment indicates these central steps cannot be checked directly from the presented text alone.
Authors: We accept this point. The revised version will append the exact Prover9 input axioms together with the full generated equational sequences for both the n=4 and n=8 cases, allowing direct checking of the derivations. revision: yes
Circularity Check
No significant circularity identified
full rationale
The paper derives commutativity results from the standard ring axioms plus the fixed-n identities using purely equational manipulations. The key lemma (x^k central for odd n=2k+1) is introduced as an internal tool whose proof is supplied within the manuscript rather than presupposed. Automated verification via Prover9 for the n=4 and n=8 Herstein cases confirms the derivations directly from the input axioms without fitted parameters, self-referential definitions, or load-bearing self-citations. All steps remain independent of the final commutativity conclusion and rest on externally verifiable equational reasoning.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math Standard axioms of associative rings with unity or without, as required by the theorems
Reference graph
Works this paper leans on
-
[1]
A. N. Abyzov, P. V. Danchev and D. T. Tapkin, Rings withx n +xorx n −xnilpotent,J. Algebra Appl.22(2023), no. 1, Paper No. 2350024, 14 pp
work page 2023
-
[2]
D. D. Anderson and P. V. Danchev, A note on a theorem of Jacobson related to periodic rings, Proc. Amer. Math. Soc.148(2020), 5087–5089
work page 2020
-
[3]
V. A. Andrunakieviˇ c and Ju. M. Rjabuhin, Rings without nilpotent elements, and completely prime ideals,Dokl. Akad. Nauk SSSR180(1968), 9–11
work page 1968
-
[4]
R. Ayoub and C. Ayoub, On the commutativity of rings,Amer. Math. Monthly71(1964), 267–271
work page 1964
-
[5]
Birkhoff, On the structure of abstract algebras,Proc
G. Birkhoff, On the structure of abstract algebras,Proc. Cambridge Philos. Soc.31(1935), 433– 454
work page 1935
-
[6]
Brandenburg, Equational proofs of Jacobson’s theorem,arxiv:2310.05301
M. Brandenburg, Equational proofs of Jacobson’s theorem,arxiv:2310.05301
-
[7]
S. M. Buckley and D. MacHale, Centrifiers and ring commutativity,J. Math. Sci. Adv. Appl.15 (2012), 139–161
work page 2012
-
[8]
S. M. Buckley and D. MacHale, Variations on a theme: Rings satisfyingx 3 =xare commutative, Amer. Math. Monthly120(2013), 430–440
work page 2013
-
[9]
P. M. Cohn, Reversible rings,Bull. London Math. Soc.31, 641–648
-
[10]
S. W. Dolan, A proof of Jacobson’s theorem,Canad. Math. Bull.19(1976), 59–61. 10 KINYON AND MACHALE
work page 1976
-
[11]
A. Forsythe and N. H. McCoy, On the commutativity of certain rings,Bull. Amer. Math. Soc.52 (1946), 523–526
work page 1946
-
[12]
I. N. Herstein, A generalization of a theorem of Jacobson III,Amer. Math. J.75(1953), 105–111
work page 1953
-
[13]
M. S. Huzurbazar and K. Sivaramakrishnan, Jacobson’s theorem on commutativity of rings,Aligarh Bull. Math.1(1971), 9–12
work page 1971
-
[14]
Jacobson, Structure theory for algebraic algebras of bounded degree,Ann
N. Jacobson, Structure theory for algebraic algebras of bounded degree,Ann. of Math.46(1945), 695–707
work page 1945
-
[15]
Jacobson,Basic Algebra(2nd ed.), New York: W.H
N. Jacobson,Basic Algebra(2nd ed.), New York: W.H. Freeman, 1989
work page 1989
-
[16]
Klein, A simple proof of a theorem on reduced rings,Canad
A. Klein, A simple proof of a theorem on reduced rings,Canad. Math. Bull.23(1980), 495–496
work page 1980
-
[17]
Luh, On the structure ofJ-rings,Amer
J. Luh, On the structure ofJ-rings,Amer. Math. Monthly74(1967), 164–166
work page 1967
-
[18]
Luh, On the commutativity ofJ-rings,Canadian J
J. Luh, On the commutativity ofJ-rings,Canadian J. Math.19(1967), 1289–1292
work page 1967
-
[19]
MacHale, Rings that are nearly Boolean III,Proc
D. MacHale, Rings that are nearly Boolean III,Proc. Roy. Irish Acad. Sect. A86A(1986), 31–33
work page 1986
-
[20]
W. W. McCune,Prover9 and Mace4, version 2009-11A.http://www.cs.unm.edu/ ~mccune/ prover9/
work page 2009
-
[21]
Morita, Elementary proofs of the commutativity of rings satisfyingx n =x,Memoirs Def
Y. Morita, Elementary proofs of the commutativity of rings satisfyingx n =x,Memoirs Def. Acad. Jap.XVIII(1978), 1–23
work page 1978
-
[22]
T. Nagahara, H. Tominaga, Elementary proofs of a theorem of Wedderburn and a theorem of Jacobson,Abh. Math. Semin. Univ. Hambg.41(1974), 72–74
work page 1974
-
[23]
Oman, A characterization of potent rings,Glasgow Math
G. Oman, A characterization of potent rings,Glasgow Math. J.65(2023), 324–327
work page 2023
-
[24]
R. Padmanabhan and Y. Zhang, Automated deduction in ring theory, In: G.M. Greuel, T. Koch, P. Paule, A. Sommese, (eds),Mathematical Software – ICMS 2016, Lecture Notes in Computer Science9725(2016), Springer
work page 2016
-
[25]
J. W. Wamsley, On a condition for commutativity of rings,J. Lond. Math. Soc.2(1971), 331–332
work page 1971
-
[26]
J. J. Wavrik, Commutativity theorems: examples in search of algorithms,Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (Vancouver, BC), 31–36.Asso- ciation for Computing Machinery (ACM), New York, 1999
work page 1999
-
[27]
Zhang, Automated proof of ring commutativity problems by algebraic methods,J
H. Zhang, Automated proof of ring commutativity problems by algebraic methods,J. Symbolic Comput.9(1990), 423–427. Michael Kinyonis Professor of Mathematics at the University of Denver. His mathematical interests include quasigroup theory and semigroup theory, and he is especially keen on using automated deduction software to prove theorems. Desmond MacHa...
work page 1990
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.