Locale pullback via dcpos Dr Christopher Townsend (Open University)

Slides:



Advertisements
Similar presentations
Functions Reading: Epp Chp 7.1, 7.2, 7.4
Advertisements

Presented by: Ms. Maria Estrellita D. Hechanova, ECE
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
1 A camera is modeled as a map from a space pt (X,Y,Z) to a pixel (u,v) by ‘homogeneous coordinates’ have been used to ‘treat’ translations ‘multiplicatively’
Discrete Mathematics I Lectures Chapter 6
Categorical aspects of Locale Theory Prepared for a University of Birmingham Seminar 16 th November 2007 By Christopher Townsend.
The Engineering Design of Systems: Models and Methods
EE663 Image Processing Histogram Equalization Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Copyright © Cengage Learning. All rights reserved.
Math 344 Winter 07 Group Theory Part 3: Quotient Groups
Functions, Pigeonhole Principle Lecture 14: Nov 4 A B f( ) =
2.3 Matrix Inverses. Numerical equivalent How would we solve for x in: ax = b ? –a -1 a x = a -1 b –x=a -1 b since a -1 a = 1 and 1x = x We use the same.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
1 Basic abstract interpretation theory. 2 The general idea §a semantics l any definition style, from a denotational definition to a detailed interpreter.
Lecture 8 Recursively enumerable (r.e.) languages
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 23 Instructor: Paul Beame.
1 Equivalence of Real Elliptic Curves Equivalence of Real Elliptic Curves Allen Broughton Rose-Hulman Institute of Technology.
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.
T he Separability Problem and its Variants in Quantum Entanglement Theory Nathaniel Johnston Institute for Quantum Computing University of Waterloo.
Chapter 4: A Universal Program 1. Coding programs Example : For our programs P we have variables that are arranged in a certain order: Y 1 X 1 Z 1 X 2.
Manindra Agrawal NUS / IITK
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)
Section 1.8: Functions A function is a mapping from one set to another that satisfies certain properties. We will first introduce the notion of a mapping.
Boyce/DiPrima 9th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
Category Theory By: Ashley Reynolds. HISTORY OF CATEGORY THEORY  In 1942–45, Samuel Eilenberg and Saunders Mac Lane introduced categories, functors,
Functorial Models, Horn Products, and Positive Omitting Types Realizability Cyrus F Nourani Akdmkrd.tripod;com savoie.fr/~hyvernat/Realisabilite2012/index.php.
Database Systems Normal Forms. Decomposition Suppose we have a relation R[U] with a schema U={A 1,…,A n } – A decomposition of U is a set of schemas.
Three levels of D - completions Zhao Dongsheng Ho Weng Kin, Wee Wen Shih Mathematics and Mathematics Education National Institute of Education, Nayang.
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.
1 Inference Rules and Proofs (Z); Program Specification and Verification Inference Rules and Proofs (Z); Program Specification and Verification.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
 FOAL 2010 Modeling Aspects by Category Theory Serge P. Kovalyov Novosibirsk, Russia.
1 §15.1 Euclid’s Superposition Proof and Plane Transformations. The student will learn: the basic concepts of transformations, isometries and reflections.
On Reducing the Global State Graph for Verification of Distributed Computations Vijay K. Garg, Arindam Chakraborty Parallel and Distributed Systems Laboratory.
1 Annoucement n Skills you need: (1) (In Thinking) You think and move by Logic Definitions Mathematical properties (Basic algebra etc.) (2) (In Exploration)
Gauge Fields, Knots and Gravity Wayne Lawton Department of Mathematics National University of Singapore (65)
Chapter 5 – Relations and Functions. 5.1Cartesian Products and Relations Definition 5.1: For sets A, B  U, the Cartesian product, or cross product, of.
On the reflection and the coreflection of categories over a base in discrete fibrations Various aspects of two “dual” formulas Claudio Pisani.
LDK R Logics for Data and Knowledge Representation Modal Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
A Logic of Partially Satisfied Constraints Nic Wilson Cork Constraint Computation Centre Computer Science, UCC.
Balanced Category Theory Claudio Pisani Calais, June 2008.
CS 103 Discrete Structures Lecture 13 Induction and Recursion (1)
Domain Theory and Multi-Variable Calculus Abbas Edalat Imperial College London Joint work with Andre Lieutier, Dirk Pattinson.
The Evolution of a Hard Graph Theory Problem – Secure Sets Ron Dutton Computer Science University of Central Florida 1.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
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.
Discrete Mathematics CS 2610 January 27, part 2.
Great Theoretical Ideas in Computer Science.
Functions (Mappings). Definitions A function (or mapping)  from a set A to a set B is a rule that assigns to each element a of A exactly one element.
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
1 Iterative Program Analysis Abstract Interpretation Mooly Sagiv Tel Aviv University Textbook:
CSCI 2670 Introduction to Theory of Computing December 2, 2004.
Process Algebra (2IF45) Basic Process Algebra Dr. Suzana Andova.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
Scott is Natural between Frames Christopher Townsend, Open University UK. Reporting on joint work with Vickers, Birmingham University, UK Approx. 20 minutes.
Discrete Structures Li Tak Sing( 李德成 ) Lectures
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Presentations for Topology Dr Christopher Townsend (Open University)
Relations, Functions, and Matrices
Unit-III Algebraic Structures
Axioms for a category of spaces
Chapter 2 Sets and Functions.
IDEALS AND I-SEQUENCES IN THE CATEGORY OF MODULES
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

Locale pullback via dcpos Dr Christopher Townsend (Open University)

Main Idea THESIS: When changing base it is only really the directed joins that need to be modelled/worried about. All the rest of the finitary data takes care of itself. DIRECTEDStudy locales only, i.e. frames. I.e. the data is finite meets and arbitrary joins. Equivalently: finite meets, finite joins and DIRECTED joins. The definition of geometric morphism (suggests atleast) that the finitary structure is preserved.

Technical Aims Given f:E -> E’, a geometric morphism. Then the direct image functor preserves dcpo structure. I.e. f * :dcpo E -> dcpo E’ is well defined. Further f * :dcpo E -> dcpo E’ has a left adjoint f #. In any topos Dlat(dcpo)=Frames. Where we look at order- internal distributive lattices in the order enriched category dcpo. The left adjoint f # restricts to a functor Dlat(dcpo E’ )-> Dlat(dcpo E ) left adjoint to f * :Fr E -> Fr E’ That is: locale pullback.

What is known already? This trick has been done by Joyal and Tierney already with suplattices: - dcpo E dcpo E’ Fr E sup E sup E’ Fr E’ NEW! Frames as order- internal dlats in dcpo Joyal and Tierney ‘84 f#f# f*f* f*f* f#f# Frames as ring objects in sup f#f# f*f*

Is f * :dcpo E -> dcpo E’ well defined? YES. Use external definition of dcpo. As with sup lattices: - Internal Definition of dcpo External Definition There exists V:IdlA->A left adjoint to A->IdlA Then unravel the adjunction of the geometric morphism with the external definition to prove f * is well defined. This works as fiber directedness is stable under the inverse image. (Known?) For every fiber directed x:I->J, the map x*:Pos E (J,A)-> Pos E (I,A) has a left adjoint (and Beck-Chevalley holds). x fiber directed iff x -1 (j) directed for all j. (I,J posets.)

Defining f # :dcpo E’ -> dcpo E e1e2 f * e1 f * e1 Note: e1 and e2 are suitably geometric and so f * e1 and f * e1 well defined TRICK: Use presentations. For every dcpo A, there exists posets G and R and dcpo maps e1 and e2 such that: Idl(R) e1 e2 Idl(G) A is a coequalizer f#f# Idl( f * R) f * e1 f * e2 Idl( f * G) f# Af# Af# Af# A defines f # A. Dcpo coequalizer well defined? Folklore, or adapt Johnstone & Vickers 91

Frames as Order-Internal DLats DEFINITION: For any order enriched category C (with lax products), an object X is an order-internal meet semilattice iff !:X- >1 and Δ:X>->XxX have right adjoints. … in other words, iff finite complete wrt to the order enrichment Define order-internal distributive lattice in the standard way from this. Then: - THEOREM: Fr=Dlat(dcpo) Proof: A in Dlat(dcpo), then  A a dcpo /\:AxA->A a dcpo hom. A a DLat A finite joins/meets + finite dist. dcpo A directed cocomplete Finite meet distr. over directed joins since AxA=A(x)A in dcpo

Defining f # :Fr E’ -> Fr E (Certainly f * :Fr E -> Fr E’ since the direct image preserves finite products) So to prove that f # :dcpo E’ -> dcpo E restricts to f # :Fr E’ -> Fr E it must be verified that (a) f # (A)x f # (A)= f # (AxA) and (b) f # preserves the order enrichment. PROOF:PROOF: (b) is immediate from construction since f* certainly preserves the order enrichment. (a) follows since product in dcpo is tensor and so is a coequalizer construction preserved by left adjoint.  Detailed construction available

Applications (Locale Pullback) If f:X->Y is locale map then f * :Fr SX -> Fr SY is equivalent to Σ f :Loc/X->Loc/Y (by the [JT84] equivalence Loc SX =Loc/X). A left adjoint to f * is therefore right adjoint to Σ f i.e. pullback. (Triquotient Assignments) If p:Z->Y is a locale map then a triquotient assignment for p is a dcpo map p # :ΩZ-> ΩY, satisfying a mixed Frobenius/coFrobenius condition with Ωp: p # [c/\(d\/Ωp(e)]=(p # c/\e)\/p # (c/\d). Using the dcpo description of pullback it can be shown that maps with triquotient assignment are pullback stable. This implies the well known pullback stability results for both proper and open maps.

Applications: Double Power Locale P (Double Power Locale) If Z is a locale map then the double power locale on Z, denoted PZ is define by P Ω PZ=Fr. PP The points of PZ at stage Y (i.e. the locale maps Y-> PZ) are therefore exactly dcpo maps ΩZ-> ΩY. Using the dcpo description of change of base it can be shown (Townsend/Vickers 03) that dcpo(ΩZ, ΩY)=Nat(Loc(_xZ,$),Loc(_xY,$)) where Loc(_xZ,$):Loc op ->Set is the presheaf, Nat(_) the collection of natural transformations and $ the Sierpiński locale. This gives a universal description of the double power locale.

Further Work Beck-Chevalley for f # :dcpo E’ -> dcpo E ? (Following on from pullback stability of triquotient assignments): Decent for Triquotient Surjections? Topos theoretic version. (With toposes taking the place of locales.) Using pretopos sites to describe filtered cocontinuous maps between toposes.

Summary An external description of dcpos is available showing the dcpo structure is preserved by the direct image of a geometric morphism. Since dcpo presentations are models of geometric theories they are preserved by the left adjoints of geometric morphisms. This defines a left adjoint to the direct image functor on dcpos. Frames are exactly order-internal distributive lattices in the category of dcpos since dcpo tensor is given by set-theoretic product. The left adjoint f # :dcpo E’ -> dcpo E preserves order and tensor and so preserves order internal distributive lattices. It therefore defines a left adjoint to f * :Fr E -> Fr E’ which must be equivalent to locale pullback. Well known pullback stability results (open/proper maps) can be reproved by a single appeal to the pullback stability of maps with triquotient assignment.