Presentations for Topology Dr Christopher Townsend (Open University)

Slides:



Advertisements
Similar presentations
On the relationship between the notions of independence in matroids, lattices, and Boolean algebras Fabio Cuzzolin INRIA Rhone-Alpes, Grenoble, France.
Advertisements

The proof is quite similar to that of a previous result: a compact subspace of a Hausdorff is closed. Theorem: If topological X  space is compact and.
Event structures Mauro Piccolo. Interleaving Models Trace Languages:  computation described through a non-deterministic choice between all sequential.
Transitive Closure Theorem 1. Let R be a relation on a set A. Then R  is the transitive closure of R. the reachability relation R * of a relation R on.
Keystone Problem… Keystone Problem… next Set 18 Part 2 © 2007 Herbert I. Gross.
CLUSTERING PROXIMITY MEASURES
Categorical aspects of Locale Theory Prepared for a University of Birmingham Seminar 16 th November 2007 By Christopher Townsend.
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 II SIZE FUNCTIONS:
Multiple View Geometry Projective Geometry & Transformations of 2D Vladimir Nedović Intelligent Systems Lab Amsterdam (ISLA) Informatics Institute,
Epipolar Geometry and the Fundamental Matrix F
Cardinals Georg Cantor ( ) thought of a cardinal as a special represenative. Bertrand Russell ( ) and Gottlob Frege ( ) used the.
Schemas as Toposes Steven Vickers Department of Pure Mathematics Open University Z schemas – specification1st order theories – logic geometric theories.
1 Foundations of Interval Computation Trong Wu Phone: Department of Computer Science Southern Illinois University Edwardsville.
CSP, Algebras, Varieties Andrei A. Bulatov Simon Fraser University.
1 Section 1.8 Functions. 2 Loose Definition Mapping of each element of one set onto some element of another set –each element of 1st set must map to something,
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.
GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.
Algebra Algebra – defined by the tuple:  A, o 1, …, o k ; R 1, …, R m ; c 1, …, c k  Where: A is a non-empty set o i is the function, o i : A p i  A.
Partially Ordered Sets (POSets)
Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.
The Relationship between Topology and Logic Dr Christopher Townsend (Open University)
Dr. Vasileios Lempessis MATHEMATICAL PHYSICS II COMPLEX ALGEBRA LECTURE - 1 “The imaginary numbers are a wonderful flight of God’s spirit; they are almost.
Solving fixpoint equations
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.
2.4 Sequences and Summations
General (point-set) topology Jundong Liu Ohio Univ.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Introduction to Graph Grammars Fulvio D’Antonio LEKS, IASI-CNR Rome,
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)
11 DISCRETE STRUCTURES DISCRETE STRUCTURES UNIT 5 SSK3003 DR. ALI MAMAT 1.
11 DISCRETE STRUCTURES DISCRETE STRUCTURES UNIT 5 SSK3003 DR. ALI MAMAT 1.
Balanced Category Theory Claudio Pisani Calais, June 2008.
******************************************************************** *These notes contain NDSU confidential and proprietary material. * *Patents are pending.
The theory behind Functional Programming Functional: based on lambda calculus / combinators, recursion theory, category theory. By contrast with other.
Some Aspects of Quasi-Stone Algebras, II Solutions and Simplifications of Some Problems from Sankappanavar and Sankappanavar Jonathan David Farley, D.Phil.
Great Theoretical Ideas in Computer Science.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
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.
1 Discrete Mathematical Functions Examples.
1 Iterative Program Analysis Abstract Interpretation Mooly Sagiv Tel Aviv University Textbook:
Locale pullback via dcpos Dr Christopher Townsend (Open University)
Shadows without Objects A very quick introduction to the philosophy of quantum groups. J.P. McCarthy.
Scott is Natural between Frames Christopher Townsend, Open University UK. Reporting on joint work with Vickers, Birmingham University, UK Approx. 20 minutes.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Chapter 14 Transformations Mappings and Functions.
Rewriting Nested Graphs, through Term Graphs Roberto Bruni, Andrea Corradini, Fabio Gadducci Alberto Lluch Lafuente and Ugo Montanari Dipartimento di Informatica,
FREE TOPOLOGICAL GROUPS AND FUNCTORIAL FIBREWISE CONSTRUCTIONS
Zigzag Persistent Homology Survey
Unit-III Algebraic Structures
Introduction to Relations
Learn about relations and their basic properties
Chapter 14 Transformations.
Axioms for a category of spaces
Structures-Trusses.
CSE 20 – Discrete Mathematics
6.1 One-to-One Functions; Inverse Function
CS201: Data Structures and Discrete Mathematics I
One-to-One Functions and Inverse Functions
Lecture 7 Functions.
Lecture 4 Propagation of errors
DISCRETE COMPUTATIONAL STRUCTURES
4.1 One-to-One Functions; Inverse Function
FREE TOPOLOGICAL GROUPS AND FUNCTORIAL FIBREWISE CONSTRUCTIONS
Sullivan Algebra and Trigonometry: Section 6.1
How to Get Where you Want to Go
6.1 One-to-One Functions; Inverse Function
Histogram Equalization
Introductory Concepts
Social Practice of the language: Describe and share information
Presentation transcript:

Presentations for Topology Dr Christopher Townsend (Open University)

Common Language We have the following assumptions for the talk: (a) What a presentation is. I.e. what A=Alg means (b) The category of frames (Objects: complete Heyting algebras. Morphisms: preserve all joins and finite meets) (c) The category of Locales (Loc) = the opposite of the category of frames. Power locales. (d ) Locales are important… –a good framework for topology –a first step towards generalised spaces (toposes)

Frame Presentations Objectives for the Talk –1) Show that frame presentations come in different flavours –2) Show that frame presentations commute with maps between toposes (frames do not) –3) Show how the ‘flavours’ correspond to well known power locale constructions Thereafter: Applications to describing Loc

Why Frame Presentations? Usually, not interesting objects… but we have different flavours emerging Each example is a ‘finitary’ (Geometric…) object The relationship between flavours corresponds to power locale constructions They are stable when moving from one topos to another… leading to arguments about universality of the double power locale. IN SHORT: careful arguments about presentations correspond to important topological constructions.

Frame Presentations: 4 Flavours A presentation is a pair (G,R) where G is a set and R are relations… OR G is a lattice and R is a relation… (DLat, ) (/\SLat, +\/) (\/SLat, +/\) (Poset, +\/+/\) Every Frame can be presented by any node... ‘Qua Dlat’

Moving Between Presentations: (DLat, ) (/\SLat, +\/) (Poset, +\/+/\) (\/SLat, +/\) Forget P_L P_U P_UP_L I.e. power locale is action of forgetting structure on presentation

Geometric Stability (DLat, ) (/\SLat, +\/) (Poset, +\/+/\) (\/SLat, +/\) Forget P_L P_U P_UP_L f:EE’ f:E  E’ a geometric morphism, f* the inverse image then: f* E... in E.

Pullback Stability f:E E’ E’Ef:E  E’ a geometric morphism; so any locale X (in E’) can be pulled back to a locale in E, denoted f*X : (Crucial Fact): If X is presented by (G,R) then f*X is presented by f*(G,R) - presentations are pullback stable. Not only the objects (locales), but the power constructions are pullback stable via the constructions on the corresponding presentations. (Known; widely?)

Consequences of Stability Broad geometric techniques for arguing about locales. (Locales have points again…) Extend to Ideal Completion of a poset Double Power Locale Result: PPX=$^($^X) f:E E’ In practice: f:E  E’ is just a continuous map between locales. I.e. f : SX  SY, the topos of sheaves over X,Y respectively. Since Loc SX = Loc/X(Joyal and Tierney) we can argue in Set and then pullback to Loc/X to obtain more general results. E.g.

Consequences of Double Power Result Axiomatization of a category of spaces Compact Open duality –Duality between compact Hausdorff and discrete. End

What I didn’t tell you about Coverage Theorem Categorical interpretation of Coverage Theorem.