Terminal Objects and Forced Isomorphisms

The big idea

An object \(T\) is terminal when every object \(X\) has exactly one arrow \(X\to T\). Both words matter: existence supplies an arrow, and uniqueness rules out every competitor. The arrows point into the terminal object. Applying the definition with \(X=T\) shows that the identity is the only arrow \(T\to T\), a small observation that powers the comparison theorem.

Worked example

In the category of sets and functions, any singleton \(\{\}\) is terminal. For every set \(X\), the only possible function sends every element of \(X\) to \(\). This also works when \(X\) is empty.

Now suppose \(T\) and \(U\) are terminal. Terminality gives unique arrows

\[ f:T\to U,\qquad g:U\to T. \]

The composite \(g\circ f:T\to T\) must equal \(\operatorname{id}_T\), because there is only one endomorphism of terminal \(T\). Similarly, \(f\circ g=\operatorname{id}_U\). Thus \(f\) is an isomorphism. Any other isomorphism \(T\to U\) would be another arrow into terminal \(U\), so it must equal \(f\).

How children may show it

A learner may draw all arrows aimed at one object, write an existence-and-uniqueness proof in two columns, or mark the two composites in a triangle. Arrow direction should be visible in every representation.

Common mix-up

The most common error is reversing terminal and initial. Ask, “For an arbitrary source \(X\), where must the arrow end?” Another error is saying terminal objects are literally equal; the correct conclusion is unique isomorphism.

Try it together

Use the sets \(\varnothing\), \(\{a\}\), and \(\{0,1\}\). Count functions from a fixed two-element set into each target, then decide which target is terminal and justify both existence and uniqueness.