Three levels of D - completions Zhao Dongsheng Ho Weng Kin, Wee Wen Shih Mathematics and Mathematics Education National Institute of Education, Nayang.

Slides:



Advertisements
Similar presentations
Partial Orderings Section 8.6.
Advertisements

Joint work with Andre Lieutier Dassault Systemes Domain Theory and Differential Calculus Abbas Edalat Imperial College Oxford.
Abbas Edalat Imperial College London Contains joint work with Andre Lieutier (AL) and joint work with Marko Krznaric (MK) Data Types.
Introduction to Set Theory
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
CSCI 115 Chapter 6 Order Relations and Structures.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
The Engineering Design of Systems: Models and Methods
Applied Discrete Mathematics Week 11: Graphs
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Math 3121 Abstract Algebra I
Foundations of Data-Flow Analysis. Basic Questions Under what circumstances is the iterative algorithm used in the data-flow analysis correct? How precise.
Programming Language Semantics Denotational Semantics Chapter 5 Based on a lecture by Martin Abadi.
Discrete Mathematics Lecture 4 Harper Langston New York University.
FSM Decomposition using Partitions on States 290N: The Unknown Component Problem Lecture 24.
Uncertainty Measure and Reduction in Intuitionistic Fuzzy Covering Approximation Space Feng Tao Mi Ju-Sheng.
Theorem 1-a Let be a sequence: L L a) converges to a real number L iff every subsequence of converge to L Illustrations 0 0.
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
Programming Language Semantics Denotational Semantics Chapter 5 Part III Based on a lecture by Martin Abadi.
1 Category Theory in a ( E,M ) -category Some aspects of category theory, in particular related to universality, can be developed in any finitely complete.
Partially Ordered Sets (POSets)
Relations Chapter 9.
Chapter 6. Order Relations and Structure
Topological Nets and Filters Mark Hunnell. Outline 1.Motivations for Nets and Filters 2.Basic Definitions 3.Construction of Equivalence 4.Comparison and.
The Relationship between Topology and Logic Dr Christopher Townsend (Open University)
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Signed-Bit Representations of Real Numbers and the Constructive Stone-Yosida Theorem Robert S. Lubarsky and Fred Richman Florida Atlantic University.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
Scott Closed Set Lattices And Applications 1. Some preliminaries 2. Dcpo-completion 3. Equivalence between CONP and CDL 4. The Hoare power domain 5. Scott.
Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Appendix A. Mathematical Background EE692 Parallel and Distribution Computation.
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Discrete Math for CS Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/21/2008.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
On the reflection and the coreflection of categories over a base in discrete fibrations Various aspects of two “dual” formulas Claudio Pisani.
Relations and their Properties
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Sets and Subsets Set A set is a collection of well-defined objects (elements/members). The elements of the set are said to belong to (or be contained in)
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
******************************************************************** *These notes contain NDSU confidential and proprietary material. * *Patents are pending.
Domain Theory and Multi-Variable Calculus Abbas Edalat Imperial College London Joint work with Andre Lieutier, Dirk Pattinson.
Problem Statement How do we represent relationship between two related elements ?
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Dcpo—Completion of posets Zhao Dongsheng National Institute of Education Nanyang Technological University Singapore Fan Taihe Department of Mathematics.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
A data Type for Computational Geometry & Solid Modelling Abbas Edalat Andr é Lieutier Imperial College Dassault Systemes.
Chapter 8: Relations. 8.1 Relations and Their Properties Binary relations: Let A and B be any two sets. A binary relation R from A to B, written R : A.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
Department of Statistics University of Rajshahi, Bangladesh
Locale pullback via dcpos Dr Christopher Townsend (Open University)
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Scott is Natural between Frames Christopher Townsend, Open University UK. Reporting on joint work with Vickers, Birmingham University, UK Approx. 20 minutes.
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Citra Noviyasari, S.Si, MT
Chapter 5 Relations and Operations
Math 3121 Abstract Algebra I
Department of Mathematics
Unit-III Algebraic Structures
Axioms for a category of spaces
Set Topology MTH 251 Lecture # 8.
CS201: Data Structures and Discrete Mathematics I
Discrete Math (2) Haiming Chen Associate Professor, PhD
Applied Discrete Mathematics Week 6: Relations/Digraphs
Sungho Kang Yonsei University
Quantum Foundations Lecture 2
Presentation transcript:

Three levels of D - completions Zhao Dongsheng Ho Weng Kin, Wee Wen Shih Mathematics and Mathematics Education National Institute of Education, Nayang Technological University, Singapore The 2nd International Conference on Quantitative Logic and Soft Computing 22-25, October, 2010 Jimei University, Xiamen, China

Outline: Subcategory and reflectivity Posets, dcpo’s and D – completion of posets Monotone convergence ( d - ) spaces, d-completion of T 0 - spaces Convergence spaces, D-completion

1. Subcategory and reflectivity Given a category C and a subcategory E of C, E is reflective in C if the inclusion functor from E into C has a left adjoint. f Y G(X) ηXηX X C E

Examples CRSP KHSP X βXβX Stone–Čech compactification

TOP 0 Sober X SX soberification A space Y is sober if for any non-empty irreducible closed set F of Y, there is a unique element a in Y such that F = cl({a})

2. Directed complete posets and dcpo-completion A non-empty subset D of a poset (P, ≤ ) is directed if any two elements in D has an upper bound in D. A poset (P, ≤ ) is directed complete if every directed subset D of P has a supremum (join) sup D. A directed complete poset is also called a dcpo.

A mapping f : P → Q between two posets is Scott continuous if it preserves joins of directed sets: f( sup D)=sup f(D) for every directed D for which sup D exists.

Let POS ( DCPO) be the category of posets ( dcpo ) and Scott continuous mappings between posets. Question: Is DCPO reflective in POS ?

Definition [11] The D-completion of a poset P is a dcpo D(P), together with a Scott continuous mapping η : P → D(P) such that for any Scott continuous f: P → Q into a dcpo Q, there is a unique Scott continuous g: D(P) → Q such that f= g○η

A subset U of P is Scott open if the following conditions are satisfied: (i) U=↑U ; (ii) for any directed set D, sup D in U implies D∩U is non- empty The set of all Scott closed (open ) sets of P is denoted by Г(P) ( σ(P)), which is a complete lattice under the inclusion relation.

A subset F of a poset P is called D-closed if for any directed subset, whenever sup D exists. The D – closed sets defines a topology--- D - topology. * A subset F is Scott closed iff it is a down set and D-closed

Theorem [11] For every poset P, the D - closure of ф={↓x: x is in P} in Г(P), or the smallest subdcpo containing ф, is the D-completion of P. Theorem [11] (1) P is continuous iff D(P) is continuous. (2) P is algebraic iff P is algebraic. (3) Г(P)≡ Г(D(P)).

*The directed completion o f continuous posets was considered in [10]. * The dcpo – completion of posets was also considered in [6] and [7] with different motivations. * The local dcpo –completion was first considered in [8] and was revised in [11]

For any T 0 space X, the specialization order  on X is defined as : x  y iff x is in cl({y}).

3. d-spaces and d-completion to topological spaces Remark 1.For any poset P, ΣP=(P, σ(P)) is a T 0 space. The specialization order is the original order on P. 2. f: P → Q is Scott continuous iff it is continuous with respect to the Scott topology. So the category POS d is a full subcategory of TOP 0 3.If P is a dcpo, then (i) the specialization of ΣP is directed complete, and (ii) for any directed subset D, D converges to sup D, as a net.

Definition A topological space X satisfying (i) and (ii) is called a d - space, or monotone convergence space. Remark: 1.For any poset P, the Scott space ΣP is a d-space iff P is directed complete. 2.Every Sober space is a d-space. 2.If X is a d - space, then every open set U of X is a Scott open set of (X, ≤ ), where is the specialization order on X.

poset dcpo P ∑P Q ∑D TOP 0 DTOP 0

Question: Is DTOP reflexive in TOP 0 ? Theorem [9] [1] [7] For each T 0 space X there is a d –space D(X) and a continuous mapping η : X → D(X) such that for any continuous f: X → Y into a d-space Y, there is a unique Scott continuous g: D(X) → Y such that f= g∙η.

Theorem [7 For any poset, the d-completion D( ∑P) of the space ∑P with the specialization order is the D-completion of P.

P ∑P D(∑P) D(P) specialization order Posets Space

So the D – completion of topological spaces is a generalization of D – completion of posets

4. Net convergence spaces and D-completion Definition [ 5] A (net ) convergence space is a pair (X, →), where X is a non-empty set and → is a collection of pairs ( S, x ) with S a net in X and x an element in X ( we write S→x if (S, x) belongs to → and say that S converges to x ), such that the following conditions are satisfied: 1.( CONSTANT NET) For any x in X, {x}→x. 2. ( SUBNET) If S → x then S 1 → x for any subnet S 1 of S.

* A net S=(x i ) is a subnet of T=(y j ) if for any j 0 there is i 0 such that for any i 0 ≤ i, x i belongs to the j 0 - tail of T. Continuous functions between convergence spaces are defined in the usual way. Let CONV be the category of convergence spaces and continuous functions between them. * CONV is cartesian closed

Example Every topological space (X, τ ) defines convergence space (X, ) in the ordinary sense. Such a convergence space is called a topological convergence space. Also the assignment of (X, ) to (X, τ ) extends to a functor from TOP to CONV, setting TOP as a full subcategory of CONV.

Definition : A subset U of a convergence space ( X, → ) is open if S=(x i ) → x and x is in U, then x i is in U eventually. The set of all open sets U of ( X, → ) form a topology, called the induced topology and denoted by. The specialization order ≤ of the topological space is called the specialization order of ( X, → ).

A space ( X, → ) is up – nice if S=(x i ) converges to a and T=(y j ) is a net satisfying the condition below, then T converges to a: for any i 0 there is j 0 such that for any j 0 ≤ j, y j belongs to ↑{x i : i 0 ≤ i }.

A space ( X, → ) is down– nice if S=(x i ) converges to a and b ≤ a, then S converges to b. A space is called nice, if it is both up-nice and down nice. For any net S, let lim S={ x: S → x } be the set of all limit points of S.

Definition[5] A convergence space ( X, →) is called a d - space of 1). It is order – nice; 2). For any directed set D={ x i : i in I }, sup D exists and D → sup D ( take D as a net ). 3). For any net, lim S is closed under supremum of directed sets.

Example[5] For each poset P, define → by: S=(x i ) → x if there is a directed set E with sup E exist, x ≤ sup E, and for any e in E, e≤ x i eventually. Then (i) (P, ≤ ) is order – nice; (ii) (P, ≤ ) is a d – space iff P is a dcpo; (iii) (P, ≤ ) is topological iff P is a continuous poset.

Theorem The category DCONV of d- convergence spaces ( as a subcategory of CONV) is Cartesian closed Example A topological space (X, τ ) is a d- space iff the convergence space (X, ) is a d – space.

Remark (1)For any poset P, ( P, → d ) is an IL space if it is topological, iff P is continuous. (2) Every topological convergence space is IL. Definition A space ( X, → ) is called an IL space if it satisfies the Iterated Limit Axiom.

Definition[5] A D – completion of a space ( X, → ) is d – space Y together with a continuous map η : X →Y, such that for any continuous f: X → Z from X into a d – space Z, there is a unique continuous h: Y → Z such that f=h ○η.

Theorem [5] If X can be embedded into an IL d-space, then X has a d – completion. Corollary Every T 0 topological spaces has a d – completion which is also topological.

poset dcpo P ∑P DTOP 0 DCONV TOP 0 X (X, ) CONV

Problem: Does every convergence space have a d – completion?

References [1] Erchov, Yu. L.: On d-spaces, Theoretical Computer Science, (1999), 224: [2] Gierz, G. et al.: Continuous lattices and Domains, Encyclopedia of Mathematics and Its Applications, Vol.93. [3] R. Heckmann: A non- topological view of dcpos as convergence spaces. Theoretical Computer Science, 305(1193), [4] W. Ho, and D. Zhao, Lattices of Scott-closed sets, Comment. Math. Univer. Carolinae, 50(2009), 2: [5] W. Ho, D. Zhao and W. Wee, d – completion of net convergence space, Proceeding of this conference. [6] A. Jung, M. A. Moshier and S. Vickers, Presenting dcpos and dcpo algebras, (Preprint). [7] Keimel, K. and Lawson, J. D.: D-completions and the d-topology, Annals of Pure and Applied Logic 59(2009), 3: [8] M. W. Mislove, Local DCPOs, Local CPOs and Local completions, Electronic Notes in Theoretical Computer Science, 20(1999). [9] Wyler, O.: Dedekind complete posets and Scott topologies, In: Lecture Notes In Mathematics, Springer-Verlag, 1981.

[10] L. Xu, Continuity of posets via Scott topology and sobrification, Topology Appl., 153(2006), 11: [11] Zhao, D. and Fan, T., dcpo-completion of posets, Theoretical Computer Science, 411(2010),

Thank you !