|logic||category theory||type theory|
|true||terminal object/(-2)-truncated object||h-level 0-type/unit type|
|false||initial object||empty type|
|proposition||(-1)-truncated object||h-level 1-type/h-prop|
|classical type theory?||internal logic||classical type theory?, logic programming?|
|cut elimination?||counit||beta reduction|
|disjunction||coproduct ((-1)-truncation of)||sum type (bracket type of)|
|implication||internal hom||function type|
|negation||internal hom into initial object||function type into empty type|
|universal quantification||dependent product||dependent product type|
|existential quantification||dependent sum ((-1)-truncation of)||dependent sum type (bracket type of)|
|equivalence||path space object||identity type|
|equivalence class||quotient||quotient type|
|induction||colimit||inductive type, W-type, M-type|
|higher induction||higher colimit||higher inductive type|
|completely presented set||discrete object/0-truncated object||h-level 2-type/preset/h-set|
|set||internal 0-groupoid||Bishop set/setoid|
|universe||object classifier||type of types|
|modality||closure operator monad||modal type theory, monad (in computer science)|
There are two main styles of definition of category in the literature: one which immediately generalises to the usual definition of internal category and one which immediately generalises to the usual definition of enriched category. Here we consider the latter definition, and show how it may naturally be expressed in dependent type theory.
Note that in a type theory without identity types, where types are presets (without an inherent equality predicate), it is not manifestly possible to express so-called evil ideas in category theory; thus categories are not necessarily strict. In homotopy type theory, we have identity types, but they are not extensional; thus it is also possible to define non-strict categories there (but there is a subtlety; see below).
We use a two-dimensional syntax, which is convenient to allow inference of implicit parameters?, and to signify notation. We read the horizontal line as a rule, so for instance the second line means that whenever and have type , then we have a type (with equality).
The notation signifies that is a proof of the proposition (under propositions as types or propositions as some types, this may be the same as , but many type theories treat propositions as distinct from types).
Here, is a type of types, and is a type of types with equality predicates (we may or may not have ). Specifically:
In extensional type theory (with extensional identity types), we have , and the above definition simply makes no use of the equality predicate on the type of objects. In this case we obtain strict categories, although that is not immediately visible from the definition.
In dependent type theory without identity types, basically the only option for is the type of setoids. In this case we obtain a notion of non-strict category, since the type of objects has no equality predicate at all.
In homotopy type theory, it is natural to take to be the type of h-sets: types whose identity/path types behave extensionally. We should also restrict the homotopy level of the type of objects, however, since a true 1-category should have no more than a 1-groupoid of objects; thus in the definition above is really the type of h-groupoids instead of the type of all small types. That is, we should take to be -truncated in addition to taking each to be -truncated.
This gives a notion of non-strict category (since there is no equality predicate on a -truncated type other than isomorphism). However, it is not quite the right definition of ”-category” in homotopy type theory, because nothing requires that the paths in are the same as the isomorphisms defined categorically. We need to impose a version of the “completeness” condition on a complete Segal space; in other words, we require that the core of the category be the equivalent as a groupoid to the original type of objects.
The defined type of categories cannot itself be a member of , otherwise we run into Girard's paradox. This is related to the size issues for categories.
Anonymous from the Peanut Gallery asks: How do we define small categories type-theoretically? It seems to me that a natural thing to try is to make “small” mean “ is a setoid (ie, element of )”, but then the coherence conditions on the type operator of morphisms make my head explode. (Namely, if is a setoid, and , then we expect , but I don’t see how should be defined! What should the type of homs be now, and what properties should they satisfy?)
Ulrik: The above does define a type of small categories (given that is a type of small types). Adding equality to (making it a setoid), defines small strict categories. Then, as you mention, we need an equality on in order to formulate the coherence condition (the type theory might do this automatically, though). To define large categories we need a larger universe of types (just like the situation in set theory).
Toby: In other words, smallness and strictness are two separate things, although sometimes they go together. If is the type of small types (and therefore is itself a moderate type but not a small type) and similarly for , then the definition above gives small categories. If is the type of moderate types but remains the type of small types with equality, then the definition above gives locally small moderate categories. If and are both types of moderate types, then the definition above gives moderate categories. Independently of this, if you change the type of from to (and add some coherence conditions), then you get strict categories.
But it seems like there's still something to make your head explode: how do we define strict categories in this framework? (The tricky part is the coherence conditions in my previous parenthetical remark above.) You have the right idea that, if , then , but what you're missing is that means isomorphism of setoids. That is, we have a rule
representing a map of setoids . (There is a similar rule on the other side.) Then you also need some coherence laws stating that and (and two laws on the other side). I think that this is all.
The definition that I usually use for a strict category, however, is this: a strict category consists of a set (of type , what we've been calling ‘setoid’ above) , a category (in the weak sense defined here) , and an essentially surjective functor to from the discrete category on . We then think of as the set of objects, the set of morphisms from to (for ) is , etc. (Again, strictness is independent of smallness; might be a small set, or a large proper class, or whatever.)
Anonymous: Ulrik, Toby: Thank you for the advice! You’re exactly right that what I’ve been groping for is strictness, not smallness. My true motivation is to implement a few constructions on functor categories in type theory. However, the way that the exponential in presheaf categories is usually defined has been pretty puzzling to me: given the category , the exponential is defined as . It’s exactly the lack of strict structure on objects in the type-theoretic definition that has left me puzzled. I’ll go play with the constructions you’ve suggested and see if I can make it work for me.
However, I do have another question, though this one arises out of curiosity rather than for any practical reason. In impredicative type theories (like the calculus of constructions) you basically give up the powerset axiom in exchange for the ability to index over the universe (i.e., you can define types like ). It seems like you would still need a strictness condition to define constructions on functor categories, even though traditional size issues are cunningly rendered unsayable. Has anyone looked at what happens when you formalize category theory in such type theories (or for that matter, in set theories with a set of all sets, like NF)?
Ulrik: Some quick remarks on your last questions: In impredicative type theory strong sums are inconsistent (by interpreting Girard’s paradox again), so you can’t form a type of meta-categories (you can still have types of types, you just can’t sum over ALL types). As for NF (or NFU), the category of sets is not cartesian closed, which causes a host of problems.