🔢 mathematics

Lattices and semilattices derived from commutative rings of characteristic 2 satisfying the identity $x^{2^n}\approx x$

This paper establishes that commutative rings of characteristic 2 satisfying the identity $x^{2^n} \approx x$ naturally form meet-semilattices under the relation $xy=x^2$ , and further constitute Boolean algebras when the rings are unitary.

Original authors: Ivan Chajda, Miroslav Kolařík, Helmut Länger

Published 2026-07-09

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Ivan Chajda, Miroslav Kolařík, Helmut Länger

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

Imagine you have a very special kind of calculator. In the world of this paper, this calculator doesn't just do normal math; it lives in a universe where adding a number to itself always equals zero. If you have a cup of coffee and you add another cup of coffee, you don't get two cups; you get nothing (because in this math world, $1 + 1 = 0$ ). This is called a "ring of characteristic 2."

Furthermore, this calculator has a magical rule: if you take any number and multiply it by itself enough times (specifically $2^n$ times, where $n$ is a whole number), it magically turns back into the original number. It's like a clock that, instead of resetting after 12 hours, resets after a specific, huge number of hours, but the rule is that the number is its own reflection after that many spins.

The authors of this paper, Ivan Chajda, Miroslav Kolařík, and Helmut Langer, asked a big question: Can we turn this weird, abstract calculator into a logical system we can understand, like a set of true/false switches?

Here is the breakdown of their discovery, using simple analogies:

1. The "Meet" (The Common Ground)

First, the authors looked at how these numbers relate to each other. They defined a relationship called "less than or equal to" ( $\le$ ). In normal life, we say 2 is less than 4. In this math world, they say $A$ is "less than" $B$ if multiplying them together gives you $A$ squared.

They discovered that if you take all the numbers in this calculator and arrange them based on this rule, they form a structure called a meet-semilattice.

The Analogy: Imagine a family tree where everyone is trying to find their "common ancestor." If you take two people, there is always a specific person who is the "greatest common ancestor" of the two. In this math world, the "meet" operation ( $\wedge$ ) is that common ancestor. It finds the "lowest common denominator" between any two numbers.
The Result: They proved that no matter how you pick two numbers in this system, you can always find this "common ground," and there is a "bottom" number (zero) that is the ancestor of everyone.

2. The "Boolean" Transformation (The Light Switch)

The real magic happens when the calculator has a "1" (a unit). The authors showed that if you add a few extra tools to this system, you can turn it into a Boolean Algebra.

What is a Boolean Algebra? Think of a light switch. It can be ON (1) or OFF (0). You can combine switches: "AND" (both must be on), "OR" (at least one is on), and "NOT" (flip the switch). This is the foundation of all computer logic.
The Discovery: The authors found a specific recipe (a formula) to create these "AND" and "OR" switches using only the basic math operations of this weird calculator.
- They created a new "AND" button ( $\wedge$ ) using a complex sum of powers.
- They created an "OR" button ( $\vee$ ) by adding the two numbers and their "AND" result.
- They created a "NOT" button ( $'$ ) by simply adding 1 to the number (which, remember, flips it because $1+1=0$ ).

The Big Claim: If you have a calculator that follows the rule "add to yourself and get zero" and "multiply yourself $2^n$ times and get yourself back," you can automatically build a perfect logic system (Boolean Algebra) out of it.

3. Why is this surprising?

Before this paper, mathematicians knew this worked for simple cases:

If the rule was $x^2 = x$ (multiplying by yourself once gets you back), it was a known Boolean ring.
If the rule was $x^4 = x$ , it was also known to work.

But what if the rule was $x^8 = x$ , or $x^{16} = x$ , or $x^{1024} = x$ ?
The authors proved that it doesn't matter how big the number is, as long as it is a power of 2 ( $2^n$ ). You can always build the logic switches. They generalized a rule that was previously only known for small numbers to apply to any power of 2.

4. How they did it (The "Trace" Trick)

To build the "AND" switch for these complex numbers, they used a concept from the study of finite fields (like a very small, closed universe of numbers). They used something called a "Trace," which is like a special scanner that looks at a number and tells you if it has certain properties (0 or 1).

They used this scanner to mix the numbers together in a very specific way to create the "AND" operation. They showed that this operation is:

Commutative: Order doesn't matter ( $A$ AND $B$ is the same as $B$ AND $A$ ).
Associative: Grouping doesn't matter ( $(A$ AND $B)$ AND $C$ is the same as $A$ AND ( $B$ AND $C$ )).
Distributive: It plays nicely with addition.

5. The "Recipe Book" (Examples)

The paper ends with a cookbook. They show exactly how to write the formula for the "AND" switch for specific sizes of these calculators:

For a 4-number system ( $n=2$ ), the formula is one thing.
For an 8-number system ( $n=3$ ), the formula gets longer.
For a 32-number system ( $n=5$ ), the formula is quite long, but they wrote it out perfectly.

Summary

In simple terms, this paper says: "If you have a mathematical system where numbers cancel themselves out when added and repeat themselves when multiplied enough times, you can secretly build a perfect computer logic system inside it."

They didn't just say it's possible; they gave the exact blueprints (formulas) to build the logic gates (AND, OR, NOT) for any size of this system. This connects the abstract world of algebra (rings) directly to the logical world of computer science (Boolean algebras) in a way that works for a much wider range of numbers than we knew before.

Technical Summary: Lattices and Semilattices Derived from Commutative Rings of Characteristic 2

Problem Statement
The paper addresses the algebraic relationship between commutative rings of characteristic 2 satisfying the polynomial identity $x^{2^n} \approx x$ and lattice-theoretic structures. While it is a classical result (Boole, Birkhoff) that unitary Boolean rings (satisfying $x^2 \approx x$ ) are equivalent to Boolean algebras, and that rings satisfying $x^4 \approx x$ also yield Boolean algebras, the generalization to rings satisfying $x^{2^n} \approx x$ for arbitrary positive integers $n$ remained an open question. The authors aim to determine whether such rings naturally induce a meet-semilattice structure and, if unitary, a full Boolean algebra structure via specific term operations.

Methodology
The authors employ a constructive algebraic approach, defining new binary term operations on the rings in question and verifying their properties against the axioms of semilattices and Boolean algebras.

Semilattice Construction (Non-Unitary Case):
For a commutative ring $R$ of characteristic 2 satisfying $x^{2^n} \approx x$ (where $q = 2^n$ ), the authors define a binary operation $\wedge$ as:
$x \wedge y := \sum_{i=1}^{q-1} x^i y^{q-i}$
They utilize induction and the properties of characteristic 2 (specifically $(x+y)^{2^k} = x^{2^k} + y^{2^k}$ ) to prove that this operation is idempotent, commutative, and associative. They further establish that the induced order $x \leq y \iff xy = x^2$ makes $(R, \wedge)$ a meet-semilattice with a smallest element 0.
Boolean Algebra Construction (Unitary Case):
To derive a Boolean algebra, the operation $\wedge$ defined above is insufficient because it is not generally distributive with respect to addition in the variety of such rings. The authors restrict their analysis to finite fields $\mathbb{F}_q$ first.
- They utilize the Normal Basis Theorem and the concept of the trace function ( $\text{Tr}$ ) to construct a new, distributive binary term operation $\wedge$ on $\mathbb{F}_q$ . This operation is defined using dual normal bases $\{\alpha_i\}$ and $\{\beta_i\}$ :
  $x \wedge y := \sum_{i,j=0}^{n-1} \text{Tr}(\alpha \beta_i \beta_j) x^{2^i} y^{2^j}$
- They prove that on $\mathbb{F}_q$ , this operation is idempotent, commutative, associative, and distributive over addition, satisfying $x \wedge 1 = x$ .
- Using Theorem 2.1, they define the join operation as $x \vee y := x + y + (x \wedge y)$ and the complement as $x' := x + 1$ .
Generalization to Arbitrary Rings:
The authors invoke the result that the variety $V_n$ of unitary commutative rings of characteristic 2 satisfying $x^{2^n} \approx x$ is generated by the finite field $\mathbb{F}_{2^n}$ (specifically, $V_n = SP(\{\mathbb{F}_{2^n}\})$ ). Since the term operations derived for the field are preserved under subalgebras and direct products, the Boolean algebra structure extends to any ring in $V_n$ .

Key Contributions and Results

Semilattice Derivation: The paper proves that any commutative ring of characteristic 2 satisfying $x^{2^n} \approx x$ (unitary or not) forms a meet-semilattice with smallest element 0 under the operation $x \wedge y = \sum_{i=1}^{2^n-1} x^i y^{2^n-i}$ . The induced order is $x \leq y \iff xy = x^2$ .
Boolean Algebra Derivation: For unitary rings in this class, the authors construct a specific term operation $\wedge$ (based on trace and normal bases) that, together with $x \vee y = x + y + (x \wedge y)$ and $x' = x + 1$ , forms a Boolean algebra.
Explicit Formulas: The paper provides explicit polynomial formulas for the meet operation $\wedge$ for small values of $n$ ( $n=1$ to $n=5$ ), demonstrating the complexity of the terms as $n$ increases. For instance, for $n=2$ (rings satisfying $x^4 \approx x$ ), the operation is $x \wedge y = xy^2 + x^2y + x^2y^2$ .
Variety Generation: The paper establishes that the variety $V_n$ is generated by the single finite field $\mathbb{F}_{2^n}$ , which is crucial for extending the field-based construction to general rings.

Significance and Claims
The paper claims to generalize previous results by Chajda and Kolařík (who treated cases $n=3, 4$ ) and earlier work by Boole and Birkhoff (case $n=1$ ) and others (case $n=2$ ) to the case of arbitrary positive integers $n$ .

The authors state that their primary contribution is proving that the correspondence between unitary rings satisfying $x^{2^n} \approx x$ and Boolean algebras holds for all $n$ , provided the correct term operations are derived. They note that while the semilattice structure is derived from a simple summation formula, the distributive lattice (Boolean) structure requires a more sophisticated construction involving the trace function and normal bases, which they explicitly provide. The paper concludes by presenting new explicit term operations for $n=5$ (rings satisfying $x^{32} \approx x$ ), which had not been previously detailed in the literature.