Bitopological Duality for Distributive Lattices and Heyting Algebras
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Topological Duality and Lattice Expansions Part I: a Topological Construction of Canonical Extensions
TOPOLOGICAL DUALITY AND LATTICE EXPANSIONS PART I: A TOPOLOGICAL CONSTRUCTION OF CANONICAL EXTENSIONS M. ANDREW MOSHIER AND PETER JIPSEN 1. INTRODUCTION The two main objectives of this paper are (a) to prove topological duality theorems for semilattices and bounded lattices, and (b) to show that the topological duality from (a) provides a construction of canonical extensions of bounded lattices. The paper is first of two parts. The main objective of the sequel is to establish a characterization of lattice expansions, i.e., lattices with additional operations, in the topological setting built in this paper. Regarding objective (a), consider the following simple question: Is there a subcategory of Top that is dually equivalent to Lat? Here, Top is the category of topological spaces and continuous maps and Lat is the category of bounded lattices and lattice homomorphisms. To date, the question has been answered positively either by specializing Lat or by generalizing Top. The earliest examples are of the former sort. Tarski [Tar29] (treated in English, e.g., in [BD74]) showed that every complete atomic Boolean lattice is represented by a powerset. Taking some historical license, we can say this result shows that the category of complete atomic Boolean lattices with complete lat- tice homomorphisms is dually equivalent to the category of discrete topological spaces. Birkhoff [Bir37] showed that every finite distributive lattice is represented by the lower sets of a finite partial order. Again, we can now say that this shows that the category of finite distributive lattices is dually equivalent to the category of finite T0 spaces and con- tinuous maps. -
Bitopological Duality for Distributive Lattices and Heyting Algebras
BITOPOLOGICAL DUALITY FOR DISTRIBUTIVE LATTICES AND HEYTING ALGEBRAS GURAM BEZHANISHVILI, NICK BEZHANISHVILI, DAVID GABELAIA, ALEXANDER KURZ Abstract. We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopolog- ical duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study of distributive lattices. We also give new bitopo- logical and spectral dualities for Heyting algebras, thus providing two new alternatives to Esakia’s duality. 1. Introduction It is widely considered that the beginning of duality theory was Stone’s groundbreaking work in the mid 30s on the dual equivalence of the category Bool of Boolean algebras and Boolean algebra homomorphism and the category Stone of compact Hausdorff zero- dimensional spaces, which became known as Stone spaces, and continuous functions. In 1937 Stone [33] extended this to the dual equivalence of the category DLat of bounded distributive lattices and bounded lattice homomorphisms and the category Spec of what later became known as spectral spaces and spectral maps. Spectral spaces provide a generalization of Stone 1 spaces. Unlike Stone spaces, spectral spaces are not Hausdorff (not even T1) , and as a result, are more difficult to work with. -
3 Lecture 3: Spectral Spaces and Constructible Sets
3 Lecture 3: Spectral spaces and constructible sets 3.1 Introduction We want to analyze quasi-compactness properties of the valuation spectrum of a commutative ring, and to do so a digression on constructible sets is needed, especially to define the notion of constructibility in the absence of noetherian hypotheses. (This is crucial, since perfectoid spaces will not satisfy any kind of noetherian condition in general.) The reason that this generality is introduced in [EGA] is for the purpose of proving openness and closedness results on the locus of fibers satisfying reasonable properties, without imposing noetherian assumptions on the base. One first proves constructibility results on the base, often by deducing it from constructibility on the source and applying Chevalley’s theorem on images of constructible sets (which is valid for finitely presented morphisms), and then uses specialization criteria for constructible sets to be open. For our purposes, the role of constructibility will be quite different, resting on the interesting “constructible topology” that is introduced in [EGA, IV1, 1.9.11, 1.9.12] but not actually used later in [EGA]. This lecture is organized as follows. We first deal with the constructible topology on topological spaces. We discuss useful characterizations of constructibility in the case of spectral spaces, aiming for a criterion of Hochster (see Theorem 3.3.9) which will be our tool to show that Spv(A) is spectral, our ultimate goal. Notational convention. From now on, we shall write everywhere (except in some definitions) “qc” for “quasi-compact”, “qs” for “quasi-separated”, and “qcqs” for “quasi-compact and quasi-separated”. -
Distributive Envelopes and Topological Duality for Lattices Via Canonical Extensions
DISTRIBUTIVE ENVELOPES AND TOPOLOGICAL DUALITY FOR LATTICES VIA CANONICAL EXTENSIONS MAI GEHRKE AND SAM VAN GOOL Abstract. We establish a topological duality for bounded lattices. The two main features of our duality are that it generalizes Stone duality for bounded distributive lattices, and that the morphisms on either side are not the stan- dard ones. A positive consequence of the choice of morphisms is that those on the topological side are functional. In the course of the paper, we obtain the following results: (1) canoni- cal extensions of bounded lattices are the algebraic versions of the existing dualities for bounded lattices by Urquhart and Hartung, (2) there is a univer- sal construction which associates to an arbitrary lattice two distributive lattice envelopes with an adjoint pair between them, and (3) we give a topological du- ality for bounded lattices which generalizes Priestley duality and which shows precisely which maps between bounded lattices admit functional duals. For the result in (1), we rely on previous work of Gehrke, J´onssonand Harding. For the universal construction in (2), we modify a construction of the injective hull of a semilattice by Bruns and Lakser, adjusting their concept of `admis- sibility' to the finitary case. For (3), we use Priestley duality for distributive lattices and our universal characterization of the distributive envelopes. 1. Introduction Topological duality for Boolean algebras [22] and distributive lattices [23] is a useful tool for studying relational semantics for propositional logics. Canonical extensions [16, 17, 11, 10] provide a way of looking at these semantics algebraically. In the absence of a satisfactory topological duality, canonical extensions have been used [3] to treat relational semantics for substructural logics. -
New York Journal of Mathematics Suprema in Spectral Spaces and The
New York Journal of Mathematics New York J. Math. 26 (2020) 1064{1092. Suprema in spectral spaces and the constructible closure Carmelo Antonio Finocchiaro and Dario Spirito Abstract. Given an arbitrary spectral space X, we endow it with its specialization order ≤ and we study the interplay between suprema of subsets of (X; ≤) and the constructible topology. More precisely, we examine when the supremum of a set Y ⊆ X exists and belongs to the constructible closure of Y . We apply such results to algebraic lattices of sets and to closure operations on them, proving density properties of some distinguished spaces of rings and ideals. Furthermore, we pro- vide topological characterizations of some class of domains in terms of topological properties of their ideals. Contents 1. Introduction 1064 2. Preliminaries 1066 3. Suprema of subsets and the constructible closure 1068 4. Algebraic lattices of sets 1073 5. Spaces of modules and ideals 1079 6. Overrings of an integral domain 1084 References 1090 1. Introduction A topological space X is said to be a spectral space if it is homeomorphic to the spectrum of a (commutative, unitary) ring, endowed with the Zariski topology; as shown by Hochster [17], being a spectral space is a topologi- cal condition, in the sense that it is possible to define spectral spaces ex- clusively through topological properties, without mentioning any algebraic notion. His proof relies heavily on the passage from the starting topology to a new topology, the patch or constructible topology (see Section 2.1), which remains spectral but becomes Hausdorff; this topology has recently been interpreted as the topology of ultrafilter limit points with respect to the Received September 27, 2019. -
PROFINITE TOPOLOGICAL SPACES 1. Introduction
Theory and Applications of Categories, Vol. 30, No. 53, 2015, pp. 1841{1863. PROFINITE TOPOLOGICAL SPACES G. BEZHANISHVILI, D. GABELAIA, M. JIBLADZE, P. J. MORANDI Abstract. It is well known [Hoc69, Joy71] that profinite T0-spaces are exactly the spectral spaces. We generalize this result to the category of all topological spaces by showing that the following conditions are equivalent: (1)( X; τ) is a profinite topological space. (2) The T0-reflection of (X; τ) is a profinite T0-space. (3)( X; τ) is a quasi spectral space (in the sense of [BMM08]). (4)( X; τ) admits a stronger Stone topology π such that (X; τ; π) is a bitopological quasi spectral space (see Definition 6.1). 1. Introduction A topological space is profinite if it is (homeomorphic to) the inverse limit of an inverse system of finite topological spaces. It is well known [Hoc69, Joy71] that profinite T0- spaces are exactly the spectral spaces. This can be seen as follows. A direct calculation shows that the inverse limit of an inverse system of finite T0-spaces is spectral. Con- versely, by [Cor75], the category Spec of spectral spaces and spectral maps is isomorphic to the category Pries of Priestley spaces and continuous order preserving maps. This isomorphism is a restriction of a more general isomorphism between the category StKSp of stably compact spaces and proper maps and the category Nach of Nachbin spaces and continuous order preserving maps [GHKLMS03]. Priestley spaces are exactly the profinite objects in Nach, and the proof of this fact is a straightforward generalization of the proof that Stone spaces are profinite objects in the category of compact Hausdorff spaces and continuous maps. -
Duality and Canonical Extensions for Stably Compact Spaces
Duality and canonical extensions for stably compact spaces∗ Sam van Gool† 6 September, 2011 Abstract We construct a canonical extension for strong proximity lattices in order to give an alge- braic, point-free description of a finitary duality for stably compact spaces. In this setting not only morphisms, but also objects may have distinct π- and σ-extensions. Introduction Strong proximity lattices were introduced, after groundwork of Michael Smyth [26], by Achim Jung and Philipp S¨underhauf [21], who showed that these structures are dual to stably compact spaces, which generalise spectral spaces and are relevant to domain theory in logical form (cf. for example [1] and [18]). The canonical extension, which first appeared in a paper by Bjarni J´onsson and Alfred Tarski [17], has proven to be a powerful method in the study of logics whose operations are based on lattices, such as classical modal logic ([17], [16]), distributive modal logic ([8], [9]), and also intuitionistic logic ([11]). Canonical extensions are interesting because they provide a formulaic, algebraic description of Stone-type dualities between algebras and topological spaces. In this paper, we re-examine the Jung-S¨underhauf duality [21] and put it in a broader perspective by connecting it with the theory of canonical extensions. We now briefly outline arXiv:1009.3410v2 [math.GN] 8 Oct 2011 the contents. Careful study of the duality in [21] led us to conclude that the axioms for strong proximity lattices were stronger than necessary. The advantage of assuming one axiom less, as we will do here, is that it will become more apparent how the inherent self-duality of stably compact spaces is reflected in the representing algebraic structures. -
Heyting Duality
Heyting Duality Vikraman Choudhury April, 2018 1 Heyting Duality Pairs of “equivalent” concepts or phenomena are ubiquitous in mathematics, and dualities relate such two different, even opposing concepts. Stone’s Representa- tion theorem (1936), due to Marshall Stone, states the duality between Boolean algebras and topological spaces. It shows that, for classical propositional logic, the Lindenbaum-Tarski algebra of a set of propositions is isomorphic to the clopen subsets of the set of its valuations, thereby exposing an algebraic viewpoint on logic. In this essay, we consider the case for intuitionistic propositional logic, that is, a duality result for Heyting algebras. It borrows heavily from an exposition of Stone and Heyting duality by van Schijndel and Landsman [2017]. 1.1 Preliminaries Definition (Lattice). A lattice is a poset which admits all finite meets and joins. Categorically, it is a (0, 1) − 푐푎푡푒푔표푟푦 (or a thin category) with all finite limits and finite colimits. Alternatively, a lattice is an algebraic structure in the signature (∧, ∨, 0, 1) that satisfies the following axioms. • ∧ and ∨ are each idempotent, commutative, and associative with respective identities 1 and 0. • the absorption laws, 푥 ∨ (푥 ∧ 푦) = 푥, and 푥 ∧ (푥 ∨ 푦) = 푥. Definition (Distributive lattice). A distributive lattice is a lattice in which ∧and ∨ distribute over each other, that is, the following distributivity axioms are satisfied. Categorically, this makes it a distributive category. 1 • 푥 ∨ (푦 ∧ 푧) = (푥 ∨ 푦) ∧ (푥 ∨ 푧) • 푥 ∧ (푦 ∨ 푧) = (푥 ∧ 푦) ∨ (푥 ∧ 푧) Definition (Complements in a lattice). A complement of an element 푥 of a lattice is an element 푦 such that, 푥 ∧ 푦 = 0 and 푥 ∨ 푦 = 1. -
Bitopological Duality for Distributive Lattices and Heyting Algebras Guram Bezhanishvili New Mexico State University
Chapman University Chapman University Digital Commons Engineering Faculty Articles and Research Fowler School of Engineering 2010 Bitopological Duality for Distributive Lattices and Heyting Algebras Guram Bezhanishvili New Mexico State University Nick Bezhanishvili University of Leicester David Gabelaia Razmadze Mathematical Institute Alexander Kurz Chapman University, [email protected] Follow this and additional works at: https://digitalcommons.chapman.edu/engineering_articles Part of the Algebra Commons, Logic and Foundations Commons, Other Computer Engineering Commons, Other Computer Sciences Commons, and the Other Mathematics Commons Recommended Citation G. Bezhanishvili, N. Bezhanishvili, D. Gabelaia, and A. Kurz, “Bitopological duality for distributive lattices and Heyting algebras,” Mathematical Structures in Computer Science, vol. 20, no. 03, pp. 359–393, Jun. 2010. DOI: 10.1017/S0960129509990302 This Article is brought to you for free and open access by the Fowler School of Engineering at Chapman University Digital Commons. It has been accepted for inclusion in Engineering Faculty Articles and Research by an authorized administrator of Chapman University Digital Commons. For more information, please contact [email protected]. Bitopological Duality for Distributive Lattices and Heyting Algebras Comments This is a pre-copy-editing, author-produced PDF of an article accepted for publication in Mathematical Structures in Computer Science, volume 20, number 3, in 2010 following peer review. The definitive publisher- authenticated -
Arxiv:1906.03640V1 [Math.GN]
THE FRAME OF NUCLEI OF AN ALEXANDROFF SPACE F. AVILA,´ G. BEZHANISHVILI, P. J. MORANDI, A. ZALD´IVAR Abstract. Let OS be the frame of open sets of a topological space S, and let N(OS) be the frame of nuclei of OS. For an Alexandroff space S, we prove that N(OS) is spatial iff the infinite binary tree T2 does not embed isomorphically into (S, ≤), where ≤ is the specialization preorder of S. 1. Introduction Nuclei play an important role in pointfree topology as they characterize homomorphic images of frames (or dually sublocales of locales). For a frame L, let N(L) be the frame of nuclei of L, also known as the assembly of L. The frame N(L) has been investigated by many authors; see, e.g., [7, 10, 16, 2, 17, 13, 12, 14, 11, 20, 15, 6, 3, 19, 4] (which are listed in chronological order). For example, Beazer and Macnab [2] gave a necessary and sufficient condition for N(L) to be boolean; Niefield and Rosenthal [14] gave necessary and sufficient conditions for N(L) to be spatial, and derived that if N(L) is spatial, then so is L; Simmons [17] proved that if L is the frame of opens of a T0-space S, then N(L) is boolean iff S is scattered; and Isbell [11] proved that if L is the frame of opens of a sober space S, then N(L) is spatial iff S is weakly scattered (see Section 2 for definitions). In [6] the study of N(L) using the spectrum of L was initiated. -
Lattice Duality: the Origin of Probability and Entropy
, 1 Lattice Duality: The Origin of Probability and Entropy Kevin H. Knuth NASA Ames Research Center, Mail Stop 269-3, Moffett Field CA 94035-1000, USA Abstract Bayesian probability theory is an inference calculus, which originates from a gen- eralization of inclusion on the Boolean lattice of logical assertions to a degree of inclusion represented by a real number. Dual to this lattice is the distributive lat- tice of questions constructed from the ordered set of down-sets of assertions, which forms the foundation of the calculus of inquiry-a generalization of information theory. In this paper we introduce this novel perspective on these spaces in which machine learning is performed and discuss the relationship between these results and several proposed generalizations of information theory in the literature. Key words: probability, entropy, lattice, information theory, Bayesian inference, inquiry PACS: 1 Introduction It has been known for some time that probability theory can be derived as a generalization of Boolean implication to degrees of implication repre- sented by real numbers [11,12]. Straightforward consistency requirements dic- tate the form of the sum and product rules of probability, and Bayes’ thee rem [11,12,47,46,20,34],which forms the basis of the inferential calculus, also known as inductive inference. However, in machine learning applications it is often times more useful to rely on information theory [45] in the design of an algorithm. On the surface, the connection between information theory and probability theory seems clear-information depends on entropy and entropy Email address: kevin.h. [email protected] (Kevin H. -
Spectral Sets
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF PURE AND APPLIED ALGEBRA ELSE&R Journal of Pure and Applied Algebra 94 (1994) lOlL114 Spectral sets H.A. Priestley Mathematical Institute, 24129 St. Giles, Oxford OXI 3LB, United Kingdom Communicated by P.T. Johnstone; received 17 September 1993; revised 13 April 1993 Abstract The purpose of this expository note is to draw together and to interrelate a variety of characterisations and examples of spectral sets (alias representable posets or profinite posets) from ring theory, lattice theory and domain theory. 1. Introduction Thanks to their threefold incarnation-in ring theory, in lattice theory and in computer science-the structures we wish to consider have been approached from a variety of perspectives, with rather little overlap. We shall seek to show how the results of these independent studies are related, and add some new results en route. We begin with the definitions which will allow us to present, as Theorem 1.1, the amalgam of known results which form the starting point for our later discussion. The theorem collects together ways of describing the prime spectra of commutative rings with identity or, equivalently, of distributive lattices with 0 and 1. A topology z on a set X is defined to be spectral (and (X; s) called a spectral space) if the following conditions hold: (i) ? is sober (that is, every non-empty irreducible closed set is the closure of a unique point), (ii) z is quasicompact, (iii) the quasicompact open sets form a basis for z, (iv) the family of quasicompact open subsets of X is closed under finite intersections.