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

New perspectives on semi-primal varieties

Alexander Kurz Chapman University, 1 University Drive, 92866 Orange, California, USA akurz@chapman.edu Wolfgang Poiger University of Luxembourg, 6 Avenue de la Fonte, L-4364 Esch-sur-Alzette, Luxembourg wolfgang.poiger@uni.lu
bruno.teheux@uni.lu
 and  Bruno Teheux
Abstract.

We study varieties generated by semi-primal lattice-expansions by means of category theory. We provide a new proof of the Keimel-Werner topological duality for such varieties and, using similar methods, establish its discrete version. We describe multiple adjunctions between the variety of Boolean algebras and the variety generated by a semi-primal lattice-expansion, both on the topological side and explicitly algebraic. In particular, we show that the Boolean skeleton functor has two adjoints, both defined by taking certain Boolean powers, and we identify properties of these adjunctions which fully characterize semi-primality of an algebra. Lastly, we give a new characterization of canonical extensions of algebras in semi-primal varieties in terms of their Boolean skeletons.

Key words and phrases:
semi-primal algebras, primal algebras, ternary discriminator, stone duality, boolean skeleton, boolean power, canonical extension, universal algebra, category theory
2020 Mathematics Subject Classification:
06E15, 06E75, 08A40, 08C05

1. Introduction

Primality and its variations are classical topics in universal algebra which were prominently studied during the second half of the 20th century [55, 59, 10]. During the 1950s, Foster introduced primal algebras in his generalized ‘Boolean’ theory of universal algebras [24, 25]. Generalizing functional completeness of the two-element Boolean algebra, an algebra 𝐏\mathbf{P} is primal if every operation f:PnPf\colon P^{n}\to P is term-definable in 𝐏\mathbf{P}. The intuition that a primal algebra 𝐏\mathbf{P} is ‘close to’ the two-element Boolean algebra 𝟐\mathbf{2} was confirmed by Hu’s theorem [36, 37], which states that a variety 𝒱\mathcal{V} is categorically equivalent to the variety 𝖡𝖠\mathsf{BA} of Boolean algebras (generated by 𝟐\mathbf{2}) if and only if 𝒱\mathcal{V} is generated by a primal algebra 𝐏𝒱\mathbf{P}\in\mathcal{V}.

In 1964, Foster and Pixley introduced the first variation of primality, which they called semi-primality [29]. Unlike primal algebras, a semi-primal algebra may have proper subalgebras. Accordingly, in a semi-primal algebra 𝐋\mathbf{L}, we only require the operations f:LnLf\colon L^{n}\to L which preserve subalgebras to be term-definable in 𝐋\mathbf{L}. Semi-primal varieties (that is, varieties of the form 𝕊(𝐋)\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{L}) where 𝐋\mathbf{L} is semi-primal) are well-understood from the viewpoint of ‘classical’ universal algebraic structure theory [29, 30, 26, 46] as well as from the viewpoint of duality theory [42, 17]. From the perspective of category theory, semi-primal varieties were classified up to Morita equivalence in [7] - however, this is done using purely algebraic tools based on [45]. In this paper, we further advance the category theoretical study of semi-primality by putting a semi-primal variety 𝒜\mathcal{A} in relationship with other varieties, in particular with the primal variety 𝖡𝖠\mathsf{BA}. Although Hu’s theorem implies that the varieties are usually not categorically equivalent, we demonstrate that, nevertheless, there is a rich relationship between 𝒜\mathcal{A} and 𝖡𝖠\mathsf{BA}. In particular we explicate the intuition that semi-primal algebras are still ‘close to’ the two-element Boolean algebra.

More specifically, we investigate multiple adjunctions between 𝖡𝖠\mathsf{BA} and the variety 𝒜\mathcal{A} generated by a semi-primal algebra 𝐋\mathbf{L} with an underlying bounded lattice (see Assumption 2.9). For one, this assumption yields a useful characterization of semi-primality via certain unary terms (see Proposition 2.8) which we prominently use. Furthermore, since 𝐋\mathbf{L} has no one-element subalgebras, the dual category of 𝒜\mathcal{A} has a particularly simple description (see Definition 3.1). Apart from these advantages, the restriction to lattice-based algebras is motivated by the connection to many-valued logic. If we consider 𝐋\mathbf{L} as an algebra of propositional truth-degrees, an underlying bounded lattice is a reasonable assumption. For example, Maruyama [44] generalized Jónsson-Tarski duality to modal extensions of semi-primal algebras with bounded lattice reducts. We plan to demonstrate applications of our results to many-valued (coalgebraic) modal logic in subsequent work. Since, in addition, there are already plenty of examples of such algebras (see Subsection 2.3), it is reasonable to stick to this framework.

Although we were mainly motivated by questions arising in logic, we particularly hope that this paper will be of interest to algebraists interested in category theory as well as to category theorists interested in universal algebra. Let us point out that, in this paper, the category theoretical approach to universal algebra is different from other common ones via Lawvere theories or monads (these are well-exposed in [38]). Indeed, this paper is not about reformulating and generalizing algebraic concepts into categorical language, but rather to apply category theory as a tool to gain new insight into a concrete topic in universal algebra. For example, the fact that the variety 𝒜\mathcal{A} is the completion of the full subcategory of its finite members 𝒜ω\mathcal{A}^{\omega} under filtered colimits (i.e., 𝒜𝖨𝗇𝖽(𝒜ω)\mathcal{A}\simeq\mathsf{Ind}(\mathcal{A}^{\omega})) can be helpful to make the step from finite to infinite, for example to extend functors defined on 𝒜ω\mathcal{A}^{\omega} to the full variety 𝒜\mathcal{A} in a canonical way. Motivated by [40], we furthermore use this fact to give a new proof of the semi-primal duality [42, 17] by lifting the corresponding finite duality (see Theorem 3.7 and Theorem 5.5). By replacing 𝖨𝗇𝖽(𝒜ω)\mathsf{Ind}(\mathcal{A}^{\omega}) by 𝖯𝗋𝗈(𝒜ω)\mathsf{Pro}(\mathcal{A}^{\omega}), the closure under cofiltered limits, we prove the discrete version of the duality (resembling the duality between 𝖲𝖾𝗍\mathsf{Set} and the category 𝖢𝖠𝖡𝖠\mathsf{CABA} of complete atomic Boolean algebras) in a similar manner.

The paper is organized as follows. In Section 2 we recall well-known results about semi-primal algebras and the varieties they generate. In particular, we discuss semi-primal bounded-lattice expansions and provide examples thereof. In Section 3 we describe the topological duality for semi-primal algebras and, as mentioned above, provide an alternative proof for it. Arguably the most important results of the paper are exposed in Section 4, where we describe a chain of four adjoint functors between 𝒜\mathcal{A} and 𝖡𝖠\mathsf{BA} (see Figure 3). Most prominently, the adjunction 𝔖𝔓\mathfrak{S}\dashv\mathfrak{P} is described in detail, first via duality and then explicitly algebraically (see Theorem 4.11). The Boolean skeleton 𝔖:𝒜𝖡𝖠\mathfrak{S}\colon\mathcal{A}\to\mathsf{BA} has, for example, been known for 𝖬𝖵n\mathsf{MV}_{n}-algebras [16] and was generalized to arbitrary semi-primal bounded lattice expansions by Maruyama [44]. Its right-adjoint 𝔓:𝖡𝖠𝒜\mathfrak{P}\colon\mathsf{BA}\to\mathcal{A} relies on the construction of a Boolean power [9], a certain Boolean product [11] which was already introduced for arbitrary finite algebras in Foster’s original paper on primality [24]. In the case where 𝐋\mathbf{L} is primal, we retrieve a concrete categorical equivalence witnessing Hu’s theorem (see Corollary 4.12). We proceed to investigate the subalgebra adjunctions, which exist for each subalgebra 𝐒𝐋\mathbf{S}\leq\mathbf{L}. We manage to trace them back to the adjunction 𝔖𝔓\mathfrak{S}\dashv\mathfrak{P} after taking an appropriate inclusion/quotient (see Theorem 4.16). In particular, we illustrate why the subalgebra adjunction 𝖰𝖨\mathsf{Q}\dashv\mathsf{I} corresponding to the smallest subalgebra of 𝐋\mathbf{L} is of special interest. Indeed, towards the end of Section 4 we also show that the existence of an adjoint situation resembling 𝖨𝔖𝔓\mathsf{I}\dashv\mathfrak{S}\dashv\mathfrak{P} fully characterizes semi-primality of a lattice-based algebra (see Theorem 4.19). Building on the results of Section 4, in Section 5 we prove the above-mentioned discrete duality for 𝖯𝗋𝗈(𝒜ω)\mathsf{Pro}(\mathcal{A}^{\omega}). It is well-known that the algebras in this category correspond to the canonical extensions [33, 21] of algebras in 𝒜\mathcal{A}. Notably, we show that these canonical extensions may be characterized almost purely in terms of their Boolean skeletons (see Theorem 5.10). Lastly we connect Sections 4 and 5 by describing an analogue of the Stone-Čech compactification in our setting (see Proposition 5.11).

We summarize our results schematically in Section 6 (see Figure 6). In addition to the logical ramifications already mentioned, we believe that there are more potential ways to follow up our results. In particular, we hope to inspire further research in universal algebra through the lens of category-theory. Some open questions directly related to the content of this paper are also collected in Section 6.

2. Semi-primal algebras and the varieties they generate

In the 1950s, Foster introduced the concept of primality in [24, 25], generalizing functional completeness of the two-element Boolean algebra 𝟐\mathbf{2}. A finite algebra 𝐋\mathbf{L} is called primal if, for all n1n\geq 1, every function f:LnLf\colon L^{n}\to L is term-definable in 𝐋\mathbf{L}. Besides the two-element Boolean algebra 𝟐\mathbf{2}, the (n+1)(n+1)-element Post chain 𝐏n\mathbf{P}_{n} and the field of prime order /p\mathbb{Z}/p\mathbb{Z} with 0 and 11 as constants are some famous examples of primal algebras.

Using Stone duality, Hu [36, 37] showed that a variety 𝒜\mathcal{A} is generated by a primal algebra (in other words, 𝒜=𝕊(𝐋)\mathcal{A}=\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{L}) for some primal algebra 𝐋\mathbf{L}) if and only if 𝒜\mathcal{A} is categorically equivalent to the variety of Boolean algebras 𝖡𝖠\mathsf{BA} (see also [52] for a treatment using Lawvere theories). Of course we don’t expect any more meaningful category theoretical results about the relationship between 𝒜\mathcal{A} and 𝖡𝖠\mathsf{BA} in this case. One purpose of this paper is to demonstrate that, in contrast, such results do arise as soon as we assume that 𝐋\mathbf{L} is semi-primal.

2.1. Characterizations of semi-primality

Since Foster’s original work, many variations of primality have been introduced (for overviews see, e.g., [55, 41]). Among them, intuitively speaking, semi-primality seems to still be rather close to primality (a central theme of this paper is to show why this intuition is justified). In a slogan: semi-primal algebras are like primal algebras which allow subalgebras.

Note that a primal algebra 𝐋\mathbf{L} does not have any proper subalgebra 𝐒𝐋\mathbf{S}\lneqq\mathbf{L}. Otherwise, picking any sSs\in S and LS\ell\in L{\setminus}S, no function f:LLf:L\to L with f(s)=f(s)=\ell can possibly be term-definable.

Semi-primality, introduced by Foster and Pixley in 1964 (see [29]) does not impose this restriction. Recall that a function f:LnLf\colon L^{n}\to L preserves subalgebras if f(a1,,an)f(a_{1},\ldots,a_{n}) is in the subalgebra generated by {a1,,an}\{a_{1},\ldots,a_{n}\} for any choice of a1,,anLa_{1},\ldots,a_{n}\in L. Clearly, if a function is term-definable, then it preserves subalgebras. In semi-primal algebras, the converse also holds.

Definition 2.1.

A finite algebra 𝐋\mathbf{L} is semi-primal (sometimes also called subalgebra-primal) if for every n1n\geq 1, every function f:LnLf\colon L^{n}\to L which preserves subalgebras is term-definable in 𝐋\mathbf{L}.

For example, the field of prime-order /p\mathbb{Z}/p\mathbb{Z} with only 0 as constant is semi-primal but not primal anymore - it now has {0}\{0\} as proper subalgebra. More interesting examples are described in detail in Subsection 2.3. In the following we recall two well-known equivalent characterizations of semi-primality. The first one is based on the ternary discriminator term and the second one is based on the existence of a majority term.

First we recall the characterization of semi-primal algebras as special instances of discriminator algebras. These are the algebras in which the ternary discriminator

t(x,y,z)={z if x=yx if xyt(x,y,z)=\begin{cases}z&\text{ if }x=y\\ x&\text{ if }x\neq y\end{cases}

is term-definable. Finite discriminator algebras are also called quasi-primal.

An internal isomorphism of 𝐋\mathbf{L} is an isomorphism φ:𝐒1𝐒2\varphi\colon\mathbf{S}_{1}\to\mathbf{S}_{2} between any two (not necessarily distinct) subalgebras 𝐒1\mathbf{S}_{1} and 𝐒2\mathbf{S}_{2} of 𝐋\mathbf{L}. For example, if 𝐒𝐋\mathbf{S}\leq\mathbf{L} is a subalgebra, then the identity idSid_{S} is an internal isomorphism of 𝐋\mathbf{L}. In semi-primal algebras, there are no other internal isomorphisms.

Proposition 2.2.

[51, Theorem 3.2.] A finite algebra 𝐋\mathbf{L} is semi-primal if and only if it is quasi-primal and the only internal isomorphisms of 𝐋\mathbf{L} are the identities on subalgebras of 𝐋\mathbf{L}.

Secondly, we recall the characterization of semi-primality based on a majority term, which can be useful to generate examples (see, for example, [22]). Recall that a majority term is a ternary term m(x,y,z)m(x,y,z) satisfying

m(x,x,y)=m(x,y,x)=m(y,x,x)=x.m(x,x,y)=m(x,y,x)=m(y,x,x)=x.

In particular, every lattice 𝐋=(L,,)\mathbf{L}=(L,\wedge,\vee) has a majority term given by the median

m(x,y,z)=(xy)(xz)(yz).m(x,y,z)=(x\wedge y)\vee(x\wedge z)\vee(y\wedge z).
Proposition 2.3.

[3, Theorem 7.2.] A finite algebra 𝐋\mathbf{L} is semi-primal if and only if it has a majority term and every subalgebra of 𝐋2\mathbf{L}^{2} is either the direct product of two subalgebras or the diagonal of a subalgebra of 𝐋\mathbf{L}.

The structure of semi-primal varieties was already well-studied in the original work by Foster and Pixley during the 1960s. To stay self-contained, we recall some results about these varieties which will be of use for us later.

Proposition 2.4.

[29, Theorem 4.2] The variety 𝒜\mathcal{A} generated by a semi-primal algebra 𝐋\mathbf{L} coincides with the quasi-variety generated by 𝐋\mathbf{L}, that is 𝒜=𝕀𝕊(𝐋).\mathcal{A}=\mathbb{I}\mathbb{S}\mathbb{P}(\mathbf{L}).

In addition to the characterizations above, there is a nice characterization of semi-primality of 𝐋\mathbf{L} in terms of 𝒜\mathcal{A}. Recall that a variety is called arithmetical if it is congruence distributive and congruence permutable.

Proposition 2.5.

[30, Theorem 3.1] A finite algebra 𝐋\mathbf{L} is semi-primal if and only if the variety generated by 𝐋\mathbf{L} is arithmetical, every subalgebra of 𝐋\mathbf{L} is simple, and the only internal isomorphisms of 𝐋\mathbf{L} are the identities of subalgebras.

Remark 1.

Together with Proposition 3.5 this implies that if 𝐋\mathbf{L} is semi-primal, then the collection of subalgebras 𝕊(𝐋)\mathbb{S}(\mathbf{L}) considered as a subcategory of the variety generated by 𝐋\mathbf{L}, forms a lattice, ordered under inclusion. \blacksquare

The finite members of 𝒜\mathcal{A} are particularly well-behaved. For notation, given a concrete category 𝖢{\mathsf{C}}, we use 𝖢ω{\mathsf{C}}^{\omega} to denote the full subcategory of 𝖢{\mathsf{C}} generated by its finite members. In particular, if 𝒜\mathcal{A} is a variety, we use 𝒜ω\mathcal{A}^{\omega} to denote the category of finite algebras in 𝒜\mathcal{A}.

Proposition 2.6.

[29, Theorem 7.1] Let 𝒜\mathcal{A} be the variety generated by a semi-primal algebra 𝐋\mathbf{L}. Every finite algebra 𝐀𝒜ω\mathbf{A}\in\mathcal{A}^{\omega} is isomorphic to a direct product of subalgebras of 𝐋\mathbf{L}.

We add yet another characterization of semi-primality in our particular case of interest (in which the algebra is based on a bounded lattice) in the following subsection (see Proposition 2.8).

2.2. Semi-primal bounded lattice expansions

In this subsection we set the scene for the remainder of this paper. We aim to describe the relationship between the variety 𝖡𝖠\mathsf{BA} of Boolean algebras and the variety generated by a semi-primal algebra with underlying bounded lattice.

Under the additional assumption that 𝐋\mathbf{L} is based on a bounded lattice, there is another nice characterization of semi-primality of 𝐋\mathbf{L} which will be particularly useful for our purposes. It relies on the following unary terms.

Definition 2.7.

Let 𝐋\mathbf{L} be an algebra based on a bounded lattice 𝐋=(L,,,0,1).\mathbf{L}^{\flat}=(L,\wedge,\vee,0,1). For all L\ell\in L we define T:LLT_{\ell}\colon L\rightarrow L and τ:LL\tau_{\ell}\colon L\to L to be the characteristic function of {}\{\ell\} and {}\{\ell^{\prime}\geq\ell\}, respectively. That is,

T(x)={1 if x=0 if x and τ(x)={1 if x0 if x.T_{\ell}(x)=\begin{cases}1&\text{ if }x=\ell\\ 0&\text{ if }x\neq\ell\end{cases}\hskip 14.22636pt\text{ and }\hskip 14.22636pt\tau_{\ell}(x)=\begin{cases}1&\text{ if }x\geq\ell\\ 0&\text{ if }x\not\geq\ell.\end{cases}

Even though the following result is essentially an instance of the more general [26, Theorem 4.1], we include an easy direct proof here.

Proposition 2.8.

[26, Theorem 4.1] Let 𝐋\mathbf{L} be a finite algebra with an underlying bounded lattice. Then the following conditions are equivalent:

  1. (1)

    𝐋\mathbf{L} is semi-primal.

  2. (2)

    For every 𝐋\ell\in\mathbf{L}, the function TT_{\ell} is term-definable in 𝐋\mathbf{L}.

  3. (3)

    T0T_{0} is term-definable and for every 𝐋\ell\in\mathbf{L}, the function τ\tau_{\ell} is term-definable in 𝐋\mathbf{L}.

Proof.

(1)(2)(1)\Rightarrow(2): Since every subalgebra of 𝐋\mathbf{L} contains the set {0,1}\{0,1\}, semi-primality of 𝐋\mathbf{L} implies that all TT_{\ell} are term-definable, since they preserve subalgebras.

(2)(1)(2)\Rightarrow(1): First we show that the ternary discriminator is term-definable in 𝐋\mathbf{L}. Consider the term

c(x,y)=L((T(x)T(y)),c(x,y)=\bigvee_{\ell\in L}\big{(}(T_{\ell}(x)\wedge T_{\ell}(y)\big{)},

which satisfies

c(x,y)={1 if x=y0 if xyc(x,y)=\begin{cases}1&\text{ if }x=y\\ 0&\text{ if }x\neq y\end{cases}

and d(x,y):=T0(c(x,y))d(x,y):=T_{0}(c(x,y)) (note that this is the discrete metric). The term

t(x,y,z)=(d(x,y)x)(c(x,y)z)t(x,y,z)=(d(x,y)\wedge x)\vee(c(x,y)\wedge z)

yields the ternary discriminator on 𝐋\mathbf{L}. Now we show that the only internal isomorphisms of 𝐋\mathbf{L} are the identities of subalgebras. Let φ:𝐒1𝐒2\varphi:\mathbf{S}_{1}\rightarrow\mathbf{S}_{2} be an internal isomorphism of 𝐋\mathbf{L} and let sS1s\in S_{1} be arbitrary. Then

1=Tφ(s)(φ(s))=φ(Tφ(s)(s))1=T_{\varphi(s)}\big{(}\varphi(s)\big{)}=\varphi\big{(}T_{\varphi(s)}(s)\big{)}

Since φ(0)=0\varphi(0)=0 we necessarily have Tφ(s)(s)=1T_{\varphi(s)}(s)=1, which is equivalent to φ(s)=s\varphi(s)=s. Altogether, due to Proposition 2.2, we showed that 𝐋\mathbf{L} is semi-primal.

(2)(3)(2)\Rightarrow(3): If the TT_{\ell} are term-definable we can define

τ(x)=T(x).\tau_{\ell}(x)=\bigvee_{\ell^{\prime}\geq\ell}T_{\ell^{\prime}}(x).

(3)(2)(3)\Rightarrow(2): If T0T_{0} and the τ\tau_{\ell} are term-definable we can define

T(x)=τ(x)>T0(τ(x)),T_{\ell}(x)=\tau_{\ell}(x)\wedge\bigwedge_{\ell^{\prime}>\ell}T_{0}\big{(}\tau_{\ell^{\prime}}(x)\big{)},

which concludes the proof. ∎

Remark 2.

In light of this result, we can turn any finite bounded lattice into a semi-primal algebra by adding TT_{\ell} as unary operation for every element L\ell\in L. One might wonder how this differs from adding a constant symbol (i.e., a nullary operation) for every element. The difference is that adding a constant imposes the requirement that every subalgebra needs to contain the element corresponding to this constant. Thus, the algebra that results after adding all constants does not have any proper subalgebras. \blacksquare

We now state our main assumption, which from now on holds for the remainder of this paper.

Assumption 2.9.

The finite algebra 𝐋\mathbf{L} is semi-primal and has an underlying bounded lattice.

From now on, let 𝒜:=𝕊(𝐋)\mathcal{A}:=\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{L}) denote the variety generated by 𝐋\mathbf{L}. In Subsection 2.3 we provide various examples of algebras satisfying Assumption 2.9.

As noted in [44] (where the same assumption on 𝐋\mathbf{L} is made), from the point of view of many-valued logic, semi-primal algebras make good candidates for algebras of truth-values. In this context the underlying bounded lattice is a natural minimal requirement.

2.3. Examples of semi-primal algebras

In this subsection we collect some examples of semi-primal algebras. All of them are bounded lattice expansions (since most of them stem from many-valued logic), thus they all fit the scope of this paper (see Assumption 2.9). For other examples we refer the reader to [10, 59, 46].

First, we describe several different semi-primal algebras based on finite chains. To get examples based on lattices which are not necessarily totally ordered, in Subsection 2.3.2 (and Appendix A) we discuss semi-primal residuated lattices. In particular we describe a systematic way to identify them among the 𝖥𝖫ew\mathsf{FL}_{ew}-algebras. Similarly, Subsection 2.3.3 illustrates how to identify semi-primal algebras which need not be totally ordered among the pseudo-logics. At the end of this subsection we recall Murskiĭ’s Theorem which states that, in some sense, almost all finite lattice-based algebras are semi-primal.

2.3.1. Chain-based algebras

We will describe several different ways of turning the (n+1)(n+1)-element chain {0,1n,,n1n,1}\{0,\tfrac{1}{n},\dots,\tfrac{n-1}{n},1\} with its usual lattice-order into a semi-primal algebra. We present the examples ordered decreasingly by the amount of subalgebras.

First, turning a chain into a semi-primal algebra without any further impositions may be achieved as follows.

Example 2.10.

The nn-th general semi-primal chain is given by

𝐓n=({0,1n,,n1n,1},,,0,1,(Tin)i=0n),\mathbf{T}_{n}=\big{(}\{0,\tfrac{1}{n},\dots,\tfrac{n-1}{n},1\},\wedge,\vee,0,1,(T_{\frac{i}{n}})_{i=0}^{n}\big{)},

where the unary operations TinT_{\frac{i}{n}} are the ones from Definition 2.7. For all n1n\geq 1 the algebra 𝐓n\mathbf{T}_{n} is semi-primal (this immediately follows from Proposition 2.8). Every subset of TnT_{n} which contains the set {0,1}\{0,1\} defines a subalgebra of 𝐓n\mathbf{T}_{n}.

Next we find examples among the Łukasiewicz-Moisil algebras, which were originally intended to give algebraic semantics for Łukasiewicz finitely-valued logic. It turns out, however, that they encompass a bit more than that (see [15]). The logic corresponding to these algebras is nowadays named after Moisil.

Example 2.11.

The nn-th Łukasiewicz-Moisil chain is given by

𝐌n=({0,1n,,n1n,1},,,¬,0,1,(τin)i=1n),\mathbf{M}_{n}=\big{(}\{0,\tfrac{1}{n},\dots,\tfrac{n-1}{n},1\},\wedge,\vee,\neg,0,1,(\tau_{\frac{i}{n}})_{i=1}^{n}\big{)},

where ¬x=1x\neg x=1-x and the unary operations τin\tau_{\frac{i}{n}} are the ones from Definition 2.7. For all n1n\geq 1, the algebra 𝐌n\mathbf{M}_{n} is semi-primal. This follows from characterization (3) of Proposition 2.8 - we only have to check that T0T_{0} is term-definable. To see this note that we can define T1(x)=τ1(x)T_{1}(x)=\tau_{1}(x) and T0(x)=T1(¬x)T_{0}(x)=T_{1}(\neg x).

We proceed with a classical example from many-valued logic among the finite MV-algebras introduced by Chang (see [13, 14]). They give rise to the algebraic counterpart of Łukasiewicz finite-valued logic.

Example 2.12.

The nn-th Łukasiewicz chain is given by

Łn=({0,1n,,n1n,1},,,,,¬,0,1),\text{\bf\L}_{n}=\big{(}\{0,\tfrac{1}{n},\dots,\tfrac{n-1}{n},1\},\wedge,\vee,\oplus,\odot,\neg,0,1\big{)},

where xy=min(x+y,1)x\oplus y=\text{min}(x+y,1), xy=max(x+y1,0)x\odot y=\text{max}(x+y-1,0) and ¬x=1x\neg x=1-x. For all n1n\geq 1, the algebra Łn\text{\bf\L}_{n} is semi-primal. The proof of this fact can be found in [49, Proposition 2.1]. The subalgebras of Łn\text{\bf\L}_{n} correspond to the divisors dd of nn and are of the form

Łd={0,kn,,(d1)kn,1} where n=kd.\text{\bf\L}_{d}=\{0,\tfrac{k}{n},\dots,\tfrac{(d-1)k}{n},1\}\text{ where }n=kd.

Other semi-primal chains are found among the Cornish algebras, which generalize Ockham algebras (see [18, 19]).

Example 2.13.

The nn-th semi-primal Cornish chain is given by

𝐂𝐎n=({0,1n,,n1n,1},,,¬,f,0,1),\mathbf{CO}_{n}=\big{(}\{0,\tfrac{1}{n},\dots,\tfrac{n-1}{n},1\},\wedge,\vee,\neg,f,0,1\big{)},

where ¬x=1x\neg x=1-x, f(0)=0,f(1)=1f(0)=0,f(1)=1 and f(in)=i+1nf(\frac{i}{n})=\frac{i+1}{n} for 1in11\leq i\leq n-1. For all n1n\geq 1, the algebra 𝐂𝐎n\mathbf{CO}_{n} is semi-primal. The proof of this fact can be found in [19, Example 5.15]. The only proper subalgebra of 𝐂𝐎n\mathbf{CO}_{n} is {0,1}\{0,1\}.

Finally, among the Post-algebras we find the well-known examples of chain-based algebras which are not only semi-primal, but even primal.

Example 2.14.

The nn-th Post chain is given by

𝐏n=({0,1n,,n1n,1},,,,0,1)\mathbf{P}_{n}=\big{(}\{0,\tfrac{1}{n},\dots,\tfrac{n-1}{n},1\},\wedge,\vee,^{\prime},0,1\big{)}

where 1=01^{\prime}=0 and (in)=(i+1n)(\frac{i}{n})^{\prime}=(\frac{i+1}{n}) for 0i<n0\leq i<n. For all n1n\geq 1, the algebra 𝐏n\mathbf{P}_{n} is primal (see, e.g., [24, Theorem 35])

2.3.2. Residuated Lattices

For a general survey of residuated lattices we refer the reader to [32, 39]. We only consider bounded commutative residuated lattices here, with a particular focus on 𝖥𝖫ew\mathsf{FL}_{ew}-algebras.

Definition 2.15.

A (bounded commutative) residuated lattice is an algebra

𝐑=(R,,,0,1,,e,)\mathbf{R}=(R,\wedge,\vee,0,1,\odot,e,\rightarrow)

such that (R,,,0,1)(R,\wedge,\vee,0,1) is a bounded lattice, (R,,e)(R,\odot,e) is a commutative monoid and the binary operation \rightarrow satisfies the residuation condition

xyzxyz.x\odot y\leq z\Leftrightarrow x\leq y\rightarrow z.

We call 𝐑\mathbf{R} a 𝖥𝖫ew\mathsf{FL}_{ew}-algebra if, in addition, it satisfies e=1e=1.

Our main tool to identify semi-primal 𝖥𝖫ew\mathsf{FL}_{ew}-algebras is [43, Theorem 3.10], which implies that a 𝖥𝖫ew\mathsf{FL}_{ew}-algebra 𝐑\mathbf{R} is quasi-primal if and only if there is some n1n\geq 1 such that

(1) x¬(xn)=1 for all xR,x\vee\neg(x^{n})=1\text{ for all }x\in R,

where, as usual, we define ¬x\neg x as x0x\rightarrow 0 (and xnx^{n} refers to the nn-th power with respect to \odot). For our purposes this theorem has the following practical consequence.

Corollary 2.16.

Let 𝐑\mathbf{R} be a finite 𝖥𝖫ew\mathsf{FL}_{ew}-algebra. If 𝐑\mathbf{R} does not contain any idempotent elements (that is, elements with xx=xx\odot x=x) other than 0 and 11, then 𝐑\mathbf{R} is quasi-primal. If 𝐑\mathbf{R} is based on a chain, the converse also holds.

Proof.

Let 𝐑\mathbf{R} be a finite 𝖥𝖫ew\mathsf{FL}_{ew}-algebra with no other idempotent elements than 0 and 11. Recall that, for any aRa\in R, we have ¬a=a0={bRab0}.\neg a=a\rightarrow 0=\bigvee\{b\in R\mid a\odot b\leq 0\}. Let aR{0,1}a\in R{\setminus}\{0,1\}. We show that there is some nan_{a} such that ana=0a^{n_{a}}=0. Since aa is not idempotent we have a2<aa^{2}<a. Either a2=0a^{2}=0 and we are done or a2a^{2} is again not idempotent. In this case we have a4<a2a^{4}<a^{2} and we repeat the argument. Since 𝐑\mathbf{R} is finite, continuing this process we eventually need to find a2k=0a^{2^{k}}=0. Now 𝐑\mathbf{R} satisfies equation (1) for n={naaR{0,1}}n=\bigvee\{n_{a}\mid a\in R{\setminus}\{0,1\}\}, since we always have

a¬(an)=a¬0=a1=1.a\vee\neg(a^{n})=a\vee\neg 0=a\vee 1=1.

Thus 𝐑\mathbf{R} is quasi-primal.

Now suppose that 𝐑\mathbf{R} is based on a chain. If aR{0,1}a\in R{\setminus}\{0,1\} is idempotent, then ¬a<a\neg a<a since for all bab\geq a we have abaa=aa\odot b\geq a\odot a=a. Therefore, for all n1n\geq 1 we have a¬(an)=a¬a=a1a\vee\neg(a^{n})=a\vee\neg a=a\neq 1. Thus, 𝐑\mathbf{R} does not satisfy equation (1) and is not quasi-primal. ∎

Remark 3.

The second part of the argument really requires 𝐑\mathbf{R} to be based on a chain. For example, consider the 44-element diamond lattice 0a,b10\leq a,b\leq 1 with ab=0a\wedge b=0 and ab=1a\vee b=1. We can define a 𝖥𝖫ew\mathsf{FL}_{ew}-algebra based on this lattice by stipulating a2=aa^{2}=a, b2=bb^{2}=b and ab=0a\odot b=0. Even though aa and bb are idempotent, we have a¬a=ab=1a\vee\neg a=a\vee b=1 and b¬b=ba=1b\vee\neg b=b\vee a=1. Therefore, this algebra is quasi-primal (it is, however, not semi-primal, since it has the non-trivial automorphism swapping aa and bb). \blacksquare

In [31] Galatos and Jipsen provide a list of all finite residuated lattices of size up to 66. Corollary 2.16 enables us to find quasi-primal 𝖥𝖫ew\mathsf{FL}_{ew}-algebras among them and thus, using Proposition 2.2, we can identify the semi-primal ones by ruling out the existence of non-trivial internal isomorphisms. For example, there is a total of six quasi-primal 𝖥𝖫ew\mathsf{FL}_{ew}-chains with 55 elements (R1,175,1,R1,185,1R1,225,1R_{1,17}^{5,1},R_{1,18}^{5,1}\dots R^{5,1}_{1,22} in [31]), five of which are semi-primal (all except R1,175,1R_{1,17}^{5,1}). Examples of semi-primal 𝖥𝖫ew\mathsf{FL}_{ew}-algebras not based on a chain are, e.g., R1,116,2R^{6,2}_{1,11} and R1,96,3R^{6,3}_{1,9} in [31]. The algebras in question are depicted in Appendix A, where we also provide detailed proofs of these claims.

While until now we discussed how to identify semi-primal 𝖥𝖫ew\mathsf{FL}_{ew}-algebras, we end this subsection with two examples of semi-primal algebras based on residuated lattices where 1e1\neq e.

Specifically, we consider the bounded De Morgan monoids 𝐂𝟒𝟎𝟏\mathbf{C^{01}_{4}} and 𝐃𝟒𝟎𝟏\mathbf{D^{01}_{4}} depicted in Figure 1.

0eeaa1=a21=a^{2}
01=a21=a^{2}eeaa
Figure 1. The (semi-)primal bounded De Morgan monoids 𝐂𝟒𝟎𝟏\mathbf{C^{01}_{4}} and 𝐃𝟒𝟎𝟏\mathbf{D^{01}_{4}}.

They are bounded commutative residuated lattices with an additional involution {\sim} which, in both examples, is defined by e=a{\sim}e=a and 0=1{\sim}0=1. Our names for these algebras are inspired by [47], where 𝐂𝟒\mathbf{C_{4}} and 𝐃𝟒\mathbf{D_{4}} are used for the corresponding De Morgan monoids with the bounds 0 and 11 excluded from the signature (in [47] it is shown that each of these two algebras generates a minimal subvariety of the variety of all De Morgan monoids).

Proposition 2.17.

The algebras 𝐂𝟒𝟎𝟏\mathbf{C_{4}^{01}} and 𝐃𝟒01\mathbf{D_{4}}^{01} are primal. Their reducts obtained by removing the neutral element ee from the signature, are semi-primal.

Proof.

Starting with 𝐂𝟒𝟎𝟏\mathbf{C_{4}^{01}}, we directly verify that it satisfies characterization (3) of Proposition 2.8. First we define T1T_{1} and, therefore, T0(x)=T1(x)T_{0}(x)=T_{1}({\sim}x). As in [22], we do this by, for all {0,e,a}\ell\in\{0,e,a\}, defining unary terms uu_{\ell} satisfying u(1)=1u_{\ell}(1)=1 and u()=0u_{\ell}(\ell)=0. For instance, we can define such terms by

u0(x)=x1,ue(x)=((x)2) and ua(x)=((x)1).u_{0}(x)=x\wedge 1,\hskip 5.69054ptu_{e}(x)={\sim}\big{(}({\sim}x)^{2}\big{)}\text{ and }u_{a}(x)={\sim}\big{(}{({\sim}x)\odot 1}\big{)}.

Through these terms we can clearly define T1(x)=u0(x)ue(x)ua(x).T_{1}(x)=u_{0}(x)\wedge u_{e}(x)\wedge u_{a}(x). Lastly, we need to define τ\tau_{\ell} for {e,a}\ell\in\{e,a\}. Again, it suffices to find terms τ\tau^{\ast}_{\ell} which satisfy

τ(x)={1 if x1 if x,\tau^{\ast}_{\ell}(x)=\begin{cases}1&\text{ if }x\geq\ell\\ \neq 1&\text{ if }x\not\geq\ell,\end{cases}

since then we get τ=T1(τ)\tau_{\ell}=T_{1}(\tau_{\ell}^{\ast}). Our desired terms are given by

τe(x)=((x)2x)x2 and τa(x)=x2.\tau^{\ast}_{e}(x)=\big{(}({\sim}x)^{2}\odot x\big{)}\vee x^{2}\text{ and }\tau^{\ast}_{a}(x)=x^{2}.

This concludes the proof for 𝐂𝟒𝟎𝟏\mathbf{C_{4}^{01}}. The proof for 𝐃𝟒𝟎𝟏\mathbf{D_{4}^{01}} is completely analogous, except that we use τe(x)=((x)2x)x\tau^{\ast}_{e}(x)=\big{(}({\sim}x)^{2}\odot x\big{)}\vee x instead. Thus we showed that these two algebras are semi-primal, and since they don’t have any proper subalgebras they are primal. Since we never relied on the constant ee in the above, the last part of the statement follows. Note that in both cases, if we exclude ee from the signature then {0,1}\{0,1\} becomes a proper subalgebra. ∎

2.3.3. Pseudo-logics

We illustrate how to generate more examples of semi-primal algebras which are based on a bounded lattice which is not necessarily a chain. The results and terminology are due to [17, 22]. A pseudo-logic

𝐋=(L,,,,0,1)\mathbf{L}=(L,\wedge,\vee,^{\prime},0,1)

is a bounded lattice with an additional unary operation which satisfies 0=10^{\prime}=1 and 1=01^{\prime}=0. In [22] it is shown that every subalgebra of 𝐋2\mathbf{L}^{2} which is not the graph of an internal isomorphism is a product of subalgebras if the following two properties are satisfied:

  1. (1)

    There is no aL{0}a\in L{\setminus}\{0\} with a=1a^{\prime}=1,

  2. (2)

    For all aLa\in L there exists an n1n\geq 1 with aa(2n)=0a\wedge a^{(2n)}=0 (where a(k)a^{(k)} denotes the kk-fold iteration of on aa).

Using this and the characterization of Proposition 2.3, we can find more examples of semi-primal algebras. Here, we only need to assure that the above mentioned conditions are satisfied and that there are no non-trivial internal isomorphisms. For example, the three algebras depicted in Figure 2 are semi-primal (the pseudo-negation is indicated by dotted arrows).

011aabbcc
011aabbccdd
011aabbccddee
Figure 2. Some semi-primal pseudo-logics ([22, 17]).

2.3.4. Murskiĭ’s Theorem

While semi-primal algebras may seem rare, quite the opposite is suggested by the following. In 1975, Murskiĭ proved his surprising theorem about the proportion of semi-primal algebras of a fixed signature under increasing order. The original paper [48] is in Russian, the version we recall here is due to [6, Section 6.2].

Theorem 2.18.

[48] Let σ\sigma be an algebraic type which contains at least one operation symbol which is at least binary. Let Aσ,nA_{\sigma,n} be the number of algebras of type σ\sigma and size nn and let SPσ,nSP_{\sigma,n} be the number of such algebras which are semi-primal. Then

limnSPσ,nAσ,n=1.\lim_{n\to\infty}\frac{SP_{\sigma,n}}{A_{\sigma,n}}=1.

3. Semi-primal duality

One of the nice features of the variety of Boolean algebras 𝖡𝖠\mathsf{BA} is the famous Stone duality [57]. Categorically speaking, it asserts that there is a dual equivalence between 𝖡𝖠\mathsf{BA} and the category 𝖲𝗍𝗈𝗇𝖾\mathsf{Stone} of Stone spaces (that is, compact, Hausdorff and zero-dimensional topological spaces) with continuous maps:

𝖲𝗍𝗈𝗇𝖾\textstyle{{\mathsf{Stone}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Π\scriptstyle{\Pi}𝖡𝖠\textstyle{{\ \mathsf{BA}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Σ\scriptstyle{\Sigma}

The functor Σ\Sigma assigns to a Boolean algebra 𝐁\mathbf{B} its collection of ultrafilters and the functor Π\Pi assigns to a Stone space XX the Boolean algebra of its clopen subsets with the usual set-theoretical Boolean operations. Note that these functors can be defined on objects by

Σ(𝐁)=𝖡𝖠(𝐁,𝟐) and Π(X)=𝖲𝗍𝗈𝗇𝖾(X,2),\Sigma(\mathbf{B})=\mathsf{BA}(\mathbf{B},\mathbf{2})\text{ and }\Pi(X)=\mathsf{Stone}(X,2),

where in the latter equation 22 denotes the two-element discrete space.

Stone duality has been extended to quasi-primal algebras by Keimel and Werner in [42]. This duality fits the general framework of Natural Dualities. For us, the Semi-primal Strong Duality Theorem [17, Theorem 3.3.14] is of high importance. However, we present it self-contained and in a way which particularly suits our purpose. Furthermore, we will use categorical constructions to provide a new proof of this duality. Such a proof has, to the best of our knowledge, not appeared in the literature yet.

First we introduce the dual category of 𝒜\mathcal{A} generated by a semi-primal algebra. In the following, we always consider 𝕊(𝐋)\mathbb{S}(\mathbf{L}) as a complete lattice in its usual ordering.

Definition 3.1.

The category 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} has objects (X,𝐯)(X,\mathbf{v}) where X𝖲𝗍𝗈𝗇𝖾X\in\mathsf{Stone} and

𝐯:X𝕊(𝐋)\mathbf{v}\colon X\to\mathbb{S}(\mathbf{L})

assigns to every point xXx\in X a subalgebra 𝐯(x)𝐋\mathbf{v}(x)\leq\mathbf{L}, such that for every subalgebra 𝐒𝐋\mathbf{S}\leq\mathbf{L} the preimage 𝐯1(𝐒)\mathbf{v}^{-1}(\mathbf{S}{\downarrow}) is closed. A morphism m:(X,𝐯)(Y,𝐰)m\colon(X,\mathbf{v})\to(Y,\mathbf{w}) in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} is a continuous map XYX\to Y which, for all xXx\in X, satisfies

𝐰(m(x))𝐯(x).\mathbf{w}(m(x))\leq\mathbf{v}(x).
Remark 4.

In the framework of natural dualities [17], the dual category of 𝒜\mathcal{A} is defined slightly differently, using Stone spaces with unary relations (i.e., subsets). Let 𝒳\mathcal{X} be the category with objects (X,{R𝐒𝐒𝐋})(X,\{R_{\mathbf{S}}\mid\mathbf{S}\leq\mathbf{L}\}), where X𝖲𝗍𝗈𝗇𝖾X\in\mathsf{Stone} and R𝐒R_{\mathbf{S}} is a closed subset of XX for each subalgebra 𝐒𝐋\mathbf{S}\leq\mathbf{L}, satisfying R𝐋=XR_{\mathbf{L}}=X and R𝐒𝟏R𝐒𝟐=R𝐒1𝐒𝟐R_{\mathbf{S_{1}}}\cap R_{\mathbf{S_{2}}}=R_{\mathbf{S}_{1}\cap\mathbf{S_{2}}} for all 𝐒𝟏,𝐒𝟐𝐋\mathbf{S_{1}},\mathbf{S_{2}}\leq\mathbf{L}. A morphism m:(X,{R𝐒𝐒𝐋})(X,{R𝐒𝐒𝐋})m\colon(X,\{R_{\mathbf{S}}\mid\mathbf{S}\leq\mathbf{L}\})\to(X^{\prime},\{R^{\prime}_{\mathbf{S}}\mid\mathbf{S}\leq\mathbf{L}\}) in 𝒳\mathcal{X} is a continuous relation-preserving map XXX\to X^{\prime}, i.e., it satisfies xR𝐒m(x)R𝐒x\in R_{\mathbf{S}}\Rightarrow m(x)\in R^{\prime}_{\mathbf{S}} for all xXx\in X and 𝐒𝕊(𝐋)\mathbf{S}\in\mathbb{S}(\mathbf{L}).

The categories 𝒳\mathcal{X} and 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} are isomorphic, as witnessed by the following mutually inverse functors ϕ\phi and ψ\psi. The functor ϕ:𝒳𝖲𝗍𝗈𝗇𝖾𝐋\phi:\mathcal{X}\to\mathsf{Stone}_{\mathbf{L}} is given on objects by (X,{R𝐒𝐒𝐋})(X,𝐯)(X,\{R_{\mathbf{S}}\mid\mathbf{S}\leq\mathbf{L}\})\mapsto(X,\mathbf{v}), where

𝐯(x)={𝐒xR𝐒}.\mathbf{v}(x)=\bigcap\{\mathbf{S}\mid x\in R_{\mathbf{S}}\}.

The functor ψ:𝖲𝗍𝗈𝗇𝖾𝐋𝒳\psi\colon\mathsf{Stone}_{\mathbf{L}}\to\mathcal{X} is given on objects by (X,𝐯)(X,{R𝐒𝐒𝐋})(X,\mathbf{v})\mapsto(X,\{R_{\mathbf{S}}\mid\mathbf{S}\leq\mathbf{L}\}) where

R𝐒={xX𝐯(x)𝐒}.R_{\mathbf{S}}=\{x\in X\mid\mathbf{v}(x)\leq\mathbf{S}\}.

Both ϕ\phi and ψ\psi map every morphism to itself. \blacksquare

We now describe the two contravariant functors Σ𝐋\Sigma_{\mathbf{L}} and Π𝐋\Pi_{\mathbf{L}} which give rise to the duality between 𝒜\mathcal{A} and 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}:

𝖲𝗍𝗈𝗇𝖾𝐋\textstyle{\mathsf{Stone}_{\mathbf{L}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Π𝐋\scriptstyle{\Pi_{\mathbf{L}}}𝒜\textstyle{{\ \mathcal{A}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Σ𝐋\scriptstyle{\Sigma_{\mathbf{L}}}

On objects 𝐀𝒜\mathbf{A}\in\mathcal{A}, let the functor Σ𝐋\Sigma_{\mathbf{L}} be defined by

Σ𝐋(𝐀)=(𝒜(𝐀,𝐋),𝐢𝐦)\Sigma_{\mathbf{L}}(\mathbf{A})=\big{(}\mathcal{A}(\mathbf{A},\mathbf{L}),\mathbf{im}\big{)}

where 𝐢𝐦\mathbf{im} assigns to a homomorphism h:𝐀𝐋h\colon\mathbf{A}\to\mathbf{L} its image 𝐢𝐦(h)=h(A)𝕊(𝐋)\mathbf{im}(h)=h(A)\in\mathbb{S}(\mathbf{L}). A clopen subbasis for the topology on 𝒜(𝐀,𝐋)\mathcal{A}(\mathbf{A},\mathbf{L}) is given by the collection of sets of the following form with aAa\in A and L\ell\in L:

[a:]={h𝒜(𝐀,𝐋)h(a)=}.[a:\ell]=\{h\in\mathcal{A}(\mathbf{A},\mathbf{L})\mid h(a)=\ell\}.

On morphisms f𝒜(𝐀1,𝐀2)f\in\mathcal{A}(\mathbf{A}_{1},\mathbf{A}_{2}) the functor acts via composition

Σ𝐋f:𝒜(𝐀2,𝐋)\displaystyle\Sigma_{\mathbf{L}}f\colon\mathcal{A}(\mathbf{A}_{2},\mathbf{L}) 𝒜(𝐀1,𝐋)\displaystyle\to\mathcal{A}(\mathbf{A}_{1},\mathbf{L})
h\displaystyle h hf.\displaystyle\mapsto h\circ f.

Note that this is a morphism in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} since 𝐢𝐦(hf)𝐢𝐦(h)\mathbf{im}(h\circ f)\leq\mathbf{im}(h).

Before we define the functor Π𝐋\Pi_{\mathbf{L}}, we describe the canonical way to consider LL as a member of 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}. Simply endow LL with the discrete topology and

:L𝕊(𝐋)\bm{\langle\cdot\rangle}\colon L\rightarrow\mathbb{S}(\mathbf{L})

assigning to an element L\ell\in L the subalgebra 𝐋\langle\ell\rangle\leq\mathbf{L} it generates. Now, as expected, we can define the functor Π𝐋\Pi_{\mathbf{L}} on objects (X,𝐯)𝖲𝗍𝗈𝗇𝖾𝐋(X,\mathbf{v})\in\mathsf{Stone}_{\mathbf{L}} by

Π𝐋(X,𝐯)=𝖲𝗍𝗈𝗇𝖾𝐋((X,𝐯),(L,))\Pi_{\mathbf{L}}(X,\mathbf{v})=\mathsf{Stone}_{\mathbf{L}}\big{(}(X,\mathbf{v}),(L,\bm{\langle\cdot\rangle})\big{)}

with the algebraic operations defined pointwise. This means that the carrier-set of Π𝐋(X,𝐯)\Pi_{\mathbf{L}}(X,\mathbf{v}) is the set of continuous maps g:XLg\colon X\to L which respect 𝐯\mathbf{v} in the sense that, for all xXx\in X, they satisfy

g(x)𝐯(x).g(x)\in\mathbf{v}(x).

Again, on morphisms m:(X,𝐯)(Y,𝐰)m\colon(X,\mathbf{v})\to(Y,\mathbf{w}) the functor is defined via composition

Π𝐋m:𝖲𝗍𝗈𝗇𝖾𝐋((Y,𝐰),(L,))\displaystyle\Pi_{\mathbf{L}}m\colon\mathsf{Stone}_{\mathbf{L}}\big{(}(Y,\mathbf{w}),(L,\bm{\langle\cdot\rangle})\big{)} 𝖲𝗍𝗈𝗇𝖾𝐋((X,𝐯),(L,))\displaystyle\to\mathsf{Stone}_{\mathbf{L}}\big{(}(X,\mathbf{v}),(L,\bm{\langle\cdot\rangle})\big{)}
g\displaystyle g gm.\displaystyle\mapsto g\circ m.

This is well-defined due to the condition on morphisms in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}:

(gm)(x)=g(m(x))𝐰(m(x))𝐯(x).(g\circ m)(x)=g(m(x))\in\mathbf{w}(m(x))\subseteq\mathbf{v}(x).

It is also clearly a homomorphism since the operations are defined pointwise.

Theorem 3.2.

[42, 17] The functors Π𝐋\Pi_{\mathbf{L}} and Σ𝐋\Sigma_{\mathbf{L}} are fully faithful and establish a dual equivalence between 𝒜\mathcal{A} and 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}.

The remainder of this section is dedicated to an alternative proof of this theorem. The idea is to directly prove the duality on the finite level, and then lift it to the infinite level using the following categorical constructions.

Definition 3.3.

For a finitely complete and cocomplete category 𝖢{\mathsf{C}}, its completion under filtered colimits is denoted by 𝖨𝗇𝖽(𝖢)\mathsf{Ind}({\mathsf{C}}) and, dually, its completion under cofiltered limits is denoted by 𝖯𝗋𝗈(𝖢)\mathsf{Pro}({\mathsf{C}}).

For example, 𝖨𝗇𝖽(𝖡𝖠ω)𝖡𝖠\mathsf{Ind}(\mathsf{BA}^{\omega})\simeq\mathsf{BA} and 𝖯𝗋𝗈(𝖲𝖾𝗍ω)𝖲𝗍𝗈𝗇𝖾\mathsf{Pro}(\mathsf{Set}^{\omega})\simeq\mathsf{Stone}. More material about these completions can be found in Johnstone’s book [40, Chapter VI] (in particular, a more rigorous definition of the 𝖨𝗇𝖽\mathsf{Ind}-completion is given in VI.1.2). We only recite the following, which allows us to lift dualities between small categories (following Johnstone, dualities arising this way are called Stone type dualities).

Lemma 3.4.

[40, Lemma VI 3.1] Let 𝖢{\mathsf{C}} and 𝖣{\mathsf{D}} be small categories which are dually equivalent. Then 𝖨𝗇𝖽(𝖢)\mathsf{Ind}({\mathsf{C}}) is dually equivalent to 𝖯𝗋𝗈(𝖣)\mathsf{Pro}({\mathsf{D}}).

Our argument to prove Theorem 3.2 now has the following outline. The role of 𝖢{\mathsf{C}} will be played by 𝒜ω\mathcal{A}^{\omega}. Since 𝒜\mathcal{A} is locally finite (see, e.g., [17, Lemma 1.3.2]), it is well-known that 𝖨𝗇𝖽(𝒜ω)𝒜\mathsf{Ind}(\mathcal{A}^{\omega})\simeq\mathcal{A} (see, e.g., [40, Corollary VI 2.2]). The role of 𝖣{\mathsf{D}} will be played by 𝖲𝗍𝗈𝗇𝖾𝐋ω\mathsf{Stone}_{\mathbf{L}}^{\omega}. Since the topology doesn’t matter here (because it is always discrete), we will denote this category by 𝖲𝖾𝗍𝐋ω\mathsf{Set}_{\mathbf{L}}^{\omega} instead. To get the finite dual equivalence, we make the following observation

Proposition 3.5.

Let 𝐒𝟏,,𝐒𝐧\mathbf{S_{1}},\dots,\mathbf{S_{n}} be subalgebras of 𝐋\mathbf{L}. Then the set of homomorphisms 𝒜(in𝐒𝐢,𝐋)\mathcal{A}(\prod_{i\leq n}\mathbf{S_{i}},\mathbf{L}) consists exactly of the projections followed by inclusions

𝗉𝗋i:in𝐒𝐢𝐒𝐢𝐋\mathsf{pr}_{i}\colon\prod_{i\leq n}\mathbf{S_{i}}\to\mathbf{S_{i}}\hookrightarrow\mathbf{L}

in each component ini\leq n.

Proof.

Our proof is similar to that of [12, Theorem 2.5]. Let h:in𝐒𝐢𝐋h\colon\prod_{i\leq n}\mathbf{S_{i}}\to\mathbf{L} be a homomorphism. Since 𝒜\mathcal{A} is congruence distributive (Proposition 2.5), it has the Fraser-Horn property, meaning that the congruence θ:=𝗄𝖾𝗋(h)\theta:=\mathsf{ker}(h) is a product of congruences θi\theta_{i} on 𝐒𝐢\mathbf{S_{i}}. By the isomorphism theorem we find

(in𝐒𝐢)/θin(𝐒𝐢/θi)𝗂𝗆(h).(\prod_{i\leq n}\mathbf{S_{i}})/\theta\cong\prod_{i\leq n}(\mathbf{S_{i}}/\theta_{i})\cong\mathsf{im}(h).

Since 𝗂𝗆(h)\mathsf{im}(h) is a subalgebra of 𝐋\mathbf{L} and thus simple by Proposition 2.5, at most one factor of in(𝐒𝐢/θi)\prod_{i\leq n}(\mathbf{S_{i}}/\theta_{i}) can be non-trivial. Since 𝗂𝗆(h)\mathsf{im}(h) contains at least two elements (that is, 0 and 11), precisely one factor, say 𝐒𝐣/θj\mathbf{S_{j}}/\theta_{j}, is non-trivial. Since 𝐒𝐣\mathbf{S_{j}} is itself semi-primal, it is simple, so 𝐒𝐣/θj𝐒𝐣\mathbf{S_{j}}/\theta_{j}\cong\mathbf{S_{j}}. So hh induces an internal isomorphism 𝐒𝐣𝗂𝗆(h)\mathbf{S_{j}}\cong\mathsf{im}(h), but by Proposition 2.2 this can only be the identity on 𝐒𝐣\mathbf{S_{j}}, thus hh coincides with 𝗉𝗋j\mathsf{pr}_{j}. ∎

Corollary 3.6.

The (restrictions of the) functors Π𝐋\Pi_{\mathbf{L}} and Σ𝐋\Sigma_{\mathbf{L}} establish a dual equivalence between the small categories 𝖲𝖾𝗍𝐋ω{\mathsf{Set}_{\mathbf{L}}}^{\omega} and 𝒜ω\mathcal{A}^{\omega}.

Proof.

Let (X,𝐯)𝖲𝖾𝗍𝐋ω(X,\mathbf{v})\in\mathsf{Set}_{\mathbf{L}}^{\omega}. Then

Σ𝐋Π𝐋(X,𝐯)=(𝒜(xX𝐯(x),𝐋),𝐢𝐦).\Sigma_{\mathbf{L}}\Pi_{\mathbf{L}}(X,\mathbf{v})=\Big{(}\mathcal{A}\big{(}\prod_{x\in X}\mathbf{v}(x),\mathbf{L}\big{)},\mathbf{im}\Big{)}.

By Proposition 3.5 this is equal to ({𝗉𝗋xxX},𝐢𝐦)(\{\mathsf{pr}_{x}\mid x\in X\},\mathbf{im}), which is clearly isomorphic to (X,𝐯)(X,\mathbf{v}).

On the other hand, starting with 𝐀𝒜ω\mathbf{A}\in\mathcal{A}^{\omega}, we know by Proposition 2.6 that it is a product of subalgebras 𝐀=in𝐒𝐢\mathbf{A}=\prod_{i\leq n}\mathbf{S_{i}}. Now, again due to Proposition 3.5, we get Σ𝐋(𝐀)=({𝗉𝗋iin},𝐢𝐦)\Sigma_{\mathbf{L}}(\mathbf{A})=(\{\mathsf{pr}_{i}\mid i\leq n\},\mathbf{im}), and thus

Π𝐋Σ𝐋(𝐀)in𝐢𝐦(𝗉𝗋i)in𝐒𝐢.\Pi_{\mathbf{L}}\Sigma_{\mathbf{L}}(\mathbf{A})\cong\prod_{i\leq n}\mathbf{im}(\mathsf{pr}_{i})\cong\prod_{i\leq n}\mathbf{S_{i}}.

To see that Π𝐋\Pi_{\mathbf{L}} and Σ𝐋\Sigma_{\mathbf{L}} form a dual adjunction we note that for 𝐀=in𝐒𝐢𝒜ω\mathbf{A}=\prod_{i\leq n}\mathbf{S_{i}}\in\mathcal{A}^{\omega} and (X,𝐯)𝖲𝖾𝗍𝐋ω(X,\mathbf{v})\in\mathsf{Set}_{\mathbf{L}}^{\omega} we have

𝒜ω(Π𝐋(X,𝐯),𝐀)in𝒜ω(Π𝐋(X,𝐯),𝐒𝐢)\mathcal{A}^{\omega}\big{(}\Pi_{\mathbf{L}}(X,\mathbf{v}),\mathbf{A}\big{)}\cong\prod_{i\leq n}\mathcal{A}^{\omega}\big{(}\Pi_{\mathbf{L}}(X,\mathbf{v}),\mathbf{S_{i}}\big{)}

and

𝖲𝖾𝗍𝐋ω(Σ𝐋(𝐀),(X,𝐯))𝖲𝖾𝗍𝐋ω(in({𝗉𝗋i},𝐢𝐦),(X,𝐯))in𝖲𝖾𝗍𝐋ω(({𝗉𝗋i},𝐢𝐦),(X,𝐯))\mathsf{Set}_{\mathbf{L}}^{\omega}\big{(}\Sigma_{\mathbf{L}}(\mathbf{A}),(X,\mathbf{v})\big{)}\cong\mathsf{Set}_{\mathbf{L}}^{\omega}(\coprod_{i{\leq n}}(\{\mathsf{pr}_{i}\},\mathbf{im}),(X,\mathbf{v}))\cong\prod_{i{\leq n}}\mathsf{Set}_{\mathbf{L}}^{\omega}\big{(}(\{\mathsf{pr}_{i}\},\mathbf{im}),(X,\mathbf{v})\big{)}

where the coproduct in 𝖲𝖾𝗍𝐋ω\mathsf{Set}_{\mathbf{L}}^{\omega} is the obvious disjoint union. So we only need to show that

𝒜ω(Π𝐋(X,𝐯),𝐒𝐢)𝖲𝖾𝗍𝐋ω(({𝗉𝗋i},𝐢𝐦),(X,𝐯)).\mathcal{A}^{\omega}\big{(}\Pi_{\mathbf{L}}(X,\mathbf{v}),\mathbf{S_{i}}\big{)}\cong\mathsf{Set}_{\mathbf{L}}^{\omega}\big{(}(\{\mathsf{pr}_{i}\},\mathbf{im}),(X,\mathbf{v})\big{)}.

But this is obvious since the elements of the left-hand side are exactly the projections with image contained in 𝐒𝐢\mathbf{S_{i}}, which are in bijective correspondence with the points of XX with 𝐯(x)𝐒𝐢\mathbf{v}(x)\leq\mathbf{S_{i}}, that is, with elements of the right-hand side. ∎

In order to successfully apply Lemma 3.4, it remains to show the following.

Theorem 3.7.

𝖯𝗋𝗈(𝖲𝖾𝗍𝐋ω)\mathsf{Pro}(\mathsf{Set}_{\mathbf{L}}^{\omega}) is categorically equivalent to 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}.

Proof.

First we show that the category 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} is complete. For an index set II (which we often omit), we claim that the product is computed as

iI(Xi,𝐯𝐢)=(iIXi,𝐯𝐢),\prod_{i\in I}(X_{i},\mathbf{v_{i}})=(\prod_{i\in I}X_{i},\bigvee\mathbf{v_{i}}),

where 𝐯𝐢(p)=(𝐯𝐢(pi))\bigvee\mathbf{v_{i}}(p)=\bigvee(\mathbf{v_{i}}(p_{i})) for all pXip\in\prod X_{i}. It follows from

(𝐯𝐢)1(𝐒)=𝐯𝐢1(𝐒)(\bigvee\mathbf{v_{i}})^{-1}(\mathbf{S}{\downarrow})=\prod\mathbf{v_{i}}^{-1}(\mathbf{S}{\downarrow})

that this defines a member of 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}. Note that the projections are morphisms in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} since

𝐯𝐢(πi(p))=𝐯𝐢(pi)jI𝐯𝐣(pj)=(𝐯𝐣)(p).\mathbf{v_{i}}(\pi_{i}(p))=\mathbf{v_{i}}(p_{i})\leq\bigvee_{j\in I}\mathbf{v_{j}}(p_{j})=(\bigvee\mathbf{v_{j}})(p).

If (γi:(Y,𝐰)(Xi,𝐯𝐢)iI)(\gamma_{i}\colon(Y,\mathbf{w})\to(X_{i},\mathbf{v_{i}})\mid i\in I) is another cone, there is a unique continuous map f:YXif\colon Y\to\prod X_{i} with πif=γi\pi_{i}\circ f=\gamma_{i}. This map is a morphism in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} since

(𝐯𝐢)(f(y))=𝐯𝐢(πi(f(y)))=𝐯𝐢(γi(f(y)))𝐰(y),(\bigvee\mathbf{v_{i}})(f(y))=\bigvee\mathbf{v_{i}}\big{(}\pi_{i}(f(y))\big{)}=\bigvee\mathbf{v_{i}}\big{(}\gamma_{i}(f(y))\big{)}\leq\mathbf{w}(y),

where the last inequality follows from 𝐯𝐢(γi)(y)𝐰(y)\mathbf{v_{i}}(\gamma_{i})(y)\leq\mathbf{w}(y) which is true since the γi\gamma_{i} are morphisms in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}. The equalizer of f,g:(X,𝐯)(Y,𝐰)f,g\colon(X,\mathbf{v})\to(Y,\mathbf{w}) is simply given by (Eq,𝐯Eq)(Eq,\mathbf{v}{\mid}_{Eq}) where EqXEq\subseteq X is the corresponding equalizer in 𝖲𝗍𝗈𝗇𝖾\mathsf{Stone}. It follows that 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} has all limits. In particular, 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} has all cofiltered limits, so the natural inclusion functor ι:𝖲𝖾𝗍𝐋ω𝖲𝗍𝗈𝗇𝖾𝐋\iota\colon\mathsf{Set}_{\mathbf{L}}^{\omega}\hookrightarrow\mathsf{Stone}_{\mathbf{L}} has a unique cofinitary (that is, cofiltered limit preserving) extension

ι^:𝖯𝗋𝗈(𝖲𝖾𝗍𝐋ω)𝖲𝗍𝗈𝗇𝖾𝐋.\hat{\iota}\colon\mathsf{Pro}(\mathsf{Set}_{\mathbf{L}}^{\omega})\hookrightarrow\mathsf{Stone}_{\mathbf{L}}.

Since ι\iota is fully faithful, to conclude that the functor ι^\hat{\iota} is fully faithful as well it suffices to show that ι\iota maps all objects to finitely copresentable objects in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} (this is due to the analogue of [40, Theorem VI.1.8] for the 𝖯𝗋𝗈\mathsf{Pro}-completion). So we need to show that any (C,𝐰)𝖲𝗍𝗈𝗇𝖾𝐋(C,\mathbf{w})\in\mathsf{Stone}_{\mathbf{L}} where CC is a finite discrete space is finitely copresentable. In other words, we need to show that, whenever (X,𝐯)limiI(Xi,𝐯𝐢)(X,\mathbf{v})\cong\lim_{i\in I}(X_{i},\mathbf{v_{i}}) is a cofiltered limit of a diagram (fij:(Xj,𝐯𝐣)(Xi,𝐯𝐢)ij)(f_{ij}\colon(X_{j},\mathbf{v_{j}})\to(X_{i},\mathbf{v_{i}})\mid i\leq j) in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} with limit morphisms pi:(X,𝐯)(Xi,𝐯𝐢)p_{i}\colon(X,\mathbf{v})\to(X_{i},\mathbf{v_{i}}), any morphism f:(X,𝐯)(C,𝐰)f\colon(X,\mathbf{v})\to(C,\mathbf{w}) factors essentially uniquely through one of the pip_{i}. For this we can employ an argument similar to the one in the proof of [56, Lemma 1.1.16(b)]. On the underlying level of 𝖲𝗍𝗈𝗇𝖾\mathsf{Stone}, where finite discrete spaces are finitely copresentable, the continuous map ff factors essentially uniquely through some pip_{i}, say via the continuous map gi:XiCg_{i}\colon X_{i}\to C. However, gig_{i} is not necessarily a morphism in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}. Consider J={ji}J=\{j\geq i\} and for each jJj\in J define gj=fijgig_{j}=f_{ij}\circ g_{i}. Define the continuous maps μ:X𝕊(𝐋)2\mu\colon X\to\mathbb{S}(\mathbf{L})^{2} and μj:Xj𝕊(𝐋)2\mu_{j}\colon X_{j}\to\mathbb{S}(\mathbf{L})^{2} for all jJj\in J by

μ(x)=(𝐰(f(x)),𝐯(x)) and μj(x)=(𝐰(gj(x)),𝐯𝐣(x)).\mu(x)=\big{(}\mathbf{w}(f(x)),\mathbf{v}(x)\big{)}\text{ and }\mu_{j}(x)=\big{(}\mathbf{w}(g_{j}(x)),\mathbf{v_{j}}(x)\big{)}.

Since μ(X)=limjJμj(Xj)=jiμj(Xj)\mu(X)=\lim_{j\in J}\mu_{j}(X_{j})=\bigcap_{j\geq i}\mu_{j}(X_{j}) is contained in the finite set 𝕊(𝐋)2\mathbb{S}(\mathbf{L})^{2} and JJ is directed, there is some kJk\in J such that

μ(X)=μk(Xk).\mu(X)=\mu_{k}(X_{k}).

But now, since ff is a morphism in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}, we have that μ(X){(𝐒,𝐓)𝐒𝐓}\mu(X)\subseteq\{(\mathbf{S},\mathbf{T})\mid\mathbf{S}\leq\mathbf{T}\}, and thus the same holds for μk(Xk)\mu_{k}(X_{k}). Thus gkg_{k} is a morphism in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} which has the desired properties.

To finish the proof we show that ι^\hat{\iota} is essentially surjective, in other words, we show that every element (X,𝐯)(X,\mathbf{v}) of 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} is isomorphic to a cofiltered limit of elements of 𝖲𝖾𝗍𝐋ω\mathsf{Set}_{\mathbf{L}}^{\omega}. We do this in a manner similar to [56, Theorem 1.1.12]. Let \mathcal{R} consist of all finite partitions of XX into clopen sets. Together with the order RRR\leq R^{\prime} if and only if RR^{\prime} refines RR this forms a codirected set and in [56, Theorem 1.1.12] it is shown that XlimRRX\cong\lim_{R\in\mathcal{R}}R. We now turn every RR\in\mathcal{R} into a member of 𝖲𝖾𝗍𝐋ω\mathsf{Set}_{\mathbf{L}}^{\omega} by endowing it with an appropriate vR:R𝕊(𝐋)v_{R}\colon R\to\mathbb{S}(\mathbf{L}) and show that (X,v)=limR(R,vR)(X,v)=\lim_{R\in\mathcal{R}}(R,v_{R}). For RR\in\mathcal{R}, say R={Ω1,,Ωk}R=\{\Omega_{1},\dots,\Omega_{k}\}, we define

vR1(𝐒)={ΩiΩi𝐯1(𝐒)}.v_{R}^{-1}(\mathbf{S}{\downarrow})=\{\Omega_{i}\mid\Omega_{i}\cap\mathbf{v}^{-1}(\mathbf{S}{\downarrow})\neq\varnothing\}.

The map pR:XRp_{R}\colon X\to R defined by pR(x)=ΩixΩip_{R}(x)=\Omega_{i}\Leftrightarrow x\in\Omega_{i} is a morphism in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} since 𝐯(x)=𝐒\mathbf{v}(x)=\mathbf{S} and xΩix\in\Omega_{i} implies vR(pR(x))vR1(𝐒)v_{R}(p_{R}(x))\in v_{R}^{-1}(\mathbf{S}{\downarrow}). Is is easy to see that this defines a cone over the diagram (R,vR)R(R,v_{R})_{R\in\mathcal{R}}, so there is a unique f:(X,𝐯)limR(R,vR)f\colon(X,\mathbf{v})\to\lim_{R\in\mathcal{R}}(R,v_{R}) in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}. As in 𝖲𝗍𝗈𝗇𝖾\mathsf{Stone}, the map ff is a homeomorphism. To complete the proof it suffices to show that f1f^{-1} is a morhpism in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} as well. Say limR(R,vR)=(Y,𝐰)\lim_{R\in\mathcal{R}}(R,v_{R})=(Y,\mathbf{w}) and let πR:(Y,𝐰)(R,vR)\pi_{R}\colon(Y,\mathbf{w})\to(R,v_{R}) denote the limit morphisms. Assuming 𝐰(y)=𝐒\mathbf{w}(y)=\mathbf{S} we want to show f1(y)𝐯1(𝐒)f^{-1}(y)\in\mathbf{v}^{-1}(\mathbf{S}{\downarrow}). Let ΩX\Omega\subseteq X be an arbitrary clopen set containing f1(y)f^{-1}(y). Then R={Ω,XΩ}R=\{\Omega,X{\setminus}\Omega\}\in\mathcal{R} and

Ω=pR(f1(y))=πR(y)vR1(𝐒).\Omega=p_{R}(f^{-1}(y))=\pi_{R}(y)\in v_{R}^{-1}(\mathbf{S}{\downarrow}).

By definition this means that Ω𝐯1(𝐒)\Omega\cap\mathbf{v}^{-1}(\mathbf{S}{\downarrow})\neq\varnothing. Since this holds for every Ω\Omega containing f1(y)f^{-1}(y), this implies that f1(y)f^{-1}(y) is in the closure 𝐯1(𝐒)¯\overline{\mathbf{v}^{-1}(\mathbf{S}{\downarrow})}. However, this closure coincides with 𝐯1(𝐒)\mathbf{v}^{-1}(\mathbf{S}{\downarrow}), since by definition of 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} this is a closed set already. ∎

As discussed before, this yields our alternative proof of Theorem 3.2. In Section 5 we investigate the other dual equivalence which can be obtained from the finite dual equivalence of Corollary 3.6. More specifically, there we describe 𝖨𝗇𝖽(𝖲𝖾𝗍𝐋ω)\mathsf{Ind}(\mathsf{Set}_{\mathbf{L}}^{\omega}) and its dual, the category of profinite algebras 𝖯𝗋𝗈(𝒜ω)\mathsf{Pro}(\mathcal{A}^{\omega}). This is the ‘semi-primal version’ of the duality between 𝖨𝗇𝖽(𝖲𝖾𝗍ω)𝖲𝖾𝗍\mathsf{Ind}(\mathsf{Set}^{\omega})\simeq\mathsf{Set} and 𝖯𝗋𝗈(𝖡𝖠ω)𝖢𝖠𝖡𝖠\mathsf{Pro}(\mathsf{BA}^{\omega})\simeq\mathsf{CABA}.

Before that, in the following section we investigate the relationship between 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} and 𝖲𝗍𝗈𝗇𝖾\mathsf{Stone} and, more interestingly, between 𝒜\mathcal{A} and 𝖡𝖠\mathsf{BA}.

4. A chain of adjuntions

In this section we explore the relationship between Stone duality and the semi-primal duality discussed in the previous section. We start with the connection between 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} and 𝖲𝗍𝗈𝗇𝖾\mathsf{Stone}, which will be expressed in terms of a chain of four adjoint functors (similar to one in [58]). Then we look at the duals of these functors and give them purely algebraic descriptions to gain insight into the structure of 𝒜\mathcal{A} relative to that of 𝖡𝖠\mathsf{BA}. The entire situation is summarized in Figure 3, which we will have fully described at the end of this section (note that left-adjoints on the topological side correspond to right-adjoints on the algebraic side and vice-versa, since the functors Π𝐋,Σ𝐋\Pi_{\mathbf{L}},\Sigma_{\mathbf{L}} and Σ,Π\Sigma,\Pi which establish the two dualities are contravariant).

𝖲𝗍𝗈𝗇𝖾𝐋\textstyle{\mathsf{Stone}_{\mathbf{L}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Π𝐋\scriptstyle{\Pi_{\mathbf{L}}}\scriptstyle{\dashv}𝖵\scriptstyle{\mathsf{V}^{\top}}𝖴\scriptstyle{\mathsf{U}}\scriptstyle{\dashv}𝖵\scriptstyle{\mathsf{V}^{\bot}}\scriptstyle{\dashv}𝖢\scriptstyle{\mathsf{C}}𝒜\textstyle{\mathcal{A}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Σ𝐋\scriptstyle{\Sigma_{\mathbf{L}}}\scriptstyle{\vdash}𝔓\scriptstyle{\mathfrak{P}}𝔖\scriptstyle{\mathfrak{S}}\scriptstyle{\vdash}𝖨\scriptstyle{\mathsf{I}\phantom{a}}\scriptstyle{\vdash}𝖰\scriptstyle{\mathsf{Q}}𝖲𝗍𝗈𝗇𝖾\textstyle{\mathsf{Stone}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Π\scriptstyle{\Pi}𝖡𝖠\textstyle{\mathsf{BA}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Σ\scriptstyle{\Sigma}
Figure 3. The chain of adjunctions on the topological and the algebraic side.

4.1. Four functors on the topological side

Let 𝖴:𝖲𝗍𝗈𝗇𝖾𝐋𝖲𝗍𝗈𝗇𝖾\mathsf{U}\colon\mathsf{Stone}_{\mathbf{L}}\to\mathsf{Stone} be the obvious forgetful functor. This functor has a left-adjoint and a right-adjoint 𝖵𝖴𝖵\mathsf{V}^{\top}\dashv\mathsf{U}\dashv\mathsf{V}^{\bot}. The two functors 𝖵,𝖵:𝖲𝗍𝗈𝗇𝖾𝐋𝖲𝗍𝗈𝗇𝖾\mathsf{V}^{\top},\mathsf{V}^{\bot}\colon\mathsf{Stone}_{\mathbf{L}}\rightarrow\mathsf{Stone} are given on objects by

V(X)=(X,𝐯) where xX:𝐯(x)=𝐋,\displaystyle V^{\top}(X)=(X,\mathbf{v^{\top}})\text{ where }\forall x\in X:\mathbf{v^{\top}}(x)=\mathbf{L},
V(X)=(X,𝐯) where xX:𝐯(x)=0,1\displaystyle V^{\bot}(X)=(X,\mathbf{v^{\bot}})\text{ where }\forall x\in X:\mathbf{v^{\bot}}(x)=\langle 0,1\rangle

and both assign every morphism to itself. Here 0,1\langle 0,1\rangle is the subalgebra generated by {0,1}\{0,1\}, that is, the (unique) smallest subalgebra of 𝐋\mathbf{L}.

To see V𝖴V^{\top}\dashv\mathsf{U} note that by definition we have

m𝖲𝗍𝗈𝗇𝖾𝐋((X,𝐯),(Y,𝐰))m𝖲𝗍𝗈𝗇𝖾(X,Y)xX:𝐰(m(x))𝐯(x),m\in\mathsf{Stone}_{\mathbf{L}}\big{(}(X,\mathbf{v^{\top}}),(Y,\mathbf{w})\big{)}\Leftrightarrow m\in\mathsf{Stone}(X,Y)\wedge\forall x\in X:\mathbf{w}(m(x))\leq\mathbf{v^{\top}}(x),

and 𝐰(m(x))𝐯(x)=𝐋\mathbf{w}(m(x))\leq\mathbf{v^{\top}}(x)=\mathbf{L} is trivially satisfied for every m𝖲𝗍𝗈𝗇𝖾(X,Y)m\in\mathsf{Stone}(X,Y).

Similarly we see 𝖴𝖵\mathsf{U}\dashv\mathsf{V}^{\bot}, since every m𝖲𝗍𝗈𝗇𝖾(X,Y)m\in\mathsf{Stone}(X,Y) automatically satisfies 𝐯(m(x))𝐰(x)\mathbf{v^{\bot}}(m(x))\leq\mathbf{w}(x) and, therefore, m𝖲𝗍𝗈𝗇𝖾𝐋((X,𝐰),(Y,𝐯))m\in\mathsf{Stone}_{\mathbf{L}}\big{(}(X,\mathbf{w}),(Y,\mathbf{v^{\bot}})\big{)}.

The functor 𝖵\mathsf{V}^{\bot} also has a right-adjoint 𝖢:𝖲𝗍𝗈𝗇𝖾𝐋𝖲𝗍𝗈𝗇𝖾\mathsf{C}:\mathsf{Stone}_{\mathbf{L}}\rightarrow\mathsf{Stone} defined by

𝖢(X,𝐯)={xX𝐯(x)=0,1}\mathsf{C}(X,\mathbf{v})=\{x\in X\mid\mathbf{v}(x)=\langle 0,1\rangle\}

on objects. On morphisms m:(X,𝐯)(Y,𝐰)m\colon(X,\mathbf{v})\to(Y,\mathbf{w}) it acts via restriction mm𝖢(X,v)m\mapsto m{\mid}_{\mathsf{C}(X,v)}, which is well-defined since m𝖲𝗍𝗈𝗇𝖾𝐋((X,𝐯),(Y,𝐰))m\in\mathsf{Stone}_{\mathbf{L}}\big{(}(X,\mathbf{v}),(Y,\mathbf{w})\big{)} and x𝖢(X,𝐯)x\in\mathsf{C}(X,\mathbf{v}) means

𝐰(m(x))𝐯(x)=0,1\mathbf{w}(m(x))\leq\mathbf{v}(x)=\langle 0,1\rangle

which is equivalent to m(x)𝖢(W,𝐰).m(x)\in\mathsf{C}(W,\mathbf{w}). Again 𝖵𝖢\mathsf{V}^{\bot}\dashv\mathsf{C} is easy to see since

m𝖲𝗍𝗈𝗇𝖾𝐋((X,𝐯),(Y,𝐰))x:𝐰(m(x))0,1m𝖲𝗍𝗈𝗇𝖾(X,𝖢(Y,𝐰)).m\in\mathsf{Stone}_{\mathbf{L}}\big{(}(X,\mathbf{v^{\bot}}),(Y,\mathbf{w})\big{)}\Leftrightarrow\forall x:\mathbf{w}(m(x))\leq\langle 0,1\rangle\Leftrightarrow m\in\mathsf{Stone}\big{(}X,\mathsf{C}(Y,\mathbf{w})\big{)}.

The functor 𝖵\mathsf{V}^{\top} preserves almost all limits, however, there is one important exception. The terminal object (that is, the limit of the empty diagram) in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} is given by ({},𝐯)(\{\ast\},\mathbf{v}^{\bot}), implying that 𝖵\mathsf{V}^{\top} does not preserve terminal objects. Therefore, contrary to a claim made in [58], no further left-adjoint of 𝖵\mathsf{V}^{\top} exists.

It is obvious that both the unit 𝗂𝖽𝖲𝗍𝗈𝗇𝖾𝖴𝖵\mathsf{id}_{\mathsf{Stone}}\Rightarrow\mathsf{U}\circ\mathsf{V}^{\top} of the adjunction 𝖵𝖴\mathsf{V}^{\top}\dashv\mathsf{U} and the counit 𝖴𝖵𝗂𝖽𝖲𝗍𝗈𝗇𝖾\mathsf{U}\circ\mathsf{V}^{\bot}\Rightarrow\mathsf{id}_{\mathsf{Stone}} of the adjunction 𝖴𝖵\mathsf{U}\dashv\mathsf{V}^{\bot} are natural isomorphisms. We hold on to this fact, which will also be interesting on the algebraic side.

Proposition 4.1.

The category 𝖲𝗍𝗈𝗇𝖾\mathsf{Stone} is categorically equivalent to

  1. (i)

    a coreflective subcategory of 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}, witnessed by the fully faithful functor 𝖵\mathsf{V}^{\top}.

  2. (ii)

    a reflective and coreflective subcategory of 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}, witnessed by the fully faithful functor 𝖵\mathsf{V}^{\bot}.

The functors described in this subsection can be carried through the dualities, resulting in a a corresponding chain of adjunctions between 𝒜\mathcal{A} and 𝖡𝖠\mathsf{BA}. For example, the dual of 𝖴\mathsf{U} is given by Π𝖴Σ𝐋:𝒜𝖡𝖠\Pi\mathsf{U}\Sigma_{\mathbf{L}}\colon\mathcal{A}\to\mathsf{BA}. In the next subsection we show that this functor can be understood algebraically as the Boolean skeleton. Throughout the subsections that follow, we will give similar algebraic descriptions for all of these functors between 𝒜\mathcal{A} and 𝖡𝖠\mathsf{BA} in Figure 3.

4.2. The Boolean skeleton functor

In the theory of 𝖬𝖵n{\mathsf{MV}}_{n}-algebras (that is, the case where 𝐋=Łn\mathbf{L}=\text{\bf\L}_{n}), the Boolean skeleton is a well-known and useful tool (see, for example, [16]). An appropriate generalization of this concept to our setting was made by Maruyama in [44] (where it is called the Boolean core).

Due to Proposition 2.8 and [44, Lemma 3.11], the following definition is justified.

Definition 4.2.

Let 𝐀𝒜.\mathbf{A}\in\mathcal{A}. The Boolean skeleton of 𝐀\mathbf{A} is the Boolean algebra 𝔖(𝐀)=(𝔖(A),,,T0,0,1)\mathfrak{S}(\mathbf{A})=(\mathfrak{S}(A),\wedge,\vee,T_{0},0,1) on the carrier set

𝔖(A)={aAT1(a)=a},\mathfrak{S}(A)=\{a\in A\mid T_{1}(a)=a\},

where the lattice operations \wedge and \vee are inherited from 𝐀\mathbf{A} and the unary operations T0T_{0} and T1T_{1} correspond to the ones from Definition 2.7 (which by Proposition 2.8 are term-definable in 𝐋\mathbf{L}), interpreted in 𝐀\mathbf{A}.

For example, for each 𝐀𝒜,a𝐀\mathbf{A}\in\mathcal{A},a\in\mathbf{A} and 𝐋\ell\in\mathbf{L} we have T(a)𝔖(𝐀)T_{\ell}(a)\in\mathfrak{S}(\mathbf{A}). This holds since the equation T1(T(x))T(x)T_{1}(T_{\ell}(x))\approx T_{\ell}(x) holds in 𝐋\mathbf{L}, and therefore also in 𝐀\mathbf{A}.

Remark 5.

For 𝐀𝒜\mathbf{A}\in\mathcal{A}, suppose that AAA^{\prime}\subseteq A is a subset such that (A,,,T0,0,1)(A^{\prime},\wedge,\vee,T_{0},0,1) forms a Boolean algebra. Then, for all aAa^{\prime}\in A^{\prime}, we have T1(a)=T1(T0(T0(a)))=T0(T0(a))=aT_{1}(a^{\prime})=T_{1}(T_{0}(T_{0}(a^{\prime})))=T_{0}(T_{0}(a^{\prime}))=a^{\prime} and thus a𝔖(A)a^{\prime}\in\mathfrak{S}(A) (the second equation always holds since 𝒜T1(T0(x))T0(x)\mathcal{A}\models T_{1}(T_{0}(x))\approx T_{0}(x), which is easily checked in 𝐋\mathbf{L}). Therefore, 𝔖(A)\mathfrak{S}(A) is the largest such subset. \blacksquare

To extend the construction of the Boolean skeleton to a functor 𝔖:𝒜𝖡𝖠\mathfrak{S}\colon\mathcal{A}\to\mathsf{BA}, on homomorphisms f𝒜(𝐀1,𝐀2)f\in\mathcal{A}(\mathbf{A}_{1},\mathbf{A}_{2}) we define 𝔖f\mathfrak{S}f to be the restriction f𝔖(𝐀1)f{\mid}_{\mathfrak{S}(\mathbf{A}_{1})}. This is well-defined since

a𝔖(𝐀1)T1(a)=aT1(f(a))=f(T1(a))=f(a)f(a)𝔖(𝐀2).a\in\mathfrak{S}(\mathbf{A}_{1})\Leftrightarrow T_{1}(a)=a\Rightarrow T_{1}(f(a))=f(T_{1}(a))=f(a)\Leftrightarrow f(a)\in\mathfrak{S}(\mathbf{A}_{2}).

The following is arguably the most important property of the Boolean skeleton.

Proposition 4.3.

For all 𝐀𝒜\mathbf{A}\in\mathcal{A}, there is a homeomorphism between 𝖴Σ𝐋(𝐀)=𝒜(𝐀,𝐋)\mathsf{U}\Sigma_{\mathbf{L}}(\mathbf{A})=\mathcal{A}(\mathbf{A},\mathbf{L}) and Σ𝔖(𝐀)=𝖡𝖠(𝔖(𝐀),𝟐)\Sigma\mathfrak{S}(\mathbf{A})=\mathsf{BA}(\mathfrak{S}(\mathbf{A}),\mathbf{2}) given by hh𝔖(𝐀)h\mapsto h{\mid}_{\mathfrak{S}(\mathbf{A})}.

Proof.

First we show that the map is a bijection. For injectivity, suppose that gg and hh satisfy g𝔖(A)=h𝔖(A)g{\mid}_{\mathfrak{S}(A)}=h{\mid}_{\mathfrak{S}(A)}. Take an arbitrary element a𝐀a\in\mathbf{A} and let g(a)=g(a)=\ell. Using that T(a)𝔖(𝐀)T_{\ell}(a)\in\mathfrak{S}(\mathbf{A}) we get

1=T(g(a))=g(T(a))=h(T(a))=T(h(a)),1=T_{\ell}(g(a))=g(T_{\ell}(a))=h(T_{\ell}(a))=T_{\ell}(h(a)),

which implies h(a)=h(a)=\ell and, since aa was arbitrary, that g=hg=h. For surjectivity, let h𝖡𝖠(𝔖(𝐀),𝟐)h\in\mathsf{BA}(\mathfrak{S}(\mathbf{A}),\mathbf{2}) be arbitrary. Due to [44, Lemma 3.12] the following yields a well-defined homomorphism h¯𝒜(𝐀,𝐋)\bar{h}\in\mathcal{A}(\mathbf{A},\mathbf{L}):

h¯(a)=h(T(a))=1.\bar{h}(a)=\ell\Leftrightarrow h(T_{\ell}(a))=1.

Since for a𝔖(𝐀)a\in\mathfrak{S}(\mathbf{A}) we have

h(T1(a))=1\displaystyle h(T_{1}(a))=1 h(a)=1 and\displaystyle\Leftrightarrow h(a)=1\text{ and }
h(T0(a))=1\displaystyle h(T_{0}(a))=1 T0(h(a))=1h(a)=0,\displaystyle\Leftrightarrow T_{0}(h(a))=1\Leftrightarrow h(a)=0,

we conclude that h¯𝔖(𝐀)=h\bar{h}{\mid}_{\mathfrak{S}(\mathbf{A})}=h.

We now have a bijection between two Stone spaces, so it only remains to show that it is continuous. But this is easy to see since the preimage of an open subbasis element [a:i]𝖡𝖠(𝔖(𝐀),𝟐)[a:i]\subseteq\mathsf{BA}(\mathfrak{S}(\mathbf{A}),\mathbf{2}) is the open subbasis element [a:i]𝒜(𝐀,𝐋)[a:i]\subseteq\mathcal{A}(\mathbf{A},\mathbf{L}). ∎

Corollary 4.4.

There is a natural isomorphism between the functor 𝔖\mathfrak{S} and the dual Π𝖴Σ𝐋\Pi\mathsf{U}\Sigma_{\mathbf{L}} of the forgetful functor 𝖴\mathsf{U}.

Proof.

By Proposition 4.3, for every 𝐀𝒜\mathbf{A}\in\mathcal{A}, setting

ϕ𝐀:𝖴Σ𝐋(𝐀)\displaystyle\phi_{\mathbf{A}}\colon\mathsf{U}\Sigma_{\mathbf{L}}(\mathbf{A}) Σ𝔖(𝐀)\displaystyle\to\Sigma\mathfrak{S}(\mathbf{A})
h\displaystyle h h𝔖(𝐀)\displaystyle\mapsto h{\mid}_{\mathfrak{S}(\mathbf{A})}

defines a natural isomorphism ϕ:𝖴Σ𝐋Σ𝔖\phi\colon\mathsf{U}\Sigma_{\mathbf{L}}\Rightarrow\Sigma\mathfrak{S} (naturality is easy to check using the definitions of Σ,Σ𝐋\Sigma,\Sigma_{\mathbf{L}} and 𝔖\mathfrak{S} on morphisms). Applying Π\Pi and using the fact that ΠΣ\Pi\Sigma is naturally isomorphic to 𝗂𝖽𝖡𝖠\mathsf{id}_{\mathsf{BA}}, we get the natural isomorphism Πϕ:𝔖Π𝖴Σ𝐋.\Pi\phi\colon\mathfrak{S}\Rightarrow\Pi\mathsf{U}\Sigma_{\mathbf{L}}.

In the next subsection we explain the right-adjoint of the Boolean skeleton functor.

4.3. The Boolean power functor

In this subsection we give an algebraic description of a functor naturally isomorphic to the dual Π𝐋𝖵Σ\Pi_{\mathbf{L}}\mathsf{V}^{\top}\Sigma of the functor 𝖵\mathsf{V}^{\top}. This functor, which we call 𝔓\mathfrak{P}, turns out to be an instance of the the well-known Boolean power (or Boolean extension), which was introduced for arbitrary finite algebras in Foster’s first paper on primal algebras [24]. Boolean powers are special instances of Boolean products (see, e.g., [11, Chapter IV]), but for our purposes it is more convenient to work with the following equivalent definition found in [9].

Definition 4.5.

Given a Boolean algebra 𝐁𝖡𝖠\mathbf{B}\in\mathsf{BA} and a finite algebra 𝐌\mathbf{M}, the Boolean power 𝐌[𝐁]\mathbf{M}[\mathbf{B}] is defined on the carrier set

M[B]BMM[B]\subseteq B^{M}

consisting of all maps ξ:MB\xi\colon M\to B which satisfy

  1. (1)

    If \ell and \ell^{\prime} are distinct elements of MM, then ξ()ξ()=0\xi(\ell)\wedge\xi(\ell^{\prime})=0,

  2. (2)

    {ξ()M}=1\bigvee\{\xi(\ell)\mid\ell\in M\}=1.

If o𝐋:MkMo^{\mathbf{L}}\colon M^{k}\to M is a kk-ary operation of 𝐌\mathbf{M}, we define a corresponding operation o𝐌[𝐁]:M[B]M[B]o^{\mathbf{M}[\mathbf{B}]}\colon M[B]\to M[B] by

o𝐌[𝐁](ξ1,,ξk)()=o𝐌(1,,k)=(ξ1(1)ξk(k)).o^{\mathbf{M}[\mathbf{B}]}(\xi_{1},\dots,\xi_{k})(\ell)=\bigvee_{o^{\mathbf{M}}(\ell_{1},\dots,\ell_{k})=\ell}(\xi_{1}(\ell_{1})\wedge\dots\wedge\xi_{k}(\ell_{k})).

The resulting algebra 𝐌[𝐁]=(M[B],{o𝐌[𝐁]o in the signature of 𝐌})\mathbf{M}[\mathbf{B}]=(M[B],\{o^{\mathbf{M}[\mathbf{B}]}\mid o\text{ in the signature of }\mathbf{M}\}) is a member of the variety 𝕊(𝐌)\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{M}) generated by 𝐌\mathbf{M} (since it satisfies the same equations as 𝐌\mathbf{M}).

There is a straightforward way to extend this construction to a functor.

Definition 4.6.

Given a finite algebra 𝐌\mathbf{M}, we define the functor 𝔓𝐌:𝖡𝖠𝕊(𝐌)\mathfrak{P}_{\mathbf{M}}\colon\mathsf{BA}\to\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{M}) as follows. On objects 𝐁𝖡𝖠\mathbf{B}\in\mathsf{BA} we define

𝔓𝐌(𝐁)=𝐌[𝐁].\mathfrak{P}_{\mathbf{M}}(\mathbf{B})=\mathbf{M}[\mathbf{B}].

For a Boolean homomorphism φ:𝐁𝐁\varphi\colon\mathbf{B}\to\mathbf{B}^{\prime}, the homomorphism 𝔓𝐌φ:𝐌[𝐁]𝐌[𝐁]\mathfrak{P}_{\mathbf{M}}\varphi\colon\mathbf{M}[\mathbf{B}]\to\mathbf{M}[\mathbf{B}^{\prime}] is defined via composition ξφξ\xi\mapsto\varphi\circ\xi (this is a homomorphism because operations in 𝐌[𝐁]\mathbf{M}[\mathbf{B}] are defined by Boolean expressions, which commute with φ\varphi).

In particular, we will use the shorthand notation 𝔓\mathfrak{P} for 𝔓𝐋\mathfrak{P}_{\mathbf{L}}. In the remainder of this subsection we aim to show that 𝔓\mathfrak{P} is indeed the right-adjoint of the Boolean skeleton functor 𝔖\mathfrak{S}. For this, we need the following well-known properties of the Boolean power.

Lemma 4.7.

[9, Proposition 2.1] The functor 𝔓𝐌\mathfrak{P}_{\mathbf{M}} has the following properties:

  1. (i)

    𝔓𝐌(𝟐)𝐌\mathfrak{P}_{\mathbf{M}}(\mathbf{2})\cong\mathbf{M},

  2. (ii)

    𝔓𝐌\mathfrak{P}_{\mathbf{M}} preserves products.

In particular, 𝔓𝐌(𝟐κ)𝐌κ\mathfrak{P}_{\mathbf{M}}(\mathbf{2}^{\kappa})\cong\mathbf{M}^{\kappa} holds for all index sets κ\kappa.

In the next proposition we describe the interplay between the functors 𝔖\mathfrak{S} and 𝔓\mathfrak{P}. Again, the terms TT_{\ell} from Proposition 2.8 play an important role.

Proposition 4.8.

For every 𝐀𝒜\mathbf{A}\in\mathcal{A} there is an embedding 𝒯():𝐀𝔓(𝔖(𝐀))\mathcal{T}_{(\cdot)}\colon\mathbf{A}\hookrightarrow\mathfrak{P}(\mathfrak{S}(\mathbf{A})) given by a𝒯aa\mapsto\mathcal{T}_{a} where

𝒯a()=T(a).\mathcal{T}_{a}(\ell)=T_{\ell}(a).

The restriction to 𝔖(𝐀)\mathfrak{S}(\mathbf{A}) yields an isomorphism 𝔖(𝐀)𝔖(𝔓(𝔖(𝐀)))\mathfrak{S}(\mathbf{A})\cong\mathfrak{S}\big{(}\mathfrak{P}(\mathfrak{S}(\mathbf{A}))\big{)}.

Proof.

The map is well-defined, that is, 𝒯a\mathcal{T}_{a} is in 𝔓(𝔖(𝐀))\mathfrak{P}(\mathfrak{S}(\mathbf{A})), since the equations T(x)T(x)0T_{\ell}(x)\wedge T_{\ell^{\prime}}(x)\approx 0 (for distinct ,\ell,\ell^{\prime}) and {T(x)L}1\bigvee\{T_{\ell}(x)\mid\ell\in L\}\approx 1 hold in 𝐋\mathbf{L}.

We now fix an embedding 𝐀𝐋I\mathbf{A}\hookrightarrow\mathbf{L}^{I}. It is easy to see that 𝒯()\mathcal{T}_{(\cdot)} is injective since, for distinct a,a𝐀a,a^{\prime}\in\mathbf{A}, there is some component iIi\in I with a(i)=a(i)a(i)=\ell\neq a^{\prime}(i), thus 𝒯a()𝒯a()\mathcal{T}_{a}(\ell)\neq\mathcal{T}_{a^{\prime}}(\ell). To conclude that 𝒯()\mathcal{T}_{(\cdot)} is an embedding we need to show that it is a homomorphism, that is we want to show that for any kk-ary operation o:LkLo\colon L^{k}\to L of 𝐋\mathbf{L} we have

𝒯o𝐀(a1,,ak)=o𝐋[𝔖(𝐀)](𝒯a1,𝒯ak).\mathcal{T}_{o^{\mathbf{A}}(a_{1},\dots,a_{k})}=o^{\mathbf{L}[\mathfrak{S}(\mathbf{A})]}(\mathcal{T}_{a_{1}},\dots\mathcal{T}_{a_{k}}).

By definition the ii-th component of the left-hand side is given by

𝒯oA(a1,,ak)()(i)=T(o𝐋(a1(i),,ak(i)))={1 if o𝐋(a1(i),,ak(i))=0 otherwise.\mathcal{T}_{o^{A}(a_{1},\dots,a_{k})}(\ell)(i)=T_{\ell}\big{(}o^{\mathbf{L}}(a_{1}(i),\dots,a_{k}(i))\big{)}=\begin{cases}1&\text{ if }o^{\mathbf{L}}(a_{1}(i),\dots,a_{k}(i))=\ell\\ 0&\text{ otherwise.}\end{cases}

The right-hand side is given by

o𝐋[𝔖(𝐀)](𝒯a1,𝒯ak)()=o𝐋(1,,k)=(𝒯a1(1)𝒯ak(k)).o^{\mathbf{L}[\mathfrak{S}(\mathbf{A})]}(\mathcal{T}_{a_{1}},\dots\mathcal{T}_{a_{k}})(\ell)=\bigvee_{o^{\mathbf{L}}(\ell_{1},\dots,\ell_{k})=\ell}(\mathcal{T}_{a_{1}}(\ell_{1})\wedge\dots\wedge\mathcal{T}_{a_{k}}(\ell_{k})).

In its ii-th component this again corresponds to

o𝐋(1,,k)=(T1(a1(i))Tk(ak(i)))={1 if o𝐋(a1(i),,ak(i))=0 otherwise.\bigvee_{o^{\mathbf{L}}(\ell_{1},\dots,\ell_{k})=\ell}\big{(}T_{\ell_{1}}(a_{1}(i))\wedge\dots\wedge T_{\ell_{k}}(a_{k}(i))\big{)}=\begin{cases}1&\text{ if }o^{\mathbf{L}}(a_{1}(i),\dots,a_{k}(i))=\ell\\ 0&\text{ otherwise.}\end{cases}

Thus 𝒯()\mathcal{T}_{(\cdot)} is an embedding, which concludes the proof of the first statement.

For the second statement, note that, since 𝔖\mathfrak{S} preserves injectivity of homomorphisms, it suffices to show that the restriction of 𝒯()\mathcal{T}_{(\cdot)} to 𝔖(𝐀)\mathfrak{S}(\mathbf{A}) is a surjection onto 𝔖(𝔓(𝔖(𝐀)))\mathfrak{S}\big{(}\mathfrak{P}(\mathfrak{S}(\mathbf{A}))\big{)}. So consider an element ξ𝔖(𝔓(𝔖(𝐀)))\xi\in\mathfrak{S}\big{(}\mathfrak{P}(\mathfrak{S}(\mathbf{A}))\big{)}, that is ξ𝔓(𝔖(𝐀))\xi\in\mathfrak{P}(\mathfrak{S}(\mathbf{A})) and T1𝐋[𝔖(𝐀)](ξ)=ξ.T_{1}^{\mathbf{L}[\mathbf{\mathfrak{S}(\mathbf{A})}]}(\xi)=\xi. The latter by definition means

T1𝐋[𝔖(𝐀)](ξ)(1)=ξ(1),T_{1}^{\mathbf{L}[\mathbf{\mathfrak{S}(\mathbf{A})}]}(\xi)(1)=\xi(1),
T1𝐋[𝔖(𝐀)](ξ)(0)={ξ()L,1}=ξ(0) and T_{1}^{\mathbf{L}[\mathbf{\mathfrak{S}(\mathbf{A})}]}(\xi)(0)=\bigvee\{\xi(\ell)\mid\ell\in L,\ell\neq 1\}=\xi(0)\text{ and }
T1𝐋[𝔖(𝐀)](ξ)()==0=ξ() for all L{0,1}.T_{1}^{\mathbf{L}[\mathbf{\mathfrak{S}(\mathbf{A})}]}(\xi)(\ell)=\bigvee\varnothing=0=\xi(\ell)\text{ for all }\ell\in L{\setminus}\{0,1\}.

We claim that ξ=𝒯ξ(1).\xi=\mathcal{T}_{\xi(1)}. Indeed, we know that ξ(1)𝔖(𝐀)\xi(1)\in\mathfrak{S}(\mathbf{A}) so ξ(1)=T1(ξ(1))\xi(1)=T_{1}(\xi(1)). Furthermore, in the component iIi\in I, we have ξ(0)(i)=1\xi(0)(i)=1 if and only if ξ(1)(i)=0\xi(1)(i)=0, so T0(ξ(1))=T1(ξ(0))=ξ(0)T_{0}(\xi(1))=T_{1}(\xi(0))=\xi(0) since ξ(0)𝔖(𝐀)\xi(0)\in\mathfrak{S}(\mathbf{A}). Finally, for {0,1}\ell\not\in\{0,1\} we have T(ξ(1))=0T_{\ell}(\xi(1))=0 since for all iIi\in I we have ξ(1)(i){0,1}\xi(1)(i)\in\{0,1\}. This concludes the proof. ∎

Since 𝔖\mathfrak{S} is dual to the essentially surjective functor 𝖴\mathsf{U}, we know that every 𝐁𝖡𝖠\mathbf{B}\in\mathsf{BA} is isomorphic to 𝔖(𝐀)\mathfrak{S}(\mathbf{A}) for some 𝐀𝒜\mathbf{A}\in\mathcal{A}. Therefore, the following is a direct consequence of the second part of Proposition 4.8.

Corollary 4.9.

Every Boolean algebra 𝐁𝖡𝖠\mathbf{B}\in\mathsf{BA} is isomorphic to 𝔖(𝔓(𝐁))\mathfrak{S}(\mathfrak{P}(\mathbf{B})).

Another immediate consequence of Proposition 4.8 is the following.

Corollary 4.10.

For every Boolean algebra 𝐁𝖡𝖠\mathbf{B}\in\mathsf{BA}, the algebra 𝔓(𝐁)\mathfrak{P}(\mathbf{B}) is the largest algebra in 𝒜\mathcal{A} which has 𝐁\mathbf{B} as Boolean skeleton. That is, for every algebra 𝐀𝒜\mathbf{A}\in\mathcal{A} with 𝔖(𝐀)𝐁\mathfrak{S}(\mathbf{A})\cong\mathbf{B} there exists an embedding 𝐀𝔓(𝐁)\mathbf{A}\hookrightarrow\mathfrak{P}(\mathbf{B}).

We now have everything at hand to prove the main theorem of this subsection.

Theorem 4.11.

𝔓\mathfrak{P} is naturally isomorphic to the dual of 𝖵\mathsf{V}^{\top} and, therefore,

𝔖𝔓.\mathfrak{S}\dashv\mathfrak{P}.
Proof.

First we prove the statement on the finite level. In other words, we want to show that, in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}},

Σ𝐋𝔓(𝐁)𝖵Σ(𝐁)\Sigma_{\mathbf{L}}\mathfrak{P}(\mathbf{B})\cong\mathsf{V}^{\top}\Sigma(\mathbf{B})

holds for every finite Boolean algebra 𝐁\mathbf{B}. More explicitly, after spelling out the definition of the functors involved we want to show

(2) (𝒜(𝔓(𝐁),𝐋),𝐢𝐦)(𝖡𝖠(𝐁,𝟐),𝐯)\big{(}\mathcal{A}(\mathfrak{P}(\mathbf{B}),\mathbf{L}),\mathbf{im}\big{)}\cong\big{(}\mathsf{BA}(\mathbf{B},\mathbf{2}),\mathbf{v}^{\top}\big{)}

for every finite Boolean algebra 𝐁\mathbf{B}. First, since 𝐁\mathbf{B} is finite there is some positive integer kk such that 𝐁𝟐k\mathbf{B}\cong\mathbf{2}^{k}. We combine the following isomorphisms in 𝖲𝗍𝗈𝗇𝖾\mathsf{Stone}. Due to Proposition 4.3 we know

𝒜(𝔓(𝐁),𝐋)𝖡𝖠(𝔖(𝔓(𝐁)),𝟐),\mathcal{A}\big{(}\mathfrak{P}(\mathbf{B}),\mathbf{L}\big{)}\cong\mathsf{BA}\big{(}\mathfrak{S}(\mathfrak{P}(\mathbf{B})),\mathbf{2}\big{)},

And due to Corollary 4.9 we know

𝔖(𝔓(𝐁))𝐁.\mathfrak{S}(\mathfrak{P}(\mathbf{B}))\cong\mathbf{B}.

Putting these together, we get

𝒜(𝔓(𝐁),𝐋)𝖡𝖠(𝐁,𝟐).\mathcal{A}(\mathfrak{P}(\mathbf{B}),\mathbf{L})\cong\mathsf{BA}(\mathbf{B},\mathbf{2}).

In fact, this even yields an isomorphism in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}} as desired in (2), because

(𝒜(𝔓(𝐁),𝐋),𝐢𝐦)(𝒜(𝐋k,𝐋),𝐢𝐦)(𝒜(𝐋k,𝐋),𝐯)\big{(}\mathcal{A}(\mathfrak{P}(\mathbf{B}),\mathbf{L}),\mathbf{im}\big{)}\cong\big{(}\mathcal{A}(\mathbf{L}^{k},\mathbf{L}),\mathbf{im}\big{)}\cong\big{(}\mathcal{A}(\mathbf{L}^{k},\mathbf{L}),\mathbf{v}^{\top}\big{)}

where the last equation holds due to Proposition 3.5.

So we know that the restriction of 𝔓\mathfrak{P} to the category of finite Boolean algebras 𝔓ω:𝖡𝖠ω𝒜\mathfrak{P}^{\omega}\colon\mathsf{BA}^{\omega}\to\mathcal{A} is dual to the restriction (𝖵)ω(\mathsf{V}^{\top})^{\omega} of 𝖵\mathsf{V}^{\top} to the category 𝖲𝖾𝗍𝐋ω\mathsf{Set}_{\mathbf{L}}^{\omega}. There is a unique (up to natural iso) finitary (i.e., filtered colimit preserving) extension of 𝔓ω\mathfrak{P}^{\omega} to 𝖨𝗇𝖽(𝖡𝖠ω)𝖡𝖠\mathsf{Ind}(\mathsf{BA}^{\omega})\simeq\mathsf{BA}, and this extension is naturally isomorphic to the dual of 𝖵\mathsf{V}^{\top} (since 𝖵\mathsf{V}^{\top} preserves all limits except for the terminal object, it is the unique cofinitary extension of (𝖵)ω(\mathsf{V}^{\top})^{\omega}). To show that 𝔓\mathfrak{P} coincides with this unique extension (up to natural isomorphism), it suffices to show that 𝔓\mathfrak{P} is finitary as well. Since 𝔓\mathfrak{P} preserves monomorphisms (it is easy to see by definition that if φ𝖡𝖠(𝐁1,𝐁2)\varphi\in\mathsf{BA}(\mathbf{B}_{1},\mathbf{B}_{2}) is injective, then 𝔓φ\mathfrak{P}\varphi is injective as well), we can apply [2, Theorem 3.4], which states that 𝔓\mathfrak{P} is finitary if and only if the following holds.
For every Boolean algebra 𝐁𝖡𝖠\mathbf{B}\in\mathsf{BA}, for every finite subalgebra 𝐀𝔓(𝐁)\mathbf{A}\hookrightarrow\mathfrak{P}(\mathbf{B}) the inclusion factors through the image of the inclusion of some finite subalgebra 𝐁𝐁\mathbf{B}^{\prime}\hookrightarrow\mathbf{B} under 𝔓\mathfrak{P}.

To see this write 𝐀in𝐒𝐢\mathbf{A}\cong\prod_{i\leq n}\mathbf{S_{i}} as product of finite subalgebras of 𝐋\mathbf{L}. Then, by Corollary 4.9, we know that 𝔖(𝐀)𝟐n\mathfrak{S}(\mathbf{A})\cong\mathbf{2}^{n} embeds into 𝐁\mathbf{B}. Now by Lemma 4.7 we have 𝔓(𝟐n)𝐋n\mathfrak{P}(\mathbf{2}^{n})\cong\mathbf{L}^{n} and the natural inclusion in𝐒𝐢𝐋n\prod_{i\leq n}\mathbf{S_{i}}\hookrightarrow\mathbf{L}^{n} yields our factorization

𝐀{\mathbf{A}}𝔓(𝐁){\mathfrak{P}(\mathbf{B})}𝔓(𝟐n){\mathfrak{P}(\mathbf{2}^{n})}

This concludes the proof. ∎

In particular, if 𝐋\mathbf{L} is primal, we get an explicit categorical equivalence witnessing Hu’s theorem.

Corollary 4.12.

[36] If 𝐋\mathbf{L} is primal, then 𝔖𝔓\mathfrak{S}\dashv\mathfrak{P} yields a categorical equivalence between 𝒜\mathcal{A} and 𝖡𝖠\mathsf{BA}.

We also get an algebraic analogue of Proposition 4.1(i).

Corollary 4.13.

The functor 𝔓\mathfrak{P} is fully faithful and identifies 𝖡𝖠\mathsf{BA} with a reflective subcategory of 𝒜\mathcal{A}.

By now we found detailed descriptions of most of the functors appearing in Figure 3. We are still missing an algebraic understanding of the adjunction 𝖰𝖨\mathsf{Q}\dashv\mathsf{I}. This gap is filled in the next subsection. As we will see, it is closely connected to the adjunction 𝔖𝔓\mathfrak{S}\dashv\mathfrak{P}.

4.4. The subalgebra adjunctions

For every subalgebra 𝐒𝐋\mathbf{S}\leq\mathbf{L}, there is an adjunction

(3) 𝖲𝗍𝗈𝗇𝖾\textstyle{\mathsf{Stone}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝖵𝐒\scriptstyle{\mathsf{V}^{\mathbf{S}}}\scriptstyle{\bot}𝖲𝗍𝗈𝗇𝖾𝐋\textstyle{{\ \mathsf{Stone}_{\mathbf{L}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝖢𝐒\scriptstyle{\mathsf{C}^{\mathbf{S}}}

which we explore in this subsection.

The functor 𝖵𝐒:𝖲𝗍𝗈𝗇𝖾𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{V}^{\mathbf{S}}\colon\mathsf{Stone}\to\mathsf{Stone}_{\mathbf{L}} is given on objects by

𝖵𝐒(X)=(X,𝐯𝐒) where xX:𝐯𝐒(x)=𝐒,\mathsf{V}^{\mathbf{S}}(X)=(X,\mathbf{v}^{\mathbf{S}})\text{ where }\forall x\in X:\mathbf{v}^{\mathbf{S}}(x)=\mathbf{S},

and assigns every morphism to itself.

The functor 𝐂𝐒:𝖲𝗍𝗈𝗇𝖾𝐋𝖲𝗍𝗈𝗇𝖾\mathbf{C}^{\mathbf{S}}\colon\mathsf{Stone}_{\mathbf{L}}\to\mathsf{Stone} is given on objects by

𝖢𝐒(X,𝐯)={xX𝐯(x)𝐒}.\mathsf{C}^{\mathbf{S}}(X,\mathbf{v})=\{x\in X\mid\mathbf{v}(x)\leq\mathbf{S}\}.

On morphisms it acts via restriction, that is, given a morphism m:(X,𝐯)(Y,𝐰)m\colon(X,\mathbf{v})\to(Y,\mathbf{w}), define m𝖢𝐒(X):𝖢𝐒(X)𝖢𝐒(Y)m\mid_{\mathsf{C}^{\mathbf{S}}(X)}\colon\mathsf{C}^{\mathbf{S}}(X)\to\mathsf{C}^{\mathbf{S}}(Y). This is well-defined since

x𝖢𝐒(X,𝐯)𝐯(x)𝐒𝐰(m(x))𝐯(x)𝐒m(x)𝖢𝐒(Y,𝐰).x\in\mathsf{C}^{\mathbf{S}}(X,\mathbf{v})\Leftrightarrow\mathbf{v}(x)\leq\mathbf{S}\Leftrightarrow\mathbf{w}(m(x))\leq\mathbf{v}(x)\leq\mathbf{S}\Leftrightarrow m(x)\in\mathsf{C}^{\mathbf{S}}(Y,\mathbf{w}).

Comparing this with Subsection 4.1, the reader may easily verify V𝐒𝖢𝐒V^{\mathbf{S}}\dashv\mathsf{C}^{\mathbf{S}}. Indeed, the adjunction V𝐒𝖢𝐒V^{\mathbf{S}}\dashv\mathsf{C}^{\mathbf{S}} generalizes the following adjunctions in Figure 3:

  • 𝖵𝖴\mathsf{V}^{\top}\dashv\mathsf{U} in the case where 𝐒=𝐋\mathbf{S}=\mathbf{L} is the largest subalgebra of 𝐋\mathbf{L},

  • 𝖵𝖢\mathsf{V}^{\bot}\dashv\mathsf{C} in the case where 𝐒=0,1\mathbf{S}=\langle 0,1\rangle is the smallest subalgebra of 𝐋\mathbf{L}.

What is special about these two extreme cases is the additional adjunction 𝖴𝖵\mathsf{U}\dashv\mathsf{V}^{\top}, which ‘glues’ the two adjunctions into the chain described in Subsection 4.1.

To better understand the adjunction corresponding to a subalgebra 𝐒𝐋\mathbf{S}\leq\mathbf{L}, we dissect it into two parts as follows.

𝖲𝗍𝗈𝗇𝖾\textstyle{\mathsf{Stone}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝖵\scriptstyle{\mathsf{V}^{\top}}\scriptstyle{\bot}𝖲𝗍𝗈𝗇𝖾𝐒\textstyle{\mathsf{Stone}_{\mathbf{S}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝖴\scriptstyle{\mathsf{U}}ι𝐒\scriptstyle{\iota^{\mathbf{S}}}\scriptstyle{\bot}𝖲𝗍𝗈𝗇𝖾𝐋\textstyle{{\ \mathsf{Stone}_{\mathbf{L}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}(𝖢𝐒,)\scriptstyle{(\mathsf{C}^{\mathbf{S}},-)}

Here, ι𝐒\iota^{\mathbf{S}} is the natural inclusion and the functor (𝖢𝐒,)(\mathsf{C}^{\mathbf{S}},-) is defined by

(X,𝐯)(𝖢𝐒(X),𝐯𝖢𝐒(X))(X,\mathbf{v})\mapsto(\mathsf{C}^{\mathbf{S}}(X),\mathbf{v}{\mid}_{\mathsf{C}^{\mathbf{S}}(X)})

on objects and, exactly like 𝖢𝐒\mathsf{C}^{\mathbf{S}}, acts via restriction on morphisms. It is easy to see that this really is a decomposition of the adjunction (3), that is,

𝖵𝐒=ι𝐒𝖵 and 𝖢𝐒=𝖴(𝖢𝐒,).\mathsf{V}^{\mathbf{S}}=\iota^{\mathbf{S}}\circ\mathsf{V}^{\top}\text{ and }\mathsf{C}^{\mathbf{S}}=\mathsf{U}\circ(\mathsf{C}^{\mathbf{S}},-).

As before, we want to carry everything over to the algebraic side, where the dissection takes place through the subvariety

𝒜𝐒:=𝕊(𝐒).\mathcal{A}_{\mathbf{S}}:=\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{S}).

We illustrate the entire situation in Figure 4. Note that 𝐒𝐋\mathbf{S}\leq\mathbf{L} is itself semi-primal, so the semi-primal duality given by Σ𝐒\Sigma_{\mathbf{S}} and Π𝐒\Pi_{\mathbf{S}} as well as the adjunction 𝔖𝔓𝐒\mathfrak{S}\dashv\mathfrak{P}_{\mathbf{S}} make sense in this context.

𝖲𝗍𝗈𝗇𝖾𝐋\textstyle{\mathsf{Stone}_{\mathbf{L}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Π𝐋\scriptstyle{\Pi_{\mathbf{L}}}ι𝐒\scriptstyle{\iota^{\mathbf{S}}}\scriptstyle{\phantom{{}^{\prime}}\dashv}(𝖢𝐒,)\scriptstyle{(\mathsf{C}^{\mathbf{S}},-)}𝒜\textstyle{\mathcal{A}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Σ𝐋\scriptstyle{\Sigma_{\mathbf{L}}}ι𝐒\scriptstyle{\iota_{\mathbf{S}}}𝖰𝐒\scriptstyle{\mathsf{Q}_{\mathbf{S}}}\scriptstyle{\vdash\phantom{{}^{\prime}}}𝖲𝗍𝗈𝗇𝖾𝐒\textstyle{\mathsf{Stone}_{\mathbf{S}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Π𝐒\scriptstyle{\Pi_{\mathbf{S}}}𝖵\scriptstyle{\mathsf{V}^{\top}}\scriptstyle{\phantom{{}^{\prime}}\dashv}𝖴\scriptstyle{\mathsf{U}}𝒜𝐒\textstyle{\mathcal{A}_{\mathbf{S}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Σ𝐒\scriptstyle{\Sigma_{\mathbf{S}}}𝔓𝐒\scriptstyle{\mathfrak{P}_{\mathbf{S}}}𝔖\scriptstyle{\mathfrak{S}}\scriptstyle{\vdash\phantom{{}^{\prime}}}𝖲𝗍𝗈𝗇𝖾\textstyle{\mathsf{Stone}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Π\scriptstyle{\Pi}𝖡𝖠\textstyle{\mathsf{BA}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}Σ\scriptstyle{\Sigma}
Figure 4. Dissecting the subalgebra adjunction of 𝐒𝐋\mathbf{S}\leq\mathbf{L}.

Again, ι𝐒\iota_{\mathbf{S}} denotes the natural inclusion. Although it may seem obvious, it is not immediate that ι𝐒\iota_{\mathbf{S}} really is the dual of ι𝐒\iota^{\mathbf{S}}. To prove it, we make use of the following unary term, which will play an important role for the remainder of the subsection:

χS(x)=sSTs(x).\chi_{S}(x)=\bigvee_{s\in S}T_{s}(x).

On 𝐋\mathbf{L}, this simply corresponds to the characteristic function of SLS\subseteq L. It is, furthermore, characteristic for the subvariety 𝒜𝐒\mathcal{A}_{\mathbf{S}} in the following sense.

Lemma 4.14.

An algebra in 𝒜\mathcal{A} is a member of 𝒜𝐒\mathcal{A}_{\mathbf{S}} if and only if it satisfies the equation χS(x)1\chi_{S}(x)\approx 1.

Proof.

Clearly every member of 𝒜𝐒\mathcal{A}_{\mathbf{S}} satisfies the equation since 𝐒\mathbf{S} satisfies it. For the other direction, let 𝐀𝒜\mathbf{A}\in\mathcal{A} satisfy χS(a)=1\chi_{S}(a)=1 for all aAa\in A. We know that 𝐀\mathbf{A} can be embedded into some 𝐋I\mathbf{L}^{I} and for each a𝐀a\in\mathbf{A} and iIi\in I, we have χ𝐒(πi(a))=1\chi_{\mathbf{S}}(\pi_{i}(a))=1 which implies that πi(a)𝐒\pi_{i}(a)\in\mathbf{S}. Therefore, 𝐀\mathbf{A} can be embedded into 𝐒I\mathbf{S}^{I}. ∎

Now, let 𝐀𝒜𝐒\mathbf{A}\in\mathcal{A}_{\mathbf{S}} and let h𝒜(ι𝐒(𝐀),𝐋)h\in\mathcal{A}(\iota_{\mathbf{S}}(\mathbf{A}),\mathbf{L}) be a homomorphism. Since hh preserves equations, for every aAa\in A we get

χS(a)=1χS(h(a))=1\chi_{S}(a)=1\Rightarrow\chi_{S}(h(a))=1

and, therefore, h𝒜(𝐀,𝐒)h\in\mathcal{A}(\mathbf{A},\mathbf{S}). So we showed 𝒜(𝐀,𝐋)=𝒜𝐒(𝐀,𝐒)\mathcal{A}(\mathbf{A},\mathbf{L})=\mathcal{A}_{\mathbf{S}}(\mathbf{A},\mathbf{S}) for 𝐀𝒜𝐒\mathbf{A}\in\mathcal{A}_{\mathbf{S}}, which immediately implies the following.

Corollary 4.15.

The inclusion functor ι𝐒\iota_{\mathbf{S}} is the dual of the inclusion functor ι𝐒\iota^{\mathbf{S}}.

To complete the picture, we only need to describe the functor 𝖰𝐒\mathsf{Q}_{\mathbf{S}} from Figure 4. Let α:𝗂𝖽𝒜ι𝐒𝖰𝐒\alpha\colon\mathsf{id}_{\mathcal{A}}\Rightarrow\iota_{\mathbf{S}}\circ\mathsf{Q}_{\mathbf{S}} be the unit of the adjunction 𝖰𝐒ι𝐒\mathsf{Q}_{\mathbf{S}}\dashv\iota_{\mathbf{S}}. For any 𝐀𝒜\mathbf{A}\in\mathcal{A}, the algebra 𝖰𝐒(𝐀)\mathsf{Q}_{\mathbf{S}}(\mathbf{A}) is universal for 𝒜𝐒\mathcal{A}_{\mathbf{S}} in the following sense:

For every 𝐁𝒜𝐒\mathbf{B}\in\mathcal{A}_{\mathbf{S}} and every homomorphism f:𝐀𝐁f\colon\mathbf{A}\to\mathbf{B}, there is a unique f^:𝖰𝐒(𝐀)𝐁\hat{f}\colon\mathsf{Q}_{\mathbf{S}}(\mathbf{A})\to\mathbf{B} such that f^α𝐀=f\hat{f}\circ\alpha_{\mathbf{A}}=f.

𝐀{\mathbf{A}}𝖰𝐒(𝐀){\mathsf{Q}_{\mathbf{S}}(\mathbf{A})}𝐁{\mathbf{B}}f\scriptstyle{f}α𝐀\scriptstyle{\alpha_{\mathbf{A}}}f^\scriptstyle{\exists\hat{f}}

Therefore, the functor 𝖰𝐒\mathsf{Q}_{\mathbf{S}} may be understood as a quotient (in fact, as the largest quotient contained in 𝒜𝐒\mathcal{A}_{\mathbf{S}}). There is a well-known connection between quotients and equations introduced by Banaschewski and Herrlich in [4]. Not surprisingly, the equation corresponding to 𝖰𝐒\mathsf{Q}_{\mathbf{S}} is given by χS(x)1\chi_{S}(x)\approx 1, which is an easy consequence of the above discussion together with Lemma 4.14. We summarize the results of this subsection as follows.

Theorem 4.16.

For every subalgebra 𝐒𝐋\mathbf{S}\leq\mathbf{L}, there is an adjunction

𝖡𝖠\textstyle{\mathsf{BA}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝖨𝐒\scriptstyle{\mathsf{I}_{\mathbf{S}}}\scriptstyle{\top}𝒜\textstyle{{\ \mathcal{A}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝖪𝐒\scriptstyle{\mathsf{K}_{\mathbf{S}}}

which can be dissected as

𝖡𝖠\textstyle{\mathsf{BA}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝔓𝐒\scriptstyle{\mathfrak{P}_{\mathbf{S}}}\scriptstyle{\top}𝒜𝐒\textstyle{\mathcal{A}_{\mathbf{S}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝔖\scriptstyle{\mathfrak{S}}ι𝐒\scriptstyle{\iota_{\mathbf{S}}}\scriptstyle{\top}𝒜\textstyle{{\ \mathcal{A}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝖰𝐒\scriptstyle{\mathsf{Q}_{\mathbf{S}}}

where ι𝐒\iota_{\mathbf{S}} is the natural inclusion functor of the subvariety 𝕊(𝐒)𝕊(𝐋)\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{S})\hookrightarrow\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{L}) and 𝖰𝐒\mathsf{Q}_{\mathbf{S}} is the quotient functor corresponding to the equation χS(x)1.\chi_{S}(x)\approx 1.

In particular, in the case where 𝐒\mathbf{S} is the smallest subalgebra of 𝐋\mathbf{L}, we can recover the functors 𝖨=ι𝐒𝔓𝐒\mathsf{I}=\iota_{\mathbf{S}}\circ\mathfrak{P}_{\mathbf{S}} and 𝖰\mathsf{Q} from Figure 3 .

Corollary 4.17.

The functor 𝖨:𝖡𝖠𝒜\mathsf{I}\colon\mathsf{BA}\rightarrow\mathcal{A} is, up to categorical equivalence, an inclusion. The functor 𝖰:𝒜𝖡𝖠\mathsf{Q}\colon\mathcal{A}\to\mathsf{BA} is, up to categorical equivalence, the quotient by the equation

χE(x)1,\chi_{E}(x)\approx 1,

where 𝐄=0,1\mathbf{E}=\langle 0,1\rangle is the smallest subalgebra of 𝐋\mathbf{L}.

Proof.

Being the smallest subalgebra of a semi-primal algebra, 𝐄\mathbf{E} is primal. Therefore, by Corollary 4.12, the adjunction 𝔖𝔓𝐄\mathfrak{S}\dashv\mathfrak{P}_{\mathbf{E}} is an equivalence of categories. The statement follows from Theorem 4.16. ∎

Clearly Corollary 4.13 holds not only for 𝔓\mathfrak{P}, but for all the functors 𝖨𝐒\mathsf{I}_{\mathbf{S}}. Among them, 𝖨\mathsf{I} is special since it also has a right-adjoint. This yields the following algebraic version of Proposition 4.1(ii).

Corollary 4.18.

The functor 𝖨\mathsf{I} is fully faithful and identifies 𝖡𝖠\mathsf{BA} with a reflective and coreflective subcategory of 𝒜\mathcal{A}.

We showed that, if a finite lattice-based algebra 𝐌\mathbf{M} is semi-primal, then there is an adjunction 𝔓𝐄𝔖𝔓𝐌\mathfrak{P}_{\mathbf{E}}\dashv\mathfrak{S}\dashv\mathfrak{P}_{\mathbf{M}}, where 𝐄\mathbf{E} is the smallest subalgebra of 𝐌\mathbf{M}. In the next subsection we show that, conversely, the existence of an adjunction resembling this one fully characterizes semi-primality of a finite lattice-based algebra 𝐌\mathbf{M}.

4.5. Characterizing semi-primality via adjunctions.

The aim of this subsection is to find sufficient conditions for an adjoint of 𝔓𝐌\mathfrak{P}_{\mathbf{M}} to imply semi-primality of the algebra 𝐌\mathbf{M}. We will then show that, in particular, these conditions are consequences of 𝖴\mathsf{U} and 𝔖\mathfrak{S} from Figure 3 being (essentially) topological functors.

Recall that, in Definition 4.6, the Boolean power functor 𝔓𝐌:𝖡𝖠𝕊(𝐌)\mathfrak{P}_{\mathbf{M}}\colon\mathsf{BA}\to\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{M}) was defined for arbitrary finite algebras 𝐌\mathbf{M}. Of course, if 𝐒\mathbf{S} is a subalgebra of 𝐌\mathbf{M}, then 𝔓𝐒\mathfrak{P}_{\mathbf{S}} can also be seen as a functor into 𝕊(𝐌)\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{M}), and in the following there is no need to distinguish between these two functors in our notation. The functor 𝔓𝐌\mathfrak{P}_{\mathbf{M}} is faithful (unless 𝐌\mathbf{M} is trivial), but it is usually not full. In fact, it is easy to see that 𝔓𝐌\mathfrak{P}_{\mathbf{M}} can only be full if 𝐌\mathbf{M} does not have any non-trivial automorphisms.

In the main theorem of this subsection we show that, if 𝔓𝐌\mathfrak{P}_{\mathbf{M}} is full and has a left-adjoint resembling 𝔖\mathfrak{S}, then a lattice-based algebra 𝐌\mathbf{M} is semi-primal.

Theorem 4.19.

Let 𝐌\mathbf{M} be a finite lattice-based algebra. Then 𝐌\mathbf{M} is semi-primal if and only if 𝔓𝐌\mathfrak{P}_{\mathbf{M}} is full and there is a faithful functor 𝔰:𝕊(𝐌)𝖡𝖠\mathfrak{s}\colon\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{M})\to\mathsf{BA} which satisfies

𝔓𝐄𝔰𝔓𝐌,\mathfrak{P}_{\mathbf{E}}\dashv\mathfrak{s}\dashv\mathfrak{P}_{\mathbf{M}},

where 𝐄=0,1\mathbf{E}=\langle 0,1\rangle is the smallest subalgebra of 𝐌\mathbf{M}.

Proof.

If 𝐌\mathbf{M} is semi-primal, then 𝔓𝐌\mathfrak{P}_{\mathbf{M}} is full since it is dual to the full functor 𝖵\mathsf{V}^{\top}, the functor 𝔰=𝔖\mathfrak{s}=\mathfrak{S} is faithful since it is dual to the faithful functor 𝖴\mathsf{U} and 𝔓𝐄𝔖𝔓𝐌\mathfrak{P}_{\mathbf{E}}\dashv\mathfrak{S}\dashv\mathfrak{P}_{\mathbf{M}} was shown in the last two subsections.

Now for the converse, assume that 𝔓𝐌\mathfrak{P}_{\mathbf{M}} is full and there is a faithful functor 𝔰:𝕊(𝐌)𝖡𝖠\mathfrak{s}\colon\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{M})\to\mathsf{BA} with 𝔓𝐄𝔰𝔓𝐌\mathfrak{P}_{\mathbf{E}}\dashv\mathfrak{s}\dashv\mathfrak{P}_{\mathbf{M}}. For abbreviation we write 𝒱\mathcal{V} for 𝕊(𝐌)\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{M}). We will make use of the following properties of 𝔰\mathfrak{s}:

  1. (i)

    The unit η:𝗂𝖽𝒱𝔓𝐌𝔰\eta\colon\mathsf{id}_{\mathcal{V}}\Rightarrow\mathfrak{P}_{\mathbf{M}}\circ\mathfrak{s} is a monomorphism in each component,

  2. (ii)

    𝔰\mathfrak{s} preserves monomorphisms and finite products.

Condition (i) follows from 𝔰\mathfrak{s} being faithful and (ii) follows from 𝔰\mathfrak{s} being a right-adjoint.

Our first goal is to prove the equivalence

(4) 𝔰(𝐀)𝟐𝐒𝕊(𝐌):𝐀𝐒.\mathfrak{s}(\mathbf{A})\cong\mathbf{2}\Leftrightarrow\exists\mathbf{S}\in\mathbb{S}(\mathbf{M}):\mathbf{A}\cong\mathbf{S}.

If 𝔰(𝐀)𝟐\mathfrak{s}(\mathbf{A})\cong\mathbf{2}, use that by (i) there is an embedding 𝐀𝔓𝐌(𝔰(𝐀))\mathbf{A}\hookrightarrow\mathfrak{P}_{\mathbf{M}}(\mathfrak{s}(\mathbf{A})). Since 𝔓𝐌(𝔰(𝐀))𝐌\mathfrak{P}_{\mathbf{M}}(\mathfrak{s}(\mathbf{A}))\cong\mathbf{M}, it follows that 𝐀\mathbf{A} is isomorphic to a subalgebra of 𝐌\mathbf{M}. Conversely, first note that 𝔰(𝐌)𝟐\mathfrak{s}(\mathbf{M})\cong\mathbf{2} since, using that 𝔓𝐌\mathfrak{P}_{\mathbf{M}} is full and 𝔰𝔓𝐌\mathfrak{s}\dashv\mathfrak{P}_{\mathbf{M}}, we have

1=|𝖡𝖠(𝟐,𝟐)|=|𝒱(𝐌,𝐌)|=|𝒱(𝐌,𝔓𝐌(𝟐))|=|𝖡𝖠(𝔰(𝐌),𝟐))|,1=|\mathsf{BA}(\mathbf{2},\mathbf{2})|=|\mathcal{V}(\mathbf{M},\mathbf{M})|=|\mathcal{V}\big{(}\mathbf{M},\mathfrak{P}_{\mathbf{M}}(\mathbf{2})\big{)}|=|\mathsf{BA}\big{(}\mathfrak{s}(\mathbf{M}),\mathbf{2})\big{)}|,

which is only possible for 𝔰(𝐌)𝟐\mathfrak{s}(\mathbf{M})\cong\mathbf{2}. Now if 𝐀𝐒𝕊(𝐌)\mathbf{A}\cong\mathbf{S}\in\mathbb{S}(\mathbf{M}) then, due to (ii), the natural embedding 𝐒𝐌\mathbf{S}\hookrightarrow{\mathbf{M}} induces an embedding 𝔰(𝐒)𝔰(𝐌)\mathfrak{s}(\mathbf{S})\hookrightarrow\mathfrak{s}(\mathbf{M}). Therefore 𝔰(𝐒)𝟐\mathfrak{s}(\mathbf{S})\cong\mathbf{2} since 𝔰(𝐌)𝟐\mathfrak{s}(\mathbf{M})\cong\mathbf{2} does not have any proper subalgebras.

Next we show that 𝐌\mathbf{M} does not have any non-trivial internal isomorphisms. For every subalgebra 𝐒𝕊(𝐌)\mathbf{S}\in\mathbb{S}(\mathbf{M}), there is a bijection between the set of Boolean homomorphisms 𝔰(𝐒)𝟐\mathfrak{s}(\mathbf{S})\to\mathbf{2} and the set of homomorphisms 𝐒𝔓𝐌(𝟐)\mathbf{S}\to\mathfrak{P}_{\mathbf{M}}(\mathbf{2}). Due to (4) we have 𝔰(𝐒)𝟐\mathfrak{s}(\mathbf{S})\cong\mathbf{2}, so the former only has one element. Since 𝔓𝐌(𝟐)𝐌\mathfrak{P}_{\mathbf{M}}(\mathbf{2})\cong\mathbf{M} this means that there is only one homomorphism 𝐒𝐌\mathbf{S}\to\mathbf{M}, namely the identity on 𝐒\mathbf{S}. Every non-trivial internal isomorphism with domain 𝐒\mathbf{S} would define another such homomorphism, resulting in a contradiction.

We now show that 𝐌\mathbf{M} is semi-primal, using the characterization of semi-primality in Proposition 2.3. That is, we want to show that 𝐌\mathbf{M} has a majority term and every subalgebra of 𝐌2\mathbf{M}^{2} is either a product of subalgebras or the diagonal of a subalgebra of 𝐌\mathbf{M}. Since 𝐌\mathbf{M} is based on a lattice, a majority term is given by the median (see the paragraph before Proposition 2.3). Let 𝐀𝐌2\mathbf{A}\leq\mathbf{M}^{2} be a subalgebra and let ι:𝐀𝐌2\iota\colon\mathbf{A}\hookrightarrow\mathbf{M}^{2} be its natural embedding. Due to (ii), this embedding induces an embedding 𝔰(𝐀)𝔰(𝐌2)\mathfrak{s}(\mathbf{A})\hookrightarrow\mathfrak{s}(\mathbf{M}^{2}) into 𝔰(𝐌2)𝟐2\mathfrak{s}(\mathbf{M}^{2})\cong\mathbf{2}^{2}. Therefore, either 𝔰(𝐀)𝟐2\mathfrak{s}(\mathbf{A})\cong\mathbf{2}^{2} or 𝔰(𝐀)𝟐\mathfrak{s}(\mathbf{A})\cong\mathbf{2}. Let p1:𝐀𝐌p_{1}\colon\mathbf{A}\to\mathbf{M} and p2:𝐀𝐌p_{2}\colon\mathbf{A}\to\mathbf{M} be ι\iota followed by the respective projections 𝐌2𝐌\mathbf{M}^{2}\to\mathbf{M}.

First assume that p1p_{1} and p2p_{2} coincide. Then clearly 𝐀\mathbf{A} embeds into 𝐌\mathbf{M}, and therefore it is isomorphic to some subalgebra 𝐒\mathbf{S} of 𝐌\mathbf{M}. Since 𝐌\mathbf{M} has no non-trivial internal isomorphisms, 𝐀\mathbf{A} needs to coincide with the diagonal of 𝐒\mathbf{S}.

If p1p_{1} and p2p_{2} are distinct then, using that 𝔰\mathfrak{s} is faithful, the morphisms 𝔰p1:𝔰(𝐀)𝟐\mathfrak{s}p_{1}\colon\mathfrak{s}(\mathbf{A})\to\mathbf{2} and 𝔰p2:𝔰(𝐀)𝟐\mathfrak{s}p_{2}\colon\mathfrak{s}(\mathbf{A})\to\mathbf{2} are distinct as well. This implies that 𝔰(𝐀)𝟐2\mathfrak{s}(\mathbf{A})\cong\mathbf{2}^{2}. Using the adjunction 𝔓E𝔰\mathfrak{P}_{E}\dashv\mathfrak{s} we get

4=|𝖡𝖠(𝟐2,𝔰(𝐀))|=|𝒱(𝐄2,𝐀)| and 4=|𝖡𝖠(𝟐2,𝔰(𝐌2))|=|𝒱(𝐄2,𝐌2)|.4=|\mathsf{BA}(\mathbf{2}^{2},\mathfrak{s}(\mathbf{A}))|=|\mathcal{V}(\mathbf{E}^{2},\mathbf{A})|\text{ and }4=|\mathsf{BA}(\mathbf{2}^{2},\mathfrak{s}(\mathbf{M}^{2}))|=|\mathcal{V}(\mathbf{E}^{2},\mathbf{M}^{2})|.

So there are exactly four distinct homomorphisms 𝐄2𝐀\mathbf{E}^{2}\to\mathbf{A} and, since ι\iota is a monomorphism, their compositions with ι\iota are also four distinct homomorphisms 𝐄2𝐌2\mathbf{E}^{2}\to\mathbf{M}^{2}. Therefore every of the former homomorphisms arises in such a way. In particular, the natural embedding 𝐄2𝐌2\mathbf{E}^{2}\hookrightarrow\mathbf{M}^{2} arises in this way, which implies (0,1)𝐀(0,1)\in\mathbf{A} and (1,0)𝐀(1,0)\in\mathbf{A}. As noted in [22], this leads to 𝐀=p1(𝐀)×p2(𝐀)\mathbf{A}=p_{1}(\mathbf{A})\times p_{2}(\mathbf{A}), since whenever (a,b),(c,d)𝐀(a,b),(c,d)\in\mathbf{A} we also have

(a,d)=((a,b)(1,0))((c,d)(0,1))𝐀.(a,d)=\big{(}(a,b)\wedge(1,0)\big{)}\vee\big{(}(c,d)\wedge(0,1)\big{)}\in\mathbf{A}.

This concludes the proof. ∎

In the remainder of this subsection we show how this theorem relates to the theory of topological functors (see, e.g., [1, Chapter VI.21] or [8, Chapter 7]). Intuitively speaking, topological functors behave similarly to the forgetful functor 𝖳𝗈𝗉𝖲𝖾𝗍\mathsf{Top}\to\mathsf{Set} out of the category of all topological spaces. Still, the definitions involved are rather technical and the reader not familiar with this topic may skip this part.

Definition 4.20.

We call a functor 𝖥:𝒞𝒟\mathsf{F}\colon\mathcal{C}\to\mathcal{D}

  1. (1)

    topological if it is faithful and every 𝖥\mathsf{F}-structured source has an initial lift,

  2. (2)

    essentially topological if it is topological up to categorical equivalence of 𝒞\mathcal{C} and 𝒟\mathcal{D}.

The need for this distinction arises because certain properties of topological functors, e.g., amnesticity [1, Definition 3.27], are not preserved under categorical equivalence (this issue is addressed in [50]).

The following is our key observation for the last part of this subsection.

Proposition 4.21.

The forgetful functor 𝖴:𝖲𝗍𝗈𝗇𝖾𝐋𝖲𝗍𝗈𝗇𝖾\mathsf{U}\colon\mathsf{Stone}_{\mathbf{L}}\to\mathsf{Stone} is topological and the Boolean skeleton functor 𝔖:𝒜𝖡𝖠\mathfrak{S}\colon\mathcal{A}\to\mathsf{BA} is essentially topological.

Proof.

We only need to show that 𝖴\mathsf{U} is topological, which immediately implies that 𝔖\mathfrak{S} is essentially topological due to [1, Theorem 21.9] together with the fact that 𝔖\mathfrak{S} is naturally isomorphic to the dual of 𝖴\mathsf{U}.

Of course 𝖴\mathsf{U} is faithful since it is the identity on morphisms. Now let X𝖲𝗍𝗈𝗇𝖾X\in\mathsf{Stone} and let (fi:X𝖴(Xi,𝐯i))iI(f_{i}\colon X\to\mathsf{U}(X_{i},\mathbf{v}_{i}))_{i\in I} be a 𝖴\mathsf{U}-structured source (i.e., a collection of continuous maps) indexed by a class II. We define 𝐯:X𝕊(𝐋)\mathbf{v}\colon X\to\mathbb{S}(\mathbf{L}) by

𝐯(x)=iI𝐯i(fi(x)).\mathbf{v}(x)=\bigvee_{i\in I}\mathbf{v}_{i}(f_{i}(x)).

Note that this is well-defined, since 𝕊(𝐋)\mathbb{S}(\mathbf{L}) is finite and that (X,𝐯)(X,\mathbf{v}) is a member of 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}, since 𝐯1(𝐒)=iIfi1(𝐯i1(𝐒))\mathbf{v}^{-1}(\mathbf{S}{\downarrow})=\bigcap_{i\in I}f_{i}^{-1}(\mathbf{v}_{i}^{-1}(\mathbf{S}{\downarrow})) is closed. Every fif_{i} is now also a morphism in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}, which defines a lift of the source. To show that it is initial, assume there are 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}-morphisms (gi:(Y,𝐰)(Xi,𝐯i))iI(g_{i}\colon(Y,\mathbf{w})\to(X_{i},\mathbf{v}_{i}))_{i\in I} and a continuous map g:YXg\colon Y\to X with fig=gif_{i}\circ g=g_{i}. All we need to show is that gg defines a 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}-morphism (Y,𝐰)(X,𝐯)(Y,\mathbf{w})\to(X,\mathbf{v}). To see this simply note that

𝐯(g(y))=iI𝐯i(fi(g(y)))=iI𝐯i(gi(y))𝐰(y),\mathbf{v}(g(y))=\bigvee_{i\in I}\mathbf{v}_{i}\big{(}f_{i}(g(y))\big{)}=\bigvee_{i\in I}\mathbf{v}_{i}(g_{i}(y))\leq\mathbf{w}(y),

which concludes the proof. ∎

We can now easily show the following.

Corollary 4.22.

Let 𝐌\mathbf{M} be a finite lattice-based algebra. Then 𝐌\mathbf{M} is semi-primal if and only if there is an essentially topological functor 𝔰:𝕊(𝐌)𝖡𝖠\mathfrak{s}\colon\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{M})\to\mathsf{BA} which satisfies

𝔓𝐄𝔰𝔓𝐌,\mathfrak{P}_{\mathbf{E}}\dashv\mathfrak{s}\dashv\mathfrak{P}_{\mathbf{M}},

where 𝐄=0,1\mathbf{E}=\langle 0,1\rangle is the smallest subalgebra of 𝐌\mathbf{M}.

Proof.

In the previous proposition we showed that if 𝐌\mathbf{M} is semi-primal, then 𝔖\mathfrak{S} is essentially topological.

Conversely, if such an essentially topological 𝔰\mathfrak{s} exists, it is faithful by definition and both its adjoints 𝔓𝐌\mathfrak{P}_{\mathbf{M}} and 𝔓𝐄\mathfrak{P}_{\mathbf{E}} are full by [1, Proposition 21.12]. Therefore, due to Theorem 4.19, 𝐌\mathbf{M} is semi-primal. ∎

In this section we gained an algebraic understanding of all the functors between 𝒜\mathcal{A} and 𝖡𝖠\mathsf{BA} appearing on the right-hand side of Figure 3. Furthermore, we now showed how properties of the Boolean skeleton functor 𝔖\mathfrak{S} characterize semi-primality. In the next section we investigate how canonical extensions of algebras in 𝒜\mathcal{A} behave under these functors. One of the main results is that the Boolean skeleton functor 𝔖\mathfrak{S} may be used to identify canonical extensions of algebras in 𝒜\mathcal{A}.

5. Discrete duality and canonical extensions

In this section we describe a semi-primal discrete duality similar to the well-known discrete duality between 𝖲𝖾𝗍\mathsf{Set} and 𝖢𝖠𝖡𝖠\mathsf{CABA}, the category of complete atomic Boolean algebras with complete homomorphisms. It can be obtained from the finite duality in a similar way to the one of Section 3, except that now we lift it to the level of 𝖨𝗇𝖽(𝖲𝖾𝗍𝐋ω)\mathsf{Ind}(\mathsf{Set}_{\mathbf{L}}^{\omega}) and 𝖯𝗋𝗈(𝒜ω)\mathsf{Pro}(\mathcal{A}^{\omega}). The members of the latter category are known to be precisely the canonical extensions [33] of members of 𝒜\mathcal{A} (see [21]), and we will provide two new characterizations of this category (Corollary 5.8 and Theorem 5.10). Lastly we show that, as in the primal case 𝐋=𝟐\mathbf{L}=\mathbf{2}, the topological duality from Section 3 can be connected to its discrete version via an analogue of the Stone-Čech compactification.

Our first goal is to identify 𝖨𝗇𝖽(𝖲𝖾𝗍𝐋ω)\mathsf{Ind}(\mathsf{Set}_{\mathbf{L}}^{\omega}). Although it may not be surprising, it will still take some work to prove that it can be identified with the following category.

Definition 5.1.

The category 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} has objects of the form (X,v)(X,v) where X𝖲𝖾𝗍X\in\mathsf{Set} and v:X𝕊(𝐋)v\colon X\to\mathbb{S}(\mathbf{L}) is an arbitrary map. A morphism m:(X,v)(Y,w)m\colon(X,v)\rightarrow(Y,w) is a map XYX\to Y which always satisfies

w(m(x))v(x).w(m(x))\leq v(x).
Remark 6.

In the context of fuzzy sets, Goguen [34, 35] initiated the study of such categories. This research was continued, e.g., in [5, 58]. In this remark we stick to the notation of [35]. Given a complete lattice 𝒱\mathcal{V}, the category 𝖲𝖾𝗍(𝒱)\mathsf{Set}(\mathcal{V}) of 𝒱\mathcal{V}-fuzzy sets has objects (X,A)(X,A) where A:X𝒱A\colon X\to\mathcal{V}. Morphisms (X,A)(X,A)(X,A)\to(X^{\prime},A^{\prime}) are maps m:XYm\colon X\to Y which satisfy A(m(x))A(x)A^{\prime}(m(x))\geq A(x) for all xXx\in X. In the context of fuzzy set theory, people were mainly interested in the case where 𝒱=[0,1]\mathcal{V}=[0,1]. However, we retrieve 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} in the case where 𝒱\mathcal{V} is the order-dual of 𝕊(𝐋)\mathbb{S}(\mathbf{L}). \blacksquare

Since we are interested in the 𝖨𝗇𝖽\mathsf{Ind}-completion of 𝖲𝖾𝗍𝐋ω\mathsf{Set}_{\mathbf{L}}^{\omega}, we will first discuss (filtered) colimits in this category.

Lemma 5.2.

The category 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} is cocomplete. The colimit colimiI(Xi,vi)\mathrm{colim}_{i\in I}(X_{i},v_{i}) of a filtered diagram (fij:(Xi,vi)(Xj,vj)ij)\big{(}f_{ij}\colon(X_{i},v_{i})\to(X_{j},v_{j})\mid i\leq j\big{)} is realized by ((iIXi)/,v¯)\big{(}(\coprod_{i\in I}X_{i}){/}{\sim},\bar{v}\big{)}. Here, for xiXix_{i}\in X_{i} and xjXjx_{j}\in X_{j},

xixjki,j:fik(xi)=fjk(xj)x_{i}\sim x_{j}\iff\exists k\geq i,j:f_{ik}(x_{i})=f_{jk}(x_{j})

and

v¯([xi])=xixjXjvj(xj),\bar{v}([x_{i}])=\bigwedge_{x_{i}\sim x_{j}\in X_{j}}v_{j}(x_{j}),

where [xi][x_{i}] is the equivalence class of xix_{i} with respect to \sim.

Proof.

The proof that 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} is cocomplete is completely analogous to the one in [58]. For filtered colimits, on the underlying level of 𝖲𝖾𝗍\mathsf{Set} we know that X:=iI(Xi)/X:=\coprod_{i\in I}(X_{i})/{\sim} with the canonical inclusions ρi:XiX\rho_{i}\colon X_{i}\to X is the colimit of the diagram. To see that all the ρi\rho_{i} are morphisms in 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} note

v¯(ρi(xi))=xixjXjvj(xj)vi(xi).\bar{v}(\rho_{i}(x_{i}))=\bigwedge_{x_{i}\sim x_{j}\in X_{j}}v_{j}(x_{j})\leq v_{i}(x_{i}).

Given another cocone γi:(Xi,vi)(Z,u)\gamma_{i}\colon(X_{i},v_{i})\to(Z,u), the unique map g:XZg\colon X\to Z is a morphism in 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} since, for xiXix_{i}\in X_{i} and xixjXjx_{i}\sim x_{j}\in X_{j} we have u(g(ρj(xj)))=u(γj(xj))vj(xj)u\big{(}g(\rho_{j}(x_{j}))\big{)}=u(\gamma_{j}(x_{j}))\leq v_{j}(x_{j}) and thus

u(g([xi]))xixjXjvj(xj)=v¯([xi]),u\big{(}g([x_{i}])\big{)}\leq\bigwedge_{x_{i}\sim x_{j}\in X_{j}}v_{j}(x_{j})=\bar{v}([x_{i}]),

which concludes the proof. ∎

We will also make use of the following general result.

Lemma 5.3.

Let 𝖥:𝒞𝒟\mathsf{F}\colon\mathcal{C}\to\mathcal{D} be a functor between categories 𝒞\mathcal{C} and 𝒟\mathcal{D} which both admit filtered colimits. If 𝖥\mathsf{F} has a right-adjoint 𝖦\mathsf{G} which preserves filtered colimits, then 𝖥\mathsf{F} preserves finitely presentable objects.

Proof.

Let C𝒞C\in\mathcal{C} be finitely presentable. We want to show that F(C)F(C) is finitely presentable in 𝒟\mathcal{D}. Let colimiDi\mathrm{colim}_{i}D_{i} be a filtered colimit in 𝒟\mathcal{D}. Then

𝒟(𝖥(C),colimiDi)colimi𝒞(C,𝖦(Di))colimi𝒟(𝖥(C),Di),\mathcal{D}\big{(}\mathsf{F}(C),\mathrm{colim}_{i}D_{i}\big{)}\cong\mathrm{colim}_{i}\mathcal{C}\big{(}C,\mathsf{G}(D_{i})\big{)}\cong\mathrm{colim}_{i}\mathcal{D}\big{(}\mathsf{F}(C),D_{i}\big{)},

where the first isomorphism comes from the fact that 𝖦\mathsf{G} preserves filtered colimits and CC is finitely presentable. ∎

Corollary 5.4.

If XX is a finite set, then (X,v)(X,v) is finitely presentable in 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} for every v:X𝕊(𝐋)v\colon X\to\mathbb{S}(\mathbf{L}).

Proof.

Let X={x1,,xn}X=\{x_{1},\dots,x_{n}\} and let v(xi)=𝐒𝐢v(x_{i})=\mathbf{S_{i}}. Then we can clearly identify

(X,v)1in({xi},v𝐒𝐢),(X,v)\cong\coprod_{1\leq i\leq n}(\{x_{i}\},v^{\mathbf{S_{i}}}),

where v𝐒𝐢(xi)=𝐒𝐢v^{\mathbf{S_{i}}}(x_{i})=\mathbf{S_{i}}. Since filtered colimits commute with finite limits in 𝖲𝖾𝗍\mathsf{Set}, it now suffices to show that all ({xi},v𝐒𝐢)(\{x_{i}\},v^{\mathbf{S_{i}}}) are finitely presentable. Just like in Subsection 4.4 we can define the adjunction 𝖵𝐒𝖢𝐒\mathsf{V}^{\mathbf{S}}\dashv\mathsf{C}^{\mathbf{S}} between 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} and 𝖲𝖾𝗍\mathsf{Set} for every subalgebra 𝐒𝐋\mathbf{S}\leq\mathbf{L}. By Lemma 5.3 it now suffices to show that 𝖢𝐒\mathsf{C}^{\mathbf{S}} preserves filtered colimits. So let (X,v¯)(X,\bar{v}) be a filtered colimit as in Lemma 5.2. We know that 𝖢𝐒(X)={[xi]xixjXj,vj(xj)𝐒}\mathsf{C}^{\mathbf{S}}(X)=\{[x_{i}]\mid\exists x_{i}\sim x_{j}\in X_{j},v_{j}(x_{j})\leq\mathbf{S}\}. Therefore, for all [xi]𝖢𝐒[x_{i}]\in\mathsf{C}^{\mathbf{S}} we can choose representatives with xi𝖢𝐒(Xi,vi)x_{i}\in\mathsf{C}^{\mathbf{S}}(X_{i},v_{i}). This yields a bijection between 𝖢𝐒(X)\mathsf{C}^{\mathbf{S}}(X) and colim𝖢𝐒(Xi,vi)\mathrm{colim}\mathsf{C}^{\mathbf{S}}(X_{i},v_{i}). ∎

We now have everything at hand to easily prove the following.

Theorem 5.5.

𝖨𝗇𝖽(𝖲𝖾𝗍𝐋ω)\mathsf{Ind}(\mathsf{Set}_{\mathbf{L}}^{\omega}) is categorically equivalent to 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}}.

Proof.

Since 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} is cocomplete, the inclusion ι:𝖲𝖾𝗍𝐋ω𝖲𝖾𝗍𝐋\iota\colon\mathsf{Set}_{\mathbf{L}}^{\omega}\to\mathsf{Set}_{\mathbf{L}} has a unique finitary extension ι^:𝖨𝗇𝖽(𝖲𝖾𝗍𝐋ω)𝖲𝖾𝗍𝐋\hat{\iota}\colon\mathsf{Ind}(\mathsf{Set}_{\mathbf{L}}^{\omega})\to\mathsf{Set}_{\mathbf{L}}. Since ι\iota is fully faithful and, by the above corollary, maps all objects to finitely presentable objects in 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}}, this extension is also fully faithful. To see that it is essentially surjective note that, just like in 𝖲𝖾𝗍\mathsf{Set}, every member of 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} is the filtered colimit of its finite subsets. ∎

We now take a closer look at the category 𝖯𝗋𝗈(𝒜ω)\mathsf{Pro}(\mathcal{A}^{\omega}). It is well-known that it consists of the canonical extensions [33] of algebras in 𝒜\mathcal{A}. In [21] a description of these canonical extensions as topological algebras can be found. But, as in the case of complete atomic Boolean algebras 𝖢𝖠𝖡𝖠𝕀(𝟐)\mathsf{CABA}\simeq\mathbb{I}\mathbb{P}(\mathbf{2}), this need not be the only description. In the following we apply results of Section 4 to find two easy alternatives. The first one is in terms of (arbitrary) products of subalgebras of 𝐋\mathbf{L} with complete homomorphisms.

Definition 5.6.

Let 𝒜^\hat{\mathcal{A}} be the category with algebras from 𝕀𝕊(𝐋)\mathbb{I}\mathbb{P}\mathbb{S}(\mathbf{L}) as objects and complete homomorphisms as morphisms.

We can essentially repeat our proof of the finite duality from Corollary 3.6, once we prove the following result analogous to Proposition 3.5.

Proposition 5.7.

Let 𝐀=iI𝐒𝐢𝒜^\mathbf{A}=\prod_{i\in I}\mathbf{S_{i}}\in\hat{\mathcal{A}}. Then the complete homomorphisms 𝐀𝐋\mathbf{A}\to\mathbf{L} are precisely the projections (followed by inclusions) in each component.

Proof.

By Proposition 4.3 there is a bijection between 𝒜(𝐀,𝐋)\mathcal{A}(\mathbf{A},\mathbf{L}) and 𝖡𝖠(𝔖(𝐀),𝟐)\mathsf{BA}(\mathfrak{S}(\mathbf{A}),\mathbf{2}) given by hh𝔖(𝐀)h\mapsto h{\mid}_{\mathfrak{S}(\mathbf{A})}. In particular, if hh is complete, then so is its restriction. Since 𝔖(𝐀)=𝟐I\mathfrak{S}(\mathbf{A})=\mathbf{2}^{I}, the only complete homomorphisms 𝔖(𝐀)𝟐\mathfrak{S}(\mathbf{A})\to\mathbf{2} are the projections, and they are the restrictions of the respective projections 𝐀𝐋\mathbf{A}\to\mathbf{L}. ∎

Corollary 5.8.

𝖯𝗋𝗈(𝒜ω)\mathsf{Pro}(\mathcal{A}^{\omega}) is categorically equivalent to 𝒜^\hat{\mathcal{A}}

Proof.

By Theorem 5.5 it suffices to show that 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} is dually equivalent to 𝒜^\hat{\mathcal{A}}. This is done completely analogous to the proof of Corollary 3.6. ∎

The second description of 𝖯𝗋𝗈(𝒜ω)\mathsf{Pro}(\mathcal{A}^{\omega}) is in terms of the Boolean skeleton.

Definition 5.9.

The category 𝖢𝖠𝒜\mathsf{CA}\mathcal{A} has as objects algebras 𝐀𝒜\mathbf{A}\in\mathcal{A} which have a complete lattice-reduct and which satisfy 𝔖(𝐀)𝖢𝖠𝖡𝖠\mathfrak{S}(\mathbf{A})\in\mathsf{CABA}. The morphisms in 𝖢𝖠𝒜\mathsf{CA}\mathcal{A} are the complete homomorphisms.

Theorem 5.10.

𝖯𝗋𝗈(𝒜ω)\mathsf{Pro}(\mathcal{A}^{\omega}) is categorically equivalent to 𝖢𝖠𝒜\mathsf{CA}\mathcal{A}.

Proof.

Using Corollary 5.8 we show that 𝖢𝖠𝒜\mathsf{CA}\mathcal{A} is categorically equivalent to 𝒜^\hat{\mathcal{A}}. Clearly there is a fully faithful inclusion functor 𝒜^𝖢𝖠𝒜\hat{\mathcal{A}}\hookrightarrow\mathsf{CA}\mathcal{A}. So it suffices to show that this functor is essentially surjective. In other words, we want to show that every object of 𝖢𝖠𝒜\mathsf{CA}\mathcal{A} is isomorphic to a product of subalgebras of 𝐋\mathbf{L}.

So consider 𝐀𝖢𝖠𝒜\mathbf{A}\in\mathsf{CA}\mathcal{A}. Since the adjunction 𝔖𝔓\mathfrak{S}\dashv\mathfrak{P} restricts to 𝖢𝖠𝖡𝖠\mathsf{CABA} and 𝖢𝖠𝒜\mathsf{CA}\mathcal{A}, we can use Corollary 4.10 to get a complete embedding η𝐀:𝐀𝔓(𝔖(𝐀))\eta_{\mathbf{A}}\colon\mathbf{A}\hookrightarrow\mathfrak{P}(\mathfrak{S}(\mathbf{A})). Since 𝔖(𝐀)\mathfrak{S}(\mathbf{A}) is in 𝖢𝖠𝖡𝖠\mathsf{CABA} it is isomorphic to 𝟐I\mathbf{2}^{I} for some index set II. Thus 𝔓(𝔖(𝐀))𝔓(𝟐𝐈)𝐋I\mathfrak{P}(\mathfrak{S}(\mathbf{A}))\cong\mathfrak{P}(\mathbf{2^{I}})\cong\mathbf{L}^{I}. We show that 𝐀\mathbf{A} is isomorphic to the direct product of subalgebras iI𝗉𝗋i(η𝐀(A))\prod_{i\in I}\mathsf{pr}_{i}(\eta_{\mathbf{A}}(A)). For this it suffices to show that the injective homomorphism η𝐀\eta_{\mathbf{A}} maps onto it. So let α\alpha be an element of this product. For each iIi\in I choose ai𝐀a_{i}\in\mathbf{A} such that 𝗉𝗋i(η𝐀(ai))=α(i)\mathsf{pr}_{i}(\eta_{\mathbf{A}}(a_{i}))=\alpha(i). Since 𝟐I𝔖(𝐀)𝐀\mathbf{2}^{I}\cong\mathfrak{S}(\mathbf{A})\subseteq\mathbf{A} all atoms bi𝟐Ib_{i}\in\mathbf{2}^{I} (defined by bi(j)=1b_{i}(j)=1 iff j=ij=i) can be considered as members of 𝐀\mathbf{A}. Now define

a={aibiiI}.a=\bigvee\{a_{i}\wedge b_{i}\mid i\in I\}.

Since 𝐀\mathbf{A} is complete, we have a𝐀a\in\mathbf{A}. And since η𝐀\eta_{\mathbf{A}} is a complete homomorphism we have η𝐀(a)=α\eta_{\mathbf{A}}(a)=\alpha (because 𝗉𝗋i(η𝐀(a))=η𝐀(ai)=α(i)\mathsf{pr}_{i}(\eta_{\mathbf{A}}(a))=\eta_{\mathbf{A}}(a_{i})=\alpha(i)). ∎

With the results from this section thus far, it is clear that the chains of adjunctions from Section 4 (summarized in Figure 3) have their discrete counterparts, equally defined, between 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}} and 𝖲𝖾𝗍\mathsf{Set} and 𝖢𝖠𝒜\mathsf{CA}\mathcal{A} and 𝖢𝖠𝖡𝖠\mathsf{CABA}, respectively. To make the connection between Figure 3 and its discrete counterpart, we finish this section by connecting the respective dualities as indicated in Figure 5.

𝖲𝗍𝗈𝗇𝖾𝐋\textstyle{\mathsf{Stone}_{\mathbf{L}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}β𝐋\scriptstyle{\beta_{\mathbf{L}}}\scriptstyle{\phantom{{}^{\prime}}\dashv}()\scriptstyle{(-)^{\flat}}𝒜\textstyle{\mathcal{A}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}ιc\scriptstyle{\iota_{c}}()δ\scriptstyle{(-)^{\delta}}\scriptstyle{\vdash\phantom{{}^{\prime}}}𝖲𝖾𝗍𝐋\textstyle{\mathsf{Set}_{\mathbf{L}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}𝖢𝖠𝒜\textstyle{\mathsf{CA}\mathcal{A}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}
Figure 5. Compactification and canonical extension.

Here ():𝖲𝗍𝗈𝗇𝖾𝐋𝖲𝖾𝗍𝐋(-)^{\flat}\colon\mathsf{Stone}_{\mathbf{L}}\to\mathsf{Set}_{\mathbf{L}} is the forgetful functor with respect to topology and ιc:𝖢𝖠𝒜𝒜\iota_{c}\colon\mathsf{CA}\mathcal{A}\to\mathcal{A} is the obvious inclusion functor (note that both these functors are not full). The functor ()δ(-)^{\delta} takes an algebra to its canonical extension. In the primal case 𝐋=𝟐\mathbf{L}=\mathbf{2}, it is well-known that β𝟐=:β\beta_{\mathbf{2}}=:\beta is the Stone-Čech compactification (see, e.g., [40, Section IV.2]). This has been generalized to the Bohr compactification in a (much broader) framework which includes ours in [20]. However, since things are particularly simple in our setting, we directly show how to define β𝐋\beta_{\mathbf{L}}.

Given (X,v)𝖲𝖾𝗍𝐋(X,v)\in\mathsf{Set}_{\mathbf{L}}, there is a natural way to extend vv to the Stone-Čech compactification β(X)\beta(X) of XX. Indeed, since v:X𝕊(𝐋)v\colon X\to\mathbb{S}(\mathbf{L}) can be thought of as a continuous map between discrete spaces, by the universal property of β\beta it has a unique continuous extension 𝐯~:β(X)𝕊(𝐋)\mathbf{\tilde{v}}\colon\beta(X)\to\mathbb{S}(\mathbf{L}). Here, 𝐯~1(𝐒)\mathbf{\tilde{v}}^{-1}(\mathbf{S}{\downarrow}) is given by the topological closure of v1(𝐒)v^{-1}(\mathbf{S}{\downarrow}) in β(X)\beta(X). Thus, for every morphism f:(X,v)(Y,w)f\colon(X,v)\to(Y,w) in 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}}, the continuous map βf\beta f defines a morphism (β(X),𝐯~)(β(Y),𝐰~)(\beta(X),\mathbf{\tilde{v}})\to(\beta(Y),\mathbf{\tilde{w}}) in 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}. This is due to the observation that whenever x𝐯~𝟏(𝐒)=v1(𝐒)¯x\in\mathbf{\tilde{v}^{-1}(S{\downarrow})}=\overline{v^{-1}(\mathbf{S}{\downarrow})}, by continuity of βf\beta f and the morphism property of ff, we have βf(x)w1(𝐒)¯=𝐰~1(𝐒)\beta f(x)\in\overline{w^{-1}(\mathbf{S}{\downarrow})}=\mathbf{\tilde{w}}^{-1}(\mathbf{S}{\downarrow}).

Proposition 5.11.

The functor β𝐋:𝖲𝖾𝗍𝐋𝖲𝗍𝗈𝗇𝖾𝐋\beta_{\mathbf{L}}\colon\mathsf{Set}_{\mathbf{L}}\to\mathsf{Stone}_{\mathbf{L}} defined on objects by

β𝐋(X,v)=(β(X),𝐯~)\beta_{\mathbf{L}}(X,v)=(\beta(X),\mathbf{\tilde{v}})

and by fβff\mapsto\beta f on morphisms is the dual of the canonical extension functor ()δ:𝒜𝖢𝖠𝒜(-)^{\delta}\colon\mathcal{A}\to\mathsf{CA}\mathcal{A}.

Proof.

It suffices to show that β𝐋\beta_{\mathbf{L}} satisfies the following universal property. Given (Y,𝐰)𝖲𝗍𝗈𝗇𝖾𝐋(Y,\mathbf{w})\in\mathsf{Stone}_{\mathbf{L}}, every 𝖲𝖾𝗍𝐋\mathsf{Set}_{\mathbf{L}}-morphism f:(X,v)(Y,𝐰)f\colon(X,v)\to(Y,\mathbf{w}) extends uniquely to a 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}-morphism f~:(β(X),𝐯~)(Y,𝐰)\tilde{f}\colon(\beta(X),\mathbf{\tilde{v}})\to(Y,\mathbf{w}). On the levels of 𝖲𝖾𝗍\mathsf{Set} and 𝖲𝗍𝗈𝗇𝖾\mathsf{Stone} we get a unique continuous extension f~\tilde{f}. To show it is a 𝖲𝗍𝗈𝗇𝖾𝐋\mathsf{Stone}_{\mathbf{L}}-morphism, similarly to before, note that if xv1(S)¯x\in\overline{v^{-1}(S{\downarrow})}, then by continuity

f~(x)f(v1(𝐒))¯𝐰1(𝐒)¯.\tilde{f}(x)\in\overline{f\big{(}v^{-1}(\mathbf{S}{\downarrow})\big{)}}\subseteq\overline{\mathbf{w}^{-1}(\mathbf{S}{\downarrow})}.

Since 𝐰1(𝐒)\mathbf{w}^{-1}(\mathbf{S}{\downarrow}) is closed it equals its own closure. This concludes the proof. ∎

This nicely wraps up this paper by connecting all of its main sections. In the last section we give a quick summary and discuss some possible directions of future research along similar lines.

6. Concluding Remarks and Further Research

We explored semi-primality by means of category theory, showing how a variety generated by a semi-primal lattice expansion relates to the variety of Boolean algebras. Various adjunctions provide insight into the many similarities between these varieties. A schematic summary of our results can be found in Figure 6, which also emphasizes once more how close 𝖡𝖠\mathsf{BA} and 𝒜\mathcal{A} really are.

𝖲𝖾𝗍𝐋ω{\mathsf{Set}_{\mathbf{L}}^{\omega}}𝒜ω{\mathcal{A}^{\omega}}𝖲𝖾𝗍𝐋{\mathsf{Set}_{\mathbf{L}}}𝖢𝖠𝒜{\mathsf{CA}\mathcal{A}}𝖲𝗍𝗈𝗇𝖾𝐋{\mathsf{Stone}_{\mathbf{L}}}𝒜{\mathcal{A}}𝖲𝖾𝗍{\mathsf{Set}}𝖢𝖠𝖡𝖠{\mathsf{CABA}}𝖲𝗍𝗈𝗇𝖾{\mathsf{Stone}}𝖡𝖠{\mathsf{BA}}𝖲𝖾𝗍ω{\mathsf{Set}^{\omega}}𝖡𝖠ω{\mathsf{BA}^{\omega}}𝖯𝗋𝗈\scriptstyle{\mathsf{Pro}}𝖨𝗇𝖽\scriptstyle{\mathsf{Ind}}𝖯𝗋𝗈\scriptstyle{\mathsf{Pro}}𝖨𝗇𝖽\scriptstyle{\mathsf{Ind}}𝖨𝗇𝖽\scriptstyle{\mathsf{Ind}}𝖯𝗋𝗈\scriptstyle{\mathsf{Pro}}𝖨𝗇𝖽\scriptstyle{\mathsf{Ind}}𝖯𝗋𝗈\scriptstyle{\mathsf{Pro}}
Figure 6. Summary of our results.

We plan to follow up this research by developing a coalgebraic framework for modal extensions of the many-valued logic corresponding to a semi-primal variety. As mentioned before, from this point of view it is reasonable to assume that 𝐋\mathbf{L} is based on a lattice. However, it seems plausible that our results generalize to the slightly more general case of semi-primal algebras which possess a coupling in the sense of [26], essentially since Proposition 2.8 and Theorem 3.2 still apply to this case.

We will now sketch some more potential ways to follow up this research. In general, we hope to have set an example in exploring concepts in universal algebra through the lens of (mostly elementary) category theory.

For example, other variants of primality (see, e.g., [55, 41]) could be investigated in a similar manner.

Definition 6.1.

A finite algebra 𝐌\mathbf{M} is called

  1. (1)

    demi-semi-primal if it is quasi-primal and every internal isomorphism of 𝐌\mathbf{M} can be extended to an automorphism of 𝐌\mathbf{M} (see [54]).

  2. (2)

    demi-primal if it is quasi-primal and has no proper subalgebras (see [54]).

  3. (3)

    infra-primal if it is demi-semi primal and every internal isomorphism is an automorphism on its domain (see [27]).

  4. (4)

    hemi-primal if every operation on 𝐌\mathbf{M} which preserves congruences is term-definable in 𝐌\mathbf{M} (see [28]).

Question 1.

What is the categorical relationship between 𝖡𝖠\mathsf{BA} and the variety generated by an algebra which is quasi-primal or which satisfies one of the properties of Definition 6.1? What about the relationship between distinct variations of primality to each other?

For quasi-primal algebras (and thus, in particular, for algebras satisfying (1), (2) or (3)), there is the duality theorem by Keimel-Werner [42] (which is also a natural duality [17]), possibly a good starting point to a discussion similar to the one presented here.

Hemi-primality seems to have received less attention. To the best of the authors knowledge, no duality for varieties generated by hemi-primal algebras is known thus far.

Question 2.

Is it possible to obtain a duality for hemi-primal varieties, for example one which stems from a finite dual equivalence using methods similar to our proof of semi-primal duality in Section 3?

The Boolean power functor 𝔓𝐌:𝖡𝖠𝕊(𝐌)\mathfrak{P}_{\mathbf{M}}\colon\mathsf{BA}\to\mathbb{H}\mathbb{S}\mathbb{P}(\mathbf{M}) was defined for an arbitrary finite algebra 𝐌\mathbf{M}. In the light of our results from Section 4, the following question arises.

Question 3.

Under which circumstances does the functor 𝔓𝐌\mathfrak{P}_{\mathbf{M}} have a left-adjoint? Which information about 𝐌\mathbf{M} can be retrieved from properties of the functors of the form 𝔓𝐒\mathfrak{P}_{\mathbf{S}} with 𝐒𝐌\mathbf{S}\leq\mathbf{M}?

If we consider this work as not only comparing varieties but comparing dualities, another range of questions appears.

Question 4.

What is the category theoretical relationship between different dual equivalences? For example, one could consider Priestley duality [53] or Esakia duality [23].

Lastly, another category theoretical approach to universal algebra, which has not been discussed in this paper, is given by Lawvere theories. For example, Hu’s theorem has been analyzed from this angle in [52]. Of course, one could also try to find out more about other variants of primality in this context.

Question 5.

How can semi-primality and other variants of primality be expressed in terms of Lawvere theories?

Appendix A Some semi-primal 𝖥𝖫ew\mathsf{FL}_{ew}algebras

Here we go into more detail in some claims made in Subsection 2.3.2. We provide examples of semi-primal 𝖥𝖫ew\mathsf{FL}_{ew}-algebras, both chain-based and non chain-based, including the proof of semi-primality for each one of them. All of the examples and their labels are taken from the list [31] by Galatos and Jipsen. For simplicity we only discus 𝖥𝖫ew\mathsf{FL}_{ew}-algebras without any idempotent elements other than 0 and 11. Due to Corollary 2.16 they are all quasi-primal. To prove semi-primality, by Proposition 2.2, it suffices to describe all subalgebras and argue why there can’t be any non-trivial isomorphisms between then.

We begin with the quasi-primal 𝖥𝖫ew\mathsf{FL}_{ew}-chains of five elements R1,175,1R^{5,1}_{1,17} to R1,225,1R^{5,1}_{1,22} in [31, p.2, row 2] depicted in Figure 7.

11aabbcca2a^{2}R1,175,1R^{5,1}_{1,17}
11aabbc=a2c=a^{2}ababR1,185,1R^{5,1}_{1,18}
11aab=a2b=a^{2}ccababR1,195,1R^{5,1}_{1,19}
11aabbc=a2=abc=a^{2}=abb2=acb^{2}=acR1,205,1R^{5,1}_{1,20}
11aab=a2b=a^{2}c=abc=abb2=acb^{2}=acR1,215,1R^{5,1}_{1,21}
11aabbc=a2=b2c=a^{2}=b^{2}acacR1,225,1R^{5,1}_{1,22}
Figure 7. The quasi-primal 𝖥𝖫ew\mathsf{FL}_{ew}-chains of order five.
Claim 1.

Except for the first one, all algebras depicted in Figure 7 are semi-primal.

Proof.

R1,175,1R^{5,1}_{1,17} is not semi-primal because it has isomorphic subalgebras {0,1,a,b}\{0,1,a,b\} and {0,1,a,c}\{0,1,a,c\}.

In the following we show why the other ones are semi-primal by describing the subalgebras other than the obvious ones {0,1}\{0,1\} and {0,1,a,b,c}\{0,1,a,b,c\}. Since isomorphisms need to be order-preserving, it suffices to note that there are never two subalgebras of the same size in the examples below.

R1,185,1R^{5,1}_{1,18}: There are no other subalgebras since {¬a,a2}={b,c}a\{\neg a,a^{2}\}=\{b,c\}\subseteq\langle a\rangle and ¬b=¬c=a\neg b=\neg c=a, thus aba\in\langle b\rangle and aca\in\langle c\rangle.
R1,191,5R^{1,5}_{1,19}: There is the subalgebra a=b={0,1,a,b}\langle a\rangle=\langle b\rangle=\{0,1,a,b\} since ab=aa\rightarrow b=a, ¬a=b\neg a=b and ¬b=a\neg b=a. Since a=¬ca=\neg c we have aca\in\langle c\rangle, so cc generates the entire algebra.

R1,205,1R^{5,1}_{1,20}: There are two different sized subalgebras a=c={0,1,a,c}\langle a\rangle=\langle c\rangle=\{0,1,a,c\} (since ¬a=c,¬c=a\neg a=c,\neg c=a and ac=aa\rightarrow c=a) and b={0,1,b}\langle b\rangle=\{0,1,b\} (since ¬b=bb=b\neg b=b\rightarrow b=b)

R1,215,1R^{5,1}_{1,21}: Note that this algebra corresponds to the Łukasiewicz-chain Ł4\text{\bf\L}_{4}. As thus expected, there is the subalgebra b={0,1,b}\langle b\rangle=\{0,1,b\}, while bacb\in\langle a\rangle\cap\langle c\rangle since a=¬c,c=¬aa=\neg c,c=\neg a and b=a2b=a^{2}.

R1,225,1R^{5,1}_{1,22}: There is the subalgebra a=c={0,1,a,c}\langle a\rangle=\langle c\rangle=\{0,1,a,c\} (since ¬a=c\neg a=c, ¬c=a\neg c=a and ac=aa\rightarrow c=a). Since ¬b=c\neg b=c and ¬c=a\neg c=a we find that bb generates the entire algebra. ∎

To also provide non chain-based examples, we examine the 𝖥𝖫ew\mathsf{FL}_{ew}-algebras R1,116,2R^{6,2}_{1,11} ([31, p.19, row 5]) and R1,96,3R^{6,3}_{1,9} ([31, p.21, row 3]) depicted in Figure 8.

11aabbc=a2c=a^{2}ddababR1,116,2R^{6,2}_{1,11}
11aabbccd=a2=c2d=a^{2}=c^{2}ab=bcab=bcR1,96,3R^{6,3}_{1,9}
Figure 8. Two semi-primal 𝖥𝖫ew\mathsf{FL}_{ew}-algebras of order six.
Claim 2.

The two 𝖥𝖫ew\mathsf{FL}_{ew}-algebras depicted in Figure 8 are semi-primal.

Proof.

R1,116,2R^{6,2}_{1,11}: The only possible candidate for an automorphism of this algebra is the bijection ff exchanging cc and dd (since it needs to be order-preserving). This map, however, is not a homomorphism, as witnessed by the fact that f(a2)=f(c)=df(a^{2})=f(c)=d while f(a)2=a2=cf(a)^{2}=a^{2}=c. The only other subalgebra other than {0,1}\{0,1\} is a={0,1,a,b,c}\langle a\rangle=\{0,1,a,b,c\} since we have ¬a=b\neg a=b, a2=ca^{2}=c, ¬c=a\neg c=a, ab=aa\rightarrow b=a, ac=aa\rightarrow c=a and bc=ab\rightarrow c=a. Since this subalgebra is a chain, it does not have any non-trivial isomorphisms. Since ¬d=a\neg d=a we know that dd generates the entire algebra, so there are no more subalgebras to consider.

R1,96,3R^{6,3}_{1,9}: Again, there is only one possible candidate for an automorphism of this algebra, namely the bijection gg exchanging bb and cc. This is not a homomorphism because g(b2)=g(0)=0g(b^{2})=g(0)=0 while g(b)2=c2=dg(b)^{2}=c^{2}=d. The only other subalgebra except {0,1}\{0,1\} is a={0,1,a,b,d}\langle a\rangle=\{0,1,a,b,d\} since ¬a=b\neg a=b, ¬b=¬d=a\neg b=\neg d=a and ab=ad=bd=aa\rightarrow b=a\rightarrow d=b\rightarrow d=a. This subalgebra has no non-trivial isomorphisms because it is a chain. Since c2=dc^{2}=d, the element cc generates the entire algebra. ∎

Acknowledgments

The second author is supported by the Luxembourg National Research Fund under the project PRIDE17/12246620/GPS.

References

  • [1] Adámek, J., Herrlich, H., and Strecker, G. E. Abstract and Concrete Categories: The Joy of Cats. Reprints in Theory and Applications of Categories, No. 17, 2006. (Originally published by Wiley, New York, 1990).
  • [2] Adámek, J., Milius, S., Sousa, L., and Wissmann, T. On finitary functors. Theory and Applications of Categories 34, 35 (2019), 1134–1164.
  • [3] Baker, K. A., and Pixley, A. F. Polynomial interpolation and the chinese remainder theorem for algebraic systems. Mathematische Zeitschrift 143 (1975), 165–174.
  • [4] Banaschewski, B., and Herrlich, H. Subcategories defined by implications. Houston J. Math. 2 (1976), 149–171.
  • [5] Barr, M. Fuzzy set theory and topos theory. Canadian Mathematical Bulletin 29, 4 (1986), 501–508.
  • [6] Bergman, C. Universal Algebra. Fundamentals and Selected Topics. Chapman and Hall/CRC, 2011.
  • [7] Bergman, C., and Bergman, J. Morita equivalence of almost-primal clones. Journal of Pure and Applied Algebra 108, 2 (1996), 175–201.
  • [8] Borceux, F. Handbook of Categorical Algebra, vol. 2. Cambridge University Press, 1994.
  • [9] Burris, S. Boolean powers. Algebra Universalis 5 (1975), 341–360.
  • [10] Burris, S. Discriminator varieties and symbolic computation. Journal of Symbolic Computation 13 (1992), 175–207.
  • [11] Burris, S., and Sankappanavar, H. P. A Course in Universal Algebra. Graduate Texts in Mathematics. Springer, 1981.
  • [12] Chajda, I., Goldstern, M., and Länger, H. A note on homomorphisms between products of algebras. Algebra Universalis 79 (2018).
  • [13] Chang, C. C. Algebraic analysis of many valued logics. Transactions of the American Mathematical Society 88, 2 (1958), 467–490.
  • [14] Chang, C. C. A new proof of the completeness of the Lukasiewicz axioms. Transactions of the American Mathematical Society 93, 1 (1959), 74–80.
  • [15] Cignoli, R. Proper n-valued Lukasiewicz algebras as s-algebras of Lukasiewicz n-valued propositional calculi. Studia Logica 41, 1 (1982), 3–16.
  • [16] Cignoli, R. L. O., D’Ottaviano, I. M. L., and Mundici, D. Algebraic Foundations of Many-Valued Reasoning. Springer, 2000.
  • [17] Clark, D. M., and Davey, B. A. Natural Dualities for the Working Algebraist. Cambridge studies in advanced mathematics, vol. 57. Cambridge University Press, 1998.
  • [18] Cornish, W. H. Antimorphic Action: Categories of Algebraic Structures with Involutions or Anti-endomorphisms. Research and Exposition in Mathematics, vol. 12. Heldermann, 1986.
  • [19] Davey, B. A., and Gair, A. Restricted Priestley dualities and discriminator varieties. Studia Logica 105 (2017), 843–872.
  • [20] Davey, B. A., Haviar, M., and Priestley, H. A. Bohr compactifications of algebras and structures. Applied Categorical Structures 25 (2017), 403–430.
  • [21] Davey, B. A., and Priestley, H. A. Canonical extensions and discrete dualities for finitely generated varieties of lattice-based algebras. Studia Logica 100 (2012), 137–161.
  • [22] Davey, B. A., Schumann, V., and Werner, H. From the subalgebras of the square to the discriminator. Algebra Universalis 28 (1991), 500–519.
  • [23] Esakia, L. Topological Kripke models. Soviet Mathematics Doklady 15, 1 (1974), 147–151.
  • [24] Foster, A. L. Generalized ”Boolean” theory of universal algebras. Part I. Mathematische Zeitschrift 58 (1953), 306–336.
  • [25] Foster, A. L. Generalized ”Boolean” theory of universal algebras. Part II. Identities and subdirect sums of functionally complete algebras. Mathematische Zeitschrift 59 (1953/54), 191–199.
  • [26] Foster, A. L. Semi-primal algebras; Characterization and normal-decomposition. Mathematische Zeitschrift 99 (1967), 105–116.
  • [27] Foster, A. L. Automorphisms and functional completeness in universal algebras. Mathematische Annalen 180 (1969), 138–169.
  • [28] Foster, A. L. Congruence relations and functional completeness in universal algebras. Structure theory of hemi-primals, I. Mathematische Zeitschrift 113 (1970), 293–308.
  • [29] Foster, A. L., and Pixley, A. F. Semi-categorical algebras. I. Semi-primal algebras. Mathematische Zeitschrift 83 (1964), 147–169.
  • [30] Foster, A. L., and Pixley, A. F. Semi-categorical algebras. II. Mathematische Zeitschrift 85 (1964), 169–184.
  • [31] Galatos, N., and Jipsen, P. Residuated lattices of size up to 6, 2017. https://math.chapman.edu/ jipsen/finitestructures/rlattices/RLlist3.pdf.
  • [32] Galatos, N., Jipsen, P., Kowalski, T., and Ono, H. Residuated Lattices: an algebraic glimpse at substructural logics. Elsevier, 2007.
  • [33] Gehrke, M., and Jónsson, B. Bounded distributive lattice expansions. Mathematica Scandinavica 94, 1 (2004), 13–45.
  • [34] Goguen, J. A. L-fuzzy sets. Journal of Mathematical Analysis and Applications 18, 1 (1967), 145–174.
  • [35] Goguen, J. A. Concept representation in natural and artificial languages: Axioms, extensions and applications for fuzzy sets. International Journal of Man-Machine Studies 6, 5 (1974), 513–561.
  • [36] Hu, T.-K. Stone duality for primal algebra theory. Mathematische Zeitschrift 110 (1969), 180–198.
  • [37] Hu, T.-K. On the topological duality for primal algebra theory. Algebra Universalis 1 (1971), 152–154.
  • [38] Hyland, M., and Power, J. The category theoretic understanding of universal algebra: Lawvere theories and monads. Electronic Notes in Theoretical Computer Science 172 (2007), 437–458.
  • [39] Jipsen, P., and Tsinakis, C. A survey of residuated lattices. In Ordered Algebraic Structures: Proceedings of the Gainesville Conference Sponsored by the University of Florida 28th February — 3rd March, 2001, J. Martínez, Ed. Springer US, Boston, 2002, pp. 19–56.
  • [40] Johnstone, P. T. Stone spaces. Cambridge University Press, 1982.
  • [41] Kaarli, K., and Pixley, A. F. Polynomial completeness in algebraic systems. Chapman and Hall/CRC, 2001.
  • [42] Keimel, K., and Werner, H. Stone duality for varieties generated by quasi-primal algebras. Memoirs of the American Mathematical Society 148 (1974), 59–85.
  • [43] Kowalski, T. Semisimplicity, edpc and discriminator varieties of residuated lattices. Studia Logica 77 (2004), 255–265.
  • [44] Maruyama, Y. Natural duality, modality, and coalgebra. Journal of Pure and Applied Algebra 216, 3 (2012), 565–580.
  • [45] McKenzie, R. An algebraic version of categorical equivalence for varieties and more general algebraic categories. In Ursini, A. and Agliano, P. Logic and Algebra. Marcel Dekker, Inc, New York, 1996, pp. 211–243.
  • [46] Moore, H. G., and Yaqub, A. An existence theorem for semi-primal algebras. Annali della Scuola Normale Superiore di Pisa 22, 4 (1968), 559–570.
  • [47] Moraschini, T., Raftery, J. G., and Wannenburg, J. J. Varieties of De Morgan monoids: Minimality and irreducible algebras. Journal of Pure and Applied Algebra 223, 7 (2019), 2780–2803.
  • [48] Murskiĭ, V. L. The existence of a finite basis of identities, and other properties of “almost all” finite algebras. Problemy Kibernet, 30 (1975), 43–56.
  • [49] Niederkorn, P. Natural dualities for varieties of MV-algebras, I. Journal of Mathematical Analysis and Applications, 255 (2001), 58–73.
  • [50] nLab authors. topological concrete category. https://ncatlab.org/nlab/show/topological%20concrete%20category, Nov. 2022. Revision 38.
  • [51] Pixley, A. F. The ternary discriminator function in universal algebra. Mathematische Annalen 191 (1971), 167–180.
  • [52] Porst, H.-E. Hu’s primal algebra theorem revisited. Commentationes Mathematicae Universitatis Carolinae 41, 4 (2000), 855–859.
  • [53] Priestley, H. A. Representation of distributive lattices by means of ordered Stone spaces. Bulletin of the London Mathematical Society 2, 2 (1970), 186–190.
  • [54] Quackenbush, R. W. Demi-semi-primal algebras and Mal’cev-type conditions. Mathematische Zeitschrift 122 (1971), 166–176.
  • [55] Quackenbush, R. W. Appendix 5: Primality: the influence of Boolean algebras in universal algebra. In Grätzer, G. Universal Algebra. Second Edition. Springer, New York, 1979, pp. 401–416.
  • [56] Ribes, L., and Zalesskii, P. Profinite Groups. Second Edition. Springer, 2010.
  • [57] Stone, M. H. The theory of representation for Boolean algebras. Transactions of the American Mathematical Society 40, 1 (1936), 37–111.
  • [58] Walker, C. Categories of fuzzy sets. Soft Computing 8 (2004), 299–304.
  • [59] Werner, H. Discriminator Algebras. Studien zur Algebra und ihre Anwendungen, vol. 6. Akademie Verlag, 1978.