Scott is Natural between Frames Christopher Townsend, Open University UK. Reporting on joint work with Vickers, Birmingham University, UK Approx. 20 minutes.

Slides:



Advertisements
Similar presentations
Partial Orderings Section 8.6.
Advertisements

Functions Reading: Epp Chp 7.1, 7.2, 7.4
Completeness and Expressiveness
Soundness of Higher-order Frame Rules (How did category theory help me?) Hongseok Yang Seoul National University Joint work with Lars Birkedal and Noah.
Joint work with Andre Lieutier Dassault Systemes Domain Theory and Differential Calculus Abbas Edalat Imperial College Oxford.
Query Answering based on Standard and Extended Modal Logic Evgeny Zolin The University of Manchester
Abbas Edalat Imperial College London Contains joint work with Andre Lieutier (AL) and joint work with Marko Krznaric (MK) Data Types.
Joint work with Andre Lieutier Dassault Systemes Domain Theoretic Models of Geometry and Differential Calculus Abbas Edalat Imperial College
1 Decomposing Hypergraphs with Hypertrees Raphael Yuster University of Haifa - Oranim.
1 C02,C03 – ,27,29 Advanced Robotics for Autonomous Manipulation Department of Mechanical EngineeringME 696 – Advanced Topics in Mechanical Engineering.
Categorical aspects of Locale Theory Prepared for a University of Birmingham Seminar 16 th November 2007 By Christopher Townsend.
1.  We have studied groups, which is an algebraic structure equipped with one binary operation. Now we shall study rings which is an algebraic structure.
1 Basic abstract interpretation theory. 2 The general idea §a semantics l any definition style, from a denotational definition to a detailed interpreter.
Brief Introduction to Logic. Outline Historical View Propositional Logic : Syntax Propositional Logic : Semantics Satisfiability Natural Deduction : Proofs.
3.II. Homomorphisms 3.II.1. Definition 3.II.2. Range Space and Nullspace.
Schemas as Toposes Steven Vickers Department of Pure Mathematics Open University Z schemas – specification1st order theories – logic geometric theories.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 12 Number theory Mathematical induction Proof by induction Examples.
CSP, Algebras, Varieties Andrei A. Bulatov Simon Fraser University.
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.
App III. Group Algebra & Reduction of Regular Representations 1. Group Algebra 2. Left Ideals, Projection Operators 3. Idempotents 4. Complete Reduction.
Partially Ordered Sets (POSets)
Relations Chapter 9.
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)
Relation, function 1 Mathematical logic Lesson 5 Relations, mappings, countable and uncountable sets.
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,
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.
Signed-Bit Representations of Real Numbers and the Constructive Stone-Yosida Theorem Robert S. Lubarsky and Fred Richman Florida Atlantic University.
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.
Measurement theory - for the interested student Erland Jonsson Department of Computer Science and Engineering Chalmers University of Technology.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
1 C03 – Advanced Robotics for Autonomous Manipulation Department of Mechanical EngineeringME 696 – Advanced Topics in Mechanical Engineering.
1 Annoucement n Skills you need: (1) (In Thinking) You think and move by Logic Definitions Mathematical properties (Basic algebra etc.) (2) (In Exploration)
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Gauge Fields, Knots and Gravity Wayne Lawton Department of Mathematics National University of Singapore (65)
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.
Universidad Nacional de ColombiaUniversidad Nacional de Colombia Facultad de IngenieríaFacultad de Ingeniería Departamento de Sistemas- 2002Departamento.
Lecture 2: Introduction to Category Theory Nick Rossiter, Computing Science, Newcastle University, England
Program Analysis and Verification Spring 2015 Program Analysis and Verification Lecture 12: Abstract Interpretation IV Roman Manevich Ben-Gurion University.
A Logic of Partially Satisfied Constraints Nic Wilson Cork Constraint Computation Centre Computer Science, UCC.
Balanced Category Theory Claudio Pisani Calais, June 2008.
1 Typing in Information Systems Nick Rossiter, Michael Heather Computer Science and Digital Technologies Northumbria University, Newcastle NE1 8ST, UK.
Growth and Decay: Integral Exponents
The theory behind Functional Programming Functional: based on lambda calculus / combinators, recursion theory, category theory. By contrast with other.
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.
A data Type for Computational Geometry & Solid Modelling Abbas Edalat Andr é Lieutier Imperial College Dassault Systemes.
CSC3315 (Spring 2009)1 CSC 3315 Languages & Compilers Hamid Harroud School of Science and Engineering, Akhawayn University
Locale pullback via dcpos Dr Christopher Townsend (Open University)
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Discrete Mathematics Lecture # 17 Function. Relations and Functions  A function F from a set X to a set Y is a relation from X to Y that satisfies the.
Presentations for Topology Dr Christopher Townsend (Open University)
Algebraic Topology Simplicial Homology Wayne Lawton
Chapter 5 Relations and Operations
CSE 2813 Discrete Structures
Unit-III Algebraic Structures
Equivalence Relations
Axioms for a category of spaces
Complex Variables. Complex Variables Open Disks or Neighborhoods Definition. The set of all points z which satisfy the inequality |z – z0|
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Lesson 5 Relations, mappings, countable and uncountable sets
Lesson 5 Relations, mappings, countable and uncountable sets
Subspaces and Spanning Sets
Linear Algebra Lecture 21.
Calculus In Infinite dimensional spaces
Presentation transcript:

Scott is Natural between Frames Christopher Townsend, Open University UK. Reporting on joint work with Vickers, Birmingham University, UK Approx. 20 minutes.

Overview Certain locale maps = Natural Transformations Scott continuous maps between frames Why? Categorical logic approach to proper maps in topology. = Today’s Talk Lattice TheoreticCategorical

Definitions Frame = complete lattice satisfying distributivety law a /\ \/ T= \/ {a /\ t, tεT} Example: Opens(X) any top. space X. Always denote frames ΩX. Frame homomorphism = preserves \/ and /\ Example: f -1 :Opens(Y)  Opens(X) any cts f : X  Y Always denote frames homs Ωf: ΩY  ΩX (more general) q : ΩY  ΩX Scott continuous = preserves directed joins (therefore definable between arb. dcpos). Example: Computer Science.

Relationship between Scott continuous and Frames Proper map in topology. If f : X  Y is proper then –there exists Scott continuous f * :Opens(X)  Opens(Y) with f * right adjoint to f -1 and f * (U\/f -1 V)=f * U\/V for U, V open in X,Y resp. Converse true provided Y is T D (i.e. every point is open in its closure). Broadly speaking: Topological notion of properness definable using interaction of Scott continuous maps and frames.

Natural Transformations Must define functor for every frame ΩX: Generalising ΩY+ΩX can be constructed as a dcpo, and so any Scott continuous Λ ΩX : Frm  Set ΩY ¦  ΩY+ΩX Hence every Ωg: ΩX  ΩW gives rise to nat. trans. by + is frame coproduct. ΩY+ΩX ΩY+ΩW 1+Ωg q: ΩX  ΩW gives rise to dcpo maps ΩY+ΩX  ΩY+ΩW for every ΩY. Scott  Nat. trans.

Scott maps from Nat Trans. UL is frame of upper closed subsets of any poset L. Lemma: for any poset L and frame ΩW Scott(idl(L),ΩW)=UL+ ΩW. Infact: Lemma is natural w.r.t Scott maps idl(R)  idl(L), and so this argument extends to any Scott continuous map since they are maps Case ΩX=idl(L) follows since, given a:Λ ΩX  Λ ΩW IdεScott(idl(L), ΩX)= UL+ ΩX UL+ ΩW=Scott(idl(L),ΩW) a UL q : idl(L)  ΩW such that qe 1 =qe 2 where e 1,e 2 : idl(R)idl(L) is the data for a dcpo presentation of ΩX.

Locale Theoretic Interpretation We can give an interpretation of Λ ΩX using locale theory; it is an exponential. Loc=Frm op This is the exponential $ X in [Loc op,Set]. $ and X embed into [Loc op,Set] via Yoneda. $ defined to behave like Sierpiński top. space Λ ΩX : Frm  Set ΩY ¦  ΩY+ΩX $ X : Loc op  Set Y ¦  Loc(Y  X,$) =

Application: Proper Maps Locale map f : X  Y is proper if there exists Scott continuous f * : ΩX  ΩY with f * right adjoint to Ωf and f * (a\/ Ωf b)=f * (a)\/b for aεΩX and bεΩY. Same as topological definition, providing examples. Equivalent definition: f : X  Y is proper if there exists natural trans. f * : $ X  $ Y satisfying coFrobenius equation. No set theory! I.e. totally categorical account of a topological notion (properness).

Further Applications Open maps Points of double power locale: $ X exists in [Loc op,Set] for every X, but exists in Loc only if X is locally compact. Remarkably, $^($ X ) always exists as a locale. Its construction is related to power domain constructions used in theoretical computer science.

Summary Scott continuous maps between frames can be represented by certain natural transformations. This provides an entirely categorical account for a well known class of functions. A categorical axiomatization of the topological notion of properness is available.