nLab synthetic topology

Contents

Context

Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logicset theory (internal logic of)category theorytype theory
propositionsetobjecttype
predicatefamily of setsdisplay morphismdependent type
proofelementgeneralized elementterm/program
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
introduction rule for implicationcounit for hom-tensor adjunctionlambda
elimination rule for implicationunit for hom-tensor adjunctionapplication
cut elimination for implicationone of the zigzag identities for hom-tensor adjunctionbeta reduction
identity elimination for implicationthe other zigzag identity for hom-tensor adjunctioneta conversion
truesingletonterminal object/(-2)-truncated objecth-level 0-type/unit type
falseempty setinitial objectempty type
proposition, truth valuesubsingletonsubterminal object/(-1)-truncated objecth-proposition, mere proposition
logical conjunctioncartesian productproductproduct type
disjunctiondisjoint union (support of)coproduct ((-1)-truncation of)sum type (bracket type of)
implicationfunction set (into subsingleton)internal hom (into subterminal object)function type (into h-proposition)
negationfunction set into empty setinternal hom into initial objectfunction type into empty type
universal quantificationindexed cartesian product (of family of subsingletons)dependent product (of family of subterminal objects)dependent product type (of family of h-propositions)
existential quantificationindexed disjoint union (support of)dependent sum ((-1)-truncation of)dependent sum type (bracket type of)
logical equivalencebijection setobject of isomorphismsequivalence type
support setsupport object/(-1)-truncationpropositional truncation/bracket type
n-image of morphism into terminal object/n-truncationn-truncation modality
equalitydiagonal function/diagonal subset/diagonal relationpath space objectidentity type/path type
completely presented setsetdiscrete object/0-truncated objecth-level 2-type/set/h-set
setset with equivalence relationinternal 0-groupoidBishop set/setoid with its pseudo-equivalence relation an actual equivalence relation
equivalence class/quotient setquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
-0-truncated higher colimitquotient inductive type
coinductionlimitcoinductive type
presettype without identity types
set of truth valuessubobject classifiertype of propositions
domain of discourseuniverseobject classifiertype universe
modalityclosure operator, (idempotent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels

semantics

Topology

topology (point-set topology, point-free topology)

see also differential topology, algebraic topology, functional analysis and topological homotopy theory

Introduction

Basic concepts

Universal constructions

Extra stuff, structure, properties

Examples

Basic statements

Theorems

Analysis Theorems

topological homotopy theory

Contents

Idea

Synthetic topology, like synthetic domain theory, synthetic differential geometry, and synthetic computability, are part of synthetic mathematics. It uses the internal logic of a topos to develop a part of mathematics. In this case topology. This is closely related to topology via logic and abstract Stone duality.

The formal system of type theory has semantics in many categories, and in particular in many categories of “spaces”. Thus types may be regarded not just as sets but as topological objects. Interestingly, a good deal of this “topology” can be detected intrinsically in type theory, often corresponding to the possible failure of principles of classical mathematics.

Dictionary

Martín Escardó has given the following translations between the two fields:

general topologytype theory
spacetype
continuous functionfunction
clopen setdecidable set
open setsemi-decidable set
closed setset with semi-decidable complement
discrete spacetype with decidable equality
Hausdorff spacetype with semi-decidable inequality
convergent sequencemap out of \mathbb{N}_\infty (see below)
compact setexhaustively searchable set, in a finite number of steps

It should be stressed that the concepts on the right are not the only ways to represent the topological concepts on the left in type theory. For instance, in cohesive homotopy type theory there is a notion of “discrete space” that has nothing to do with decidable equality (in particular, in homotopy type theory a type with decidable equality is necessarily an h-set, whereas discrete spaces don’t need to be h-sets).

Semantics

There are many different topological semantics for type theory, but one which seems especially closely related to the above dictionary is the topological topos. For instance, in that case the internally defined set \mathbb{N}_\infty (the set of infinite decreasing binary sequences) really does get interpreted semantically as “the generic convergent sequence”.

Implementation

Many of the results that have originated from this view have been implemented in an Agda library.

References

Last revised on December 28, 2022 at 02:08:00. See the history of this page for a list of all contributions to it.