HOME

TheInfoList



OR:

In
category theory Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory ...
, a branch of
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, a natural transformation provides a way of transforming one
functor In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) ar ...
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". Informally, the notion of a natural transformation states that a particular map between functors can be done consistently over an entire category. Indeed, this intuition can be formalized to define so-called functor categories. Natural transformations are, after categories and functors, one of the most fundamental notions of
category theory Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory ...
and consequently appear in the majority of its applications.


Definition

If F and G are
functor In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) ar ...
s between the categories C and D (both from C to D), then a natural transformation \eta from F to G is a family of morphisms that satisfies two requirements. # The natural transformation must associate, to every object X in C, a morphism \eta_X : F(X) \to G(X) between objects of D . The morphism \eta_X is called "the component of \eta at X " or "the X component of \eta." # Components must be such that for every morphism f :X \to Y in C we have: :::\eta_Y \circ F(f) = G(f) \circ \eta_X The last equation can conveniently be expressed by the commutative diagram. If both F and G are contravariant, the vertical arrows in the right diagram are reversed. If \eta is a natural transformation from F to G , we also write \eta : F \to G or \eta : F \Rightarrow G . This is also expressed by saying the family of morphisms \eta_X: F(X) \to G(X) is natural in X . If, for every object X in C , the morphism \eta_X is an
isomorphism In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between the ...
in D , then \eta is said to be a (or sometimes natural equivalence or isomorphism of functors). This can be intuitively thought of as an isomorphism \eta_X between ''objects'' F(X) and G(X) ''inside'' D having been created, or "generated," by a natural transformation \eta between ''functors'' F and G ''outside'' D, into D. In other words, \eta is a natural isomorphism
if and only if In logic and related fields such as mathematics and philosophy, "if and only if" (often shortened as "iff") is paraphrased by the biconditional, a logical connective between statements. The biconditional is true in two cases, where either bo ...
\eta : F \Rightarrow G entails an isomorphic \eta_X: F(X) \to G(X), for all objects X in C ; the two statements are equivalent. Even more reductionistically, or philosophically, a natural isomorphism occurs when a natural transformation begets its own respective isomorphism (by name that is) and thus the "natural-ness" (or rather, naturality even) of the natural transformation passes from itself over into that very same isomorphism, resulting in a natural isomorphism. Two functors F and G are called ''naturally isomorphic'' or simply ''isomorphic'' if there exists a natural isomorphism from F to G in their category. An infranatural transformation \eta : F \Rightarrow G is simply the family of components for all X in C. Thus, a natural transformation is a special case of an infranatural transformation for which \eta_Y \circ F(f) = G(f) \circ \eta_X for every morphism f : X \to Y in C. The naturalizer of \eta , \mathbb(\eta), is the largest subcategory C_S \subseteq C (S for subcategory), we will denote as C_ (L for largest), containing all the objects of C, on which \eta restricts to a natural transformation. Alternatively put, \mathbb(\eta) is the largest C_S \subseteq C, dubbed C_, such that \, \eta, _\ : \ F, _ \implies G, _ or \, \eta, _\ : \ F, _ \implies G, _ for every object X in nat = C_ \subseteq C.


Examples


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 \textbf of all groups with
group homomorphism In mathematics, given two groups, (''G'',∗) and (''H'', ·), a group homomorphism from (''G'',∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that : h(u*v) = h(u) \cdot h(v) whe ...
s as morphisms. If (G, *) is a group, we define its opposite group (G^\text, ^\text) as follows: G^\text is the same set as G, and the operation *^\text is defined by a *^\text b = b * a. All multiplications in G^ are thus "turned around". Forming the opposite group becomes a (covariant) functor from \textbf to \textbf if we define f^ = f for any group homomorphism f: G \to H. Note that f^\text is indeed a group homomorphism from G^\text to H^\text: :f^\text(a *^\text b) = f(b * a) = f(b) * f(a) = f^\text(a) *^\text f^\text(b). The content of the above statement is: :"The identity functor \text_: \textbf \to \textbf is naturally isomorphic to the opposite functor : \textbf \to \textbf" To prove this, we need to provide isomorphisms \eta_G: G \to G^ for every group G, such that the above diagram commutes. Set \eta_G(a) = a^. The formulas (a * b)^ = b^*a^= a^*^ b^ and (a^)^ = a show that \eta_G is a group homomorphism with inverse \eta_. To prove the naturality, we start with a group homomorphism f : G \to H and show \eta_H \circ f = f^ \circ \eta_G, i.e. (f(a))^ = f^\text(a^) for all a in G. This is true since f^ = f and every group homomorphism has the property (f(a))^ = f(a^).


Modules

Let \varphi:M \longrightarrow M^ be an R -module homomorphism of right modules. For every left module N there is a natural map \varphi \otimes N: M \otimes_ N \longrightarrow M^ \otimes_ N, form a natural transformation \eta: M \otimes_ - \implies M' \otimes_ - . For every right module N there is a natural map \eta_: \text_(M',N) \longrightarrow \text_(M,N) defined by \eta_(f) = f\varphi, form a natural transformation \eta:\text_(M',-) \implies \text_(M,-) .


Abelianization

Given a group G, we can define its abelianization G^ = G/ ,G/math>. Let \pi_G: G \to G^ denote the projection map onto the cosets of ,G/math>. This homomorphism is "natural in G", i.e., it defines a natural transformation, which we now check. Let H be a group. For any homomorphism f : G \to H, we have that ,G/math> is contained in the kernel of \pi_H \circ f, because any homomorphism into an abelian group kills the commutator subgroup. Then \pi_H \circ f factors through G^ as f^ \circ \pi_G = \pi_H \circ f for the unique homomorphism f^ : G^ \to H^. This makes : \textbf \to \textbf a functor and \pi a natural transformation, but not a natural isomorphism, from the identity functor to \text.


Hurewicz homomorphism

Functors and natural transformations abound in
algebraic topology Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces. The basic goal is to find algebraic invariant (mathematics), invariants that classification theorem, classify topological spaces up t ...
, with the Hurewicz homomorphisms serving as examples. For any pointed topological space (X,x) and positive integer n there exists a
group homomorphism In mathematics, given two groups, (''G'',∗) and (''H'', ·), a group homomorphism from (''G'',∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that : h(u*v) = h(u) \cdot h(v) whe ...
: h_n \colon \pi_n(X,x) \to H_n(X) from the n-th homotopy group of (X,x) to the n-th homology group of X. Both \pi_n and H_n are functors from the category Top* of pointed topological spaces to the category Grp of groups, and h_n is a natural transformation from \pi_n to H_n.


Determinant

Given commutative rings R and S with a ring homomorphism f : R \to S, the respective groups of invertible n \times n matrices \text_n(R) and \text_n(S) inherit a homomorphism which we denote by \text_n(f), obtained by applying f to each matrix entry. Similarly, f restricts to a group homomorphism f^* : R^* \to S^*, where R^* denotes the
group of units In algebra, a unit or invertible element of a ring is an invertible element for the multiplication of the ring. That is, an element of a ring is a unit if there exists in such that vu = uv = 1, where is the multiplicative identity; the ele ...
of R. In fact, \text_n and * are functors from the category of commutative rings \textbf to \textbf. The
determinant In mathematics, the determinant is a Scalar (mathematics), scalar-valued function (mathematics), function of the entries of a square matrix. The determinant of a matrix is commonly denoted , , or . Its value characterizes some properties of the ...
on the group \text_n(R), denoted by \text_R, is a group homomorphism : \mbox_R \colon \mbox_n(R) \to R^* which is natural in R: because the determinant is defined by the same formula for every ring, f^* \circ \text_R = \text_S\circ \text_n(f) holds. This makes the determinant a natural transformation from \text_n to *.


Double dual of a vector space

For example, if K is a field, then for every
vector space In mathematics and physics, a vector space (also called a linear space) is a set (mathematics), set whose elements, often called vector (mathematics and physics), ''vectors'', can be added together and multiplied ("scaled") by numbers called sc ...
V over K we have a "natural" injective
linear map In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that p ...
V \to 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.


Finite calculus

For every abelian group G, the set \text_\textbf(\mathbb, U(G)) of functions from the integers to the underlying set of G forms an abelian group V_(G) under pointwise addition. (Here U is the standard
forgetful functor In mathematics, more specifically in the area of category theory, a forgetful functor (also known as a stripping functor) "forgets" or drops some or all of the input's structure or properties mapping to the output. For an algebraic structure of ...
U:\textbf \to \textbf.) Given an \textbf morphism \varphi: G \to G' , the map V_\mathbb(\varphi): V_\mathbb(G) \to V_\mathbb(G') given by left composing \varphi with the elements of the former is itself a homomorphism of abelian groups; in this way we obtain a functor V_: \textbf \to \textbf. The finite difference operator \Delta_G taking each function f: \mathbb \to U(G) to \Delta(f): n \mapsto f(n+ 1) - f(n) is a map from V_(G) to itself, and the collection \Delta of such maps gives a natural transformation \Delta: V_\mathbb \to V_\mathbb.


Tensor-hom adjunction

Consider the category \textbf of abelian groups and group homomorphisms. For all abelian groups X, Y and Z we have a group isomorphism : \text(X \otimes Y, Z) \to \text(X, \text(Y, Z)). These isomorphisms are "natural" in the sense that they define a natural transformation between the two involved functors \textbf^ \times \textbf^ \times \textbf \to \textbf. (Here "op" is the opposite category of \textbf, not to be confused with the trivial opposite group functor on \textbf !) 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 "an isomorphism that 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 \eta, there is some A with which it does not commute; in some cases a single automorphism A works for all candidate isomorphisms \eta while in other cases one must show how to construct a different A_\eta 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 for example. Some authors distinguish notationally, using \cong for a natural isomorphism and \approx for an unnatural isomorphism, reserving = for equality (usually equality of maps).


Example: fundamental group of torus

As an example of the distinction between the functorial statement and individual objects, consider homotopy groups of a product space, specifically the fundamental group of the torus. The homotopy groups of a product space are naturally the product of the homotopy groups of the components, \pi_n((X,x_0) \times (Y,y_0)) \cong \pi_n((X,x_0)) \times \pi_n((Y,y_0)), with the isomorphism given by projection onto the two factors, fundamentally because maps into a product space are exactly products of maps into the components – this is a functorial statement. However, the torus (which is abstractly a product of two circles) has fundamental group isomorphic to Z^2, but the splitting \pi_1(T,t_0) \approx \mathbf \times \mathbf is not natural. Note the use of \approx, \cong, and =: :\pi_1(T,t_0) \approx \pi_1(S^1,x_0) \times \pi_1(S^1,y_0) \cong \mathbf \times \mathbf = \mathbf^2. This abstract isomorphism with a product is not natural, as some isomorphisms of T do not preserve the product: the self-homeomorphism of T (thought of as the quotient space R^2/\mathbb^2) given by \left(\begin1 & 1\\0 & 1\end\right) (geometrically a Dehn twist about one of the generating curves) acts as this matrix on \mathbb^2 (it's in the
general linear group In mathematics, the general linear group of degree n is the set of n\times n invertible matrices, together with the operation of ordinary matrix multiplication. This forms a group, because the product of two invertible matrices is again inve ...
\text(\mathbb, 2) of invertible integer matrices), which does not preserve the decomposition as a product because it is not diagonal. However, if one is given the torus as a product (T,t_0) = (S^1,x_0) \times (S^1,y_0) – equivalently, given a decomposition of the space – then the splitting of the group follows from the general statement earlier. In categorical terms, the relevant category (preserving the structure of a product space) is "maps of product spaces, namely a pair of maps between the respective components". Naturality is a categorical notion, and requires being very precise about exactly what data is given – the torus as a space that happens to be a product (in the category of spaces and continuous maps) is different from the torus presented as a product (in the category of products of two spaces and continuous maps between the respective components).


Example: dual of a finite-dimensional vector space

Every finite-dimensional vector space is isomorphic to its dual space, but there may be many different isomorphisms between the two spaces. 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 constraints (such as a requirement that maps preserve the chosen basis), the map from a space to its dual is not unique, 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, say, the zero map; see for detailed discussion. Starting from finite-dimensional vector spaces (as objects) and the identity and dual functors, 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 comes 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 T\colon V \to U that commute with the isomorphisms: T^*(\eta_(T(v))) = \eta_(v) or in other words, preserve the bilinear form: b_(T(v),T(w))=b_V(v,w). (These maps define the ''naturalizer'' of the isomorphisms.) 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.


Operations with natural transformations


Vertical composition

If \eta : F \Rightarrow G and \epsilon: G \Rightarrow H are natural transformations between functors F, G, H: C \to D, then we can compose them to get a natural transformation \epsilon \circ \eta: F \Rightarrow H. This is done component-wise: :(\epsilon \circ \eta)_X = \epsilon_X \circ \eta_X. This vertical composition of natural transformations is associative and has an identity, and allows one to consider the collection of all functors C \to D itself as a category (see below under Functor categories). The identity natural transformation \mathrm_F on functor F has components (\mathrm_F)_X = \mathrm_. :For \eta : F \Rightarrow G, \mathrm_G \circ \eta = \eta = \eta \circ \mathrm_F.


Horizontal composition

If \eta: F \Rightarrow G is a natural transformation between functors F, G: C \to D and \epsilon: J \Rightarrow K is a natural transformation between functors J, K: D \to E, then the composition of functors allows a composition of natural transformations \epsilon * \eta: J \circ F \Rightarrow K \circ G with components :(\epsilon * \eta)_X = \epsilon_ \circ J(\eta_X) = K(\eta_X) \circ \epsilon_. By using whiskering (see below), we can write :(\epsilon * \eta)_X = (\epsilon G)_X \circ (J \eta)_X = (K \eta)_X \circ (\epsilon F)_X, hence :\epsilon * \eta = \epsilon G \circ J \eta = K \eta \circ \epsilon F. This horizontal composition of natural transformations is also associative with identity. This identity is the identity natural transformation on the identity functor, i.e., the natural transformation that associate to each object its identity morphism: for object X in category C, (\mathrm_)_X = \mathrm_ = \mathrm_X. :For \eta: F \Rightarrow G with F, G: C \to D, \mathrm_ * \eta = \eta = \eta * \mathrm_. As identity functors \mathrm_C and \mathrm_D are functors, the identity for horizontal composition is also the identity for vertical composition, but not vice versa.


Whiskering

Whiskering is an external binary operation between a functor and a natural transformation. If \eta: F \Rightarrow G is a natural transformation between functors F, G: C \to D, and H: D \to E is another functor, then we can form the natural transformation H \eta: H \circ F \Rightarrow H \circ G by defining :(H \eta)_X = H(\eta_X). If on the other hand K: B \to C is a functor, the natural transformation \eta K: F \circ K \Rightarrow G \circ K is defined by :(\eta K)_X = \eta_. It's also a horizontal composition where one of the natural transformations is the identity natural transformation: :H \eta = \mathrm_H * \eta and \eta K = \eta * \mathrm_K. Note that \mathrm_H (resp. \mathrm_K) is generally not the left (resp. right) identity of horizontal composition * (H \eta \neq \eta and \eta K \neq \eta in general), except if H (resp. K) is the identity functor of the category D (resp. C).


Interchange law

The two operations are related by an identity which exchanges vertical composition with horizontal composition: if we have four natural transformations \alpha, \alpha', \beta, \beta' as shown on the image to the right, then the following identity holds: : (\beta' \circ \alpha') * (\beta \circ \alpha) = (\beta' * \beta) \circ (\alpha' * \alpha). Vertical and horizontal compositions are also linked through identity natural transformations: :for F: C \to D and G: D \to E, \mathrm_G * \mathrm_F = \mathrm_. As whiskering is horizontal composition with an identity, the interchange law gives immediately the compact formulas of horizontal composition of \eta: F \Rightarrow G and \epsilon: J \Rightarrow K without having to analyze components and the commutative diagram: :\begin \epsilon * \eta & = (\epsilon \circ \mathrm_J) * (\mathrm_G \circ \eta) = (\epsilon * \mathrm_G) \circ (\mathrm_J * \eta) = \epsilon G \circ J \eta \\ & = (\mathrm_K \circ \epsilon) * (\eta \circ \mathrm_F) = (\mathrm_K * \eta) \circ (\epsilon * \mathrm_F) = K \eta \circ \epsilon F \end.


Functor categories

If C is any category and I is a small category, we can form the
functor category In category theory, a branch of mathematics, a functor category D^C is a category where the objects are the functors F: C \to D and the morphisms are natural transformations \eta: F \to G between the functors (here, G: C \to D is another object i ...
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 \to 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
isomorphism In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between the ...
s in C^I are precisely the natural isomorphisms. That is, a natural transformation \eta: F \to G is a natural isomorphism if and only if there exists a natural transformation \epsilon: G \to F such that \eta\epsilon = 1_G and \epsilon\eta = 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 \phi: U \to V and \psi: X \to Y in C^I is a pair of morphisms f: U \to X and g: V \to Y in C such that the "square commutes", i.e. \psi \circ f = g \circ \phi. More generally, one can build the 2-category \textbf 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).


More examples

Every limit and colimit provides an example for a simple natural transformation, as a cone amounts to a natural transformation with the diagonal functor as domain. Indeed, if limits and colimits are defined directly in terms of their universal property, they are universal morphisms in a functor category.


Yoneda lemma

If X is an object of a locally small category C, then the assignment Y \mapsto \text_(X, Y) defines a covariant functor F_X: C \to \textbf. 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 \to \textbf 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
functor In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) ar ...
s. 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.


See also

* Extranatural transformation * Universal property *
Higher category theory In mathematics, higher category theory is the part of category theory at a ''higher order'', which means that some equalities are replaced by explicit morphism, arrows in order to be able to explicitly study the structure behind those equalities. H ...
* Modification (mathematics)


Notes


References

* * . * *


External links


nLab
a wiki project on mathematics, physics and philosophy with emphasis on the ''n''-categorical point of view * J. Adamek, H. Herrlich, G. Strecker
Abstract and Concrete Categories-The Joy of Cats
*
Stanford Encyclopedia of Philosophy The ''Stanford Encyclopedia of Philosophy'' (''SEP'') is a freely available online philosophy resource published and maintained by Stanford University, encompassing both an online encyclopedia of philosophy and peer-reviewed original publication ...
:
Category Theory
—by Jean-Pierre Marquis. Extensive bibliography. * Baez, John, 1996

An informal introduction to higher categories. {{Category theory Functors