This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

\urladdr

https://tomasz-kowalski.github.io

Varieties of semiassociative relation algebras and tense algebras

James M. Koussas Department of Mathematics & Statistics
La Trobe University
Victoria 3086
Australia
[email protected]
   Tomasz Kowalski Department of Mathematics & Statistics
La Trobe University
Victoria 3086
Australia
[email protected]
Abstract.

It is well known that the subvariety lattice of the variety of relation algebras has exactly three atoms. The (join-irreducible) covers of two of these atoms are known, but a complete classification of the (join-irreducible) covers of the remaining atom has not yet been found. These statements are also true of a related subvariety lattice, namely the subvariety lattice of the variety of semiassociative relation algebras. The present article shows that this atom has continuum many covers in this subvariety lattice (and in some related subvariety lattices) using a previously established term equivalence between a variety of tense algebras and a variety of semiassociative rr-algebras.

Key words and phrases:
Semiassociative relation algebras, tense algebras, lattices of subvarieties.
1991 Mathematics Subject Classification:
03G15, 06E25, 08B15

1. Introduction

Varieties have been a major focus of research in relation algebras for a number of years. For example, several of the early landmark results in the subject focus on the variety of representable relation algebras. In 1955, Tarski showed in [25] that the class of all representable relation algebras is indeed a variety. A year later, in [19], Lyndon gave the first (equational) basis for this variety. In 1964, Monk showed in [24] that this variety is not finitely based.

The lattice of subvarieties of the variety of all relation algebras was first studied extensively by Jónsson in [14], although Tarski did publish some results much earlier in [26]. In [26], Tarski showed, using a result from Jónsson and Tarski [16], that this lattice has exactly three atoms. These atoms are generated by 𝐀1\mathbf{A}_{1}, 𝐀2\mathbf{A}_{2}, and 𝐀3\mathbf{A}_{3} (the minimal subalgebras of the full relation algebras on a 1-element set, a 2-element set, and a 3-element set, respectively). As the variety of relation algebras is congruence distributive, we only need to look for join-irreducible varieties to find the other varieties of small height. It follows from results in [16] that the variety generated by 𝐀1\mathbf{A}_{1} has no join-irreducible covers. In [3], Andréka, Jónsson, and Németi showed that the variety generated by 𝐀2\mathbf{A}_{2} has exactly one join-irreducible cover. The variety generated by 𝐀3\mathbf{A}_{3} is known to have at least 20 finitely generated join-irreducible covers and at least one infinitely generated join-irreducible cover; generators of these covers are listed by Jipsen in [11]. However, it is not yet known if there are more covers. The problem of completely classifying these covers is posed (in various forms) by Jónsson and Maddux in [20], by Hirsch and Hodkinson in [10], and by Givant in [8]. Further results on this lattice can be found in Jónsson [14] and Andréka, Givant, and Németi [1], for example.

Semiassociative relation algebras arise fairly naturally in the study of relation algebras and the calculus of relations; see Maddux [21], for example. As such, the subvariety lattice of the variety of all semiassociative relation algebras has attracted interest from researchers in this field. In [3], Andréka, Jónsson, and Németi show that the properties of the subvariety lattice of the variety of relation algebras that we mentioned above also hold in this lattice. In [13], Jipsen, Kramer, and Maddux show that 𝐀3\mathbf{A}_{3} has a countably infinite family of covers (in the semiassociative case) by constructing a term equivalence and a countably infinite family of covers of the variety generated by 𝐓0\mathbf{T}_{0} (the two element Boolean algebra with a pair of identity operators). In 1999, the problem of showing that 𝐓0\mathbf{T}_{0} has continuum many covers was posed by Peter Jipsen in a conversation with the second author relating to Kowalski [17]. In Section 3 of the present article we will solve this problem, and hence conclude that 𝐀3\mathbf{A}_{3} has continuum many covers in the subvariety lattice of the variety of semiassociative relation algebras.

2. Preliminaries

2.1. Relation-type algebras

For an extensive introduction to the theory and history of relation algebras, we refer the reader to Hirsch and Hodkinson [10], Maddux [22] and Givant [9]; shorter introductions can be found in Chin and Tarski [7] and Jónsson [14]. For sources that cover nonassociative and semiassociative relation algebras, we refer the reader to Maddux [23], Maddux [21], Hirsch and Hodkinson [10], and Maddux [22]. Subvariety lattices are discussed in Jónsson [14], Andréka, Jónsson, and Németi [3], Jipsen [11], Andréka, Givant, and Németi [2], Jipsen, Kramer, and Maddux [13], Andréka, Givant, and Németi [1], and Givant [8]. We will begin by recalling some definitions from [23] and [13].

Definition 2.1.

An algebra 𝐀=A;,,,,˘,0,1,e\mathbf{A}=\langle A;\vee,\wedge,\cdot,{{}^{\prime}},\breve{\ },0,1,e\rangle is called a nonassociative relation algebra iff A;,,,0,1\langle A;\vee,\wedge,{{}^{\prime}},0,1\rangle is a Boolean algebra, \cdot is a binary operation, ee is an identity element for \cdot, and the triangle laws hold in 𝐀\mathbf{A}, i.e.,

(xy)z=0(x˘z)y=0(zy˘)x=0,(x\cdot y)\wedge z=0\iff(x\breve{\ }\cdot z)\wedge y=0\iff(z\cdot y\breve{\ })\wedge x=0,

for all x,y,zAx,y,z\in A. A nonassociative relation algebra 𝐀\mathbf{A} is called a semiassociative relation algebra iff 𝐀\mathbf{A} satisfies (x1)1x1(x\cdot 1)\cdot 1\approx x\cdot 1. A nonassociative relation algebra is called reflexive iff xxxx\leqslant x\cdot x, for all xAx\in A. A nonassociative relation algebra 𝐀\mathbf{A} is called symmetric iff 𝐀\mathbf{A} satisfies x˘xx\breve{\ }\approx x. A nonassociative relation algebra 𝐀\mathbf{A} is called subadditive iff x(xy)xyx\cdot(x^{\prime}\wedge y)\leqslant x\vee y, for all x,yAx,y\in A.

The triangle laws are equivalent to an equation modulo the other axioms of nonassociative relation algebras (see Theorem 1.4 of [23]), so the classes of all nonassociative relation algebras, semissociative relation algebras, and reflexive subadditive symmetric semiassociative relation algebras are varieties.

Notation 2.2.

The subvariety lattices of the varieties of nonassociative relation algebras, semiassociative relation algebras and reflexive subadditive symmetric semiassociative algebras will be denoted by 𝚲NA\boldsymbol{\Lambda}_{\textup{NA}}, 𝚲SA\boldsymbol{\Lambda}_{\textup{SA}} and 𝚲RSA\boldsymbol{\Lambda}_{\textup{RSA}}, respectively.

2.2. Tense algebras

For an introduction to the theory and history of tense (or temporal) algebras, we refer the reader to Kracht [18] and Blackburn, de Rijke, and Venema [4]. We refer the reader to Hirsch and Hodkinson [10] and Maddux [22] for an introduction to the theory of Boolean algebras with conjugated operators; Jónsson and Tarski [15] is a shorter introduction. We will need the following definitions from [13].

Definition 2.3.

An algebra 𝐀=A;,,,f,g,0,1\mathbf{A}=\langle A;\vee,\wedge,{{}^{\prime}},f,g,0,1\rangle is called a tense algebra iff A;,,,0,1\langle A;\vee,\wedge,{{}^{\prime}},0,1\rangle is a Boolean algebra, and ff and gg are a conjugate pair, i.e.,

f(x)y=0xg(y)=0,f(x)\wedge y=0\iff x\wedge g(y)=0,

for all x,yAx,y\in A. A tense algebra 𝐀\mathbf{A} is called total iff f(x)g(x)=1f(x)\vee g(x)=1, for all xAx\in A with x0x\neq 0.

A concrete example of a tense algebra is the complex algebra of a frame, i.e., a directed graph. Recall that the complex algebra of a frame U;R\langle U;R\rangle is the algebra 𝐂𝐦(U;R):=(U);,,,cfR,gR,,U\operatorname{\mathbf{Cm}}(\langle U;R\rangle)\mathrel{\mathop{:}}=\langle\raise 2.21735pt\hbox{{\scalebox{1.125}[1.125]{$\wp$}}}(U);\cup,\cap,{{}^{c}},f_{R},g_{R},\varnothing,U\rangle, where (U)\raise 2.21735pt\hbox{{\scalebox{1.125}[1.125]{$\wp$}}}(U), c, fRf_{R}, and gRg_{R} respectively denote the powerset of UU, complementation relative to UU, the image operation defined by RR, and the preimage operation defined by RR. Thus, we have

fR(X)\displaystyle f_{R}(X) ={uU(x,u)R, for some xX},\displaystyle=\{u\in U\mid(x,u)\in R,\textrm{ for some }x\in X\},
gR(X)\displaystyle g_{R}(X) ={uU(u,x)R, for some xX},\displaystyle=\{u\in U\mid(u,x)\in R,\textrm{ for some }x\in X\},

for all XUX\subseteq U.

The fact that ff and gg form a conjugate pair can be expressed by equations (see Theorem 1.15 of [15]), so the class of all tense algebras is a variety. The class of all total tense algebras is not a variety, but the variety it generates is finitely based (see Jipsen [12]).

Notation 2.4.

The subvariety lattice of the variety of tense algebras will be denoted by 𝚲TA\boldsymbol{\Lambda}_{\textrm{TA}}. The subvariety lattice of the variety generated by the class of all total tense algebras will be denoted by 𝚲TTA\boldsymbol{\Lambda}_{\textrm{TTA}}.

The variety of reflexive subadditive symmetric semiassociative rr-algebras (reflexive subadditive symmetric semiassociative relation algebras without the requirement of an identity element) is known to be term equivalent to 𝚲TTA\boldsymbol{\Lambda}_{\textrm{TTA}} (see Theorem 7 of [13]). This observation can be used to establish the following result (see Section 4 of [13]). Here we use Var(𝐀)\operatorname{Var}(\mathbf{A}) to denote variety generated by an algebra 𝐀\mathbf{A}.

Proposition 2.5.

Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) has at least as many covers (in 𝚲RSA\boldsymbol{\Lambda}_{\textup{RSA}}) as Var(𝐓0)\operatorname{Var}(\mathbf{T}_{0}) (in 𝚲TTA\boldsymbol{\Lambda}_{\textup{TTA}}).

We conclude this section with some standard results that we use later. We call a binary relation RR on a set UU total when (x,y)R(x,y)\in R or (y,x)R(y,x)\in R, for all x,yUx,y\in U; we do not require that xyx\neq y, so total relations are reflexive. The following results can be found in Section 1 of [13] and Chapter 2 of [11].

Proposition 2.6.
  1. (1)

    Let RR be a total binary relation on a set UU. Then 𝐂𝐦(U;R)\operatorname{\mathbf{Cm}}(\langle U;R\rangle) is a total tense algebra.

  2. (2)

    Let 𝐀\mathbf{A} be a total tense algebra. Then 𝐀\mathbf{A} is discriminator.

Lastly, we state some basic results on discriminator varieties; we refer the reader to Lemma 9.2 and Theorem 9.4 of [6]. Here we use 𝕀\operatorname{\mathbb{I}}, 𝕊\operatorname{\mathbb{S}}, and 𝕌\operatorname{\mathbb{U}} for the usual class operators of taking all isomorphic copies, subalgebras, and ultraproducts of a class of similar algebras, respectively.

Proposition 2.7.

Let 𝒦\mathcal{K} be a class of similar non-trivial algebras with a common discriminator term. Then

  1. (1)

    every element of 𝒦\mathcal{K} is simple,

  2. (2)

    all directly indecomposable and subdirectly irreducible elements of Var(𝒦)\operatorname{Var}(\mathcal{K}) are simple,

  3. (3)

    the class of simple (and therefore the class of subdirectly irreducible) elements of Var(𝒦)\operatorname{Var}(\mathcal{K}) is precisely 𝕀𝕊𝕌(𝒦)\operatorname{\mathbb{ISU}}(\mathcal{K}).

3. Uncountable collections of varieties

In this section we will construct continuum many varieties that cover Var(𝐓0)\operatorname{Var}(\mathbf{T}_{0}) in 𝚲TTA\boldsymbol{\Lambda}_{\textrm{TTA}} and hence show that Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) has continuum many covers in 𝚲RSA\boldsymbol{\Lambda}_{\textrm{RSA}}. These varieties are generated by the complex algebras of an uncountable collection of frames with a very strong resemblance to the recession frames that were defined by Blok in [5] and by Jipsen, Kramer, and Maddux in [13]. Roughly speaking, in the terminology of [13], these frames are ω\omega-recession frames with minor modifications that are combined like a \mathbb{Z}-recession frame. Before we make this more explicit, we will need to introduce some notation.

Notation 3.1.

Let 𝔼\mathbb{E} and 𝕆\mathbb{O} denote {2nn}\{2n\mid n\in\mathbb{N}\} and {2n+1n}\{2n+1\mid n\in\mathbb{N}\}, respectively (where :={pp>0}\mathbb{N}\mathrel{\mathop{:}}=\{p\in\mathbb{Z}\mid p>0\}). For each S𝕆S\subseteq\mathbb{O}, let S𝔼:=S𝔼S_{\mathbb{E}}\mathrel{\mathop{:}}=S\cup\mathbb{E}.

Now we can define the frames we will be working with. We use ap,ma_{p,m} for an arbitrary vertex (or node) because vertices correspond to atoms of complex algebras, and to match the notation used in [13].

Definition 3.2.

Let ap,ma_{p,m} be a (distinct) vertex, for each pp\in\mathbb{Z} and mm\in\mathbb{N}. Define V:={ap,mp,m}V\mathrel{\mathop{:}}=\{a_{p,m}\mid p\in\mathbb{Z},m\in\mathbb{N}\}. For each S𝕆S\subseteq\mathbb{O}, let

RS:=\displaystyle R_{S}\mathrel{\mathop{:}}=\phantom{} {(ap,m,aq,n)p>q or (p=q and mn)}\displaystyle\{(a_{p,m},a_{q,n})\mid p>q\textrm{ or }(p=q\textrm{ and }m\geqslant n)\}
{(ap,1,ap+1,m)p,mS𝔼}\displaystyle\cup\{(a_{p,1},a_{p+1,m})\mid p\in\mathbb{Z},m\in S_{\mathbb{E}}\}
{(ap,m,ap,m+1)p,m}\displaystyle\cup\{(a_{p,m},a_{p,m+1})\mid p\in\mathbb{Z},m\in\mathbb{N}\}

and let 𝐅S:=𝐂𝐦(V;RS)\mathbf{F}_{S}\mathrel{\mathop{:}}=\operatorname{\mathbf{Cm}}(\langle V;R_{S}\rangle).

As is usually the case with frames, a diagram is easier to work with than a written description. Thus, we will usually refer to Figure 1.

\cdots\cdots\cdots\cdots\cdotsa0,5a_{0,5}a0,4a_{0,4}a0,3a_{0,3}a0,2a_{0,2}a0,1a_{0,1}a1,5a_{1,5}a1,4a_{1,4}a1,3a_{1,3}a1,2a_{1,2}a1,1a_{1,1}a2,5a_{2,5}a2,4a_{2,4}a2,3a_{2,3}a2,2a_{2,2}a2,1a_{2,1}a1,5a_{-1,5}a1,4a_{-1,4}a1,3a_{-1,3}a1,2a_{-1,2}a1,1a_{-1,1}a2,5a_{-2,5}a2,4a_{-2,4}a2,3a_{-2,3}a2,2a_{-2,2}a2,1a_{-2,1}\vdots\vdots\vdots\vdots\vdots\vdots\vdots\vdots\vdots\vdots
Figure 1. A graph drawing of V;RS\langle V;R_{S}\rangle.

This graph drawing uses some conventions from [13]. To reduce clutter, we exclude loops, as there are loops at every vertex. The thick vertical arrow indicates that a vertex points at each vertex below it. For example, a1,1a_{1,1} points at a0,1a_{0,1}, a0,2a_{0,2}, and a1,1a_{-1,1}. The thick horizontal arrows indicate that a vertex points at each vertex to its right. For example, a1,3a_{1,3} points at a1,2a_{1,2} and a1,1a_{1,1}. Dashed arrows indicate edges whose inclusion depends on the choice of SS. For example, a0,1a_{0,1} points at a1,3a_{1,3} and a1,1a_{1,1} points at a2,3a_{2,3} and a2,3a_{2,3} when 3S3\in S, but a0,1a_{0,1} and a1,1a_{1,1} do not point at a1,3a_{1,3} and a2,3a_{2,3}, respectively, when 3S3\notin S.

For another example, we will list all of the vertices that a0,1a_{0,1} points at. When mm\in\mathbb{N} is even, a0,1a_{0,1} always points at a1,ma_{1,m}. If m𝕆m\in\mathbb{O}, then a0,1a_{0,1} points at a1,ma_{1,m} when mSm\in S. If p<0p<0 and mm\in\mathbb{N}, then a0,1a_{0,1} always points at ap,ma_{p,m}. Lastly, a0,1a_{0,1} always points at a0,1a_{0,1} and a0,2a_{0,2}.

Firstly, we will need to check that these relations are total.

Lemma 3.3.

Let S𝕆S\subseteq\mathbb{O}. Then RSR_{S} is total.

Proof.

Let p,qp,q\in\mathbb{Z} and let m,nm,n\in\mathbb{N}. As mmm\geqslant m, we have (ap,m,ap,m)RS(a_{p,m},a_{p,m})\in R_{S}, so RSR_{S} is reflexive. Assume that ap,maq,na_{p,m}\neq a_{q,n}. If p=qp=q, we must have mnm\neq n, hence m>nm>n or m<nm<n, so (ap,m,aq,n)RS(a_{p,m},a_{q,n})\in R_{S} or (aq,n,ap,m)RS(a_{q,n},a_{p,m})\in R_{S}. Similarly, when pqp\neq q, we have p>qp>q or p<qp<q, so (ap,m,aq,n)RS(a_{p,m},a_{q,n})\in R_{S} or (aq,n,ap,m)RS(a_{q,n},a_{p,m})\in R_{S}. Combining these results, we find that RR is total, which is what we wanted. ∎

Using Proposition 2.6 and Proposition 2.7(1), we get the following result.

Corollary 3.4.

Let S𝕆S\subseteq\mathbb{O}. Then every element of 𝕀𝕊(𝐅S)\operatorname{\mathbb{IS}}(\mathbf{F}_{S}) is simple.

The full complex algebras of these frames are too big for our purposes; we will instead work with the subalgebras generated by all of their atoms. Due to the difference in structure between our frames and the frames in [13], these algebras will be somewhat more difficult to describe explicitly than the algebras in [13]. However, these explicit descriptions are more convenient to work with, so we will use them to define the algebras we will be working with.

Definition 3.5.

For all pp\in\mathbb{Z}, mm\in\mathbb{N}, and S𝕆S\subseteq\mathbb{O}, let Vp:={ap,nn}V_{p}\mathrel{\mathop{:}}=\{a_{p,n}\mid n\in\mathbb{N}\}, Ap,m:={ap,m}A_{p,m}\mathrel{\mathop{:}}=\{a_{p,m}\}, Dp:={aq,nqp,n}D_{p}\mathrel{\mathop{:}}=\{a_{q,n}\mid q\leqslant p,n\in\mathbb{N}\}, Up:={aq,nqp,n}U_{p}\mathrel{\mathop{:}}=\{a_{q,n}\mid q\geqslant p,n\in\mathbb{N}\}, Sp,m:={ap,nnS𝔼,nm}S_{p,m}\mathrel{\mathop{:}}=\{a_{p,n}\mid n\in S_{\mathbb{E}},n\geqslant m\}, and S¯p,m:={ap,nnS𝔼,n>1,nm}\bar{S}_{p,m}\mathrel{\mathop{:}}=\{a_{p,n}\mid n\notin S_{\mathbb{E}},n>1,n\geqslant m\}. Now, for each S𝕆S\subseteq\mathbb{O}, let

𝒮S:={Ap,m,Sp,m,S¯p,mp,m}{Dp,Upp}\mathscr{S}_{S}\mathrel{\mathop{:}}=\{A_{p,m},S_{p,m},\bar{S}_{p,m}\mid p\in\mathbb{Z},m\in\mathbb{N}\}\cup\{D_{p},U_{p}\mid p\in\mathbb{Z}\}

and let S\mathscr{B}_{S} be the set of finite unions of elements of 𝒮S\mathscr{S}_{S}.

We aim to show that S\mathscr{B}_{S} is a subuniverse of 𝐅S\mathbf{F}_{S}, for all S𝕆S\subseteq\mathbb{O}. Firstly, we will describe the action of the operators of the elements of 𝒮S\mathscr{S}_{S}. To avoid double subscripts, we write fSf_{S} and gSg_{S} in place of fRSf_{R_{S}} and gRSg_{R_{S}}, respectively.

Lemma 3.6.

Let S𝕆S\subseteq\mathbb{O}, let pp\in\mathbb{Z}, let mm\in\mathbb{N}, and define T:={nS𝔼nm}T\mathrel{\mathop{:}}=\{n\in\mathbb{N}\setminus S_{\mathbb{E}}\mid n\geqslant m\}. Then

  1. (1)

    fS(Ap,1)=Ap,1Ap,2Dp1Sp+1,1f_{S}(A_{p,1})=A_{p,1}\cup A_{p,2}\cup D_{p-1}\cup S_{p+1,1},

  2. (2)

    fS(Ap,m)={Ap,nnm+1}Dp1f_{S}(A_{p,m})=\bigcup\{A_{p,n}\mid n\leqslant m+1\}\cup D_{p-1} if m>1m>1,

  3. (3)

    fS(Dp)=DpSp+1,1f_{S}(D_{p})=D_{p}\cup S_{p+1,1},

  4. (4)

    fS(Up)=Vf_{S}(U_{p})=V,

  5. (5)

    fS(Sp,m)=Dpf_{S}(S_{p,m})=D_{p},

  6. (6)

    fS(S¯p,m)=f_{S}(\bar{S}_{p,m})=\varnothing if T=T=\varnothing,

  7. (7)

    fS(S¯p,m)={Ap,nnmax(T)+1}Dp1f_{S}(\bar{S}_{p,m})=\bigcup\{A_{p,n}\mid n\leqslant\max(T)+1\}\cup D_{p-1} if TT\neq\varnothing is finite,

  8. (8)

    fS(S¯p,m)=Dpf_{S}(\bar{S}_{p,m})=D_{p} if TT is infinite,

  9. (9)

    gS(Ap,1)=Upg_{S}(A_{p,1})=U_{p},

  10. (10)

    gS(Ap,2)=Ap1,1Upg_{S}(A_{p,2})=A_{p-1,1}\cup U_{p},

  11. (11)

    gS(Ap,m)=Up+1Sp,m1S¯p,m1g_{S}(A_{p,m})=U_{p+1}\cup S_{p,m-1}\cup\bar{S}_{p,m-1} if m>1m>1 and mS𝔼m\notin S_{\mathbb{E}},

  12. (12)

    gS(Ap,m)=Ap1,1Up+1Sp,m1S¯p,m1g_{S}(A_{p,m})=A_{p-1,1}\cup U_{p+1}\cup S_{p,m-1}\cup\bar{S}_{p,m-1} if m>2m>2 and mS𝔼m\in S_{\mathbb{E}},

  13. (13)

    gS(Dp)=Vg_{S}(D_{p})=V,

  14. (14)

    gS(Up)=Ap1,1Upg_{S}(U_{p})=A_{p-1,1}\cup U_{p},

  15. (15)

    gS(Sp,m)=Ap1,1Upg_{S}(S_{p,m})=A_{p-1,1}\cup U_{p},

  16. (16)

    gS(S¯p,m)=g_{S}(\bar{S}_{p,m})=\varnothing if T=T=\varnothing,

  17. (17)

    gS(S¯p,m)=Sp,min(T)1S¯p,min(T)1Up+1g_{S}(\bar{S}_{p,m})=S_{p,\min(T)-1}\cup\bar{S}_{p,\min(T)-1}\cup U_{p+1} if TT\neq\varnothing.

Proof.

If XVX\subseteq V, then fS(X)f_{S}(X) is the set of vertices that are pointed at by XX, while gS(X)g_{S}(X) is the set of vertices that point at XX. From this and Figure 1, the required results follow immediately. ∎

Lemma 3.7.

Let S𝕆S\subseteq\mathbb{O}. Then S\mathscr{B}_{S} is the subuniverse of 𝐅S\mathbf{F}_{S} generated by 𝒮S\mathscr{S}_{S}.

Proof.

It is clear that 𝒮SS\mathscr{S}_{S}\subseteq\mathscr{B}_{S} and that any subuniverse of 𝐅S\mathbf{F}_{S} that extends 𝒮S\mathscr{S}_{S} also extends S\mathscr{B}_{S}, so it remains to show that S\mathscr{B}_{S} is a subuniverse of 𝐅S\mathbf{F}_{S}.

By definition, S\mathscr{B}_{S} is the set of all finite unions of elements of 𝒮S\mathscr{S}_{S}. Thus, S\mathscr{B}_{S} is closed under (binary) union and S\varnothing\in\mathscr{B}_{S}.

By distributivity, to show that S\mathscr{B}_{S} is closed under (binary) intersection, we only need to show that XYSX\cap Y\in\mathscr{B}_{S} if X,Y𝒮SX,Y\in\mathscr{S}_{S}. Let pp\in\mathbb{Z} and let mm\in\mathbb{N}. If X𝒮SX\in\mathscr{S}_{S}, then Ap,mX=A_{p,m}\cap X=\varnothing or Ap,mX=Ap,mA_{p,m}\cap X=A_{p,m}, hence Ap,mXSA_{p,m}\cap X\in\mathscr{B}_{S}. Clearly, UpUq=Umax(p,m)U_{p}\cap U_{q}=U_{\max(p,m)} and UpDq={Vrprq}U_{p}\cap D_{q}=\bigcup\{V_{r}\mid p\leqslant r\leqslant q\}, for all qq\in\mathbb{Z}. If qq\in\mathbb{Z}, nn\in\mathbb{N} and X{Sq,n,S¯q,n}X\in\{S_{q,n},\bar{S}_{q,n}\}, then we have UpX=XU_{p}\cap X=X when qpq\geqslant p and UpX=U_{p}\cap X=\varnothing when q<pq<p. Thus, UpXSU_{p}\cap X\in\mathscr{B}_{S} when X𝒮SX\in\mathscr{S}_{S}. If qq\in\mathbb{Z}, then it is clear that DpDq=Dmin(p,q)D_{p}\cap D_{q}=D_{\min(p,q)}. If X{Sq,n,S¯q,n}X\in\{S_{q,n},\bar{S}_{q,n}\}, for some qq\in\mathbb{Z} and nn\in\mathbb{N}, then DpX=XD_{p}\cap X=X if qpq\leqslant p and DpX=D_{p}\cap X=\varnothing if q>pq>p. From this, it follows that DpXSD_{p}\cap X\in\mathscr{B}_{S}, for all X𝒮SX\in\mathscr{S}_{S}. If qq\in\mathbb{Z} and nn\in\mathbb{N}, then we have Sp,mSq,n=Sp,max(m,n)S_{p,m}\cap S_{q,n}=S_{p,\max(m,n)} when q=pq=p and Sp,mSq,n=S_{p,m}\cap S_{q,n}=\varnothing when qpq\neq p. Clearly, Sp,mS¯q,n=S_{p,m}\cap\bar{S}_{q,n}=\varnothing, for all pp\in\mathbb{Z} and nn\in\mathbb{N}, so Sp,mXSS_{p,m}\cap X\in\mathscr{B}_{S} if X𝒮SX\in\mathscr{S}_{S}. If qq\in\mathbb{Z} and nn\in\mathbb{N}, then we have S¯p,mS¯q,n=Sp,max(m,n)\bar{S}_{p,m}\cap\bar{S}_{q,n}=S_{p,\max(m,n)} when q=pq=p and S¯p,mS¯q,n=\bar{S}_{p,m}\cap\bar{S}_{q,n}=\varnothing otherwise, so S¯p,mXS\bar{S}_{p,m}\cap X\in\mathscr{B}_{S}, for all X𝒮SX\in\mathscr{S}_{S}. Combining these results, we find that S\mathscr{B}_{S} is closed under intersection.

From De Morgan’s laws and the observations above, to show the closure of S\mathscr{B}_{S} under forming complements, it will be enough to show that XcSX^{c}\in\mathscr{B}_{S} if X𝒮SX\in\mathscr{S}_{S}. As Ap,mc={Ap,nn<m}Up+1Dp1Sp,m+1S¯p,m+1A_{p,m}^{c}=\bigcup\{A_{p,n}\mid n<m\}\cup U_{p+1}\cup D_{p-1}\cup S_{p,m+1}\cup\bar{S}_{p,m+1}, Upc=Dp1U_{p}^{c}=D_{p-1}, Dpc=Up+1D_{p}^{c}=U_{p+1}, Sp,mc={Ap,nn<m}S¯p,mUp+1Dp1S_{p,m}^{c}=\bigcup\{A_{p,n}\mid n<m\}\cup\bar{S}_{p,m}\cup U_{p+1}\cup D_{p-1} and S¯p,mc={Ap,nn<m}Sp,mUp+1Dp1\bar{S}_{p,m}^{c}=\bigcup\{A_{p,n}\mid n<m\}\cup S_{p,m}\cup U_{p+1}\cup D_{p-1}, it follows that S\mathscr{B}_{S} is closed under forming complements. As S\varnothing\in\mathscr{B}_{S}, this result tells us that VSV\in\mathscr{B}_{S}.

By additivity, to show that S\mathscr{B}_{S} is closed under fSf_{S} and gSg_{S}, we only need to check that fS(X),gS(X)Sf_{S}(X),g_{S}(X)\in\mathscr{B}_{S} if X𝒮SX\in\mathscr{S}_{S}. This follows from Lemma 3.6, so S\mathscr{B}_{S} is indeed a subuniverse of 𝐅S\mathbf{F}_{S}, which is what we wanted. ∎

This result allows us to make the following definition.

Notation 3.8.

Let S𝕆S\subseteq\mathbb{O}. The subalgebra of 𝐅S\mathbf{F}_{S} with universe S\mathscr{B}_{S} will be denoted by 𝐁S\mathbf{B}_{S}.

Before we show that these algebras have the properties we want, we will show that they are generated by any element of the form VpV_{p}, for some pp\in\mathbb{Z}.

Lemma 3.9.

Let S𝕆S\subseteq\mathbb{O}, let XVX\subseteq V and assume that there is a maximal pp\in\mathbb{Z} with VpXV_{p}\cap X\neq\varnothing, say qq. Then

  1. (1)

    fS4(X)fS2(X)c=Vq+2f_{S}^{4}(X)\cap f_{S}^{2}(X)^{c}=V_{q+2} if aq,1Xa_{q,1}\in X,

  2. (2)

    fS5(X)fS3(X)c=Vq+2f_{S}^{5}(X)\cap f_{S}^{3}(X)^{c}=V_{q+2} if aq,1Xa_{q,1}\notin X.

Proof.

Firstly, assume that aq,1Xa_{q,1}\in X. Based on Figure 1, fS2(X)=Dq+1f_{S}^{2}(X)=D_{q+1} and fS4(X)=Dq+2f_{S}^{4}(X)=D_{q+2}, which implies that fS4(X)fS2(X)c=Vq+2f_{S}^{4}(X)\cap f_{S}^{2}(X)^{c}=V_{q+2}. Thus, (1) holds.

Now, assume that we have aq,1Xa_{q,1}\notin X. Similarly to the previous case, fS3(X)=Dq+1f_{S}^{3}(X)=D_{q+1} and fS5(X)=Dq+2f_{S}^{5}(X)=D_{q+2}, hence fS5(X)fS3(X)c=Vq+2f_{S}^{5}(X)\cap f_{S}^{3}(X)^{c}=V_{q+2}. Thus, (2) also holds. ∎

We will need the following argument later, so we isolate it here. Firstly, we define some terms (in the signature {,,,f,g,0,1}\{\vee,\wedge,{{}^{\prime}},f,g,0,1\} of tense algebras).

Definition 3.10.
  1. (1)

    Let β(x):=f4(x)f2(x)\beta(x)\mathrel{\mathop{:}}=f^{4}(x)\wedge f^{2}(x)^{\prime}.

  2. (2)

    Let σ(x):=f(x)(xg2(β(x))f4(g10(β(x))g8(β(x))))\sigma(x)\mathrel{\mathop{:}}=f(x)\wedge(x\vee g^{2}(\beta(x))\vee f^{4}(g^{10}(\beta(x))\wedge g^{8}(\beta(x))^{\prime}))^{\prime}.

  3. (3)

    Let ν3(x):=f(σ(x))f(x)\nu_{3}(x)\mathrel{\mathop{:}}=f(\sigma(x))\wedge f(x)^{\prime}.

  4. (4)

    Let ν4(x):=f(ν3(x))f(σ(x))\nu_{4}(x)\mathrel{\mathop{:}}=f(\nu_{3}(x))\wedge f(\sigma(x))^{\prime}.

  5. (5)

    For each n5n\geqslant 5, let νn:=f(νn1(x))f(νn2(x))\nu_{n}\mathrel{\mathop{:}}=f(\nu_{n-1}(x))\wedge f(\nu_{n-2}(x))^{\prime}.

Lemma 3.11.

Let S𝕆S\subseteq\mathbb{O} and let pp\in\mathbb{Z}. Then we have σ(Ap,1)=Ap,2\sigma(A_{p,1})=A_{p,2} and νn(σ(x))=Ap,n\nu_{n}(\sigma(x))=A_{p,n}, for all n3n\geqslant 3.

Proof.

By Lemma 3.9(1), we have β(Ap,1)=Vp+2\beta(A_{p,1})=V_{p+2}. So, based on Figure 1, gS2(β(Ap,1))=Up+1g_{S}^{2}(\beta(A_{p,1}))=U_{p+1}. Similarly, gS8(Vp+2)=Up2g_{S}^{8}(V_{p+2})=U_{p-2} and gS10(Vp+2)=Up3g_{S}^{10}(V_{p+2})=U_{p-3}, hence fS4(gS10(β(Ap,1)gS8(β(Ap,1))c)=fS4(Vp3)=Dp1f_{S}^{4}(g_{S}^{10}(\beta(A_{p,1})\cap g_{S}^{8}(\beta(A_{p,1}))^{c})=f_{S}^{4}(V_{p-3})=D_{p-1}. By Lemma 3.6(1), we have σ(Ap,1)=Ap,2\sigma(A_{p,1})=A_{p,2}, as claimed.

Next, we will use a (strong) inductive argument for the second claim. By Lemma 3.6(1) and Lemma 3.6(2), ν3(Ap,1)=fS(Ap,2)fS(Ap,1)c=Ap,3\nu_{3}(A_{p,1})=f_{S}(A_{p,2})\cap f_{S}(A_{p,1})^{c}=A_{p,3} and ν4(Ap,1)=fS(Ap,3)fS(Ap,2)c=Ap,3\nu_{4}(A_{p,1})=f_{S}(A_{p,3})\cap f_{S}(A_{p,2})^{c}=A_{p,3} as σ(Ap,1)=Ap,2\sigma(A_{p,1})=A_{p,2}. Let n5n\geqslant 5 and assume that νm(Ap,1)=Ap,m\nu_{m}(A_{p,1})=A_{p,m}, for all 4mn4\leqslant m\leqslant n. From this assumption and Lemma 3.6(2), it follows that νn+1(Ap,1)=fS(Ap,n)fS(Ap,n1)c=Ap,n+1\nu_{n+1}(A_{p,1})=f_{S}(A_{p,n})\cap f_{S}(A_{p,n-1})^{c}=A_{p,n+1}. Thus, νm(Ap,1)=Ap,m\nu_{m}(A_{p,1})=A_{p,m}, for all m3m\geqslant 3, as claimed. ∎

Lemma 3.12.

Let S𝕆S\subseteq\mathbb{O} and let pp\in\mathbb{Z}. Then S\mathscr{B}_{S} is the subuniverse of 𝐁S\mathbf{B}_{S} generated by VpV_{p}.

Proof.

Let 𝒱p\mathscr{V}_{p} denote the subuniverse of 𝐁\mathbf{B} generated by VpV_{p}. By Lemma 3.7, it will be enough to show that 𝒮S𝒱p\mathscr{S}_{S}\subseteq\mathscr{V}_{p}.

Firstly, we claim that Vq𝒱pV_{q}\in\mathscr{V}_{p}, for every qq\in\mathbb{Z}. Based on Figure 1, Lemma 3.6(3) and Lemma 3.6(5), we have fS2m(Vp)=Dp+mf_{S}^{2m}(V_{p})=D_{p+m}, for each mm\in\mathbb{N}. This implies that Vp+m+1=fS2m+2(Vp)fS2m(Vp)c𝒱pV_{p+m+1}=f_{S}^{2m+2}(V_{p})\cap f_{S}^{2m}(V_{p})^{c}\in\mathscr{V}_{p}, for every mm\in\mathbb{N}, hence we have Vq𝒱pV_{q}\in\mathscr{V}_{p}, for every qm+2q\geqslant m+2. Similarly, if qq\in\mathbb{Z} and mm\in\mathbb{N}, then gS2m(Vq)=Uqmg_{S}^{2m}(V_{q})=U_{q-m}, hence Vqm1=gS2m+2(Vq)cgS2m(Vq)𝒱pV_{q-m-1}=g_{S}^{2m+2}(V_{q})^{c}\cap g_{S}^{2m}(V_{q})\in\mathscr{V}_{p}. Thus, we must have Vq𝒱pV_{q}\in\mathscr{V}_{p}, for all qq\in\mathbb{Z}, as claimed.

Based on Figure 1, Lemma 3.6(3) and Lemma 3.6(5), fS2(Vq1)=Dqf_{S}^{2}(V_{q-1})=D_{q}, for each qq\in\mathbb{Z}. Similarly, we also have gS2(Vq+1)=Uqg_{S}^{2}(V_{q+1})=U_{q}, for every qq\in\mathbb{Z}. Hence, by the previous result, we have Dq,Uq𝒱pD_{q},U_{q}\in\mathscr{V}_{p}, for all qq\in\mathbb{Z}.

By Lemma 3.6(13) and the previous result, Ap,1=g(Uq+1)Uq+1c𝒱pA_{p,1}=g(U_{q+1})\cap U_{q+1}^{c}\in\mathscr{V}_{p}, for all qq\in\mathbb{Z}. So, by Lemma 3.11, we have Ap,n𝒱pA_{p,n}\in\mathscr{V}_{p}, for all pp\in\mathbb{Z} and nn\in\mathbb{N}.

Based on Lemma 3.6(3), Sq,m=fS(Dq1)({Aq,nn<m}Dq1)cS_{q,m}=f_{S}(D_{q-1})\cap(\bigcup\{A_{q,n}\mid n<m\}\cup D_{q-1})^{c}. Hence, by the above results, we must have Sq,m𝒱pS_{q,m}\in\mathscr{V}_{p}, for all qq\in\mathbb{Z} and mm\in\mathbb{N}.

Clearly, we must have S¯q,m=({Aq,nn<m}Dq1Uq+1Sq,m)c\bar{S}_{q,m}=(\bigcup\{A_{q,n}\mid n<m\}\cup D_{q-1}\cup U_{q+1}\cup S_{q,m})^{c}, for all qq\in\mathbb{Z} and mm\in\mathbb{N}. So, based the above results, we must have S¯q,m𝒱p\bar{S}_{q,m}\in\mathscr{V}_{p}, for all qq\in\mathbb{Z} and mm\in\mathbb{N}.

Based on these results, 𝒱p=S\mathscr{V}_{p}=\mathscr{B}_{S}, which is what we wanted to show. ∎

Now we will shift our focus to varieties. To make use of Proposition 2.7(3), we will need a number of intermediate results.

Lemma 3.13.

Let S𝕆S\subseteq\mathbb{O} and let XSX\in\mathscr{B}_{S}. Then fS(X)Vf_{S}(X)\neq V or fS(Xc)Vf_{S}(X^{c})\neq V.

Proof.

By Lemma 3.7, XX and XcX^{c} can be represented as unions of finite subsets of 𝒮S\mathscr{S}_{S}. Clearly, only one of the unions will involve an element of {Upp}\{U_{p}\mid p\in\mathbb{Z}\}. So, based on Figure 1, we have fS(X)Vf_{S}(X)\neq V or fS(Xc)Vf_{S}(X^{c})\neq V, as required.∎

Lemma 3.14.

Let S𝕆S\subseteq\mathbb{O} and let XSX\in\mathscr{B}_{S} such that XX\neq\varnothing and fS(X)Vf_{S}(X)\neq V. Then there is a maximal pp\in\mathbb{Z} with VpXV_{p}\cap X\neq\varnothing.

Proof.

By Lemma 3.7, XX can be represented as the union of a finite subset of 𝒮\mathscr{S}. By assumption, fS(X)Vf_{S}(X)\neq V, so Lemma 3.6(iii) tells us that such a representation cannot involve an element of {Upp}\{U_{p}\mid p\in\mathbb{Z}\}. Since XX\neq\varnothing, there is maximal pp\in\mathbb{Z} with VpXV_{p}\cap X\neq\varnothing, as claimed. ∎

Using Lemma 3.9 and the preceding pair of results, it is easy to verify our previous claim that 𝐁S\mathbf{B}_{S} is the subalgebra of 𝐅S\mathbf{F}_{S} generated by its atoms, or by any element of S\mathscr{B}_{S}, for each S𝕆S\subseteq\mathbb{O}. The following result will allow us to obtain similar results for ultrapowers.

Lemma 3.15.

Let S𝕆S\subseteq\mathbb{O} and let p,qp,q\in\mathbb{Z}.

  1. (1)

    We have S={t𝐁S(Vp)t is a unary term}\mathscr{B}_{S}=\{t^{\mathbf{B}_{S}}(V_{p})\mid t\textrm{ is a unary term}\}.

  2. (2)

    If tt and ss are unary terms with t𝐁S(Vp)=s𝐁S(Vp)t^{\mathbf{B}_{S}}(V_{p})=s^{\mathbf{B}_{S}}(V_{p}), then we have t𝐁S(Vq)=s𝐁S(Vq)t^{\mathbf{B}_{S}}(V_{q})=s^{\mathbf{B}_{S}}(V_{q}).

  3. (3)

    There is an automorphism of 𝐁S\mathbf{B}_{S} that maps VpV_{p} to VqV_{q}.

Proof.

The first statement is an immediate consequence of Lemma 3.7, while (2) is evident from the self similarity of V;RS\langle V;R_{S}\rangle.

From (1) and (2), it follows that we can define a map μ:SS\mu\colon\mathscr{B}_{S}\to\mathscr{B}_{S} by setting μ(t𝐁(Vp))=t𝐁(Vq)\mu(t^{\mathbf{B}}(V_{p}))=t^{\mathbf{B}}(V_{q}), for every unary term tt. Combining (1) and (2), we find that μ\mu is a bijection. Based on (2), μ\mu is an endomorphism of 𝐁S\mathbf{B}_{S}. Thus, μ\mu is an automorphism of 𝐁S\mathbf{B}_{S}, so (3) holds. ∎

Lemma 3.16.

Let S𝕆S\subseteq\mathbb{O}, let II be a non-empty set, let 𝒰\mathscr{U} be an ultrafilter over II, and let XSIX\in\mathscr{B}_{S}^{I} with X/𝒰0X/\mathscr{U}\neq 0 and X/𝒰1X/\mathscr{U}\neq 1. Then 𝐁S\mathbf{B}_{S} embeds into the subalgebra of 𝐁SI/𝒰\mathbf{B}_{S}^{I}/\mathscr{U} generated by X/𝒰X/\mathscr{U}.

Proof.

By Lemma 3.13 and Łoś’s Theorem, f(X/𝒰)1f(X/\mathscr{U})\neq 1 or f(X/𝒰)1f(X/\mathscr{U}^{\prime})\neq 1. Without loss of generality, we can assume that f(X/𝒰)1f(X/\mathscr{U})\neq 1. By Lemma 3.9 and Lemma 3.14, either {iIfS4(X(i))fS2(X(i))c=Vp, for some p}\{i\in I\mid f_{S}^{4}(X(i))\cap f_{S}^{2}(X(i))^{c}=V_{p},\textrm{ for some }p\in\mathbb{Z}\} or {iIfS5(X(i))fS3(X(i))c=Vp, for some p}\{i\in I\mid f_{S}^{5}(X(i))\cap f_{S}^{3}(X(i))^{c}=V_{p},\textrm{ for some }p\in\mathbb{Z}\} is an element of 𝒰\mathscr{U}. Based on Lemma 3.15(3), 𝐁S\mathbf{B}_{S} embeds into the subalgebra of 𝐁SI/𝒰\mathbf{B}_{S}^{I}/\mathscr{U} generated by X/𝒰X/\mathscr{U}, as claimed. ∎

Note that we only needed the fact that ultrafilters are prime filters, hence this result applies to principal ultrafilters.

Lemma 3.17.

Let S𝕆S\subseteq\mathbb{O}. Then Var(𝐁S)\operatorname{Var}(\mathbf{B}_{S}) covers Var(𝐓0)\operatorname{Var}(\mathbf{T}_{0}) in 𝚲TTA\boldsymbol{\Lambda}_{\textup{TTA}}. Further, Var(𝐁S)\operatorname{Var}(\mathbf{B}_{S}) is join-irreducible.

Proof.

It is clear that {,V}\{\varnothing,V\} is a subuniverse of 𝐁S\mathbf{B}_{S}, and that the corresponding subalgebra of 𝐁S\mathbf{B}_{S} is isomorphic to 𝐓0\mathbf{T}_{0}. By Jónsson’s Theorem, Si(Var(𝐓0))=𝕀(𝐓0)\operatorname{Si}(\operatorname{Var}(\mathbf{T}_{0}))=\operatorname{\mathbb{I}}(\mathbf{T}_{0}), so by Lemma 3.4, we must have Var(𝐓0)Var(𝐁S)\operatorname{Var}(\mathbf{T}_{0})\subsetneq\operatorname{Var}(\mathbf{B}_{S}). Let 𝒱ΛTTA\mathcal{V}\in\Lambda_{\textrm{TTA}} with Var(𝐓0)𝒱Var(𝐁S)\operatorname{Var}(\mathbf{T}_{0})\subsetneq\mathcal{V}\subseteq\operatorname{Var}(\mathbf{B}_{S}). Clearly, Si(𝒱)Si(Var(𝐁S))\operatorname{Si}(\mathcal{V})\subseteq\operatorname{Si}(\operatorname{Var}(\mathbf{B}_{S})). By Proposition 2.7(3), Si(Var(𝐁S))=𝕀𝕊𝕌(𝐁S)\operatorname{Si}(\operatorname{Var}(\mathbf{B}_{S}))=\operatorname{\mathbb{ISU}}(\mathbf{B}_{S}), hence Si(𝒱)𝕀𝕊𝕌(𝐁S)\operatorname{Si}(\mathcal{V})\subseteq\operatorname{\mathbb{ISU}}(\mathbf{B}_{S}). Since Var(𝐓0)𝒱\operatorname{Var}(\mathbf{T}_{0})\subsetneq\mathcal{V}, there is some 𝐀Si(𝒱)\mathbf{A}\in\operatorname{Si}(\mathcal{V}) with more than 2 elements. By Lemma 3.16, 𝐁S\mathbf{B}_{S} embeds into 𝐀\mathbf{A}, so 𝐁S𝒱\mathbf{B}_{S}\in\mathcal{V}, hence 𝒱=Var(𝐁S)\mathcal{V}=\operatorname{Var}(\mathbf{B}_{S}). Thus, Var(𝐁S)\operatorname{Var}(\mathbf{B}_{S}) is a cover of Var(𝐓0)\operatorname{Var}(\mathbf{T}_{0}) in 𝚲TTA\boldsymbol{\Lambda}_{\textrm{TTA}}, as required. Based on these arguments, it is evident that Var(𝐁S)\operatorname{Var}(\mathbf{B}_{S}) is also join-irreducible. ∎

Lastly, we will need to show that these varieties are distinct. The following pair of results effectively reduce this problem to showing that 𝐀S\mathbf{A}_{S} and 𝐀T\mathbf{A}_{T} are not elementarily equivalent, for all distinct S,T𝕆S,T\subseteq\mathbb{O}.

Lemma 3.18.

Let S,T𝕆S,T\subseteq\mathbb{O} and let μ:𝐁S𝐁T\mu\colon\mathbf{B}_{S}\to\mathbf{B}_{T} be a homomorphism. Then μ\mu is an isomorphism.

Proof.

Since 𝐁S\mathbf{B}_{S} and 𝐁T\mathbf{B}_{T} are non-trivial, the kernel of μ\mu must be non-zero. From Corollary 3.4, 𝐁S\mathbf{B}_{S} is simple, so the kernel of μ\mu is the identity relation. This implies that μ\mu is an embedding, so μ(V0)V\varnothing\subsetneq\mu(V_{0})\subsetneq V. By Lemma 3.9, Lemma 3.12, Lemma 3.13 and Lemma 3.14, we must have μ[S]=T\mu[\mathscr{B}_{S}]=\mathscr{B}_{T}. Thus, μ\mu is surjective, hence μ\mu is an isomorphism, as required. ∎

Using Lemma 3.11, we will construct some useful first-order formulae (again, in the signature {,,,f,g,0,1}\{\vee,\wedge,{{}^{\prime}},f,g,0,1\} of tense algebras). To avoid confusion, we will use \curlyvee for logical disjunction and \curlywedge for logical conjunction.

Definition 3.19.
  1. (1)

    Let α(x):=x0(y:xy0xyx)\alpha(x)\mathrel{\mathop{:}}=x\not\approx 0\curlywedge(\forall y\colon x\wedge y\approx 0\curlyvee x\wedge y\approx x).

  2. (2)

    Let φ(x):=α(x)¬(w,y,z:α(w)α(y)α(z)f(x)g(x)wyz)\varphi(x)\mathrel{\mathop{:}}=\alpha(x)\curlywedge\neg(\exists w,y,z\colon\alpha(w)\curlywedge\alpha(y)\curlywedge\alpha(z)\curlywedge f(x)\wedge g(x)\approx w\vee y\vee z).

  3. (3)

    For each n3n\geqslant 3, let τn(x):=φ(x)νn(x)f(g2(x)g(x))0\tau_{n}(x)\mathrel{\mathop{:}}=\varphi(x)\curlywedge\nu_{n}(x)\wedge f(g^{2}(x)\wedge g(x)^{\prime})\not\approx 0.

Lemma 3.20.

Let S𝕆S\subseteq\mathbb{O}, let n3n\geqslant 3 and let XSX\in\mathscr{B}_{S}. Then

  1. (1)

    𝐁Sφ[X]\mathbf{B}_{S}\models\varphi[X] if and only if X=Ap,1X=A_{p,1}, for some pp\in\mathbb{Z},

  2. (2)

    𝐁Sτn[X]\mathbf{B}_{S}\models\tau_{n}[X] if and only if nS𝔼n\in S_{\mathbb{E}} and X=Ap,1X=A_{p,1}, for some pp\in\mathbb{Z}.

Proof.

If 𝐓\mathbf{T} is a tense algebra and xTx\in T, then 𝐓α[x]\mathbf{T}\models\alpha[x] if and only if xx is an atom, hence 𝐁α[X]\mathbf{B}\models\alpha[X] if and only if X=Ap,nX=A_{p,n}, for some pp\in\mathbb{Z} and nn\in\mathbb{N}. By Lemma 3.6(1) and Lemma 3.6(9), fS(Ap,n)gS(Ap,n)=Ap,1Ap,2Sp,1f_{S}(A_{p,n})\cap g_{S}(A_{p,n})=A_{p,1}\cup A_{p,2}\cup S_{p,1} if n=1n=1 and pp\in\mathbb{Z}. Similarly, fS(Ap,n)gS(Ap,n)=Ap,n1Ap,nAp,n+1f_{S}(A_{p,n})\cap g_{S}(A_{p,n})=A_{p,n-1}\cup A_{p,n}\cup A_{p,n+1} if n>1n>1 and pp\in\mathbb{Z}. Combining these results, we see that (1) holds.

Based on Lemma 3.6(9) and Lemma 3.6(13), we have gS(Ap,1)=Upg_{S}(A_{p,1})=U_{p} and gS2(Ap,1)=gS(Up)=Ap1,1Upg_{S}^{2}(A_{p,1})=g_{S}(U_{p})=A_{p-1,1}\cup U_{p}, for each pp\in\mathbb{Z}. So, by Lemma 3.6(1), fS(gS2(Ap,1)gS(Ap,1)c)=fS(Ap1,1)=Ap1,1Ap1,2Dp2Sp,1f_{S}(g_{S}^{2}(A_{p,1})\cap g_{S}(A_{p,1})^{c})=f_{S}(A_{p-1,1})=A_{p-1,1}\cup A_{p-1,2}\cup D_{p-2}\cup S_{p,1} when pp\in\mathbb{Z}. By Lemma 3.11, τn(Ap,1)fS(gS2(Ap,1)gS(Ap,1)c)\tau_{n}(A_{p,1})\cap f_{S}(g_{S}^{2}(A_{p,1})\cap g_{S}(A_{p,1})^{c})\neq\varnothing if and only if nS𝔼n\in S_{\mathbb{E}}, as τn(Ap,1)=Ap,n\tau_{n}(A_{p,1})=A_{p,n}. Based on this and (1), (2) also holds. ∎

Now we have the results we need to show that our varieties are distinct.

Lemma 3.21.

Let S,T𝕆S,T\subseteq\mathbb{O} with STS\neq T. Then Var(𝐁S)Var(𝐁T)\operatorname{Var}(\mathbf{B}_{S})\neq\operatorname{Var}(\mathbf{B}_{T}).

Proof.

Without loss of generality, we can assume that STS\nsubseteq T, since STS\neq T. Let nn\in\mathbb{N} with nSn\in S and nTn\notin T. By Lemma 3.20, 𝐁Sx:τn(x)\mathbf{B}_{S}\models\exists x\colon\tau_{n}(x) and 𝐁T⊧̸x:τn(x)\mathbf{B}_{T}\not\models\exists x\colon\tau_{n}(x), hence 𝐁S\mathbf{B}_{S} and 𝐁T\mathbf{B}_{T} are not elementarily equivalent. Thus, 𝐁S\mathbf{B}_{S} and 𝐁T\mathbf{B}_{T} are not isomorphic, so by Lemma 3.18, 𝐁S\mathbf{B}_{S} does not embed into 𝐁T\mathbf{B}_{T}. Based on Proposition 2.7(3), Corollary 3.4 and Lemma 3.16, 𝐁TVar(𝐁S)\mathbf{B}_{T}\notin\operatorname{Var}(\mathbf{B}_{S}), so Var(𝐁S)Var(𝐁T)\operatorname{Var}(\mathbf{B}_{S})\neq\operatorname{Var}(\mathbf{B}_{T}), as claimed. ∎

Now we just need to put on the finishing touches.

Theorem 3.22.

Var(𝐓0)\operatorname{Var}(\mathbf{T}_{0}) has 202^{\aleph_{0}} join-irreducible covers in 𝚲TTA\boldsymbol{\Lambda}_{\textup{TTA}} and 𝚲TA\boldsymbol{\Lambda}_{\textup{TA}}.

Proof.

Let CC denote the set of join-irreducible covers of Var(𝐓0)\operatorname{Var}(\mathbf{T}_{0}) in 𝚲TTA\boldsymbol{\Lambda}_{\textup{TTA}}. Combining Lemma 3.17 and Lemma 3.21, we find that |C|20|C|\geqslant 2^{\aleph_{0}}. It is easy to see that there are at most 202^{\aleph_{0}} sets of equations in a countable signature (up to replacing variables), hence |C||ΛTTA|20|C|\leqslant|\Lambda_{\textup{TTA}}|\leqslant 2^{\aleph_{0}}. Therefore |C|=20|C|=2^{\aleph_{0}}, which is what we wanted to show. ∎

Combining Proposition 2.5 and Theorem 3.22, we obtain our main result.

Theorem 3.23.

Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) has exactly 202^{\aleph_{0}} join-irreducible covers in 𝚲RSA\boldsymbol{\Lambda}_{\textup{RSA}}, 𝚲SA\boldsymbol{\Lambda}_{\textup{SA}}, and 𝚲NA\boldsymbol{\Lambda}_{\textup{NA}}.

We can also use Theorem 3.22 to obtain similar results on the subvariety lattices of other varieties of rr-algebras and nonassociative relation algebras; see Section 4 of [13] for more details.

4. Concluding remarks

In the previous section we saw that Var(𝐓0)\operatorname{Var}(\mathbf{T}_{0}) has 202^{\aleph_{0}} covers in 𝚲TA\boldsymbol{\Lambda}_{\textup{TA}} and 𝚲TTA\boldsymbol{\Lambda}_{\textup{TTA}}, and that Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) has 202^{\aleph_{0}} covers in 𝚲SA\boldsymbol{\Lambda}_{\textup{SA}} and 𝚲RSA\boldsymbol{\Lambda}_{\textup{RSA}}. However, the problem of completely characterizing these covers remains open. Based on a computer search, it seems that there are finite semiassociative relation algebras that generate covers of Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) in 𝚲SA\boldsymbol{\Lambda}_{\textup{SA}} that are not in the list in [11]. In fact, based on this search, it seems reasonable to conjecture that there are finite algebras with arbitrarily large atom sets that generate covers of Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) in 𝚲SA\boldsymbol{\Lambda}_{\textup{SA}}, so the problem of completely characterizing covers of Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) in 𝚲SA\boldsymbol{\Lambda}_{\textup{SA}} could prove to be quite difficult.

Using Lemma 3.6 and the term equivalence in [13], it is not too difficult to show that the semiassociative relation algebras corresponding to the tense algebras constructed above are not relation algebras. (For example, A0,1(A0,1A1,1)A_{0,1}(A_{0,1}A_{1,1}) and (A0,1A0,1)A1,1(A_{0,1}A_{0,1})A_{1,1} are always distinct, so associativity fails.) Thus, the results obtained above do not appear to provide any information about the covers of Var(𝐁3)\operatorname{Var}(\mathbf{B}_{3}) in the lattice 𝚲RA\boldsymbol{\Lambda}_{\textup{RA}} of subvarieties of the variety of relation algebras.

Based on these observations, the following problems seem like reasonable starting points for further research in this area.

Problem 1.

Classify the covers of Var(𝐓0)\operatorname{Var}(\mathbf{T}_{0}) in 𝚲TA\boldsymbol{\Lambda}_{\textup{TA}} (or 𝚲TTA\boldsymbol{\Lambda}_{\textup{TTA}}).

Problem 2.

Classify the covers of Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) in 𝚲SA\boldsymbol{\Lambda}_{\textup{SA}} (or 𝚲RSA\boldsymbol{\Lambda}_{\textup{RSA}}).

Problem 3.

Determine whether or not Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) has infinitely many finitely generated covers in 𝚲SA\boldsymbol{\Lambda}_{\textup{SA}}.

Problem 4.

Determine the number of covers of Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) in 𝚲RA\boldsymbol{\Lambda}_{\textup{RA}}.

Problem 5.

Classify the covers of Var(𝐀3)\operatorname{Var}(\mathbf{A}_{3}) in 𝚲RA\boldsymbol{\Lambda}_{\textup{RA}}.

Acknowledgment

This is a pre-print of an article published in Algebra Universalis. The final authenticated version is available online at: https://doi.org/10.1007/s00012-020-0646-9.

The first author would like to thank Peter Jipsen for recommending [13], and Eli Hazel for solving a mysterious issue.

References

  • [1] Andréka, H., Givant, S., Németi, I.: Decision problems for equational theories of relation algebras. Memoirs of the American mathematical society. Amer. Math. Soc. (1997)
  • [2] Andréka, H., Givant, S., Németi, I.: The lattice of varieties of representable relation algebras. J. Symbolic Logic 59, 631–661 (1994)
  • [3] Andréka, H., Jónsson, B., Németi, I.: Free algebras in discriminator varieties. Algebra Universalis 28, 401–447 (1991)
  • [4] Blackburn, P., M. de Rijke, Venema, Y.: Modal Logic. Cambridge tracts in theoretical computer science. Cambridge university press, Cambridge (2002)
  • [5] Blok, W.: The lattice of modal logics: an algebraic investigation. J. Symbolic Logic 45, 221–236 (1980)
  • [6] Burris, S., Sankappanavar, H.P.: A course in universal algebra, Millenium edition. http://www.math.uwaterloo.ca/~snburris
  • [7] Chin, L.H., Tarski, A.: Distributive and modular laws in the arithmetic of relation algebras. Univ. California Publ. Math. (N.S.) 1, 341–384 (1951)
  • [8] Givant, S.: Advanced topics in relation algebras. Springer, Cham (2017)
  • [9] Givant, S.: Introduction to relation algebras. Springer, Cham (2017)
  • [10] Hirsch, R., Hodkinson, I.: Relation algebras by games. Studies in logic and the foundations of mathematics. North-Holland, Amsterdam (2002)
  • [11] Jipsen, P.: Computer aided investigations of relation algebras. PhD thesis, Vanderbilt University (1992)
  • [12] Jipsen, P.: Discriminator varieties of Boolean algebras with operators, in: Cecylua Rauszer (ed.), Algebraic methods in logic and in computer science, Banach Center Publ. vol. 28, Institute of Math., Polish Acad. Sci., Warsaw, 239–252 (1993)
  • [13] Jipsen, P., Kramer R.L., Maddux, R.D.: Total tense algebras and symmetric semiassociative relation algebras. Algebra Universalis 34, 404–423 (1995)
  • [14] Jónsson, B.: Varieties of relation algebras. Algebra Universalis 15, 273–298 (1982)
  • [15] Jónsson, B., Tarski, A.: Boolean algebras with operators. Part I. Amer. J. Math. 73, 891–939 (1951)
  • [16] Jónsson, B., Tarski, A.: Boolean algebras with operators. Part II. Amer. J. Math. 74, 127–162 (1952)
  • [17] Kowalski, T.: Varieties of tense algebras. Reports on Mathematical Logic 32, 53–95 (1998)
  • [18] Kracht, M.: Tools and techniques in modal logic. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1999)
  • [19] Lyndon, R.C.: The representation of relation algebras, II. Ann. Math. 63, 294–307 (1956)
  • [20] Maddux, R.D.: A perspective on the theory of relation algebras. Algebra Universalis 31, 456–465 (1994)
  • [21] Maddux, R.D.: A sequent calculus for relation algebras. Ann. Pure Appl. Log. 25, 73–101 (1983)
  • [22] Maddux, R.D.: Relation algebras. Studies in logic and the foundations of mathematics. North-Holland, Amsterdam (2006)
  • [23] Maddux, R.D.: Some varieties containing relation algebras. Trans. Amer. Math. Soc. 272, 501–526 (1982)
  • [24] Monk, J.D.: On representable relation algebras. Mich. Math. J. 11, 207–210 (1964)
  • [25] Tarski, A.: Contributions to the theory of models. III. Proc. Konikl. Nederl. Akad. Wet. 58, 56–64 (1955)
  • [26] Tarski, A.: Equationally complete rings and relation algebras. Indag. Math. 18, 39–46, (1956)