Coder Social home page Coder Social logo

ayberkt / formal-topology-in-uf Goto Github PK

View Code? Open in Web Editor NEW
35.0 5.0 2.0 10.78 MB

Formal Topology in Univalent Foundations (WIP).

License: GNU General Public License v3.0

CSS 90.52% Makefile 1.14% Shell 8.34%
formal-topologies locale-theory pointless-topology topology univalent-foundations univalent-mathematics homotopy-type-theory constructive-topology

formal-topology-in-uf's Introduction

Formal Topology in Univalent Foundations

Link to thesis.

This is the Agda development accompanying my (upcoming) master's thesis at Chalmers University of Technology to be titled Formal Topology in Univalent Foundations.

Note: This library is not actively maintained. The dependency cubical needs to be checked out to commit 09cc7134082573cf82436f5d317405812856f7f6. For an actively developed version of the locale theory development here, see the Locales in TypeTopology.

The approach to formal topology implemented here follows an idea of Thierry Coquand [0] to define formal topologies as posets endowed with interaction systems. The main novelty in this development is the definition of covering as an HIT. This seems to be necessary in the context of univalent type theory to avoid using a form of the axiom of choice.

The version of the code presented in the thesis will be archived whereas this repository (which is, as of now, mostly the same) will be maintained and developed further.

Question: what is formal topology?

Here is an answer by Giovanni Sambin [1]:

What is formal topology? A good approximation to the correct answer is: formal topology is topology as developed in (Martin-Löf's) type theory.

Also, this blog post by Mike Shulman contains interesting remarks about predicative mathematics and formal topology.

Overview

The main development comprises nine modules. If you are interested in reading the code, I suggest the following order:

  1. Basis. Basic definitions of univalent type theory, many of which are imported from agda/cubical and some of which are adapted from Martín Escardó's introduction to HoTT/UF.
  2. Poset.
  3. Frame. A rudimentary development of frames.
  4. Nucleus. The notion of a nucleus on a frame.
  5. FormalTopology. Definition of a formal topology as an interaction system.
  6. Cover. The cover relation induced by the structure of a formal topology.
  7. CoverFormsNucleus. Contains the proof that the cover relation of a formal topology is a nucleus on the frame of downwards-closed subsets of its underlying poset.
  8. UniversalProperty. Contains the proof that formal topologies present frames as expected.
  9. CantorSpace. The definition of the formal Cantor topology along with a proof that it is compact.
  10. Sierpinski. The formal topology of the Sierpinski space.

Clickable HTML

A rendering of the code in glorious clickable HTML can be accessed here.

Credits

This work was carried out under the supervision of Thierry Coquand.

References

  1. Coquand, T. 1996. Formal Topology with Posets. http://www.cse.chalmers.se/~coquand/formal.html
  2. Sambin, G. 2000. Formal Topology and Domains. Electronic Notes in Theoretical Computer Science. 35, (Jan. 2000), 177–190. DOI:https://doi.org/10.1016/S1571-0661(05)80742-X.

formal-topology-in-uf's People

Contributors

ayberkt avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar

Forkers

pnlph lemastero

formal-topology-in-uf's Issues

Prove Exercise II.1.5 from Stone Spaces

Show that a locale A is spatial iff each element of A can be expressed as a meet of prime elements. Show also that if A and B are spatial locales and f* : B -> A is left adjoint to f_* : A -> B then f^* preserves finite meets (i.e. is a frame homomorphism) iff f_* preserves prime elements.

Prove Exercise I.2.2 from Stone Spaces

Stone Spaces, pg. 12:

Verify that a subset of a Boolean algebra A is an ideal (prime ideal) of A considered as a lattice
iff it is an ideal (prime ideal) of A considered as a ring.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.