In the mathematical field of category theory, the category of sets, denoted as Set, is the category whose objects are sets. The arrows or morphisms between sets A and B are all functions from A to B. Care must be taken in the definition of Set to avoid settheoretic paradoxes.
The category of sets is the most commonly used category in mathematics^{[citation needed]}. Many other categories (such as the category of groups, with group homomorphisms as arrows) add structure to the objects of this category and/or restrict the arrows to functions of a particular kind.
Contents
Properties of the category of sets
The epimorphisms in Set are the surjective maps, the monomorphisms are the injective maps, and the isomorphisms are the bijective maps.
The empty set serves as the initial object in Set with empty functions as morphisms. Every singleton is a terminal object, with the functions mapping all elements of the source sets to the single target element as morphisms. There are thus no zero objects in Set.
The category Set is complete and cocomplete. The product in this category is given by the cartesian product of sets. The coproduct is given by the disjoint union: given sets A_{i} where i ranges over some index set I, we construct the coproduct as the union of A_{i}×{i} (the cartesian product with i serves to ensure that all the components stay disjoint).
Set is the prototype of a concrete category; other categories are concrete if they "resemble" Set in some welldefined way.
Every twoelement set serves as a subobject classifier in Set. The power object of a set A is given by its power set, and the exponential object of the sets A and B is given by the set of all functions from A to B. Set is thus a topos (and in particular cartesian closed).
Full article ▸
