1. Introduction and Motivations
One of the most famous formulas in mathematics is the Euler’s relation:
It is related to an inequality, which has a geometrical interpretation (see the
Figure 1):
The Formulas (
1) and (
2) were unified in [
1], and there exists a matrix version of Formula (
1) in Remark 4:
where
On the other hand, the Yang–Baxter equation [
2] which appeared in theoretical physics and statistical mechanics (see [
3,
4,
5]) has led to many applications in these fields and is also related to the Euler’s formula. This equation can be understood as a unifying equation (see, for example, [
6,
7,
8]).
Some results obtained under the guidance of Stefan Papadima were presented at
The 14th International Workshop on Differential Geometry and Its Applications, Ploiesti, 2019 (DGA 14). It was observed during that workshop that some results from [
9] can be extended for the virtual braid groups from [
10]. Moreover, the techniques of [
11] can be considered in the framework of certain unification structures (from the article [
6]). The Yang–Baxter equation plays an important role in knot theory. Dăscălescu and Nichita have shown in [
12] how to associate a Yang–Baxter operator to an arbitrary associative algebra. Turaev has described in [
13] a general scheme to derive an invariant of oriented links from a Yang–Baxter operator, provided this one can be “enhanced”. The invariant which was obtained from these Yang–Baxter operators is the Alexander polynomial of knots. Thus, in a way, the Alexander polynomial is the knot invariant corresponding to the axioms of (unitary associative) algebras. (This result was highly appreciated by Stefan Papadima.) More recently, Cristina Anghel-Palmer has constructed a polynomial which unifies the Alexander and the Jones polynomials of knots (see [
14,
15]).
The main characters of our current paper are rings, Boolean algebras and Yang–Baxter systems. The rings and Boolean algebras are usually thought of as complementary structures because they arise from different theories, but sometimes it is useful to compare their axioms and properties. Our approach in this paper is somewhat enhanced from the usual point of view. Thus, we introduce structures which unify Boolean algebras and rings, called B–rings (B from Boolean algebras followed by ring).
After the definition of B–rings, we give examples, study the implications of this new approach and present some properties of these new structures.
2. Yang–Baxter Equations and Yang–Baxter Systems
Before presenting the unification of rings and Boolean algebras, we need to recall some facts about the Yang–Baxter equation and related structures. Moreover, a certain type of solution to the “colored” Yang–Baxter equation will lead us to a matrix version of the Euler’s relation (
3).
The following notations and terminology will be used in this section: For the moment, we will work over a field k, and the tensor products will be defined over this field. Let V be a vector space over k. Let be the identity map of the space V. We denote by the twist map defined by .
For a k-linear map, let In a similar manner, we denote by a linear map acting on the first and third component of .
Definition 1. A
Yang–Baxter operator
is a k-linear map , which satisfies the braid condition (the Yang–Baxter equation):We also require that the map R is invertible. Remark 1. An important observation is that, if R satisfies (5), then both and satisfy the QYBE (the quantum Yang–Baxter equation):So, the Equations (5) and (6) are equivalent. Remark 2. The following construction of Yang–Baxter operators is described in [12]. If A is a k-algebra, then, for all non-zero , the linear mapis a Yang–Baxter operator. Remark 3. For a certain matrix J (see [1]), the colored operator satisfies the following version of the Yang–Baxter equation: Remark 4. With the formula in mind, we will return to Formula (3). By , we understand , in which we use the Taylor expansion of the function . We observe that (this follows from the Taylor expansion of the function ).
Now, . So, .
Remark 5. There is a similar terminology for the set-theoretical Yang–Baxter equation. In this case, V is replaced by a set X and the tensor product by the Cartesian product. For example, let , be defined by in a Boolean algebra. It follows that Remark 6. Example of solution to the set-theoretical Yang–Baxter equation.
Another interesting solution to the set-theoretical Yang–Baxter equation is given by the Boolean map .
We now present the Yang–Baxter systems theory following the paper [
16]. Yang–Baxter systems were introduced in [
17] as a spectral-parameter-independent generalization of quantum Yang–Baxter. They are conveniently defined in terms of
Yang–Baxter commutators. Consider three vector spaces
and three linear maps
,
and
.
Then a
Yang–Baxter commutator is a map
, defined by
In terms of a Yang–Baxter commutator, the quantum Yang–Baxter Equation (
6) is expressed simply as
.
Definition 2. Let V and be vector spaces. A system of linear mapsis called a WXZ-system or a Yang–Baxter system, provided the following equations are satisfied: There are several algebraic origins and applications of WXZ-systems (see [
18]).
3. Introduction to B–Ring Theory
The rings [
19] and Boolean algebras [
19] are usually thought of as complementary structures because they arise from different theories, but sometimes it is useful to compare their axioms and properties. Our approach in this section is different from that point of view. Thus, we introduce structures which unify Boolean algebras and rings, called B–rings (
B from Boolean algebras followed by
ring). After the definition of B–rings, we give examples and counterexamples. Then, we study the implications of this new approach and some properties of these new structures.
Definition 3. A
B–ring
is a 6–tuple , where is a set, ∨ and · are binary operations on X, and is a unary operation on X ().
These obey the following axioms.
• is a commutative monoid:
(1) ;
(2) ;
(3) .
• is a monoid:
(4) ;
(5) .
• 0 is an absorbing element:
(6) .
• The second operation is distributive with regard to the first operation:
(7) ;
(8) .
• The unary operation has some basic properties:
(9) ;
(10) ;
(11) ;
(12) .
If a B–ring satisfies the following De Morgan laws, we call it a
B–ring with DM:
(DM 1) ;
(DM 2)
Remark 7. Several properties in a B–ring follow right away: (from the commutativity of ∨), and (since .
Notice that we do not require ; also, .
Definition 4. We define new operations in a B–ring: and . In addition, let .
At this moment it is convenient to present some properties of B–rings which resemble the properties of Boolean algebras. We have the following table of operations in a B–ring (see
Figure 2):
Remark 8. Examples of B-rings.
Any Boolean algebra is a B–ring with DM. In this case the second operation is ∧. The hardest part is to verify the De Morgan laws. In addition, in this case, .
Remark 9. Examples of B-rings which are not Boolean algebras.
Any ring is a B–ring with DM. The first operation is just the addition (usually denoted by +), and the unary operation is . For example, in this case, .
Remark 10. An example of a B-ring which is neither a Boolean algebra nor a ring.
One could introduce a B–ring structure on which is neither a ring nor a Boolean algebra.
Thus, 0 is the neutral element for the commutative operation ∨:
.
The neutral element for the commutative operation · is 3 (0 is an absorbing element):
.
This structure is in fact a Cartesian product between viewed as a ring and viewed as a Boolean algebra.
Theorem 1 (Duality Theorem). For a B–ring (with DM), , one could associate another B–ring (with DM), namely .
Moreover, this association is functorial, and applying the corresponding functor twice leads to the initial B–ring (see the Figure 3). Proof. The proof is direct for B–rings, and it is left for the reader. However, the question if the dual of a B–ring with DM is a B–ring with DM is harder. We will now check some axioms of the new B–ring.
(the axiom (1)).
imply ; so, .
From (DM 1), we have ; so, ; so,
; so, . □
Remark 11. For a better understanding of the implications of the above theorem, we consider the following example. We start with the usual ring (, +, 0, ×, 1). In view of the above theorem, we obtain a new ring (, ⊕, 1, ⊗, 0), where and . It can be checked by hand that: , , , , etc.
We now consider a question somewhat complementary to the main definition (our Definition 3).
Remark 12. Our results so far could be summarized by the following diagram:
Figure 3.
B–rings are structures which generalize both rings and Boolean algebras. In other words, a ring (respectively, a Boolean algebra) could be understood as a B–ring.
Figure 3.
B–rings are structures which generalize both rings and Boolean algebras. In other words, a ring (respectively, a Boolean algebra) could be understood as a B–ring.
The question is to find structures which are, to some extent, both rings and Boolean algebras. In other words, such a structure is a ring and a Boolean algebra at the same time.
Of course, a structure with one element could be thought of both as a ring and a Boolean algebra.
Another answer would refer to a 7–tuple , in which we consider a mixed structure: a Boolean algebra () and a ring (). For example, the subsets of a given set (i.e., ), could be thought of both as a Boolean algebra (with the union and intersection) and as a ring (with the symmetric difference and intersection).
For other applications of B-rings, we will use the concepts of the Yang–Baxter equation and Yang–Baxter system.
Theorem 2. We have the following solution to the set-theoretical braid condition in a B–ring:
.
Proof. We compute the left-hand side of the braid condition, then the right-hand side, and then we use the axioms (7), (10) and (12).
;
. □
Theorem 3. We have the following solution to the set-theoretical Yang–Baxter system in a B–ring B: Proof. The first two conditions from the definition of Yang–Baxter systems, , follow from classical theory (see the Remarks 1 and 2). A direct check could easily be performed also.
We now compute the left-hand side of the condition (11) from the definition of Yang–Baxter systems, then the right-hand side, and then we use the axiom (7).
The last condition is left to the reader. □