Spectral Sets
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Categories and Types for Axiomatic Domain Theory Adam Eppendahl
Department of Computer Science Research Report No. RR-03-05 ISSN 1470-5559 December 2003 Categories and Types for Axiomatic Domain Theory Adam Eppendahl 1 Categories and Types for Axiomatic Domain Theory Adam Eppendahl Submitted for the degree of Doctor of Philosophy University of London 2003 2 3 Categories and Types for Axiomatic Domain Theory Adam Eppendahl Abstract Domain Theory provides a denotational semantics for programming languages and calculi con- taining fixed point combinators and other so-called paradoxical combinators. This dissertation presents results in the category theory and type theory of Axiomatic Domain Theory. Prompted by the adjunctions of Domain Theory, we extend Benton’s linear/nonlinear dual- sequent calculus to include recursive linear types and define a class of models by adding Freyd’s notion of algebraic compactness to the monoidal adjunctions that model Benton’s calculus. We observe that algebraic compactness is better behaved in the context of categories with structural actions than in the usual context of enriched categories. We establish a theory of structural algebraic compactness that allows us to describe our models without reference to en- richment. We develop a 2-categorical perspective on structural actions, including a presentation of monoidal categories that leads directly to Kelly’s reduced coherence conditions. We observe that Benton’s adjoint type constructors can be treated individually, semantically as well as syntactically, using free representations of distributors. We type various of fixed point combinators using recursive types and function types, which we consider the core types of such calculi, together with the adjoint types. We use the idioms of these typings, which include oblique function spaces, to give a translation of the core of Levy’s Call-By-Push-Value. -
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”. -
Topology, Domain Theory and Theoretical Computer Science
Draft URL httpwwwmathtulaneedumwmtopandcspsgz pages Top ology Domain Theory and Theoretical Computer Science Michael W Mislove Department of Mathematics Tulane University New Orleans LA Abstract In this pap er we survey the use of ordertheoretic top ology in theoretical computer science with an emphasis on applications of domain theory Our fo cus is on the uses of ordertheoretic top ology in programming language semantics and on problems of p otential interest to top ologists that stem from concerns that semantics generates Keywords Domain theory Scott top ology p ower domains untyp ed lamb da calculus Subject Classication BFBNQ Intro duction Top ology has proved to b e an essential to ol for certain asp ects of theoretical computer science Conversely the problems that arise in the computational setting have provided new and interesting stimuli for top ology These prob lems also have increased the interaction b etween top ology and related areas of mathematics such as order theory and top ological algebra In this pap er we outline some of these interactions b etween top ology and theoretical computer science fo cusing on those asp ects that have b een most useful to one particular area of theoretical computation denotational semantics This pap er b egan with the goal of highlighting how the interaction of order and top ology plays a fundamental role in programming semantics and related areas It also started with the viewp oint that there are many purely top o logical notions that are useful in theoretical computer science that -
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. -
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 alge- braic concepts important for the study of distributive lattices. We also give new bitopological and spectral dualities for Heyting algebras, co-Heyting algebras, and bi-Heyting algebras, thus providing two new alternatives of Esakia’s duality. 1. Introduction It is widely considered that the beginning of duality theory was Stone’s groundbreaking work in the mid 30ies 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 [28] 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. -
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. -
Spectral Spaces Versus Distributive Lattices: a Dictionary
Spectral spaces versus distributive lattices: a dictionary Henri Lombardi (∗) March 17, 2020 Abstract The category of distributive lattices is, in classical mathematics, antiequivalent to the category of spectral spaces. We give here some examples and a short dictionary for this antiequivalence. We propose a translation of several abstract theorems (in classical math- ematics) into constructive ones, even in the case where points of a spectral space have no clear constructive content. Contents Introduction 2 1 Distributive lattices and spectral spaces: some general facts2 1.1 The seminal paper by Stone..............................2 1.2 Distributive lattices and entailment relations.....................6 2 Spectral spaces in algebra6 2.1 Dynamical algebraic structures, distributive lattices and spectra..........6 2.2 A very simple case...................................8 2.3 The real spectrum of a commutative ring.......................9 2.4 Linear spectrum of a lattice-group.......................... 10 2.5 Valuative spectrum of a commutative ring...................... 11 2.6 Heitmann lattice and J-spectrum of a commutative ring.............. 11 3 A short dictionary 12 3.1 Properties of morphisms................................ 12 3.2 Dimension properties.................................. 15 3.3 Properties of spaces.................................. 16 4 Some examples 16 4.1 Relative dimension, lying over, going up, going down................ 17 4.2 Kronecker, Forster-Swan, Serre and Bass Theorems................. 18 4.3 Other results concerning Krull dimension...................... 19 ∗Laboratoire de Mathématiques de Besançon, Université de Franche-Comté. http://hlombardi.free.fr/ email: [email protected]. 1 2 1 Distributive lattices and spectral spaces: some general facts Introduction This paper is written in Bishop’s style of constructive mathematics ([3,4,6, 20, 21]). -
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. -
Domain Theory: an Introduction
Domain Theory: An Introduction Robert Cartwright Rebecca Parsons Rice University This monograph is an unauthorized revision of “Lectures On A Mathematical Theory of Computation” by Dana Scott [3]. Scott’s monograph uses a formulation of domains called neighborhood systems in which finite elements are selected subsets of a master set of objects called “tokens”. Since tokens have little intuitive significance, Scott has discarded neighborhood systems in favor of an equivalent formulation of domains called information systems [4]. Unfortunately, he has not rewritten his monograph to reflect this change. We have rewritten Scott’s monograph in terms of finitary bases (see Cartwright [2]) instead of information systems. A finitary basis is an information system that is closed under least upper bounds on finite consistent subsets. This convention ensures that every finite answer is represented by a single basis object instead of a set of objects. 1 The Rudiments of Domain Theory Motivation Programs perform computations by repeatedly applying primitive operations to data values. The set of primitive operations and data values depends on the particular programming language. Nearly all languages support a rich collection of data values including atomic objects, such as booleans, integers, characters, and floating point numbers, and composite objects, such as arrays, records, sequences, tuples, and infinite streams. More advanced languages also support functions and procedures as data values. To define the meaning of programs in a given language, we must first define the building blocks—the primitive data values and operations—from which computations in the language are constructed. Domain theory is a comprehensive mathematical framework for defining the data values and primitive operations of a programming language.