Free Objects and Universal Properties, Because Most General is Too Wordy

So we often see these constructions come up. For a set S, we define the free group F_S as the group of words under string concatenation of S \cup S^{-1}. Similarly, the free monoid over S is just words given by S under concatenation. We also define the free R-module R^{(S)} as the set of formal linear combinations on S given by R. If R is a field, we get the free vector space. Given a directed graph G, we can form the free category over G by taking vertices to objects and paths to morphisms. In fact, there are many such “free” constructions of various other objects, such as the free algebra T(V) over a vector space V. In the end, we have all these objects that are labelled with free, but there is no apparent connection between them, so this post aims to give some insight as to why they all have the same label.

Recall that a functor eats things from a category and returns a similar object in another category. Call a functor F : \mathscr{C} \to \mathscr{D} faithful if for every two objects X, Y \in \mathscr{C}, the map on morphisms F_{X, Y} : \Hom(X, Y) \to \Hom(F(X), F(Y)) is injective. So a functor is faithful if it preserves the information about morphisms. We now define a concrete category to be a category equipped with a faithful functor into \mathbf{Set}, the category of sets.

Let \mathscr{C}, F be a concrete category, and let X be some set, called a basis, A \in \mathscr{C} an object, and \iota : X \to F(A) any set-theoretic function. We say X is the free object on A with respect to \iota if and only if, when given another object B \in \mathscr{C} and map \kappa : X \to F(B), the following triangle commutes.

Rendered by

We essentially want a unique morphism \tilde{\kappa} \in \Hom(A, B) such that \kappa is the precomposition of F(\tilde{\kappa}) with \iota. In some sense, this is just saying that all maps from X to some structured object have to go through \iota and A, so A is the most general object derived from X and \iota is the most general map. But wait, this does not appear to be what free groups are about on the surface! For free groups, we must have

Rendered by

where F_S is the free group on S and G is any arbitrary group and \tilde{\psi} : F_S \to G a group homomorphism. On the surface, it appears as if the functor is going backwards, because we have functions from \mathbf{Set} \to \mathbf{Grp}! But then we squint at the diagram and realize that is not the case at all. In this case, we just view F_S, G as sets under the forgetful (and faithful!) functor \mathcal{F} : \mathbf{Grp} \to \mathbf{Set} taking groups to their underlying sets and group homomorphisms to their set theoretic definitions. So now that we have this faithful functor, we just plug into the diagram. For all morphisms \psi : S \to G, there exists a group homomorphism \tilde{\psi} : F_S \to G (as a set theoretic function!) such that \psi = \tilde{\psi} \circ \varphi, where \varphi is the natural inclusion of S into F_S (as a set!).

So we repeat this process for free vector spaces, free monoids, and whatnot, and realize that the definition makes a lot of sense, but why are they called free? Personally, I’m not sure, but we can remember that they are free objects because you basically get these extensions of sets for free, and calling them the most general object is too hard to say in English. Anyways, this motivates the definition of universal properties.

Let \mathscr{C} be a category and let C \in \mathscr{C} be an object. C is said to be an initial object if there is only one morphism in \Hom(C, X), for all objects X \in \mathscr{C}. Dually, C is said to be a terminal object if there is only one morphism in \Hom(X, C) for all objects X \in \mathscr{C}. For example, the trivial group is both an initial object and terminal object in \mathbf{Grp}.

Let \mathscr{A}, \mathscr{B}, \mathscr{C} be categories and let \mathcal{S} : \mathscr{A} \to \mathscr{C}, \mathcal{T} : \mathscr{B} \to \mathscr{C}. We define the comma category \mathcal{S} \downarrow \mathcal{T} to be the category whose objects are triples (\alpha, \beta, \gamma) where \alpha \in \mathscr{A}, \beta \in \mathscr{B}, \gamma \in \Hom(\mathcal{S}(\alpha), \mathcal{T}(\beta)) and morphisms are pairs

    \[ (\varphi \in \Hom(\alpha, \alpha'), \psi \in \Hom(\beta, \beta')) \in \Hom((\alpha, \beta, \gamma), (\alpha', \beta', \gamma')) \]

such that the following square commutes.

Rendered by

and composition is component-wise composition.

Rendered by

Suppose \mathcal{U} : \mathscr{D} \to \mathscr{C} is a functor and X \in \mathscr{C}. An initial morphism \varphi from X to \mathcal{U} is just an initial object in the comma category X \downarrow \mathcal{U}. But this notation is somewhat confusing, X is not a functor! To make this definition precise, we let X \downarrow \mathcal{U} = \mathcal{X} \downarrow \mathcal{U} where \mathcal{X} : \mathscr{C}' \to \overline{X} is the functor sending all objects in \mathscr{C}' to X and all morphisms to the identity on X. Therefore, we can shrink our definition for this comma category down to objects being pairs (A, \varphi \in \Hom(X, \mathcal{U}(A)) and morphisms just being \psi \in \Hom(\mathcal{U}(A), \mathcal{U}(B)). To expand on the initial object, our initial morphism is just a pair (A, \varphi) such that whenever we have B \in \mathscr{D} an object and f \in \Hom(X, \mathcal{U}(B)) a morphism, the following triangle, called the initial property commutes.

Rendered by

To see this better in the comma category, we add the identity morphism on X to produce the following square.

Rendered by

Dually, an terminal morphism from \mathcal{U} to X is a terminal object in the comma category \mathcal{U} \downarrow X, or a pair (A, \varphi \in \Hom(\mathcal{U}(A), X)) such that whenever we have B \in \mathscr{D} and f \in \Hom(\mathcal{U}(B), X), the following triangle, called the terminal property is satisfied.

Rendered by

We now have enough to define what we originally wanted. A universal property refers to either an initial property or a terminal property while a universal morphism refers to either an initial morphism or terminal morphism. We can then summarize free objects as initial morphisms from their underlying set to the faithfully forgetful functor that strips away the structure of our object.

This entry was posted in Math. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *