DOCSLIB.ORG

Topology and Stone Duality for Domains

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Topology and Stone Duality for Domains Topology and Stone Duality for Domains Uday S. Reddy May 8, 1995 1 Topology in a nutshell The basic ideas of topology are contained in the two definitions below. Definition 1 A(topological) space X = hX; ΩX i is a pair consisting of a set X (of points x; y; z) and a collection ΩX of subsets of X (open sets u; v; w) such that ΩX is closed under arbitrary union and finite intersection. S If s is a family of open sets, s is an open set. In particular, ? is an open set. If u1; : : : ; un is a family of open sets then u1 \···\ un is an open set. In particular, X is an open set. We use the terminology \u is a neighborhood of x" when u is an open set containing a point x. Definition 2 If X and Y are topological spaces, a function f : X ! Y is said to be continuous at x 2 X if, for every neighborhood v of f(x), there exists a neighborhood u of x such that f(u) ⊆ v. (By f(u), we mean the set f f(x): x 2 u g.) A continuous function is a function that is continuous at every x 2 X. Topological spaces and continuous functions form a category Top. For theoretical purposes however, it is often simpler to use the following criterion for continuous functions: Theorem 3 A function f : X ! Y is continuous iff, for every open set −1 v 2 ΩY , the inverse image f (v) is an open set in ΩX . Proof: \If:" If f −1(v) is an open set, take the requisite witness u to be f −1(v). \Only if:" For every x 2 f −1(v), f(x) 2 v. By definition, there exists a neighborhood ux of x (an open set) such that f(ux) ⊆ v. By generalization, S −1 x2f −1(v) ux is an open set whose direct image is included in v. So f (v) = S −1 x2f −1(v) ux, and we have that f (v) is an open set. From here on, we take this to be our working definition of continuous functions. 1 The main motivating example for topological spaces is the real line. Let R denote the set of real numbers. The \standard" topology on R consists of open sets that are unions of open intervals (a; b). Evidently, any union of open sets is an open set. The entire set R is an open set because it S is, for instance, the union x2R(x − , x + ) for some positive number . The intersection of open sets is an open set because the intersection of open intervals is an open interval. The definition of R as an open set suggests an equivalent criterion for open sets in the standard topology. A subset u is open iff, for every x 2 u, there exists an open interval (a; b) ⊆ u such that x 2 (a; b). This leads to the usual notion of a continuous function on the real line familiar from calculus: a function f : R ! R is continuous at x, iff, for every neighborhood v = (f(x)−, f(x)+) of f(x), there exists a neighborhood u = (x−δ; x+δ) such that f(u) ⊆ v. Definition 4 A basis for a space X is a family of subsets σ such that a subset u ⊆ X is open iff it is expressible as S s for some s ⊆ σ. The elements of σ are called \basic" open sets (relative to σ). For the real line, the set of open intervals (a; b) forms a basis. For that matter, the set of rational open intervals (a; b) forms a basis too. The definition of continuity can now be refined. A function f : X ! Y is continuous if, for every basic open set v of Y , f −1(v) is an open set in X. The example of real line gives a \geometric" intuition to the subject of topology. For our purposes, it is also useful to keep in mind a \logical" intuition. Regard the open sets as (perhaps finitary) pieces of information about their constituents. For instance, the open interval (x − δ; x + δ) says that each of its elements is within δ distance from x. Union of open sets then corresponds to infinitary disjunction of information. The empty set denotes the \impossibility." Intersection corresponds to finitary conjunc- tion of information. Continuity of functions says that each (finitary) piece of information about f(x) can be obtained from some (finitary) piece of information about x. These are, indeed, the basic intuitions underlying domain-theoretic semantics for programming languages. 2 Domains as topologies Consider Scott domains (bounded-complete algebraic cpo's). We write D0 for the set of finite elements (compact elements) of D. Every x 2 D can be written as x = F(#x) where #x is the downward-closure f y : y v x g. Since D is algebraic, we can in fact write x = F(#0x) where #0x = (#x) \ D0. We have x v y iff #0fxg ⊆ #0fyg. A Scott-continuous function f : D ! E preserves directed sups. There is an equivalent criterion: 2 Theorem 5 A function f : D ! E is Scott-continuous iff, whenever y0 v f(x) is a finite element, there exists a finite approximation x0 v x such that y0 v f(x0). Proof: \Only if:" Suppose y0 v f(x) is a finite element. Consider the 0 F F directed set d = # x. Since x = d, we have f(x) = f(d). But y0 is a finite element, so it is bounded by an element in f(d), say f(x0) where x0 2 d. We have that y0 v f(x0), x0 a finite approximation of x. \If:" Suppose d ⊆ D0 is a directed set with Fd = x. Without loss of generality, assume that d is down-closed. Then, for every finite y0 v f(x), F we have y0 v f(x0) v f(d) (where x0 is an appropriate finite element in d). This shows f(x) v Ff(d). The reverse inclusion Ff(d) v f(x) follows by monotinicity. Hence, f(x) = Ff(d). If x is a finite element, there is no reason for f(x) to be a finite element. But, if f(x) is finite, then all its information is already contained in f(x0) for some finite approximation x0 v x. Let us restate the criterion of the theorem in terms of upper sets. \y0 v f(x)" is equivalent to f(x) 2 "fy0g, and \x0 v x" is equivalent to x 2 "fx0g. So, f continuous means that whenever f(x) is in a compact upper set "fy0g, there exists a compact upper set "fx0g containing x such that f("fx0g) ⊆ "fy0g. Thus, we may regard compact compact upper sets "fx0g and unions thereof, as open sets. Definition 6 If D is a Scott domain, a Scott-open set in D is an upper set "a of a subset a ⊆ D0. The collection of Scott-open sets forms a topology on D, called the Scott topology. To see that this is a topology, note that the union of upper sets Ss is an upper set and the minimal elements are still finite. The intersection of upper sets "a \"b is "f x t y : x 2 a; y 2 b g if x t y exists and ? otherwise. Corollary 7 A function f : D ! E between Scott domains is Scott- continuous iff it is (topologically) continuous with D and E regarded as Scott topologies. We may now import geometric as well as logical intuitions to Scott domains. Geometrically speaking, we regard every Scott-open set "a as a neighborhood for every element x 2 "a. A \smaller" neighborhood "b of x satisfies the \upper" order a vU b () 8y0 2 b: 9x0 2 a: x0 v y0, i.e., every point of b is above some point of a. Continuity says that we can get arbitrarily close to f(x) by getting arbitrarily close to x. Logically speaking, the finite elements of D represent finitary pieces of information about the elements of D. The finite element ?D says \nothing" ("f?Dg = D) while x0 t y0 gives the conjunction of information given by x0 and y0 ("fx0 t y0g = "fx0g \ "fy0g). If there is no upper bound for x0 and 3 y0, then their information is \inconsistent" together, i.e., "fx0g \ "fy0g = S ?. Disjunction of information is given by union ("a = x2a "fxg). All this is certainly implicit in our usual understanding of Scott domains. The topological formulation makes it explicit. We will introduce a bit of notation. If u and v have a non-empty intersection, we write u ^_ v to mean that they are consistent. If the intersection is empty, we write u ^ v. (They are inconsistent.) If they are allowed to be equal as well as be inconsistent, we write u _^ v. 3 Topological notions The basic concept of a topological space is much too general (in the same vein as the notion of cpo being too general). A variety of \separation axioms" are often used to characterize the spaces of interest. A Hausdorff space or T2-space is defined by the axiom: whenever x and y are distinct points, there exist disjoint neighborhoods u and v for the two points respectively. One writes x 6= y =) 9u; v 2 ΩX : u ^ v ^ x 2 u ^ y 2 v or _ [8u; v 2 ΩX : x 2 u ^ y 2 v =) u ^ v] =) x = y So, in a Hausdorff space, all points are \independent" and do not impinge on each other.
Load more

Recommended publications
  • Scott Spaces and the Dcpo Category
    SCOTT SPACES AND THE DCPO CATEGORY JORDAN BROWN Abstract. Directed-complete partial orders (dcpo’s) arise often in the study of λ-calculus. Here we investigate certain properties of dcpo’s and the Scott spaces they induce. We introduce a new construction which allows for the canonical extension of a partial order to a dcpo and give a proof that the dcpo introduced by Zhao, Xi, and Chen is well-filtered. Contents 1. Introduction 1 2. General Definitions and the Finite Case 2 3. Connectedness of Scott Spaces 5 4. The Categorical Structure of DCPO 6 5. Suprema and the Waybelow Relation 7 6. Hofmann-Mislove Theorem 9 7. Ordinal-Based DCPOs 11 8. Acknowledgments 13 References 13 1. Introduction Directed-complete partially ordered sets (dcpo’s) often arise in the study of λ-calculus. Namely, they are often used to construct models for λ theories. There are several versions of the λ-calculus, all of which attempt to describe the ‘computable’ functions. The first robust descriptions of λ-calculus appeared around the same time as the definition of Turing machines, and Turing’s paper introducing computing machines includes a proof that his computable functions are precisely the λ-definable ones [5] [8]. Though we do not address the λ-calculus directly here, an exposition of certain λ theories and the construction of Scott space models for them can be found in [1]. In these models, computable functions correspond to continuous functions with respect to the Scott topology. It is thus with an eye to the application of topological tools in the study of computability that we investigate the Scott topology.
    [Show full text]
  • 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.
    [Show full text]
  • T0 Topological Spaces and T0 Posets in the Topos of M-Sets
    Theory and Applications of Categories, Vol. 33, No. 34, 2018, pp. 1059{1071. T0 TOPOLOGICAL SPACES AND T0 POSETS IN THE TOPOS OF M-SETS M.M. EBRAHIMI, M. MAHMOUDI, AND A.H. NEJAH Abstract. In this paper, we introduce the concept of a topological space in the topos M-Set of M-sets, for a monoid M. We do this by replacing the notion of open \subset" by open \subobject" in the definition of a topology. We prove that the resulting category has an open subobject classifier, which is the counterpart of the Sierpinski space in this topos. We also study the relation between the given notion of topology and the notion of a poset in this universe. In fact, the counterpart of the specialization pre-order is given for topological spaces in M-Set, and it is shown that, similar to the classic case, for a special kind of topological spaces in M-Set, namely T0 ones, it is a partial order. Furthermore, we obtain the universal T0 space, and give the adjunction between topological spaces and T0 posets, in M-Set. 1. Introduction Topoi are categories which behave like the category Set, of sets and functions between them. Naturally one tries to reconstruct the classical mathematics in such categories. The difference between classical mathematics and topos base mathematics is that the latter is in some sense constructive. In fact, the internal logic of a topos is intuitionistic, and so topoi provide a convenient set up for constructive mathematics. One of the most important features of constructive mathematics is in computer science and semantic of programing languages.
    [Show full text]
  • Z-Continuous Posets
    DISCRETE MATHEMATICS ELSEVIERI Discrete Mathematics 152 (1996) 33-45 Z-continuous posets Andrei Baranga Department ofMathematics, University ofBucharest, Str. Academiei 14, 70109, Bucharest, Romania Received 19 July 1994 Abstract The concept of 'subset system on the category Po of posets (Z-sets) was defined by Wright, Wagner and Thatcher in 1978. The term Z-set becomes meaningful if we replace Z by 'directed', 'chain', 'finite'. At the end of the paper (Wright et al. 1978), the authors suggested an attempt to study the generalized counterpart of the term 'continuous poset (lattice)' obtained by replacing directed sets by Z-sets, Z being an arbitary subset system on Po. We present here some results concerning this investigation. These results are generalized counterparts of some purely order theoretical facts about continuous posets. Keywords: Poset; Subset system; Z-set; Continuous poset; Continuous lattice; Algebraic poset; Algebraic lattice; Moore family; Closure operator; Ideal; Z-inductive poset Introduction The concept of 'subset system on the category Po of posets' (Z-sets) was defined by Wright et al. in [12]. The term Z-set becomes meaningful if we replace Z by 'directed', 'chain', 'finite', etc. On the other hand, the concept of continuous lattice was defined by Scott in [9] in a topological manner as a mathematical tool in computation theory (see [10, 11]) although it has appeared in other fields of mathematics as well, such as general topology, analysis, algebra, category theory, logic and topological algebra (see [4]), This concept was defined later in purely order theoretical terms (see [8]) and now this definition has became the one used in almost all references.
    [Show full text]
  • Arxiv:1508.05446V2 [Math.CO] 27 Sep 2018 02,5B5 16E10
    CELL COMPLEXES, POSET TOPOLOGY AND THE REPRESENTATION THEORY OF ALGEBRAS ARISING IN ALGEBRAIC COMBINATORICS AND DISCRETE GEOMETRY STUART MARGOLIS, FRANCO SALIOLA, AND BENJAMIN STEINBERG Abstract. In recent years it has been noted that a number of combi- natorial structures such as real and complex hyperplane arrangements, interval greedoids, matroids and oriented matroids have the structure of a finite monoid called a left regular band. Random walks on the monoid model a number of interesting Markov chains such as the Tsetlin library and riffle shuffle. The representation theory of left regular bands then comes into play and has had a major influence on both the combinatorics and the probability theory associated to such structures. In a recent pa- per, the authors established a close connection between algebraic and combinatorial invariants of a left regular band by showing that certain homological invariants of the algebra of a left regular band coincide with the cohomology of order complexes of posets naturally associated to the left regular band. The purpose of the present monograph is to further develop and deepen the connection between left regular bands and poset topology. This allows us to compute finite projective resolutions of all simple mod- ules of unital left regular band algebras over fields and much more. In the process, we are led to define the class of CW left regular bands as the class of left regular bands whose associated posets are the face posets of regular CW complexes. Most of the examples that have arisen in the literature belong to this class. A new and important class of ex- amples is a left regular band structure on the face poset of a CAT(0) cube complex.
    [Show full text]
  • Complete Topologized Posets and Semilattices
    COMPLETE TOPOLOGIZED POSETS AND SEMILATTICES TARAS BANAKH, SERHII BARDYLA Abstract. In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices. 1. Introduction In this paper we discuss a notion of completeness for topologized posets and semilattices. By a poset we understand a set X endowed with a partial order ≤. A topologized poset is a poset endowed with a topology. A topologized poset X is defined to be complete if each non-empty chain C in X has inf C ∈ C¯ and sup C ∈ C¯, where C¯ stands for the closure of C in X. More details on this definition can be found in Section 2, where we prove that complete topologized posets can be equivalently defined using directed sets instead of chains. In Section 4 we study the interplay between complete and chain-compact topologized posets and in Section 5 we study complete topologized semilattices. In Section 6 we survey some known results on the absolute closedness of complete semitopological semilattices and in Section 7 we survey recent results on the closedness of the partial order in complete semitopological semilattices. 2. The completeness of topologized posets In this section we define the notion of a complete topologized poset, which is a topological counterpart of the standard notion of a complete poset, see [10]. First we recall some concepts and notations from the theory of partially ordered sets. A subset C of a poset (X, ≤) is called a chain if any two points x,y ∈ X are comparable in the partial order of X.
    [Show full text]
  • COMPLETE HOMOMORPHISMS BETWEEN MODULE LATTICES Patrick F. Smith 1. Introduction in This Paper We Continue the Discussion In
    International Electronic Journal of Algebra Volume 16 (2014) 16-31 COMPLETE HOMOMORPHISMS BETWEEN MODULE LATTICES Patrick F. Smith Received: 18 October 2013; Revised: 25 May 2014 Communicated by Christian Lomp For my good friend John Clark on his 70th birthday Abstract. We examine the properties of certain mappings between the lattice L(R) of ideals of a commutative ring R and the lattice L(RM) of submodules of an R-module M, in particular considering when these mappings are com- plete homomorphisms of the lattices. We prove that the mapping λ from L(R) to L(RM) defined by λ(B) = BM for every ideal B of R is a complete ho- momorphism if M is a faithful multiplication module. A ring R is semiperfect (respectively, a finite direct sum of chain rings) if and only if this mapping λ : L(R) !L(RM) is a complete homomorphism for every simple (respec- tively, cyclic) R-module M. A Noetherian ring R is an Artinian principal ideal ring if and only if, for every R-module M, the mapping λ : L(R) !L(RM) is a complete homomorphism. Mathematics Subject Classification 2010: 06B23, 06B10, 16D10, 16D80 Keywords: Lattice of ideals, lattice of submodules, multiplication modules, complete lattice, complete homomorphism 1. Introduction In this paper we continue the discussion in [7] concerning mappings, in particular homomorphisms, between the lattice of ideals of a commutative ring and the lattice of submodules of a module over that ring. A lattice L is called complete provided every non-empty subset S has a least upper bound _S and a greatest lower bound ^S.
    [Show full text]
  • A Topology on Lattice-Ordered Groups
    Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 11 (2018), 701–712 Research Article Journal Homepage: www.isr-publications.com/jnsa A topology on lattice-ordered groups Huanrong Wu, Qingguo Li∗, Bin Yu College of Mathematics and Econometrics, Hunan University, Changsha 410082, China. Communicated by M. Bohner Abstract We introduce the concept of the strong-positive cone in a lattice-ordered group (G, 6, ·) and define the continuous lattice- ordered group. We also investigate the C-topology and bi-C-topology given on a lattice-ordered group. The main results obtained in this paper are as follows: (1) (G, 6, ·) is a continuous lattice-ordered group if and only if (G, 6) is a continuous poset; (2) for the bi-C-topology τ in a continuous lattice-ordered group (G, 6, ·), (G, ·, τ) is a topological group and (G, 6, τ) is a topological lattice. Keywords: Lattice-ordered group, continuous, topology, topological group, topological lattice. 2010 MSC: 06F15, 06B35, 54H11. c 2018 All rights reserved. 1. Introduction Lattice-ordered groups (also called l-groups) are an important class of partially ordered algebraic systems. The study of l-groups was initiated by Birkhoff [9, 12] and followed by many other researchers [6, 16, 24]. The monographs [10, 15] gave a systematic account of the basic theory of l-groups. Recently, l-groups have cropped up in many other areas of mathematics, for instance, in the theory of bezout´ domains [36, 37], ordered fields [7, 15], category theory [11], topology theory [5,8, 21] and others [22]. In the 1960s, Scott introduced domain theory [31], aiming to provide mathematical models for com- puter program languages.
    [Show full text]
  • L-Fuzzy Scott Topology and Scott Convergence of Stratified L-Filters
    Electronic Notes in Theoretical Computer Science 257 (2009) 135–152 www.elsevier.com/locate/entcs View metadata, citation and similar papers at core.ac.uk brought to you by CORE L-fuzzy Scott Topology and Scottprovided by Elsevier Convergence - Publisher Connector of Stratified L-filters on Fuzzy Dcpos 1 Wei Yao2 Department of Mathematics Hebei University of Science and Technology Shijiazhuang 050018, China Abstract On a fuzzy dcpo with a frame L as its valued lattice, we define an L-fuzzy Scott topology by means of graded convergence of stratified L-filters. It is a fuzzy counterpart of the classical Scott topology on a crisp dcpo. The properties of L-fuzzy Scott topology are investigated. We establish Scott convergence theory of stratified L-filters. We show that for an L-set, its degree of Scott openness equals to the degree of Scott continuity from the underlying fuzzy dcpo to the lattice L (also being viewed as a fuzzy poset). We also show that a fuzzy dcpo is continuous iff for any stratified L-filter, Scott convergence coincides with topological convergence (w.r.t. the L-fuzzy Scott topology). Keywords: fuzzy dcpo, stratified L-filter, L-fuzzy Scott topology, Scott convergence, topological convergence. 1 Introduction Domain Theory, a formal basis for the semantics of programming languages, originates in work by D. Scott [17,18] in the mid-1960s. Domain models for var- ious types of programming languages, including imperative, functional, non- deterministic and probabilistic languages, have been extensively studied. Quantitative Domain Theory that provides a model of concurrent systems forms a new branch of Domain Theory and has undergone active research in the past three decades.
    [Show full text]
  • Pseudocomplemented Semilattices, Boolean Algebras, and Compatible Products1
    Journal of Algebra 242, 60᎐91Ž. 2001 doi:10.1006rjabr.2001.8807, available online at http:rrwww.idealibrary.com on Pseudocomplemented Semilattices, Boolean Algebras, and Compatible Products1 Antonio Fernandez´´ Lopez and Marıa ´ Isabel Tocon ´ Barroso View metadata, citationDepartamento and similar papers de Algebra, at core.ac.uk Geometrıa´´ y Topologıa, Facultad de Ciencias, brought to you by CORE Uni¨ersidad de Malaga,´´ 29071 Malaga, Spain provided by Elsevier - Publisher Connector E-mail: [email protected], [email protected] Communicated by Georgia Benkart Received November 19, 1999 DEDICATED TO PROFESSOR J. MARSHALL OSBORN Pseudocomplemented semilattices are studied here from an algebraic point of view, stressing the pivotal role played by the pseudocomplements and the relation- ship between pseudocomplemented semilattices and Boolean algebras. Following the pattern of semiprime ring theory, a notion of Goldie dimension is introduced for complete pseudocomplemented lattices and calculated in terms of maximal uniform elements if they exist in abundance. Products in lattices with 0-element are studied and questions about the existence and uniqueness of compatible products in pseudocomplemented lattices, as well as about the abundance of prime elements in lattices with a compatible product, are discussed. Finally, a Yood decomposition theorem for topological rings is extended to complete pseudocom- plemented lattices. ᮊ 2001 Academic Press Key Words: pseudocomplemented semilattice; Boolean algebra; compatible product. INTRODUCTION A pseudocomplemented semilattice is aŽ. meet semilattice S having a least element 0 and is such that, for each x in S, there exists a largest element x H such that x n x Hs 0. In spite of what the name could suggest, a complemented lattice need not be pseudocomplemented, as is easily seen by considering the lattice of all subspaces of a vector space of dimension greater than one.
    [Show full text]
  • Lattices and the Geometry of Numbers
    Lattices and the Geometry of Numbers Lattices and the Geometry of Numbers Sourangshu Ghosha, aUndergraduate Student ,Department of Civil Engineering , Indian Institute of Technology Kharagpur, West Bengal, India 1. ABSTRACT In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to study the properties of algebraic numbers. It has application on various other fields of mathematics especially the study of Diophantine equations, analysis of functional analysis etc. This paper will review all the major developments that have occurred in the field of geometry of numbers. In this paper we shall first give a broad overview of the concept of lattice and then discuss about the geometrical properties it has and its applications. 2. LATTICE Before introducing Minkowski’s theorem we shall first discuss what is a lattice. Definition 1: A lattice 흉 is a subgroup of 푹풏 such that it can be represented as 휏 = 푎1풁 + 푎2풁 + . + 푎푚풁 풏 Here {푎푖} are linearly independent vectors of the space 푹 and 푚 ≤ 푛. Here 풁 is the set of whole numbers. We call these vectors {푎푖} the basis of the lattice. By the definition we can see that a lattice is a subgroup and a free abelian group of rank m, of the vector space 푹풏. The rank and dimension of the lattice is 푚 and 푛 respectively, the lattice will be complete if 푚 = 푛. This definition is not only limited to the vector space 푹풏.
    [Show full text]
  • Lattice Theory
    Chapter 1 Lattice theory 1.1 Partial orders 1.1.1 Binary Relations A binary relation R on a set X is a set of pairs of elements of X. That is, R ⊆ X2. We write xRy as a synonym for (x, y) ∈ R and say that R holds at (x, y). We may also view R as a square matrix of 0’s and 1’s, with rows and columns each indexed by elements of X. Then Rxy = 1 just when xRy. The following attributes of a binary relation R in the left column satisfy the corresponding conditions on the right for all x, y, and z. We abbreviate “xRy and yRz” to “xRyRz”. empty ¬(xRy) reflexive xRx irreflexive ¬(xRx) identity xRy ↔ x = y transitive xRyRz → xRz symmetric xRy → yRx antisymmetric xRyRx → x = y clique xRy For any given X, three of these attributes are each satisfied by exactly one binary relation on X, namely empty, identity, and clique, written respectively ∅, 1X , and KX . As sets of pairs these are respectively the empty set, the set of all pairs (x, x), and the set of all pairs (x, y), for x, y ∈ X. As square X × X matrices these are respectively the matrix of all 0’s, the matrix with 1’s on the leading diagonal and 0’s off the diagonal, and the matrix of all 1’s. Each of these attributes holds of R if and only if it holds of its converse R˘, defined by xRy ↔ yRx˘ . This extends to Boolean combinations of these attributes, those formed using “and,” “or,” and “not,” such as “reflexive and either not transitive or antisymmetric”.
    [Show full text]