An Adjunction Between Boolean Algebras and a Subcategory of Stone Algebras
Abstract
We consider Stone algebras with a distinguished element satisfying the identity for all elements of the algebra. We provide an adjunction between the category of such algebras and that of Boolean algebras.
1 Introduction
The algebra of contracts [1, 2] has been an object of attention in computer science and engineering due to its capability to support compositional design. Given a Boolean algebra , its contract algebra has elements such that . is a Stone algebra with operations , , and . The top and bottom elements of this algebra are, respectively, and . This note introduces a subcategory of Stone algebras with the property that the contract functor is the left adjoint of the functor that maps these algebras to their closures.
2 Augmented Stone Algebras
First we recall the definition of Stone algebras. Then we introduce the concept of an augmented Stone algebra.
Definition 2.1.
A Stone algebra is a Heyting algebra satisfying for all , where and is the closure of : . We say that is closed if . We say is dense if .
Definition 2.2.
We say is an augmented Stone algebra if is a Stone algebra and , called the closure element, satisfies for all .
Notation 2.3.
Let be the category of Boolean algebras, and that of augmented Stone algebras. We define as the functor that maps an extended Stone algebra to its Boolean algebra of closed elements.
Example 2.4.
Any Boolean algebra is an augmented Stone algebra with . is an augmented Stone algebra with .
Let us prove some elementary facts about augmented Stone algebras.
Proposition 2.5.
Let be an augmented Stone algebra.
-
(i)
.
-
(ii)
The closure element is unique.
-
(iii)
is dense for all .
-
(iv)
If is closed, .
Proof.
-
(i)
.
-
(ii)
Suppose and are closure elements. Then , whence . By the same reasoning, , and so .
-
(iii)
.
-
(iv)
For , we have .∎
Proposition 2.6.
is a functor .
3 An adjunction between and
Let and . For , we let and , and for , we let .
Proposition 3.1.
Let . The assignment
is a set morphism .
Proof.
Let and , where and .
-
•
.
-
•
.
-
•
.
-
•
-
•
Since , we have . Thus,The last equality follows from the fact that . We conclude that
(1) By applying an analogous procedure, we obtain
Conjoining this expression with (1) yields
-
•
The last equality follows from the fact that . We have
which holds because . We finally obtain
Proposition 3.2.
Let . The assignment
is a set morphism . Moreover, and are inverses.
Proof.
Let and set . We have . Now we study the Boolean operations: . . . Regarding the second part, let . We have and . ∎
Corollary 3.3.
is fully faithful.
Proof.
Let be a Boolean algebra. The maps and form an isomorphism in . Therefore,
where the second isomorphism follows from Proposition 3.2. ∎
Theorem 3.4.
is the left adjoint of .
Proof.
Funding details
This work was supported by NSF and ASEE through an eFellows postdoctoral fellowship.
References
- [1] Benveniste, A., Caillaud, B., Nickovic, D., Passerone, R., Raclet, J.-B., Reinkemeier, P., Sangiovanni-Vincentelli, A., Damm, W., Henzinger, T. A., and Larsen, K. G. Contracts for system design. Foundations and Trends in Electronic Design Automation 12, 2-3 (2018), 124–400.
- [2] Incer, I. The Algebra of Contracts. PhD thesis, EECS Department, University of California, Berkeley, May 2022.