Natural transformation

This article is about natural transformations in category theory. For the natural competence of bacteria to take up foreign DNA, see Transformation (genetics).

For other uses, see Transformation (mathematics) (disambiguation).

In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure (i.e. the composition of morphisms) of the categories involved. Hence, a natural transformation can be considered to be a "morphism of functors". Indeed this intuition can be formalized to define so-called functor categories. Natural transformations are, after categories and functors, one of the most basic notions of category theory and consequently appear in the majority of its applications.

Definition

If F and G are functors between the categories C and D, then a natural transformation η from F to G associates to every object X in C a morphism η_X : F(X) → G(X) between objects of D, called the component of η at X, such that for every morphism f : X → Y in C we have:

$\eta _{Y}\circ F(f)=G(f)\circ \eta _{X}$

This equation can conveniently be expressed by the commutative diagram

If both F and G are contravariant, the horizontal arrows in this diagram are reversed. If η is a natural transformation from F to G, we also write η : F → G or η : F ⇒ G. This is also expressed by saying the family of morphisms η_X : F(X) → G(X) is natural in X.

If, for every object X in C, the morphism η_X is an isomorphism in D, then η is said to be a natural isomorphism (or sometimes natural equivalence or isomorphism of functors). Two functors F and G are called naturally isomorphic or simply isomorphic if there exists a natural isomorphism from F to G.

An infranatural transformation η from F to G is simply a family of morphisms η_X: F(X) → G(X). Thus a natural transformation is an infranatural transformation for which η_Y ∘ F(f) = G(f) ∘ η_X for every morphism f : X → Y. The naturalizer of η, nat(η), is the largest subcategory of C containing all the objects of C on which η restricts to a natural transformation.

Examples

Opposite group

Further information: Opposite group

Statements such as

"Every group is naturally isomorphic to its opposite group"

abound in modern mathematics. We will now give the precise meaning of this statement as well as its proof. Consider the category Grp of all groups with group homomorphisms as morphisms. If (G,*) is a group, we define its opposite group (G^op,*^op) as follows: G^op is the same set as G, and the operation *^op is defined by a *^op b = b * a. All multiplications in G^op are thus "turned around". Forming the opposite group becomes a (covariant!) functor from Grp to Grp if we define f^op = f for any group homomorphism f: G → H. Note that f^op is indeed a group homomorphism from G^op to H^op:

f^op(a *^op b) = f(b * a) = f(b) * f(a) = f^op(a) *^op f^op(b).

The content of the above statement is:

"The identity functor Id_Grp : Grp → Grp is naturally isomorphic to the opposite functor ^op : Grp → Grp."

To prove this, we need to provide isomorphisms η_G : G → G^op for every group G, such that the above diagram commutes. Set η_G(a) = a⁻¹. The formulas (ab)⁻¹ = b⁻¹ a⁻¹ and (a⁻¹)⁻¹ = a show that η_G is a group homomorphism which is its own inverse. To prove the naturality, we start with a group homomorphism f : G → H and show η_H ∘ f = f^op ∘ η_G, i.e. (f(a))⁻¹ = f^op(a⁻¹) for all a in G. This is true since f^op = f and every group homomorphism has the property (f(a))⁻¹ = f(a⁻¹).

Double dual of a finite dimensional vector space

If K is a field, then for every vector space V over K we have a "natural" injective linear map V → V** from the vector space into its double dual. These maps are "natural" in the following sense: the double dual operation is a functor, and the maps are the components of a natural transformation from the identity functor to the double dual functor.

Counterexample: dual of a finite-dimensional vector space

Every finite-dimensional vector space is isomorphic to its dual space, but this isomorphism relies on an arbitrary choice of isomorphism (for example, via choosing a basis and then taking the isomorphism sending this basis to the corresponding dual basis). There is in general no natural isomorphism between a finite-dimensional vector space and its dual space. However, related categories (with additional structure and restrictions on the maps) do have a natural isomorphism, as described below.

The dual space of a finite-dimensional vector space is again a finite-dimensional vector space of the same dimension, and these are thus isomorphic, since dimension is the only invariant of finite-dimensional vector spaces over a given field. However, in the absence of additional data (such as a basis), there is no given map from a space to its dual, and thus such an isomorphism requires a choice, and is "not natural". On the category of finite-dimensional vector spaces and linear maps, one can define an infranatural isomorphism from vector spaces to their dual by choosing an isomorphism for each space (say, by choosing a basis for every vector space and taking the corresponding isomorphism), but this will not define a natural transformation. Intuitively this is because it required a choice, rigorously because any such choice of isomorphisms will not commute with all linear maps; see (MacLane & Birkhoff 1999, §VI.4) for detailed discussion.

Starting from finite-dimensional vector spaces (as objects) and the dual functor, one can define a natural isomorphism, but this requires first adding additional structure, then restricting the maps from "all linear maps" to "linear maps that respect this structure". Explicitly, for each vector space, require that it come with the data of an isomorphism to its dual, $\eta _{V}\colon V\to V^{*}.$ In other words, take as objects vector spaces with a nondegenerate bilinear form $b_{V}\colon V\times V\to K.$ This defines an infranatural isomorphism (isomorphism for each object). One then restricts the maps to only those maps that commute with these isomorphism (restricts to the naturalizer of η), in other words, restrict to the maps that do not change the bilinear form: $b(T(v),T(w))=b(v,w).$ The resulting category, with objects finite-dimensional vector spaces with a nondegenerate bilinear form, and maps linear transforms that respect the bilinear form, by construction has a natural isomorphism from the identity to the dual (each space has an isomorphism to its dual, and the maps in the category are required to commute). Viewed in this light, this construction (add transforms for each object, restrict maps to commute with these) is completely general, and does not depend on any particular properties of vector spaces.

In this category (finite-dimensional vector spaces with a nondegenerate bilinear form, maps linear transforms that respect the bilinear form), the dual of a map between vector spaces can be identified as a transpose. Often for reasons of geometric interest this is specialized to a subcategory, by requiring that the nondegenerate bilinear forms have additional properties, such as being symmetric (orthogonal matrices), symmetric and positive definite (inner product space), symmetric sesquilinear (Hermitian spaces), skew-symmetric and totally isotropic (symplectic vector space), etc. – in all these categories a vector space is naturally identified with its dual, by the nondegenerate bilinear form.

Tensor-hom adjunction

Further information: Tensor-hom adjunction and Adjoint functors

Consider the category Ab of abelian groups and group homomorphisms. For all abelian groups X, Y and Z we have a group isomorphism

Hom(X ⊗ Y, Z) → Hom(X, Hom(Y, Z)).

These isomorphisms are "natural" in the sense that they define a natural transformation between the two involved functors Ab × Ab^op × Ab^op → Ab.

This is formally the tensor-hom adjunction, and is an archetypal example of a pair of adjoint functors. Natural transformations arise frequently in conjunction with adjoint functors, and indeed, adjoint functors are defined by a certain natural isomorphism. Additionally, every pair of adjoint functors comes equipped with two natural transformations (generally not isomorphisms) called the unit and counit.

Unnatural isomorphism

The notion of a natural transformation is categorical, and states (informally) that a particular map between functors can be done consistently over an entire category. Informally, a particular map (esp. an isomorphism) between individual objects (not entire categories) is referred to as a "natural isomorphism", meaning implicitly that it is actually defined on the entire category, and defines a natural transformation of functors; formalizing this intuition was a motivating factor in the development of category theory. Conversely, a particular map between particular objects may be called an unnatural isomorphism (or "this isomorphism is not natural") if the map cannot be extended to a natural transformation on the entire category. Given an object X, a functor G (taking for simplicity the first functor to be the identity) and an isomorphism $\eta \colon X\to G(X),$ proof of unnaturality is most easily shown by giving an automorphism $A\colon X\to X$ that does not commute with this isomorphism (so $\eta \circ A\neq G(A)\circ \eta$). More strongly, if one wishes to prove that X and G(X) are not naturally isomorphic, without reference to a particular isomorphism, this requires showing that for any isomorphism η, there is some A with which it does not commute; in some cases a single automorphism A works for all candidate isomorphisms η, while in other cases one must show how to construct a different A_η for each isomorphism. The maps of the category play a crucial role – any infranatural transform is natural if the only maps are the identity map, for instance.

This is similar (but more categorical) to concepts in group theory or module theory, where a given decomposition of an object into a direct sum is "not natural", or rather "not unique", as automorphisms exist that do not preserve the direct sum decomposition – see Structure theorem for finitely generated modules over a principal ideal domain#Uniqueness for example.

Some authors distinguish notationally, using ≅ for a natural isomorphism and ≈ for an unnatural isomorphism, reserving = for equality (usually equality of maps).

Operations with natural transformations

If η : F → G and ε : G → H are natural transformations between functors F,G,H : C → D, then we can compose them to get a natural transformation εη : F → H. This is done componentwise: (εη)_X = ε_Xη_X. This "vertical composition" of natural transformation is associative and has an identity, and allows one to consider the collection of all functors C → D itself as a category (see below under Functor categories).

Natural transformations also have a "horizontal composition". If η : F → G is a natural transformation between functors F,G : C → D and ε : J → K is a natural transformation between functors J,K : D → E, then the composition of functors allows a composition of natural transformations ηε : JF → KG. This operation is also associative with identity, and the identity coincides with that for vertical composition. The two operations are related by an identity which exchanges vertical composition with horizontal composition.

If η : F → G is a natural transformation between functors F,G : C → D, and H : D → E is another functor, then we can form the natural transformation Hη : HF → HG by defining

$(H\eta )_{X}=H\eta _{X}.$

If on the other hand K : B → C is a functor, the natural transformation ηK : FK → GK is defined by

$(\eta K)_{X}=\eta _{K(X)}.\,$

Functor categories

Main article: Functor category

If C is any category and I is a small category, we can form the functor category C^I having as objects all functors from I to C and as morphisms the natural transformations between those functors. This forms a category since for any functor F there is an identity natural transformation 1_F : F → F (which assigns to every object X the identity morphism on F(X)) and the composition of two natural transformations (the "vertical composition" above) is again a natural transformation.

The isomorphisms in C^I are precisely the natural isomorphisms. That is, a natural transformation η : F → G is a natural isomorphism if and only if there exists a natural transformation ε : G → F such that ηε = 1_G and εη = 1_F.

The functor category C^I is especially useful if I arises from a directed graph. For instance, if I is the category of the directed graph • → •, then C^I has as objects the morphisms of C, and a morphism between φ : U → V and ψ : X → Y in C^I is a pair of morphisms f : U → X and g : V → Y in C such that the "square commutes", i.e. ψ f = g φ.

More generally, one can build the 2-category Cat whose

• 0-cells (objects) are the small categories,
• 1-cells (arrows) between two objects $C$ and $D$ are the functors from $C$ to $D$,
• 2-cells between two 1-cells (functors) $F:C\to D$ and $G:C\to D$ are the natural transformations from $F$ to $G$.

The horizontal and vertical compositions are the compositions between natural transformations described previously. A functor category $C^{I}$ is then simply a hom-category in this category (smallness issues aside).

Yoneda lemma

Main article: Yoneda lemma

If X is an object of a locally small category C, then the assignment Y ↦ Hom_C(X, Y) defines a covariant functor F_X : C → Set. This functor is called representable (more generally, a representable functor is any functor naturally isomorphic to this functor for an appropriate choice of X). The natural transformations from a representable functor to an arbitrary functor F : C → Set are completely known and easy to describe; this is the content of the Yoneda lemma.

Historical notes

Saunders Mac Lane, one of the founders of category theory, is said to have remarked, "I didn't invent categories to study functors; I invented them to study natural transformations." Just as the study of groups is not complete without a study of homomorphisms, so the study of categories is not complete without the study of functors. The reason for Mac Lane's comment is that the study of functors is itself not complete without the study of natural transformations.

The context of Mac Lane's remark was the axiomatic theory of homology. Different ways of constructing homology could be shown to coincide: for example in the case of a simplicial complex the groups defined directly would be isomorphic to those of the singular theory. What cannot easily be expressed without the language of natural transformations is how homology groups are compatible with morphisms between objects, and how two equivalent homology theories not only have the same homology groups, but also the same morphisms between those groups.

Symbols used

• U+2297 ⊗ CIRCLED TIMES (⊗, ⊗)

See also

• Extranatural transformation

References

• Mac Lane, Saunders (1998), Categories for the Working Mathematician, Graduate Texts in Mathematics 5 (2nd ed.), Springer-Verlag, ISBN 0-387-98403-8
• MacLane, Saunders; Birkhoff, Garrett (1999), Algebra (3rd ed.), AMS Chelsea Publishing, ISBN 0-8218-1646-2.

External links

• nLab, a wiki project on mathematics, physics and philosophy with emphasis on the n-categorical point of view
• André Joyal, CatLab, a wiki project dedicated to the exposition of categorical mathematics
• Hillman, Chris. "A Categorical Primer". CiteSeer^x: 10.1.1.24.3264: {{cite web}}: Missing or empty |url= (help) formal introduction to category theory.
• J. Adamek, H. Herrlich, G. Stecker, Abstract and Concrete Categories-The Joy of Cats
• Stanford Encyclopedia of Philosophy: "Category Theory" -- by Jean-Pierre Marquis. Extensive bibliography.
• List of academic conferences on category theory
• Baez, John, 1996,"The Tale of n-categories." An informal introduction to higher order categories.
• WildCats is a category theory package for Mathematica. Manipulation and visualization of objects, morphisms, categories, functors, natural transformations, universal properties.
• The catsters, a YouTube channel about category theory.
• "Category Theory". PlanetMath.
• Video archive of recorded talks relevant to categories, logic and the foundations of physics.
• Interactive Web page which generates examples of categorical constructions in the category of finite sets.