Universal property

Written by Patrick Stevens last updated

In category theory, we attempt to avoid thinking about what an object is, and look only at how it interacts with other objects. It turns out that even if we're not allowed to talk about the "internal" structure of an object, we can still pin down some objects just by talking about their interactions. For example, if we are not allowed to define the empty set as "the set with no elements", we can still define it by means of a "universal property", talking instead about the functions from the empty set rather than about the elements of the empty set.

This page is not designed to teach you any particular universal properties, but rather to convey a sense of what the idea of "universal property" is about. You are supposed to let it wash over you gently, without worrying particularly if you don't understand words or even entire sentences.

Examples

  • The empty set can be defined by a universal property. Specifically, it is an instance of the idea of an initial_object, in the category of sets. The same idea captures the trivial group, the ring of integers, and the natural number .
  • The product has a universal property, generalising the set product, the product of integers, the greatest_lower_bound in a partially ordered set, the products of many different algebraic structures, and many other things besides.
  • The free group has a universal property (we refer to this property by the unwieldy phrase "the free-group functor is left-adjoint to the forgetful_functor"). The same property can be used to create free rings, the discrete_topology on a set, and the free semigroup on a set. This idea of the left adjoint can also be used to define initial objects (which is the generalised version of the universal property of the empty set). [1]

The above examples show that the ideas of category theory are very general. For instance, the third example captures the idea of a "free" object, which turns up all over abstract algebra.

Definition "up to isomorphism"

explain that we only usually get things defined up to isomorphism, and what that means anyway

Universal properties might not define objects

Universal properties are often good ways to define things, but just like with any definition, we always need to check in each individual case that we've actually defined something coherent. There is no silver bullet for this: universal properties don't just magically work all the time.

For example, consider a very similar universal property to that of the empty set (detailed here), but instead of working with sets, we'll work with fields, and instead of functions between sets, we'll work with field homomorphisms.

The corresponding universal property will turn out not to be coherent:

The initial field [2] is the unique field such that for every field , there is a unique field homomorphism from to .

Proof that there is no initial field

(The slick way to communicate this proof to a practised mathematician is "there are no field homomorphisms between fields of different characteristic".)

It will turn out that all we need is that there are two fields and the field on two elements. [3]

Suppose we had an initial field with multiplicative identity element ; then there would have to be a field homomorphism from to . Remember, can be viewed as (among other things) a group homomorphism from the multiplicative group [4] to .

Now because the image of the identity is the identity, and so .

But field homomorphisms are either injective or map everything to (proof); and we've already seen that is not . So must be injective; and hence must be because .

Now examine . There is a field homomorphism from to . We have ; but also . This is a contradiction.

  1. ^︎

    Indeed, an initial object of category is exactly a left adjoint to the unique functor from to the one-arrow category.

  2. ^︎

    Analogously with the empty set, but fields can't be empty so we'll call it "initial" for reasons which aren't important right now.

  3. ^︎

    has elements and , and the relation .

  4. ^︎

    That is, the group whose underlying set is without , with the group operation being "multiplication in ".