I'm puzzled by this comment "The objects (or arrows) of a category need not constitute a set. If they do, the category is said to be small. If they don't, the category is large." in the definition of the axioms of category theory here ( http://en.wikibooks.org/wiki/Category_Theory/Categories ).

If this is in the axioms, it is, presumably important, and the distinction between a large and small category something one needs to understand.

This page doesn't define 'set', but, if a set is a collection of discrete objects, then I'd see the arrows of a category being defined as, just that, 'the set of arrows of a category'.

Is the point being made that the arrows (or objects) need not be discrete?

Or is there quite a different definition of a 'set' being appealed to? If so, what is it?

Or, perhaps more pertinently, what is an example of a large category?

  • 2
    $\begingroup$ Well, not any collection of objects form a set - for example, the set of all sets is excluded axiomatically. Hence my guess would be that if one took the category of all sets, it would be large. But I will let someone wiser than I answer properly. $\endgroup$ – Joe Tait Feb 16 '14 at 10:25
  • $\begingroup$ Besides the category of all sets (or categories), also Russel's Paradox comes to mind. $\endgroup$ – Roland Feb 16 '14 at 10:27
  • $\begingroup$ Russell's paradox disappears if you drop the unnecessary axiom of non-contradiction and admit dialetheisms. $\endgroup$ – Peter Brooks Feb 17 '14 at 3:30

Examples of large categories are the category of sets, of groups, of topological spaces, of rings, of vector spaces, of modules, of ....., also, any proper class gives rise to two large categories, the discrete one and the indiscrete one on the set.

The importance of size in category theory is an issue of the existence of certain constructions. For instance, it is useful to know if a category admits certain limits or colimits, since if it does, then you know you can always construct a certain object as the (co)limit of some diagram in the category. If a category is a complete lattice, then it has all limits and colimits. All here means no restriction at all on the diagram. In the other direction, if a category has all limits or all colimits, then it actually must be a poset (and thus a complete lattice).

This shows that there is some mutual exclusivity between having all (co)limits and having more than two arrows between objects. Since we are quite often interested in categories that are not posets, and we are also interested in having (co)limits, we must set some size constraints on the diagrams for the (co)limits. Typically, one defines a category to be small (co)complete, if it has all small (co)limits. That means that any diagram indexed by a small category will have a (co)limit. Large diagrams may or may not have limits.

Also, without the restriction of size, the difference between limits and colimits becomes blurred. It is possible to exhibit any limit as a (potentially) large colimit, and vice versa. Same holds for left and right Kan extensions.

Size issues also play a role in knowing that functor categories exist and also in constructions of left/right adjoints, but I won't get into that since my answer is long enough, and I hope it answers your question sufficiently, at least for now. And see Importance of 'smallness' in a category, and functor categories.

  • $\begingroup$ I don't see why any of those are 'large'. The definition I've seen says that a 'large category' is one where the objects or arrows do not constitute a set. All the examples you give seem to be small by that definition. $\endgroup$ – Peter Brooks Feb 17 '14 at 3:28
  • 2
    $\begingroup$ @PeterBrooks the objects of the category of sets are all sets. All sets do not form a set. The objects of the category of groups are all groups. All groups do not constitute a set. Etc. $\endgroup$ – Ittay Weiss Feb 17 '14 at 3:37
  • 1
    $\begingroup$ I can't agree. All sets do form a set. Sets are objects. All groups form a set, the set of all groups, because groups are objects - ∀x, x is a set, x ∊ S. Defines S, the set of all sets. $\endgroup$ – Peter Brooks Feb 17 '14 at 5:35
  • 3
    $\begingroup$ @PeterBrooks please read a bit about Russell's paradox. $\endgroup$ – Ittay Weiss Feb 17 '14 at 8:05
  • $\begingroup$ I'm familiar with Russell's paradox - I've not looked at this site for a while. You might find it useful to look into dialetheism. dialetheism.org/dialetheism/… $\endgroup$ – Peter Brooks Oct 15 '14 at 16:35

As mentioned here in the wiki article on categories, the category of all sets is large category. The "set of all sets" is not a set, as it is excluded axiomatically.

Also, see the question Category of all categories vs. Set of all sets.

  • $\begingroup$ By what axiom? Why is this axiom needed? $\endgroup$ – Peter Brooks Feb 17 '14 at 6:50
  • $\begingroup$ The 'set of all sets' is a set, and is not excluded axiomatically, unless you happen to include the axiom of non-contradiction, which is not necessary for logic. Russell's paradox disappears if you recognise that it's a dialetheia. $\endgroup$ – Peter Brooks Oct 23 '14 at 22:43

A category of sets $C$ consists of a class $\DeclareMathOperator{\ob}{ob}\ob(C)$ of objects and a class $\hom(C)$ of morphisms. Every set $A$ is an object in $\ob(C)$. ِAssume (temporarily), that $\ob(C)$ is a set, then by Cantor's theorem $|\mathscr{P}(\ob(C))| > |\ob(C)|$. On the other hand, by our assumption, all elements of $\mathscr{P}(\ob(C))$ are sets, and thus contained in $\ob(C)$, therefore $|\mathscr{P}(ob(C))| ≤ |\ob(C)|$. Contradiction. So the class of all sets is not a set, and the category of all sets is large (not small).


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.