Categorical aspects of Locale Theory Prepared for a University of Birmingham Seminar 16 th November 2007 By Christopher Townsend.

Slides:



Advertisements
Similar presentations
Function Technique Eduardo Pinheiro Paul Ilardi Athanasios E. Papathanasiou The.
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’
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
(CSC 102) Discrete Structures Lecture 14.
Section 1.6: Sets Sets are the most basic of discrete structures and also the most general. Several of the discrete structures we will study are built.
Edge-Coloring of Graphs On the left we see a 1- factorization of  5, the five-sided prism. Each factor is respresented by its own color. No edges of the.
The Engineering Design of Systems: Models and Methods
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Math 3121 Abstract Algebra I
Groups TS.Nguyễn Viết Đông.
I. Homomorphisms & Isomorphisms II. Computing Linear Maps III. Matrix Operations VI. Change of Basis V. Projection Topics: Line of Best Fit Geometry of.
Avraham Ben-Aroya (Tel Aviv University) Oded Regev (Tel Aviv University) Ronald de Wolf (CWI, Amsterdam) A Hypercontractive Inequality for Matrix-Valued.
Digital Image Processing, 2nd ed. www. imageprocessingbook.com © 2001 R. C. Gonzalez & R. E. Woods 1 Objective To provide background material in support.
Schemas as Toposes Steven Vickers Department of Pure Mathematics Open University Z schemas – specification1st order theories – logic geometric theories.
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
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)
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)
Boolean Algebra Computer Organization 1 © McQuain Boolean Algebra A Boolean algebra is a set B of values together with: -two binary operations,
Methods of Proof & Proof Strategies
Category Theory By: Ashley Reynolds. HISTORY OF CATEGORY THEORY  In 1942–45, Samuel Eilenberg and Saunders Mac Lane introduced categories, functors,
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.
Hierarchied Categories Abelian categories, hierarchied abelian categories, graded hierarchied tensor categories Abelian categories, hierarchied abelian.
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.
Section 1.8. Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness Proofs.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Categories and Computer Science
 FOAL 2010 Modeling Aspects by Category Theory Serge P. Kovalyov Novosibirsk, Russia.
Copyright © Curt Hill Mathematical Logic An Introduction.
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)
On the reflection and the coreflection of categories over a base in discrete fibrations Various aspects of two “dual” formulas Claudio Pisani.
CS201: Data Structures and Discrete Mathematics I
A Logic of Partially Satisfied Constraints Nic Wilson Cork Constraint Computation Centre Computer Science, UCC.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
Balanced Category Theory Claudio Pisani Calais, June 2008.
Domain Theory and Multi-Variable Calculus Abbas Edalat Imperial College London Joint work with Andre Lieutier, Dirk Pattinson.
Dcpo—Completion of posets Zhao Dongsheng National Institute of Education Nanyang Technological University Singapore Fan Taihe Department of Mathematics.
Math 3121 Abstract Algebra I Lecture 11 Finish Section 13 Section 14.
Some Aspects of Quasi-Stone Algebras, II Solutions and Simplifications of Some Problems from Sankappanavar and Sankappanavar Jonathan David Farley, D.Phil.
Advanced Engineering Mathematics, 7 th Edition Peter V. O’Neil © 2012 Cengage Learning Engineering. All Rights Reserved. CHAPTER 4 Series Solutions.
CS 285- Discrete Mathematics
Information Systems and the Theory of Categories: Is Every Model an Anticipatory System?
Behavioral Extensions of Institutions Andrei Popescu Grigore Roşu University of Illinois at Urbana-Champaign.
CSE 311: Foundations of Computing Fall 2013 Lecture 8: Proofs and Set theory.
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
Locale pullback via dcpos Dr Christopher Townsend (Open University)
Scott is Natural between Frames Christopher Townsend, Open University UK. Reporting on joint work with Vickers, Birmingham University, UK Approx. 20 minutes.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
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.
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)
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
Sporadic and Related groups Lecture 15 Introduction to Fusion.
Random Access Codes and a Hypercontractive Inequality for
Unit-III Algebraic Structures
Axioms for a category of spaces
Chapter 2 Sets and Functions.
Boolean Algebra A Boolean algebra is a set B of values together with:
A Design Structure for Higher Order Quotients
On Kripke’s Alleged Proof of Church-Turing Thesis
Chapter 5 Limits and Continuity.
Construction techniques in topological universal algebra
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
Linear Systems Review Objective
Presentation transcript:

Categorical aspects of Locale Theory Prepared for a University of Birmingham Seminar 16 th November 2007 By Christopher Townsend

Today’s talk Only references to detailed proofs You all known what Loc is? Assumptions Recall what categorical facts are known about Loc. Try to show what aspects of locale theory have purely categorical proofs. Work plan ‘Axiomatic’ topology Compact Open Duality

List of Topics Power monads via exponentials Weak triquotient assignments (covers proper and open maps). Points of the double power locale. Hofmann-Mislove theorem Closed subgroup theorem Compact Hausdorff locales Patch construction Hyland’s result Representation of geometric morphisms Fundamental theorem of locale theory Once a categorical framework is set up for Loc aim to cover the following topics: Can’t do: Bourbaki characterization of proper maps Italics means account is not entirely satisfactory

Attempt at History … Closeds as primitives Tarksi & McKinsey [late 1940s] Wallman [1938] TIME Isbell [1972] & Dowker/Strauss Grothendieck (Topos)  TOPOS   LOCALE THEORY   COMPACT OPEN DUALITY  Proper Maps of Locales Vermeulen [1994] Taylor’s ASD Joyal & Tierney [1984] Preframes Banaschewski, Vickers & Johnstone ? Moerdijk & Vermeulen Proper Topos [2000] Vickers 97 Ps

Facts about Loc Order enriched Order enriched limits and colimits X×(Y+Z)=X×Y+X×Z There is an order internal distributive lattice $ that classifies open and closed subobjects For any equalizer E X Y there is a dcpo coequalizer (whiteboard). There are three monads P U, P L and PP. Locales are slice stable. e f g co-KZ KZ

Dcpo homs. are categorical Given q : ΩX  ΩY a dcpo hom. there exists unique nat. trans. a q : $ X  $ Y such that q=[a q ] 1. Specializes to suplattice and preframe homomorphisms THEREFORE: Can replicate all the Facts about Loc as categorical statements. Example (whiteboard): P U, P L and PP. Power monads via Exponentials

Extra assumptions P U, P L are co-KZ, KZ respectively. $ (_) creates isomorphisms q : X  Y epimorphism implies $ q regular monomorphism. … others. CONCLUSION: The axiomatization is effective as it shows many theorems, but it is not yet ‘nice’. Might be ‘nice’: idea is of having a universal nat. trans CSub(_xX)  CSub(_xPPX). c.f. classification of relations in topos theory. Avoids $. Remember: objective is Compact Open duality. Equivalent to assumption the Kleisli categories are Cauchy complete

Weak Triquotient Assignments Given f : X  Y then a wta on f is a nat. transformation q: $ X  $ Y such that q[c/\(d\/$ f (e)]=(q(c)/\e)\/q(c/\d). Technically important as points of PP(f:X  Y) as in order isomorphism with wtas on f. As application provides a route to showing pullback stability of proper and open maps. Since: Fact: f : X  Y is proper iff there is a wta on f such that q is right adjoint to $ f. Fact: f : X  Y is open iff there is a wta on f such that q is left adjoint to $ f. Can derive definitions for compact, compact Hausdorff & discrete from these definitions.

Hofmann-Mislove Theorem Scott open filters on ΩX are preframe homs ΩX  Ω. So they are, equivalently, /\-Slat homs $ X  $. [Localic] H-M Thm is assertion that S.O.F.s on ΩX are in order reversing bijection with fitted sublocales with compact domain. Sublocale X 0  X is fitted if it exists as a lax equalizer, f≤g say, where f factors via 1. i.e. ‘in order isomorphism with’ This is an important theorem: (a) classically allows us to recover points, (b) ??.

Hofmann-Mislove proof outline Given i: X 0  X fitted with X 0 compact, there is /\-Slat hom. q : $ X0  $ by definition of compact. Then q $ i : $ X  $ is a ‘S.O.F.’ on X. If $ X  $ is a ‘S.O.F.’ on X then there is p:1  P U X, so define X 0 is the lax equalizer p! ≤η X. The theorem has a Compact Open dual which is that the points of the lower power locale are in order isomorphism with sublocales X 0 that are weakly closed and for which X 0 is open. (Bunge/Funk.) Vickers originally

Closed subgroup theorem (Isbell et al) Theorem: All subgroups with open domain are weakly closed. Open dual of H-M implies that any inclusion i : X 0  X, with X 0 open, factors uniquely as X 0 X 0  X 0  X with the first factor dense and the second weakly closed. ( I.e. there is a ‘closure’ operator.) But, if X is a group then the first factor is an isomorphism. I.e. All subgroups with open domain are weakly closed Non-standard definition, classicially equivalent to usual definiton. One Step: The factorization is pullback stable (by stability of proper maps), so extends to the category of internal groups. Dually: all compact subgroups are fitted.

Compact Hausdorff locales As indicated, these can be defined by proper maps. Another application of H-M is that for compact Hausdorff X and Y, closed relations on XxY are in order ismorphism with /\-Slat homs $ X  $ Y. [Change of base.] E.g. can define and examine compact Hausdorff localic posets. The category of compact Hausdorff objects is regular c.f. set theory. Relations on sets X and Y are in order isomorphism with suplattice homomrophisms PX to PY. This is formally dual.

The patch construction I.e. How to get a compact Hausdorff poset from a stably locally compact locale. In fact, we do something different: show how to recover a poset N from the locale Idl(N) Opens of Idl(N) are the upward closed subsets of N. Called Idl(N) since its points are the ideals of N. Use U(N) for ΩIdl(N). P(N) can be recovered from U(N op xN) by splitting an idempotent on U(N op xN): R  ≤;(R∩∆); ≤ The data for this idempotent and U(N op xN) can be derived from Idl(N) just using facts about Loc. Bits of proof: Idl(N op )= P L (Idl(N)) Idl(N)xIdl(N op )=Idl(NxN op ) All this can be repeated on the Compact Hausdorff side: any compact Hausdorff poset can be recovered from its ‘Idl(N)’; since a locale is stably locally compact if and only if it is of the form ‘Idl(N)’ for compact Hausdorff N, this means that we have the patch construction. Could be nicer … [+2]

Hyland’s result A locale X is locally compact iff $ X is a retract of $ Idl(L) for some semilattice L. Since Idl(L) is exponentiable this implies $ X is representable. But, (New Facts about Loc) any locale Y embeds in $ Idl(N) so Y X exists if $ X does. Conversely, if Z=$ X exists then Z embeds in $ Idl(N). But, (New Facts about Loc) $ is injective and so Z is retract of $ Idl(N). Apply Yoneda to equalizer created by the retract. Seems to require ‘asymmetric’ New Facts about Loc and so not in keeping with rest of work.

Representation of Geometric Morphisms I Any geometric morphism f : F  E induces an (order enriched) adjunction Σ f -| f* between locales in F and locale in E. E.g. Ωf*X=Fr if ΩX=Fr. So, f* preserves $. This adjunction satisfies Frobenius reciprocity, i.e. Σ f (Wxf*X)=Σ f (W)xX. (Outline on whiteboard) Conversely, if L -| R is such an adjunction, then it extends to natural transformation, i.e. the dcpo homomorphisms. Since any set exists as a dcpo equalizer with objects frames, this allows us to define the direct image of a geometric morphisms f : F  E. Can extend our axiomatic approach to morphisms.

Representation of Geometric Morphisms II Well known that for any geometric morphism f : F  E, f* preserves PP. Conversely if L -| R is an adjunction between locales in F and locales in E such that R preserves PP then it extends to dcpo homomorphisms. Some questions about naturality remain, but under the further assumption that R preserves coproduct this [?] implies R=f* for some geometric morphism f: F  E. Treating geometric morphisms as adjunctions that commute with PP allows bits of the theory of geometric morphisms to be recovered without an assumption that toposes exist. E.g. Hyperconnected localic factorization and pullback stability of localic geometric morphisms. Localic Hyperconnected Bounded Of the form Σ X -| X* for some object X of codomain. Such that Σ f (1)=1. Domain of the form [G,Loc] for some internal groupoid G. Types of geom. morphism NEW DEFINITIONS

Fundemental Theorem of Locale Theory In fact, most of the axioms are slice stable.

Summary: Help! Can we make the axiomatization nicer? –Via a universal natural transformation? –Models other than Loc to prove independence of axioms. (There are some easy ones: e.g. distributive or pullback preserves coproduct?) –Firm up ‘fundamental theorem of locale theory’ What is the right characterization of stably locally compact? (And, by implication, of locales of the form Idl(P)?) Bourbaki characterization of proper maps. Representation of geometric morphisms: - –Finish proof on characterization in terms of PP –Proof of stability of proper and open geometric morphisms using representation –Stability of axiomiatization under taking G-equivarent sheaves for internal groupoids G.