All Projects → ayberkt → formal-topology-in-UF

ayberkt / formal-topology-in-UF

Licence: GPL-3.0 license
Formal Topology in Univalent Foundations (WIP).

Programming Languages

CSS
56736 projects
shell
77523 projects
Makefile
30231 projects

Projects that are alternatives of or similar to formal-topology-in-UF

SymmetryBookFormalization
Univalent mathematics in Agda
Stars: ✭ 117 (+333.33%)
Mutual labels:  homotopy-type-theory, univalent-foundations, univalent-mathematics
TypeTopology
Logical manifestations of topological concepts, and other things. This version adopts the univalent point of view.
Stars: ✭ 132 (+388.89%)
Mutual labels:  homotopy-type-theory, univalent-foundations, univalent-mathematics
Topology
A diagram (topology, UML) framework uses canvas and typescript. 一个轻量(100k左右)、功能丰富的绘图工具(微服务架构图、拓扑图、流程图、类图等UML图、脑图,动画、视频支持)。 【在线使用】:
Stars: ✭ 3,270 (+12011.11%)
Mutual labels:  topology
task schedule
(C++)基于图数据结构与拓扑序列的任务调度demo
Stars: ✭ 53 (+96.3%)
Mutual labels:  topology
data
A community database of topological counterexamples
Stars: ✭ 42 (+55.56%)
Mutual labels:  topology
topology
拓扑图组件
Stars: ✭ 29 (+7.41%)
Mutual labels:  topology
cat
A formalization of category theory in cubical Agda
Stars: ✭ 50 (+85.19%)
Mutual labels:  homotopy-type-theory
Mockedstreams
Scala DSL for Unit-Testing Processing Topologies in Kafka Streams
Stars: ✭ 184 (+581.48%)
Mutual labels:  topology
Brain-Tumor-Segmentation-using-Topological-Loss
A Tensorflow Implementation of Brain Tumor Segmentation using Topological Loss
Stars: ✭ 28 (+3.7%)
Mutual labels:  topology
Idris-HoTT
Homotopy Type Theory proofs in Idris
Stars: ✭ 19 (-29.63%)
Mutual labels:  homotopy-type-theory
RamaNet
Preforms De novo protein design using machine learning and PyRosetta to generate a novel protein structure
Stars: ✭ 41 (+51.85%)
Mutual labels:  topology
reed-thesis
My undergradate thesis on coinductive types in univalent type theory
Stars: ✭ 14 (-48.15%)
Mutual labels:  univalent-foundations
qtopology
Distributed stream processing layer
Stars: ✭ 20 (-25.93%)
Mutual labels:  topology
persim
Distances and representations of persistence diagrams
Stars: ✭ 98 (+262.96%)
Mutual labels:  topology
topology.js
A diagram visualization framework uses canvas and typescript. Developers are able to build topology, UML, diagram, architecture, mind, SCADA and so on.
Stars: ✭ 148 (+448.15%)
Mutual labels:  topology
Jtopo topology
基于 jtopo 二次封装,拓扑图编辑器
Stars: ✭ 197 (+629.63%)
Mutual labels:  topology
Asistente-LADM-COL
Complemento para QGIS v3 que permite capturar, consultar, mantener, validar y exportar datos conformes con el modelo LADM-COL.
Stars: ✭ 22 (-18.52%)
Mutual labels:  topology
ntmap
Network topology map using Netbox as a data source
Stars: ✭ 74 (+174.07%)
Mutual labels:  topology
silicate
A general form for complex data
Stars: ✭ 46 (+70.37%)
Mutual labels:  topology
SkeletonMatching
This repository implements skeleton matching algorithm.
Stars: ✭ 30 (+11.11%)
Mutual labels:  topology

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.
Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].