nLab effective topos proofs

Context

Topos Theory

topos theory

Background

Toposes

Internal Logic

Topos morphisms

Extra stuff, structure, properties

Cohomology and homotopy

In higher category theory

Theorems

Constructivism, Realizability, Computability

Contents

Overview

Here we give the proofs that are necessary to show that the definition of the effective topos does in fact give a well-defined category.

In general, this follows the strategy of taking a proof that the category of partial setoids (where an object is a set equipped with a partial equivalence relation and a morphism is a respectful functional relation) is a category, and keeping track of realizers at each step. The resulting partial recursive functions will generally be closely related to the corresponding proof terms under the Curry-Howard correspondence.

Equivalence relation

We first need to show that equivalence of effective functional relations is in fact an equivalence relation.

The reflexivity property is easy, since the identity function on ℕ\mathbb{N} works for e f,fe_{f,f}.

For symmetry, suppose that f,g⊆ℕ×X×Yf, g \subseteq \mathbb{N} \times X \times Y are two equivalent effective functional relations, and choose an equivalence tracker e f,g:ℕ⤏ℕe_{f,g} : \mathbb{N} \dashrightarrow \mathbb{N}, along with trackers d f,c f,…,d g,c g,…d_f, c_f, \ldots, d_g, c_g, \ldots associated with ff and gg being effective functional relations. Now, suppose that

n⊩x↦gy.n \Vdash x \xmapsto{g} y.

Then

n 1 ⊩ x≡x, n 1 ≔ d g(n) ⇒∃y′∈Y,n 2 ⊩ x↦fy′, n 2 ≔ t f(n 1) ⇒n 3 ⊩ x↦gy′, n 3 ≔ e f,g(n 2) ⇒n 4 ⊩ y′≡y, n 4 ≔ u g(n 3,n) ⇒n 5 ⊩ x↦fy, n 5 ≔ r f(n 2,n 1,n 4). \begin{array}{rclcrcl} n_1 & \Vdash & x \equiv x, & \quad & n_1 & \coloneqq & d_g(n) \\ \implies \exists y'\in Y, n_2 & \Vdash & x \xmapsto{f} y', & \quad & n_2 & \coloneqq & t_f(n_1) \\ \implies n_3 & \Vdash & x \xmapsto{g} y', & \quad & n_3 & \coloneqq & e_{f,g}(n_2) \\ \implies n_4 & \Vdash & y' \equiv y, & \quad & n_4 & \coloneqq & u_g(n_3, n) \\ \implies n_5 & \Vdash & x \xmapsto{f} y, & \quad & n_5 & \coloneqq & r_f(n_2, n_1, n_4). \end{array}

Now, it is easy to see that the function which takes nn and follows the steps on the right to calculate n 5n_5 is a partial recursive function, which satisfies the necessary property for e g,fe_{g,f}.

For transitivity, this is again easy: given equivalence trackers e f,ge_{f,g} and e g,he_{g,h}, then the composition e g,h∘e f,ge_{g,h} \circ e_{f,g} satisfies the necessary property for e f,he_{f,h}.

Well-definedness of category operations

Here, we first show that id X\operatorname{id}_X is an effective functional relation.

(Domain condition) Suppose

n⊩x↦id Xy.n \Vdash x \xmapsto{\operatorname{id}_X} y.

Then

n 1 ⊩ x≡y, n 1 ≔ n ⇒n 2 ⊩ y≡x, n 2 ≔ s X(n 1) ⇒n 3 ⊩ x≡x, n 3 ≔ t X(n 1,n 2). \begin{array}{rclcrcl} n_1 & \Vdash & x \equiv y, & \quad & n_1 & \coloneqq & n \\ \implies n_2 & \Vdash & y \equiv x, & \quad & n_2 & \coloneqq & s_X(n_1) \\ \implies n_3 & \Vdash & x \equiv x, & \quad & n_3 & \coloneqq & t_X(n_1, n_2). \end{array}

Therefore, the composition n↦n 3n \mapsto n_3 on the right satisfies the necessary property for d id Xd_{\operatorname{id}_X}.

(Codomain condition) Similarly, if we replace the last line in the proof directly above with

n 3⊩y≡y,n 3≔t X(n 2,n 1),n_3 \Vdash y \equiv y, \quad n_3 \coloneqq t_X(n_2, n_1),

then the composition n↦n 3n \mapsto n_3 on the right satisfies the necessary property for c id Xc_{\operatorname{id}_X}.

(Image uniqueness) Suppose

n⊩x↦id Xy 1n \Vdash x \xmapsto{\operatorname{id}_X} y_1

and

n⊩x↦id Xy 2.n \Vdash x \xmapsto{\operatorname{id}_X} y_2.

Then

n 1 ⊩ x≡y 1, n 1 ≔ n, n 2 ⊩ x≡y 2, n 2 ≔ m ⇒n 3 ⊩ y 1≡x, n 3 ≔ s X(n 1) ⇒n 4 ⊩ y 1≡y 2, n 4 ≔ t X(n 3,n 2). \begin{array}{rclcrcl} n_1 & \Vdash & x \equiv y_1, & \quad & n_1 & \coloneqq & n, \\ n_2 & \Vdash & x \equiv y_2, & \quad & n_2 & \coloneqq & m \\ \implies n_3 & \Vdash & y_1 \equiv x, & \quad & n_3 & \coloneqq & s_X(n_1) \\ \implies n_4 & \Vdash & y_1 \equiv y_2, & \quad & n_4 & \coloneqq & t_X(n_3, n_2). \end{array}

Therefore, the composition (n,m)↦n 4(n, m) \mapsto n_4 on the right satisfies the necessary property for u id Xu_{\operatorname{id}_X}.

(Totality) Suppose

n⊩x≡x.n \Vdash x \equiv x.

Then

n⊩x↦id Xx.n \Vdash x \xmapsto{\operatorname{id}_X} x.

Thus, the identity function satisfies the necessary property for t id Xt_{\operatorname{id}_X}.

(Respectfulness) Suppose

n⊩x 1↦id Xy 1,n \Vdash x_1 \xmapsto{\operatorname{id}_X} y_1,
m⊩x 1≡x 2,m \Vdash x_1 \equiv x_2,

and

p⊩y 1≡y 2.p \Vdash y_1 \equiv y_2.

Then

n 1 ⊩ x 1≡y 1, n 1 ≔ n, n 2 ⊩ x 2≡x 1, n 2 ≔ s X(m) ⇒n 3 ⊩ x 2≡y 1 n 3 ≔ t X(n 2,n 1) ⇒n 4 ⊩ x 2≡y 2 n 4 ≔ t X(n 3,p). \begin{array}{rclcrcl} n_1 & \Vdash & x_1 \equiv y_1, & \quad & n_1 & \coloneqq & n, \\ n_2 & \Vdash & x_2 \equiv x_1, & \quad & n_2 & \coloneqq & s_X(m) \\ \implies n_3 & \Vdash & x_2 \equiv y_1 & \quad & n_3 & \coloneqq & t_X(n_2, n_1) \\ \implies n_4 & \Vdash & x_2 \equiv y_2 & \quad & n_4 & \coloneqq & t_X(n_3, p). \end{array}

Therefore, the composition (n,m,p)↦n 4(n, m, p) \mapsto n_4 on the right satisfies the necessary property for r id Xr_{\operatorname{id}_X}.

Similarly, we need to show that the composition of two effective functional relations ff between YY and ZZ, and gg between XX and YY, is again an effective functional relation between XX and ZZ.

(Domain condition) Suppose

n⊩x↦f∘gz.n \Vdash x \xmapsto{f\circ g} z.

Then there exists y∈Yy\in Y such that

n 1 ⊩ x↦gy, n 1 ≔ p 1(n), n 2 ⊩ y↦fz, n 2 ≔ p 2(n) ⇒n 3 ⊩ x≡x, n 3 ≔ d g(n 1). \begin{array}{rclcrcl} n_1 & \Vdash & x \xmapsto{g} y, & \quad & n_1 & \coloneqq & p_1(n), \\ n_2 & \Vdash & y \xmapsto{f} z, & \quad & n_2 & \coloneqq & p_2(n) \\ \implies n_3 & \Vdash & x \equiv x, & \quad & n_3 & \coloneqq & d_g(n_1). \end{array}

Therefore, the composition n↦n 3n \mapsto n_3 on the right satisfies the necessary property for d f∘gd_{f\circ g}.

(Codomain condition) Similarly, if we replace the last line in the proof directly above with

n 3⊩y≡y,n 3≔c f(n 2),n_3 \Vdash y \equiv y, \quad n_3 \coloneqq c_f(n_2),

then the composition in n↦n 3n \mapsto n_3 on the right satisfies the necessary property for c f∘gc_{f\circ g}.

(Image uniqueness) Suppose

n⊩x↦f∘gz 1n \Vdash x \xmapsto{f\circ g} z_1

and

m⊩x↦f∘gz 2.m \Vdash x \xmapsto{f\circ g} z_2.

Then there exist y 1,y 2∈Yy_1, y_2 \in Y such that

n 1 ⊩ x↦gy 1, n 1 ≔ p 1(n), n 2 ⊩ y 1↦fz 1, n 2 ≔ p 2(n), n 3 ⊩ x↦gy 2, n 3 ≔ p 1(m), n 4 ⊩ y 2↦fz 2, n 4 ≔ p 2(m) ⇒n 5 ⊩ y 1≡y 2, n 5 ≔ u g(n 1,n 3) ⇒n 6 ⊩ z 1≡z 1, n 6 ≔ d f(n 2) ⇒n 7 ⊩ y 2↦fz 1, n 7 ≔ r f(n 2,n 5,n 6) ⇒n 8 ⊩ z 1≡z 2, n 8 ≔ u f(n 4,n 7). \begin{array}{rclcrcl} n_1 & \Vdash & x \xmapsto{g} y_1, & \quad & n_1 & \coloneqq & p_1(n), \\ n_2 & \Vdash & y_1 \xmapsto{f} z_1, & \quad & n_2 & \coloneqq & p_2(n), \\ n_3 & \Vdash & x \xmapsto{g} y_2, & \quad & n_3 & \coloneqq & p_1(m), \\ n_4 & \Vdash & y_2 \xmapsto{f} z_2, & \quad & n_4 & \coloneqq & p_2(m) \\ \implies n_5 & \Vdash & y_1 \equiv y_2, & \quad & n_5 & \coloneqq & u_g(n_1, n_3) \\ \implies n_6 & \Vdash & z_1 \equiv z_1, & \quad & n_6 & \coloneqq & d_f(n_2) \\ \implies n_7 & \Vdash & y_2 \xmapsto{f} z_1, & \quad & n_7 & \coloneqq & r_f(n_2, n_5, n_6) \\ \implies n_8 & \Vdash & z_1 \equiv z_2, & \quad & n_8 & \coloneqq & u_f(n_4, n_7). \end{array}

Therefore, the composition (n,m)↦n 8(n, m) \mapsto n_8 on the right satisfies the necessary property for u f∘gu_{f\circ g}.

(Totality) Suppose

n⊩x≡x.n \Vdash x \equiv x.

Then there exists y∈Yy\in Y such that

n 1 ⊩ x↦gy, n 1 ≔ t g(n) ⇒n 2 ⊩ y≡y, n 2 ≔ c g(n 1). \begin{array}{rclcrcl} n_1 & \Vdash & x \xmapsto{g} y, & \quad & n_1 & \coloneqq & t_g(n) \\ \implies n_2 & \Vdash & y \equiv y, & \quad & n_2 & \coloneqq & c_g(n_1). \end{array}

It follows that there exists z∈Zz\in Z such that

n 3 ⊩ y↦fz, n 3 ≔ t f(n 2) ⇒n 4 ⊩ x↦f∘gz, n 4 ≔ ⟨n 1,n 3. \begin{array}{rclcrcl} n_3 & \Vdash & y \xmapsto{f} z, & \quad & n_3 & \coloneqq & t_f(n_2) \\ \implies n_4 & \Vdash & x \xmapsto{f\circ g} z, & \quad & n_4 & \coloneqq & \langle n_1, n_3. \end{array}

Therefore, the composition n↦n 4n \mapsto n_4 on the right satisfies the necessary property for t f∘gt_{f\circ g}.

(Respectfulness) Suppose

n⊩x 1↦f∘gz 1,n \Vdash x_1 \xmapsto{f\circ g} z_1,
m⊩x 1≡x 2,m \Vdash x_1 \equiv x_2,

and

p⊩z 1≡z 2.p \Vdash z_1 \equiv z_2.

Then there exists y∈Yy\in Y such that

n 1 ⊩ x 1↦gy, n 1 ≔ p 1(n), n 2 ⊩ y↦fz 1, n 2 ≔ p 2(n) ⇒n 3 ⊩ y≡y, n 3 ≔ c g(n 1) ⇒n 4 ⊩ x 2↦gy, n 4 ≔ r g(n 1,m,n 3) ⇒n 5 ⊩ y↦fz 2, n 5 ≔ r f(n 2,n 3,p) ⇒n 6 ⊩ x 2↦f∘gz 2, n 6 ≔ ⟨n 4,n 5⟩. \begin{array}{rclcrcl} n_1 & \Vdash & x_1 \xmapsto{g} y, & \quad & n_1 & \coloneqq & p_1(n), \\ n_2 & \Vdash & y \xmapsto{f} z_1, & \quad & n_2 & \coloneqq & p_2(n) \\ \implies n_3 & \Vdash & y \equiv y, & \quad & n_3 & \coloneqq & c_g(n_1) \\ \implies n_4 & \Vdash & x_2 \xmapsto{g} y, & \quad & n_4 & \coloneqq & r_g(n_1, m, n_3) \\ \implies n_5 & \Vdash & y \xmapsto{f} z_2, & \quad & n_5 & \coloneqq & r_f(n_2, n_3, p) \\ \implies n_6 & \Vdash & x_2 \xmapsto{f\circ g} z_2, & \quad & n_6 & \coloneqq & \langle n_4, n_5 \rangle. \end{array}

Therefore, the composition (n,m,p)↦n 6(n, m, p) \mapsto n_6 on the right satisfies the necessary property for r f∘gr_{f\circ g}.

Finally, we show that composition is well-defined up to equivalence of effective functional relations. Thus, suppose we have equivalence trackers e g 1,g 2e_{g_1, g_2} and e f 1,f 2e_{f_1, f_2}, where f if_i are effective functional relations between YY and ZZ, and g ig_i are effective functional relations between XX and YY. Then whenever

n⊩x↦f 1∘g 1z,n \Vdash x \xmapsto{f_1 \circ g_1} z,

then there exists y∈Yy\in Y such that

n 1 ⊩ x↦g 1y, n 1 ≔ p 1(n), n 2 ⊩ y↦f 1z, n 2 ≔ p 2(n) ⇒n 3 ⊩ x↦g 2y, n 3 ≔ e g 1,g 2(n 1) ⇒n 4 ⊩ y↦f 2z, n 4 ≔ e f 1,f 2(n 2) ⇒n 5 ⊩ x↦f 2∘g 2z, n 5 ≔ ⟨n 3,n 4⟩. \begin{array}{rclcrcl} n_1 & \Vdash & x \xmapsto{g_1} y, & \quad & n_1 & \coloneqq & p_1(n), \\ n_2 & \Vdash & y \xmapsto{f_1} z, & \quad & n_2 & \coloneqq & p_2(n) \\ \implies n_3 & \Vdash & x \xmapsto{g_2} y, & \quad & n_3 & \coloneqq & e_{g_1, g_2}(n_1) \\ \implies n_4 & \Vdash & y \xmapsto{f_2} z, & \quad & n_4 & \coloneqq & e_{f_1, f_2}(n_2) \\ \implies n_5 & \Vdash & x \xmapsto{f_2 \circ g_2} z, & \quad & n_5 & \coloneqq & \langle n_3, n_4 \rangle. \end{array}

Therefore, the composition n↦n 5n \mapsto n_5 on the right satisfies the necessary property for e f 1∘g 1,f 2∘g 2e_{f_1 \circ g_1, f_2 \circ g_2}.

Identity properties

In order to establish the identity properties of the category, it suffices to show that for ff an effective functional relation between XX and YY, id Y∘f\operatorname{id}_Y \circ f and f∘id Xf \circ \operatorname{id}_X are both equivalent to ff. Thus, suppose that

n⊩x↦fy.n \Vdash x \xmapsto{f} y.

Then

n 1 ⊩ y≡y, n 1 ≔ c f(n) ⇒n 2 ⊩ y↦id Yy, n 2 ≔ n 1 ⇒n 3 ⊩ x↦id Y∘fy, n 2 ≔ ⟨n,n 2⟩. \begin{array}{rclcrcl} n_1 & \Vdash & y \equiv y, & \quad & n_1 & \coloneqq & c_f(n) \\ \implies n_2 & \Vdash & y \xmapsto{\operatorname{id}_Y} y, & \quad & n_2 & \coloneqq & n_1 \\ \implies n_3 & \Vdash & x \xmapsto{\operatorname{id}_Y \circ f} y, & \quad & n_2 & \coloneqq & \langle n, n_2 \rangle. \end{array}

Therefore, the composition n↦n 3n \mapsto n_3 on the right satisfies the necessary property for e f,id Y∘fe_{f, \operatorname{id}_Y \circ f}.

Similarly,

n 1 ⊩ x≡x, n 1 ≔ d f(n) ⇒n 2 ⊩ x↦id Xx, n 2 ≔ n 1 ⇒n 3 ⊩ x↦f∘id Xy, n 3 ≔ ⟨n 2,n⟩. \begin{array}{rclcrcl} n_1 & \Vdash & x \equiv x, & \quad & n_1 & \coloneqq & d_f(n) \\ \implies n_2 & \Vdash & x \xmapsto{\operatorname{id}_X} x, & \quad & n_2 & \coloneqq & n_1 \\ \implies n_3 & \Vdash & x \xmapsto{f \circ \operatorname{id}_X} y, & \quad & n_3 & \coloneqq & \langle n_2, n \rangle. \end{array}

Therefore, the composition n↦n 3n \mapsto n_3 on the right satisfies the necessary property for e f,f∘id Xe_{f, f \circ \operatorname{id}_X}.

Associativity of composition

In order to establish associativity of composition in the category, it suffices to show that for ff an effective functional relation between ZZ and WW, gg an effective functional relation between YY and ZZ, and hh an effective functional relation between XX and YY, then f∘(g∘h)f \circ (g\circ h) is equivalent to (f∘g)∘h(f\circ g) \circ h. Thus, suppose that

n⊩x↦f∘(g∘h)w.n \Vdash x \xmapsto{f\circ (g\circ h)} w.

Then there exists z∈Zz\in Z such that

n 1 ⊩ x↦g∘hz, n 1 ≔ p 1(n), n 2 ⊩ z↦fw, n 2 ≔ p 2(n). \begin{array}{rclcrcl} n_1 & \Vdash & x \xmapsto{g\circ h} z, & \quad & n_1 & \coloneqq & p_1(n), \\ n_2 & \Vdash & z \xmapsto{f} w, & \quad & n_2 & \coloneqq & p_2(n). \end{array}

By the g∘hg\circ h condition, we can also find y∈Yy\in Y such that

n 3 ⊩ x↦hy, n 3 ≔ p 1(n 1), n 4 ⊩ y↦gz, n 4 ≔ p 2(n 1) ⇒n 5 ⊩ y↦f∘gw, n 5 ≔ ⟨n 4,n 2⟩ ⇒n 6 ⊩ x↦(f∘g)∘hw, n 6 ≔ ⟨n 3,n 5⟩. \begin{array}{rclcrcl} n_3 & \Vdash & x \xmapsto{h} y, & \quad & n_3 & \coloneqq & p_1(n_1), \\ n_4 & \Vdash & y \xmapsto{g} z, & \quad & n_4 & \coloneqq & p_2(n_1) \\ \implies n_5 & \Vdash & y \xmapsto{f\circ g} w, & \quad & n_5 & \coloneqq & \langle n_4, n_2 \rangle \\ \implies n_6 & \Vdash & x \xmapsto{(f\circ g)\circ h} w, & \quad & n_6 & \coloneqq & \langle n_3, n_5 \rangle. \end{array}

Therefore, the composition n↦n 6n \mapsto n_6 on the right satisfies the necessary property for e f∘(g∘h),(f∘g)∘he_{f \circ (g \circ h), (f\circ g) \circ h}. (This composition can be described as the function ⟨⟨a,b⟩,c⟩↦⟨a,⟨b,c⟩⟩\langle \langle a, b \rangle, c \rangle \mapsto \langle a, \langle b, c \rangle \rangle.)

Last revised on October 29, 2026 at 00:56:40. See the history of this page for a list of all contributions to it.