1 Jan 2010 15:48
Small is beautiful
Robert Pare <pare <at> mathstat.dal.ca>
2010-01-01 14:48:26 GMT
2010-01-01 14:48:26 GMT
I would like to add a few thoughts to the "evil" discussion. My 30+ years involvement with indexed categories have led me to the following understanding. There are two kinds of categories, small and large (surprise!). But the difference is not mainly one of size. Rather it's how well we can pin down the objects. The distinction between sets and classes is often thought of in terms of size but Russell's problem with the set of all sets was not one of size but rather of the nature of sets. Once you think you have the set of all sets, you can construct another set which you had missed. I.e. the notion is changing, slippery. There are set theories where you can have a subclass of a set which is not a set (c.f. Vopenka, e.g.) Smallness is more a question of representability: a functor may fail to be representable because it's too big (no solution set) or, more often, because it's badly behaved (doesn't preserve products, say). Subfunctors of representables are not usually representable. In our work on indexed categories, Schumacher and I had tried to treat this question by considering categories equipped with a groupoid of isomorphisms, which we called *canonical*, and then consider functors defined up to canonical isomorphism. In small categories only identities were canonical whereas in large categories, all isomorphisms were canonical. Our ideas were a bit naive and not well developed and earned us some ridicule, so we quietly stopped talking about it. Recently, Makkai developed an extensive theory of functors defined up to isomorphisms, FOLDS, but did not consider the possibility of specifying which isomorphisms ahead of time, so small categories were not included. When I used to teach category theory, before Dalhousie made me chuck my(Continue reading)
.
Cheers, and Happy New Year, -- Fred
[For admin and other information see:
RSS Feed