Finn Lawler thesis outline (Rev #3)

This page is for material relevant to my Ph.D. thesis — I will try to sketch the important bits here as I write up the document itself.

Chapter 2

There are two quite different ways to construct the effective topos: we start with the Kleene algebra (ℕ,⋅)(\mathbb{N}, \cdot) of partial recursive functions, and then

  1. construct the effective tripos,

    • this is the hyperdoctrine over SetSet whose predicates over XX are ℕ\mathbb{N}-valued sets X→PℕX \to P\mathbb{N}, ordered by ϕ≤ψ\phi \leq \psi if there exists a partial recursive function Φ\Phi such that for any x∈Xx \in X and n∈ϕxn \in \phi x, Φn\Phi n is defined and contained in ψx\psi x.

    and then take its category of partial equivalence relations; or

  2. construct the regular category of assemblies over ℕ\mathbb{N}

    • …

    and take its exact completion.

We show how the two are related.

The category of pers

Let E→B\mathbf{E} \to \mathbf{B} be an ordered regular fibration. A partial equivalence relation over the type X∈BX \in \mathbf{B} is relation RR on XX that is symmetric and transitive:

R(x 1,x 2) ⇒R(x 2,x 1) R(x 1,x 2),R(x 2,x 3) ⇒R(x 1,x 3) \begin{aligned} R(x_1, x_2) & \Rightarrow R(x_2, x_1) \\ R(x_1, x_2), R(x_2, x_3) & \Rightarrow R(x_1, x_3) \end{aligned}

A morphism (R,X)→(S,Y)(R, X) \to (S, Y) of pers is a relation F:X,YF \colon X, Y that satisfies

F(x,y) ⇒R(x,x)∧S(y,y) F(x 1,y 1)∧R(x 1,x 2)∧S(y 1,y 2) ⇒F(x 2,y 2) F(x,y 1)∧F(x,y 2) ⇒S(y 1,y 2) R(x,x) ⇒∃υ.F(x,υ) \begin{aligned} F(x,y) & \Rightarrow R(x,x) \wedge S(y,y) \\ F(x_1,y_1) \wedge R(x_1, x_2) \wedge S(y_1, y_2) & \Rightarrow F(x_2,y_2) \\ F(x,y_1) \wedge F(x,y_2) & \Rightarrow S(y_1,y_2) \\ R(x,x) & \Rightarrow \exists \upsilon . F(x, \upsilon) \end{aligned}

These form a category Per(E→B)Per(\mathbf{E} \to \mathbf{B}). The effective topos is PerPer of the effective tripos.

The exact completion

  • allegory Rel(Asm)Rel(\mathbf{Asm}) is unitary, tabular.
  • effective completion is splitting of equivalences Rel(Asm)[eqvˇ]Rel(\mathbf{Asm})[\check{\mathrm{eqv}}].
  • exact completion is category of maps in this.

Allegories vs. bicategories of relations

A unitary pre-tabular allegory is the same thing as a bicategory of relations. This extends to an equivalence of 2-categories.

We define a framed bicategory of relations to be a (locally ordered) framed bicategory that is a bicategory of relations in which all cartesian-product structure morphisms are ‘tight’ (or ‘representable’) maps. Then

Theorem

The 2-categories of ordered regular fibrations and of framed bicategories of relations are equivalent.

…

Revision on November 22, 2012 at 23:38:26 by Finn Lawler?. See the history of this page for a list of all contributions to it.