This entry is about the term of “class function” as it is used in set-theoretical contexts. For the notion of the same name in algebra see at class function.
Recall that in set theory a function from a set to a set may be encoded in terms of a relation on the Cartesian product of the two sets, namely the subset with (the graph of the function).
This concept has an evident generalization to the case where and are allowed to be proper classes. In this case one speaks of class functions.
A class function is a class which is a relation with the property that if and , then .
A class function need not be a set.
Class functions are an important concept when formalizing category theory on set-theoretic foundations without using universes, especially when
constructing functors step by step, e.g. by first constructing an assignment between two classes of objects, and then compatibly augmenting this assignment to make it a functor,
most especially when constructing functors on functor categories, whose classes of objects tend to be proper classes.
An example is Mac Lane’s discussion p. 23 of the category of all classes in his chapter on Foundations. There, the class of arrows is defined by writing “its arrows [are] all functions between classes”.
Class functions are the morphisms in a category with class structure.
Arguably the prototypical example of an essential use of the concept of class functions in set theory is Easton's theorem Theorem 15.18. on the behaviour of the class function on the class of all cardinals. (In Easton’s theorem, the domain of the class function in question is the proper class of all regular cardinals.)
Often, authors resort to synonyms like operation or assignment when writing about proper classes, with p. 23 being a counterexample.
Saunders Mac Lane. Categories for the Working Mathematician Second Edition. Springer (1998)
T. Jech. Set theory. Third Edition. Springer (2002)
Last revised on September 25, 2020 at 13:39:54. See the history of this page for a list of all contributions to it.