🔢 mathematics

Rings with finitely many zero divisors

The paper provides an elementary proof and a precise bound for the theorem stating that any ring containing a finite number of zero divisors must itself be a finite ring.

Original authors: Michael Kinyon

Published 2026-04-28

📖 4 min read🧠 Deep dive

CC BY 4.0

Original authors: Michael Kinyon

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Mystery of the "Troublemaker" Numbers: An Explanation

Imagine you are running a highly organized society where everyone follows strict rules. In this society, most people are "reliable"—if you multiply them by something, they produce a clear, predictable result.

However, there is a small group of "Troublemakers" (which mathematicians call Zero Divisors). These are strange individuals who, when multiplied by someone else, result in absolute nothingness (zero). In a normal, well-behaved society (like the one we use for basic math), the only way to get "nothing" is to start with "nothing." But in these weird mathematical rings, you can have two "something" people collide and suddenly vanish into zero.

The paper by Michael Kinyon explores a fascinating question: If we know exactly how many Troublemakers live in a society, can we predict how big the entire society is?

1. The "Crowd Control" Rule (Lemma 1)

Kinyon starts by looking at one-sided troublemakers. Imagine a club where some people are "Left-Handed Troublemakers"—they only cause chaos when they are the first person in a multiplication pair.

Kinyon proves a rule: The number of Troublemakers acts like a leash on the size of the entire population.

The Analogy: Imagine a party where there are only 3 Troublemakers. You might think, "Well, there could be a million regular people there!" But Kinyon proves that's impossible. Because of the way the math rules work, every time you add a new "regular" person, they inevitably create a pattern that would force more Troublemakers into existence. If the population gets too big, you'll accidentally create a 4th or 5th Troublemaker.

He provides a specific formula: if you have $n$ troublemakers, the total population cannot be larger than $(n+1)^2$ . If you have 3 troublemakers, the population can't be bigger than 16. The Troublemakers effectively "limit the room" available for everyone else.

2. The "Two-Sided" Upgrade (The Main Theorem)

The paper then gets more sophisticated. Some people are "Two-Sided Troublemakers"—they cause chaos whether they are on the left or the right.

Kinyon’s main achievement is proving that even if you only count these "Two-Sided" troublemakers, the "leash" still works. Even if there are "One-Sided" troublemakers hiding in the shadows, the total size of the entire mathematical universe is still strictly capped by that same formula: $|R| \leq (n+1)^2$ .

3. The "Small Club" Rule (The Proposition)

Finally, the paper looks at "Clubs with a Leader" (Rings with Unity). In these clubs, there is a special element (the number 1) that acts as a neutral leader.

Kinyon asks: If a club is very small and has very few Troublemakers (only 1 or 2), can it be chaotic and disorganized (non-commutative)?

In math, "non-commutative" means that the order matters: $A \times B$ is not the same as $B \times A$ . It’s like a world where "putting on socks then shoes" is different from "putting on shoes then socks."

Kinyon proves that if there are only 1 or 2 Troublemakers, the club must be orderly. The math is too tight; there isn't enough "room" for the chaos of non-commutative behavior to exist. To have a truly chaotic, "order-matters" club, you need a larger population and more Troublemakers to shake things up.

Summary in a Nutshell

The Troublemakers (Zero Divisors): The weird elements that turn "something" into "nothing."
The Leash: The more Troublemakers you have, the larger the world can be. But if you keep the number of Troublemakers small, the entire mathematical world is forced to stay small.
The Order: If the number of Troublemakers is tiny (1 or 2), the world is forced to be polite and predictable (commutative).

Technical Summary: "Rings with Finitely Many Zero Divisors" by Michael Kinyon

Problem Statement

The paper addresses a fundamental but often overlooked question in ring theory: What can be determined about the order (size) of a ring if the number of its zero divisors is known and finite?

While introductory algebra courses focus heavily on integral domains (rings with no zero divisors) and fields, the behavior of rings with a specific, finite number of zero divisors is less explored. The author seeks to provide an elementary, self-contained proof of a theorem that bounds the size of a ring based on the number of its two-sided zero divisors, avoiding the more complex machinery of ideals and quotients used in previous literature.

Methodology

The author employs a combinatorial and elementary algebraic approach. The methodology is structured through a series of progressive lemmas:

Combinatorial Partitioning (Lemma 1): To bound the size of a ring based on its one-sided zero divisors, the author uses the Pigeonhole Principle. By selecting a left zero divisor $c$ and an element $d$ such that $cd=0$, the author partitions the ring into sets $A_i$ based on the product $xc$. By showing that these sets are essentially additive cosets (or at least have equal size), the author establishes that the total number of elements cannot exceed $(n+1)^2$ .
Cancellability (Lemma 2): The author utilizes the relationship between zero divisors and the property of being "cancellable" (i.e., $xa = ya \implies x = y$ ). This is used to bridge the gap between one-sided and two-sided zero divisors.
Reduction and Mapping (Proof of Theorem): The core proof reduces the general case of two-sided zero divisors to the case of one-sided zero divisors. If a left zero divisor is not a right zero divisor, the author uses the right-cancellability of that element to create an injective mapping from the ring $R$ to a subring $Ra$. This allows the bound derived for one-sided divisors to be applied to the entire ring.

Key Contributions and Results

The paper provides three primary mathematical results:

The Main Theorem: Let $R$ be a ring with exactly $n > 0$ two-sided zero divisors. Then $R$ is finite, and its order is bounded by:
$|R| \leq (n + 1)^2$
The author notes this bound is sharp, citing the ring $\mathbb{Z}_{p^2}$ as an example where equality holds.
Lemma 1 (Koh’s Theorem): A ring with exactly $n > 0$ left (or right) zero divisors has an order $|R| \leq (n + 1)^2$ .
Commutativity Proposition: A ring with unity that possesses exactly 1 or exactly 2 two-sided zero divisors must be commutative. This is proven by exhaustion, noting that the smallest non-commutative ring with unity (the $2 \times 2$ upper triangular matrices over $\mathbb{F}_2$ ) has 5 two-sided zero divisors.

Significance

The significance of this paper lies in its pedagogical accessibility. While the results were previously established by mathematicians such as Ganesan, Koh, Hirano, Corbas, and Raghavendran, those proofs typically required an understanding of one-sided ideals and quotient rings.

Kinyon’s work is significant because:

Elementary Proof: It provides a proof that can be taught early in an undergraduate ring theory course, immediately following the definition of a zero divisor.
Refinement of Bounds: It clarifies the relationship between one-sided and two-sided zero divisors, showing that the two-sided constraint provides a tighter or equal bound compared to the one-sided constraint.
Mathematical Completeness: It closes a gap in "elementary" literature by providing a self-contained derivation of a result that was previously considered part of more advanced ring theory.