nLab Tarski universe

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

Equality and Equivalence

Universes

Contents

Idea

In intensional type theory and homotopy type theory, there are typically two ways to construct a “type of small types”. One way is by Russell universes, where a term A:UA:U of a type universe UU is literally a type AtypeA \; \mathrm{type}. The alternative is by Tarski universes, where terms A:UA:U are not literally types, but rather the universe type UU comes with the additional structure of a type family TT, such that the dependent type T(A)T(A) represents the actual type. Usually universes are defined in intensional type theory and homotopy type theory using derivations and rules?, such as the type reflection rule

ΓA:UΓT(A)type\frac{\Gamma \vdash A:U}{\Gamma \vdash T(A) \; \mathrm{type}}

for Tarski universes. Furthermore, universes are usually defined as being closed under all type formers inside the type theory, regardless of the type theory.

However, this approach of defining Tarski universes means that the notion of “Tarski universe” differs from type theory to type theory. By this approach, a Tarski universe in the bare intensional Martin-Löf type theory, which has identity types, dependent product types, dependent sum types, an empty type, a unit type, a booleans type, and a natural numbers type, would not be considered a Tarski universe in homotopy type theory, since it is missing important type formers present in homotopy type theory, such as internal pushout types, a torus type?, propositional truncations, W-types, and localizations. On the other hand, one could consider an even more spartan type theory which doesn’t even have the unit type, let alone the empty type, the natural numbers type, and the booleans type, whose Tarski universes are thus consisting of only internal identity types, dependent product types, dependent sum types.

All three notions of Tarski universe described above are in fact definable in all three versions of intensional type theory mentioned above, but Tarski universes are usually described as having, apart from addiitonal internal Tarski universes, exactly the internal type formers that the external type theory has. One usually doesn’t consider Tarski universes with an internal James construction type in bare intensional Martin-Löf type theory, even though a Tarski universe closed under James constructions is definable in Martin-Löf type theory. On the other hand, in homotopy type theory the name “Tarski universe” isn’t usually used for a universe only closed under identity types, dependent product types, dependent sum types.

From a global perspective, however, all of these types should be considered Tarski universes, since they model some notion of type of small types, even though the small types in the universe do not behave as the external types in the type theory do. And that is how we approach Tarski universes in this article: Tarski universes are a very general notion encompassing all of the above notions of Tarski universe and more, and one could describe more specific versions of Tarski universes by adding additional structure and axioms to Tarski universes, in the same way one adds additional structure and axioms to an abelian group to get a ring, a commutative ring, a RR-module, a RR-algebra, and an RR-commutative algebra. We could then study in general Tarski universes and their properties as we do for abelian groups and rings. This requires a shift in the point of view of what Tarski universes are: Tarski universes are actual mathematical structure in intensional type theory, rather than being something in the foundations of mathematics to merely address size? issues or do mathematics in.

Definition

With a family of types

A Tarski universe or universe à la Tarski is simply a type UU with a type family TT whose dependent types T(A)T(A) are indexed by terms A:UA:U. The terms A:UA:U are usually called UU-small types, or small types for short, and T(A)T(A) is the type of terms of AA.

With a type and a function

A Tarski universe or universe à la Tarski is a type UU of all UU-small types with a type TT' of all terms, and a function typeOf:TU\mathrm{typeOf}:T' \to U which gets the associated type for every term a:Ta:T'.

Equivalence of definitions

From one direction, the individual dependent types T(A)T(A) could be defined as the fiber type of typeOf\mathrm{typeOf} at AA

T(A)fiber T,U(typeOf,A)T(A) \coloneqq \mathrm{fiber}_{T', U}(\mathrm{typeOf},A)

From the other direction, the entire type of terms TT' is just the dependent sum type of all the type reflections of small types

T A:UT(A)T' \coloneqq \sum_{A:U} T(A)

We shall be using the first definition throughout this article, but everything could be translated into the second definition of a Tarski universe.

Tarski universes as models of type theory

The definitions above are already enough to build an internal model of dependent type theory inside the Tarski universe:

  • The type AtypeA \; \mathrm{type} is represented by the small type A:UA:U
  • The term a:Aa:A is represented by the term a:T(A)a:T(A) for small type A:UA:U.
  • The type family BB indexed by the type AtypeA \; \mathrm{type} is represented by the function B:T(A)UB:T(A) \to U for small type A:UA:U
  • The dependent type a:ABtypea:A \vdash B \; \mathrm{type} is represented by the section B(a):UB(a):U for term a:T(A)a:T(A) and small type A:UA:U.
  • The section a:Ab:Ba:A \vdash b:B is represented by the term b:T(B(a))b:T(B(a)) for term a:T(A)a:T(A) and small type A:UA:U.

Univalence

There are two notions of equivalence in a Tarski universe (U,T)(U, T), equality A= UBA =_U B and equivalence T(A)T(B)T(A) \simeq T(B). By the properties of the identity type, there is a canonical transport dependent function

transport T: A:U B:U(A= UB)T(A)T(B)\mathrm{transport}^T:\prod_{A:U} \prod_{B:U} (A =_U B) \to T(A) \simeq T(B)

A Tarski universe is a univalent Tarski universe if for all terms A:UA:U and B:UB:U the function transport T(A,B)\mathrm{transport}^T(A, B) is an equivalence of types

A:U B:UisEquiv(transport T(A,B))\prod_{A:U} \prod_{B:U} \mathrm{isEquiv}(\mathrm{transport}^T(A, B))

This is the extensionality principle for any Tarski universe (U,T)(U, T).

Equivalently, by the fundamental theorem of identity types, a Tarski universe is a univalent Tarski universe if it comes with a dependent function

t: X:UC(X,X,id X)J(t): A:U B:U R:T(A)T(B)C(A,B,R)t:\prod_{X:U} C(X, X, \mathrm{id}_X) \vdash J(t):\prod_{A:U} \prod_{B:U} \prod_{R:T(A) \simeq T(B)} C(A, B, R)

and a dependent function

t: X:UC(X,X,id X)β(t): A:UJ(t,A,A,id A)= C(A,A,id A)t(A)t:\prod_{X:U} C(X, X, \mathrm{id}_X) \vdash \beta(t):\prod_{A:U} J(t, A, A, \mathrm{id}_A) =_{C(A, A, \mathrm{id}_A)} t(A)

When the Tarski universe is closed under identity types, dependent sum types, and dependent product types (see below for more on closure of Tarski universes under type formers), one is able to internalize the type of equivalences in the universe as A UBA \simeq_U B. It can be proven that T(A UB)T(A \simeq_U B) is equivalent to T(A)T(B)T(A) \simeq T(B), and that the definition of univalence using transport is equivalent to the usual definition given by the internal type of equivalences and the canonical function idtoequiv\mathrm{idtoequiv}. See at Univalence axiom#For Tarski universes for more details on this.

Construction of univalent Tarski universes via a higher inductive type

Let (U,T)(U, T) be a Tarski universe. Then one could construct a univalent Tarski universe as the higher inductive type (U,T)(U', T') generated by

  • a function F:UUF:U \to U'
  • a function G(A):T(A)T(A)G(A):T(A) \to T'(A) for all terms a:Ua:U
  • a dependent function
    ua U: A:U B:UisEquiv(transport T(A,B))\mathrm{ua}_{U'}:\prod_{A:U} \prod_{B:U} \mathrm{isEquiv}(\mathrm{transport}^{T'}(A, B))

Tarski universes with all propositions

A Tarski universe (U,T)(U, T) has all propositions if given a type AA with a family of identities x:A,y:Aτ 1(x,y):x= Ayx:A, y:A \vdash \tau_{-1}(x, y):x =_A y, the universe UU comes with the structure of an element A U:UA_U:U and an equivalence δ A:T(A U)A\delta_A:T(A_U) \simeq A.

The rules for this condition on Tarski universes is as follows:

ΓAtypeΓ,x:A,y:Aτ 1(x,y):x= AyΓA U:UΓAtypeΓ,x:A,y:Aτ 1(x,y):x= AyΓδ A:T(A U)A\frac{\Gamma \vdash A \; \mathrm{type} \quad \Gamma, x:A, y:A \vdash \tau_{-1}(x, y):x =_A y}{\Gamma \vdash A_U:U} \qquad \frac{\Gamma \vdash A \; \mathrm{type} \quad \Gamma, x:A, y:A \vdash \tau_{-1}(x, y):x =_A y}{\Gamma \vdash \delta_A:T(A_U) \simeq A}

Given a Tarski universe which has all propositions, the type A:UisProp(T(A))\sum_{A:U} \mathrm{isProp}(T(A)) is the type of all propositions. This is a form of strong impredicativity in the type theory, as given a type AA, the type A A:UisProp(T(A))A \to \sum_{A:U} \mathrm{isProp}(T(A)) is the power set on AA.

Closure of Tarski universes under type formers

There are many ways of defining type formers internally in a universe:

  • by an equivalence or definitional equality with an existing global type former for the entire type theory.

  • by translating the rules for the type former into internal structure on the universe

  • by using the universal properties corresponding to the categorical semantics of the types

Using a definitional equality with an existing global type former for each type former results in a strict Tarski universe, while using equivalences for each type former results in a weak Tarski universe. There are also various Tarski universes where some type formers are strictly closed, and some type formers are only weakly closed, resulting in Tarski universes which are intermediate between strict Tarski universes and weak Tarski universes.

Empty type

A Tarski universe is closed under the empty type if the universe comes with

  • a term U:U\emptyset_U:U
  • a dependent function
    ind : C:T( U)U p:T( U)T(C(p))\mathrm{ind}_\emptyset:\prod_{C:T(\emptyset_U) \to U} \prod_{p:T(\emptyset_U)} T(C(p))
  • a dependent function
    η : C:T( U)U p:T( U)isContr(T(C(p)))\eta_\emptyset:\prod_{C:T(\emptyset_U) \to U} \prod_{p:T(\emptyset_U)} \mathrm{isContr}(T(C(p)))

If the type theory has an empty type type\emptyset \; \mathrm{type} external to the Tarski, universe, then an equivalence smallemptytype:T( U)\mathrm{smallemptytype}:T(\emptyset_U) \simeq \emptyset could be constructed. A Tarski universe is strictly closed under the empty type if there is a definitional equality T( U)T(\emptyset_U) \equiv \emptyset.

Unit type

A Tarski universe is closed under the unit type if the universe comes with

  • a term 𝟙 U:U\mathbb{1}_U:U
  • a term *:T(𝟙 U)*:T(\mathbb{1}_U)
  • a dependent function
    ind 𝟙: C:T(𝟙 U)U p:T(𝟙 U)T(C(*))T(C(p))\mathrm{ind}_\mathbb{1}: \prod_{C:T(\mathbb{1}_U) \to U} \prod_{p:T(\mathbb{1}_U)} T(C(*)) \to T(C(p))
  • a dependent function
    β 𝟙: C:T(𝟙 U)UisContr(T(C(*)))\beta_\mathbb{1}:\prod_{C:T(\mathbb{1}_U) \to U} \mathrm{isContr}(T(C(*)))
  • a dependent function
    η 𝟙: C:T(𝟙 U)U p:T(𝟙 U)isContr(T(C(*)))isContr(T(C(p)))\eta_\mathbb{1}:\prod_{C:T(\mathbb{1}_U) \to U} \prod_{p:T(\mathbb{1}_U)} \mathrm{isContr}(T(C(*))) \to \mathrm{isContr}(T(C(p)))

If the type theory has an unit type 𝟙type\mathbb{1} \; \mathrm{type} external to the Tarski, universe, then an equivalence smallunittype:T(𝟙 U)𝟙\mathrm{smallunittype}:T(\mathbb{1}_U) \simeq \mathbb{1} could be constructed. A Tarski universe is strictly closed under the unit type if there is a definitional equality T(𝟙 U)𝟙T(\mathbb{1}_U) \equiv \mathbb{1}.

Booleans type

A Tarski universe is closed under the booleans type if the universe comes with

  • a term 𝟚 U:U\mathbb{2}_U:U
  • a term 0:T(𝟚 U)0:T(\mathbb{2}_U)
  • a term 1:T(𝟚 U)1:T(\mathbb{2}_U)
  • a dependent function
    ind 𝟚: C:T(𝟚 U)U p:T(𝟚 U)T(C(0))×T(C(1))T(C(p))\mathrm{ind}_\mathbb{2}: \prod_{C:T(\mathbb{2}_U) \to U} \prod_{p:T(\mathbb{2}_U)} T(C(0)) \times T(C(1)) \to T(C(p))
  • a dependent function
    β 𝟚 0: C:T(𝟚 U)UisContr(T(C(0)))\beta_\mathbb{2}^0:\prod_{C:T(\mathbb{2}_U) \to U} \mathrm{isContr}(T(C(0)))
  • a dependent function
    β 𝟚 1: C:T(𝟚 U)UisContr(T(C(1)))\beta_\mathbb{2}^1:\prod_{C:T(\mathbb{2}_U) \to U} \mathrm{isContr}(T(C(1)))
  • a dependent function
    η 𝟚: C:T(𝟚 U)U p:T(𝟚 U)isContr(T(C(0)))×isContr(T(C(1)))isContr(T(C(p)))\eta_\mathbb{2}:\prod_{C:T(\mathbb{2}_U) \to U} \prod_{p:T(\mathbb{2}_U)} \mathrm{isContr}(T(C(0))) \times \mathrm{isContr}(T(C(1))) \to \mathrm{isContr}(T(C(p)))

If the type theory has an booleans type 𝟚type\mathbb{2} \; \mathrm{type} external to the Tarski, universe, then an equivalence smallbool:T(𝟚 U)𝟚\mathrm{smallbool}:T(\mathbb{2}_U) \simeq \mathbb{2} could be constructed. A Tarski universe is strictly closed under the booleans type if there is a definitional equality T(𝟚 U)𝟚T(\mathbb{2}_U) \equiv \mathbb{2}.

Natural numbers type

A Tarski universe is closed under the natural numbers type if the universe comes with

  • a term U:U\mathbb{N}_U:U
  • a term 0:T( U)0:T(\mathbb{N}_U)
  • a function s:T( U)T( U)s:T(\mathbb{N}_U) \to T(\mathbb{N}_U)
  • a dependent function
    ind : C:T( U)U p:T( U)(T(C(0))× n:T( U)T(C(n))T(C(s(n)))T(C(p))\mathrm{ind}_\mathbb{N}: \prod_{C:T(\mathbb{N}_U) \to U} \prod_{p:T(\mathbb{N}_U)} \left(T(C(0)) \times \prod_{n:T(\mathbb{N}_U)} T(C(n)) \to T(C(s(n)) \right) \to T(C(p))
  • a dependent function
    β 0: C:T( U)UisContr(T(C(0)))\beta_\mathbb{N}^0:\prod_{C:T(\mathbb{N}_U) \to U} \mathrm{isContr}(T(C(0)))
  • a dependent function
    β s: C:T( U)U n:T( U)isContr(T(C(n)))isContr(T(C(s(n))))\beta_\mathbb{N}^s:\prod_{C:T(\mathbb{N}_U) \to U} \prod_{n:T(\mathbb{N}_U)} \mathrm{isContr}(T(C(n))) \to \mathrm{isContr}(T(C(s(n))))
  • A dependent function
    η : C:T( U)U p:T( U)(isContr(T(C(0)))× n:T( U)isContr(T(C(n)))isContr(T(C(s(n)))))isContr(T(C(p)))\eta_\mathbb{N}: \prod_{C:T(\mathbb{N}_U) \to U} \prod_{p:T(\mathbb{N}_U)} \left(\mathrm{isContr}(T(C(0))) \times \prod_{n:T(\mathbb{N}_U)} \mathrm{isContr}(T(C(n))) \to \mathrm{isContr}(T(C(s(n)))) \right) \to \mathrm{isContr}(T(C(p)))

If the type theory has a natural numbers type type\mathbb{N} \; \mathrm{type} external to the Tarski, universe, then an equivalence smallnat:T( U)\mathrm{smallnat}:T(\mathbb{N}_U) \simeq \mathbb{N} could be constructed. A Tarski universe is strictly closed under the nqtural numbers type if there is a definitional equality T( U)T(\mathbb{N}_U) \equiv \mathbb{N}.

Identity types

Dependent function types

Dependent sum types

Tarski subuniverses

Let (U,T U)(U, T_U) be a Tarski universe. A Tarski universe (V,T V)(V, T_V) is a Tarski subuniverse of (U,T U)(U, T_U) if it comes with an embedding t:VUt:V \hookrightarrow U and a dependent function

p: a:VT U(t(a))T V(a)p:\prod_{a:V} T_U(t(a)) \simeq T_V(a)

This is equivalent to a family of Tarski universes (U(i),T(i))(U(i), T(i)) indexed by terms i:𝟚i:\mathbb{2} of the interval preorder (𝟚, 𝟚)(\mathbb{2}, \leq_\mathbb{2}), which comes with

  • a dependent function

    t: a:𝟚 b:𝟚(a 𝟚b)(U(a)U(b))t:\prod_{a:\mathbb{2}} \prod_{b:\mathbb{2}} (a \leq_\mathbb{2} b) \to (U(a) \hookrightarrow U(b))
  • a dependent function

    q: a:𝟚 b:𝟚 p:a 𝟚b A:U(a)T(a)(A)T(b)(t(a,b)(p)(A))q:\prod_{a:\mathbb{2}} \prod_{b:\mathbb{2}} \prod_{p:a \leq_\mathbb{2} b} \prod_{A:U(a)} T(a)(A) \simeq T(b)(t(a, b)(p)(A))

    indicating that lifting each small type results in a type equivalent to the original small type.

Essentially small Tarski universes

A Tarski universe (V,T V)(V, T_V) inside of a Tarski universe (U,T U)(U, T_U) consists of a term V:UV:U and a function T V:T U(V)UT_V:T_U(V) \to U.

Given a Tarski universe (U,T U)(U, T_U), a Tarski universe (V,T V)(V, T_V) is essentially UU-small if it comes with

  • a term V:UV':U

  • a function T V:T U(V)UT_{V'}:T_U(V') \to U

  • an equivalence

    smallType:VT U(V)\mathrm{smallType}:V \simeq T_U(V')
  • a dependent function

    smallFamily: A:VT V(A)T U(T V(smallType(A)))\mathrm{smallFamily}:\prod_{A:V} T_V(A) \simeq T_U(T_{V'}(\mathrm{smallType}(A)))

Equivalently, the entire structure could be regarded as a family of Tarski universes (U(a),T(a))(U(a), T(a)) indexed by terms a:𝟚a:\mathbb{2} of the interval preorder (𝟚, 𝟚)(\mathbb{2}, \leq_\mathbb{2}), which comes with

  • a dependent function

    U: a:𝟚 b:𝟚 p:a 𝟚b((b 𝟚a))U(b)U':\prod_{a:\mathbb{2}} \prod_{b:\mathbb{2}} \prod_{p:a \leq_\mathbb{2} b} \left((b \leq_\mathbb{2} a) \to \emptyset\right) \to U(b)
  • a dependent function

    T: a:𝟚 b:𝟚 p:a 𝟚b((b 𝟚a))(T(b)(U(a,b,p))U(b))T':\prod_{a:\mathbb{2}} \prod_{b:\mathbb{2}} \prod_{p:a \leq_\mathbb{2} b} \left((b \leq_\mathbb{2} a) \to \emptyset\right) \to \left(T(b)(U'(a, b, p)) \to U(b)\right)
  • an dependent function

    smallType: a:𝟚 b:𝟚 p:a 𝟚b((b 𝟚a))(U(a)T(b)(U(a,b,p)))\mathrm{smallType}:\prod_{a:\mathbb{2}} \prod_{b:\mathbb{2}} \prod_{p:a \leq_\mathbb{2} b} \left((b \leq_\mathbb{2} a) \to \emptyset\right) \to \left(U(a) \simeq T(b)(U'(a, b, p))\right)
  • a dependent function

    smallFamily: a:𝟚 b:𝟚 p:a 𝟚b((b 𝟚a)) A:U(a)T(a)(A)T(b)(T(a,b,p)(smallType(a,b,p)(A)))\mathrm{smallFamily}:\prod_{a:\mathbb{2}} \prod_{b:\mathbb{2}} \prod_{p:a \leq_\mathbb{2} b} \left((b \leq_\mathbb{2} a) \to \emptyset\right) \to \prod_{A:U(a)} T(a)(A) \simeq T(b)(T'(a, b, p)(\mathrm{smallType}(a, b, p)(A)))

Hierarchy of Tarski universes

Let PP be a preorder. Then, a PP-indexed hierarchy of Tarski universes is a type family UU such that for all indices a:Pa:P, there is a Tarski universe (U(a),T(a))(U(a), T(a)), such that for all indices a:Pa:P and b:Pb:P and witnesses p:a Pbp:a \leq_P b, the Tarski universe (U(a),T(a))(U(a), T(a)) is an essentially U(b)U(b)-small Tarski subuniverse of the Tarski universe (U(b),T(b))(U(b), T(b)).

Expanded out, the family of Tarski universes (U(a),T(a))(U(a), T(a)) indexed by terms a:Pa:P additionally come with

  • a dependent function

    U: a:P b:P p:a Pb((b Pa))U(b)U':\prod_{a:P} \prod_{b:P} \prod_{p:a \leq_P b} \left((b \leq_P a) \to \emptyset\right) \to U(b)
  • a dependent function

    T: a:P b:P p:a Pb((b Pa))(T(b)(U(a,b,p))U(b))T':\prod_{a:P} \prod_{b:P} \prod_{p:a \leq_P b} \left((b \leq_P a) \to \emptyset\right) \to \left(T(b)(U'(a, b, p)) \to U(b)\right)
  • an dependent function

    smallType: a:P b:P p:a Pb((b Pa))(U(a)T(b)(U(a,b,p)))\mathrm{smallType}:\prod_{a:P} \prod_{b:P} \prod_{p:a \leq_P b} \left((b \leq_P a) \to \emptyset\right) \to \left(U(a) \simeq T(b)(U'(a, b, p))\right)
  • a dependent function

    smallFamily: a:P b:P p:a Pb((b Pa)) A:U(a)T(a)(A)T(b)(T(a,b,p)(smallType(a,b,p)(A)))\mathrm{smallFamily}:\prod_{a:P} \prod_{b:P} \prod_{p:a \leq_P b} \left((b \leq_P a) \to \emptyset\right) \to \prod_{A:U(a)} T(a)(A) \simeq T(b)(T'(a, b, p)(\mathrm{smallType}(a, b, p)(A)))
  • a dependent function

    t: a:P b:P(a Pb)(U(a)U(b))t:\prod_{a:P} \prod_{b:P} (a \leq_P b) \to (U(a) \hookrightarrow U(b))
  • a dependent function

    q: a:P b:P p:a Pb A:U(a)T(a)(A)T(b)(t(a,b)(p)(A))q:\prod_{a:P} \prod_{b:P} \prod_{p:a \leq_P b} \prod_{A:U(a)} T(a)(A) \simeq T(b)(t(a, b)(p)(A))

Usually, hierarchies of Tarski universes are indexed by the type of natural numbers. A type theory may have multiple hierarchies of type universes.

Modalities and comodalities

A modal operator on a Tarski universe (U,T)(U, T) is just an endofunction L:UUL:U \to U. Given a Tarski universe, the modal unit family is a family of functions

η: L:UU A:UT(A)T(L(A))\eta:\prod_{L:U \to U}\prod_{A:U} T(A) \to T(L(A))

and the comodal counit family is a family of functions

ϵ: L:UU A:UT(L(A))T(A)\epsilon:\prod_{L:U \to U}\prod_{A:U} T(L(A)) \to T(A)

Given a modal operator L:UUL:U \to U, η(L)\eta(L) is called the modal unit of LL and ϵ(L)\epsilon(L) is called the comodal counit of LL. A small type A:UA:U is LL-modal if the function

η(L)(A):T(A)T(L(A))\eta(L)(A):T(A) \to T(L(A))

is an equivalence of types, and LL-comodal if the function

ϵ(L)(A):T(L(A))T(A)\epsilon(L)(A):T(L(A)) \to T(A)

is an equivalence of types.

A modality is…

…and a comodality is…

Reflective and coreflective Tarski subuniverses

(Section under construction see reflective subuniverse for the Russell universe variant for the time being)

 Choice operators

A choice operator on a universe is a family of functions which, given a witness that a type is inhabited, gives an element of the type. Given a Tarski universe (U,T)(U, T), the UU-local choice operator is given by the following rule:

ΓUtypeΓ,X:UTtypeΓε U: A:U|T[A/X]|T[A/X]\frac{\Gamma \vdash U \; \mathrm{type} \quad \Gamma, X:U \vdash T \; \mathrm{type}}{\Gamma \vdash \varepsilon_U:\prod_{A:U} \vert T[A/X] \vert \to T[A/X]}

UU having a choice operator implies that UU satisfies axiom K or UIP. If UU is also univalent, then it is an h-groupoid.

Examples

The types of propositions in a type theory are univalent Tarski universes: they model a dependent type theoretic model of propositional logic with function types, product types, disjunction higher inductive types, empty type, and unit type.

Every concrete category and every concrete dagger category? is a Tarski universe, as given a concrete category or concrete dagger category CC by definition for each object A:Ob(C)A:Ob(C) there is an h-set El(A)El(A). This includes models of Mike Shulman‘s SEAR, which is a concrete power allegory, as well as ETCS with elements, which is a concrete elementary topos.

See also

For universes as a replacement for type judgments, see

Regarding the general notion of types of small types, see

Other mathematical structures and their univalent counterparts:

References

Historical review of Alfred Tarski‘s original notion in set theory:

The terminology “universe à la Tarski” — and now in the context of type universes for Martin-Löf dependent type theory — is due to:

Further discussion:

See also:

Last revised on January 30, 2023 at 15:14:29. See the history of this page for a list of all contributions to it.