Movatterモバイル変換


[0]ホーム

URL:


nLab realizability topos

Skip the Navigation Links |Home Page |All Pages |Latest Revisions |Discuss this page |
Contents

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

constructive mathematics,realizability,computability

intuitionistic mathematics

propositions as types,proofs as programs,computational trinitarianism

Constructive mathematics

Realizability

Computability

Contents

Idea

A realizability topos is atopos which embodies therealizability interpretation ofintuitionisticnumber theory (due to Kleene) as part of itsinternal logic. Realizability toposes form an important class ofelementary toposes that are notGrothendieck toposes, and don’t even have ageometric morphism toSet.

The input datum for forming a realizability topos is apartial combinatory algebra, or PCA.

Constructions

There are a number of approaches toward constructing realizability toposes. One is throughtripos theory, and another is through assemblies (actually the latter is a family of related approaches).

LetAA be aPCA — inSet, for simplicity, but similar constructions usually work over other base toposes.

Via tripos theory

There is atripos whose base category isSetSet and for which the preorderPA(X)P_A(X) ofXX-indexed predicates is the setP(A)XP(A)^X of functions fromXX to thepowersetP(A)P(A) ofAA. The order relation setsϕψ\phi \le \psi if there existsaAa\in A such thatbϕ(x)b\in \phi(x) impliesabψ(x)a\cdot b \in \psi(x) for allxx; note thataa must be chosen uniformly across allxXx\in X.

Applying the tripos-to-topos construction to this tripos produces the realizability topos overAA. Seetripos for details.

Via assemblies

LetAsmAAsm_A be the category ofassemblies on apartial combinatory algebraAA, and letPAsmAPAsm_A be the category ofpartitioned assemblies onAA.

Definition

Therealizability topos is theex/reg completion ofAsmAAsm_A.

Theorem

In the presence of theaxiom of choice, the realizability topos is theex/lex completion ofPAsmAPAsm_A, since with choiceAsmAAsm_A is thereg/lex completion ofPAsmAPAsm_A.

Remark

A general result about the ex/lex completionCex/lexC_{ex/lex} of a left exact categoryCC is that it has enough regularprojectives, meaning objectsPP such thathom(P,):Cex/lexSet\hom(P, -) \colon C_{ex/lex} \to Set preserves regular epis. In fact, the regular projective objects coincide with the objects ofCC (as a subcategory ofCex/lexC_{ex/lex}). Of course, whenCex/lexC_{ex/lex} is a topos, where every epi is regular, this meansCex/lexC_{ex/lex} has enough projectives, or satisfies (external)COSHEP. It also satisfies internalCOSHEP, since binary products of projectives, i.e., products of objects ofCC, are again objects ofCC (seethis result).

Remark

The fact that a realizability topos is an ex/lex completion depends on theaxiom of choice forSet, since it requires the partitioned assemblies to be projective objects therein. In the absence of the axiom of choice, the projective objects in a realizability topos are the (isomorphs of) partitioned assemblies whose underlying set isprojective inSet. Thus, ifCOSHEP holds inSet, then a realizability topos is the ex/wlex completion of the category of such “projective partitioned assemblies” (wlex because this category may not have finite limits, only weak finite limits). Without some choice principle, the realizability topos may not be an ex/wlex completion at all; but it is still an ex/reg completion ofAsmAAsm_A.

Properties

Axiomatic characterization

The following is a statement characterizing realizability toposes which is analogous to theGiraud axioms characterizingGrothendieck toposes.

Theorem

Alocally small category\mathcal{E} is (equivalent to) a realizability topos precisely if

  1. \mathcal{E} isexact andlocally cartesian closed;

  2. \mathcal{E} hasenough projectives and thefull subcategoryProj()Proj(\mathcal{E}) \hookrightarrow \mathcal{E} has allfinite limits;

  3. theglobal sectionfunctorΓ(*,):\Gamma \coloneqq \mathcal{E}(\ast,-) \colon \mathcal{E}\longrightarrowSet

    1. has aright adjoint:Set\nabla \colon Set \hookrightarrow \mathcal{E} (which is necessarily areflective inclusion makingΓ\nabla \Gamma a finite-limit preservingidempotent monad/closure operator);

    2. \nabla factors throughProj()Proj(\mathcal{E});

  4. there exists an objectDProj()D \in Proj(\mathcal{E}) such that

    1. DD isΓ\nabla\Gamma-separated (in that its(Γ)(\Gamma \dashv \nabla)-unit is amonomorphism);

    2. allΓ\nabla \Gamma-closedregular epimorphisms have theleft lifting property againstD*D\to \ast;

    3. for everyprojective objectPP there is aΓ\nabla \Gamma-closed morphismPDP \to D.

This is due to (Frey 2014)

Related concepts

References

  • Stijn Vermeeren,Realizability Toposes, 2009 (pdf)

  • Matías Menni, Exact completions and toposes. Ph.D. Thesis, University of Edinburgh (2000). (web)

Ondomain theory in realizability toposes:

  • Wesley Phoa,Domain theory in realizability toposes, author’s thesis (Ph.D.)–Trinity College, Cambridge, November 1990.

A characterization of realizability toposes analogous to theGiraud axioms forGrothendieck toposes is given in

Last revised on June 22, 2025 at 14:14:18. See thehistory of this page for a list of all contributions to it.

EditDiscussPrevious revisionChanges from previous revisionHistory (26 revisions)CitePrintSource

[8]ページ先頭

©2009-2025 Movatter.jp