|
|
| Line 1: |
Line 1: |
| {{About|natural transformations in category theory|the natural competence of bacteria to take up foreign DNA|Transformation (genetics)}}
| | My name is Genesis (29 years old) and my hobbies are Travel and Amateur radio.<br><br>Feel free to surf to my blog post [http://Simongj.nfx-studio.com/mediawiki/index.php/Utilisateur:AngelinDelee Fifa 15 Coin Generator] |
| {{other uses|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 [[morphism]]s) of the [[Category (mathematics)|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 category|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 [[functor]]s between the categories ''C'' and ''D'', then a '''natural transformation''' η from ''F'' to ''G'' associates to every object ''X'' in ''C'' a [[morphism]] {{nobreak|1=η<sub>''X''</sub> : ''F''(''X'') → ''G''(''X'')}} between objects of ''D'', called the '''component''' of η at ''X'', such that for every morphism {{nobreak|1=''f'' : ''X'' → ''Y'' in ''C''}} we have:
| |
| | |
| :<math>\eta_Y \circ F(f) = G(f) \circ \eta_X</math>
| |
| | |
| This equation can conveniently be expressed by the [[commutative diagram]]
| |
| | |
| [[File:Natural transformation.svg|175px]]
| |
| | |
| If both ''F'' and ''G'' are [[contravariant functor|contravariant]], the horizontal arrows in this diagram are reversed. If η is a natural transformation from ''F'' to ''G'', we also write {{nobreak|1=η : ''F'' → ''G''}} or {{nobreak|1=η : ''F'' ⇒ ''G''}}. This is also expressed by saying the family of morphisms {{nobreak|1=η<sub>''X''</sub> : ''F''(''X'') → ''G''(''X'')}} is '''natural''' in ''X''.
| |
| | |
| If, for every object ''X'' in ''C'', the morphism η<sub>''X''</sub> is an [[isomorphism]] in ''D'', then η is said to be a '''{{visible anchor|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 {{nobreak|1=η<sub>''X''</sub>: ''F''(''X'') → ''G''(''X'')}}. Thus a natural transformation is an infranatural transformation for which {{nobreak|1=η<sub>''Y''</sub> ∘ ''F''(''f'') = ''G''(''f'') ∘ η<sub>''X''</sub>}} for every morphism {{nobreak|1=''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===
| |
| {{details|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 [[group (mathematics)|group]]s with [[group homomorphism]]s as morphisms. If (''G'',*) is a group, we define its opposite group (''G''<sup>op</sup>,*<sup>op</sup>) as follows: ''G''<sup>op</sup> is the same set as ''G'', and the operation *<sup>op</sup> is defined by {{nobreak|1=''a'' *<sup>op</sup> ''b'' = ''b'' * ''a''}}. All multiplications in ''G''<sup>op</sup> are thus "turned around". Forming the [[Opposite category|opposite]] group becomes a (covariant!) functor from '''Grp''' to '''Grp''' if we define {{nobreak|1=''f''<sup>op</sup> = ''f''}} for any group homomorphism {{nobreak|1=''f'': ''G'' → ''H''}}. Note that ''f''<sup>op</sup> is indeed a group homomorphism from ''G''<sup>op</sup> to ''H''<sup>op</sup>:
| |
| :''f''<sup>op</sup>(''a'' *<sup>op</sup> ''b'') = ''f''(''b'' * ''a'') = ''f''(''b'') * ''f''(''a'') = ''f''<sup>op</sup>(''a'') *<sup>op</sup> ''f''<sup>op</sup>(''b'').
| |
| The content of the above statement is:
| |
| :"The identity functor {{nobreak|1=Id<sub>'''Grp'''</sub> : '''Grp''' → '''Grp'''}} is naturally isomorphic to the opposite functor {{nobreak|1=<sup>op</sup> : '''Grp''' → '''Grp'''}}."
| |
| To prove this, we need to provide isomorphisms {{nobreak|1=η<sub>''G''</sub> : ''G'' → ''G''<sup>op</sup>}} for every group ''G'', such that the above diagram commutes. Set {{nobreak|1=η<sub>''G''</sub>(''a'') = ''a''<sup>−1</sup>}}. The formulas {{nobreak|1=(''ab'')<sup>−1</sup> = ''b''<sup>−1</sup> ''a''<sup>−1</sup>}} and {{nobreak|1=(''a''<sup>−1</sup>)<sup>−1</sup> = ''a''}} show that η<sub>''G''</sub> is a group homomorphism which is its own inverse. To prove the naturality, we start with a group homomorphism {{nobreak|1=''f'' : ''G'' → ''H''}} and show {{nobreak|1=η<sub>''H''</sub> ∘ ''f'' = ''f''<sup>op</sup> ∘ η<sub>''G''</sub>}}, i.e. {{nobreak|1=(''f''(''a''))<sup>−1</sup> = ''f''<sup>op</sup>(''a''<sup>−1</sup>)}} for all ''a'' in ''G''. This is true since {{nobreak|1=''f''<sup>op</sup> = ''f''}} and every group homomorphism has the property {{nobreak|1=(''f''(''a''))<sup>−1</sup> = ''f''(''a''<sup>−1</sup>)}}.
| |
| | |
| ===Double dual of a finite dimensional vector space===
| |
| If ''K'' is a [[field (mathematics)|field]], then for every [[vector space]] ''V'' over ''K'' we have a "natural" [[injective]] [[linear map]] {{nobreak|1=''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.
| |
| | |
| ===Tensor-hom adjunction===
| |
| {{see|Tensor-hom adjunction|Adjoint functors}}
| |
| Consider the [[category of abelian groups|category '''Ab''' of abelian groups and group homomorphisms]]. For all abelian groups ''X'', ''Y'' and ''Z'' we have a group isomorphism
| |
| :{{nobreak|1=Hom(''X'' {{otimes}} ''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 {{nobreak|1='''Ab''' × '''Ab'''<sup>op</sup> × '''Ab'''<sup>op</sup> → '''Ab'''}}. (Here "op" is the [[opposite category]] of '''Ab''', not to be confused with the trivial [[opposite group]] functor on '''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 <math>\eta\colon X \to G(X),</math> proof of unnaturality is most easily shown by giving an automorphism <math>A\colon X \to X</math> that does not commute with this isomorphism (so <math>\eta \circ A \neq G(A) \circ \eta</math>). 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''<sub>''η''</sub> 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).
| |
| | |
| ===Example: fundamental group of torus===
| |
| As an example of the distinction between the functorial statement and individual objects, consider [[homotopy group]]s of a product space, specifically the fundamental group of the torus.
| |
| | |
| The [[homotopy group]]s of a product space are naturally the product of the homotopy groups of the components, <math>\pi_n((X,x_0) \times (Y,y_0)) \cong \pi_n((X,x_0)) \times \pi_n((Y,y_0)),</math> 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, given the torus, which is abstractly a product of two circles, and thus has [[fundamental group]] isomorphic to '''Z'''<sup>2</sup>, but the splitting <math>\pi_1(T,t_0) \approx \mathbf{Z} \times \mathbf{Z}</math> is not natural. Note the use of <math>\approx</math>, <math>\cong</math>, and <math>=</math>:{{efn|1='''Z'''<sup>''n''</sup> could be defined as the ''n''-fold product of '''Z''', or as the product of '''Z'''<sup>''n'' − 1</sup> and '''Z''', which are subtly different sets (though they can be naturally identified, which would be notated as ≅). Here we've fixed a definition, and in any case they coincide for ''n'' = 2.}}
| |
| :<math>\pi_1(T,t_0) \approx \pi_1(S^1,x_0) \times \pi_1(S^1,y_0) \cong \mathbf{Z} \times \mathbf{Z} = \mathbf{Z}^2.</math>
| |
| 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'''<sup>2</sup>/'''Z'''<sup>2</sup>) given by <math>\left(\begin{smallmatrix}1 & 1\\0 & 1\end{smallmatrix}\right)</math> (geometrically a [[Dehn twist]] about one of the generating curves) acts as this matrix on '''Z'''<sup>2</sup> (it’s in the [[general linear group]] GL('''Z''', 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 <math>(T,t_0) = (S^1,x_0) \times (S^1,y_0)</math> – 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 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.<ref>{{harv|MacLane|Birkhoff|1999|loc=§VI.4}}</ref> 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 {{harv|MacLane|Birkhoff|1999|loc=§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, <math>\eta_V\colon V \to V^*.</math> In other words, take as objects vector spaces with a [[nondegenerate bilinear form]] <math>b_V\colon V \times V \to K.</math> This defines an infranatural isomorphism (isomorphism for each object). One then restricts the maps to only those maps T that commute with the isomorphisms: <math>T^*(\eta_{T(V)}(T(v))) = \eta_{V}(v)</math> or in other words, preserve the bilinear form: <math>b_{T(V)}(T(v),T(w))=b_V(v,w).</math> (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 space]]s), 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 ==
| |
| If {{nobreak|1=η : ''F'' → ''G''}} and {{nobreak|1=ε : ''G'' → ''H''}} are natural transformations between functors {{nobreak|1=''F'',''G'',''H'' : ''C'' → ''D''}}, then we can compose them to get a natural transformation {{nobreak|1=εη : ''F'' → ''H''}}. This is done componentwise: {{nobreak|1=(εη)<sub>''X''</sub> = ε<sub>''X''</sub>η<sub>''X''</sub>}}. This "vertical composition" of natural transformation is [[associative]] and has an identity, and allows one to consider the collection of all functors {{nobreak|1=''C'' → ''D''}} itself as a category (see below under [[#Functor categories|Functor categories]]).
| |
| | |
| Natural transformations also have a "horizontal composition". If {{nobreak|1=η : ''F'' → ''G''}} is a natural transformation between functors {{nobreak|1=''F'',''G'' : ''C'' → ''D''}} and {{nobreak|1=ε : ''J'' → ''K''}} is a natural transformation between functors {{nobreak|1=''J'',''K'' : ''D'' → ''E''}}, then the composition of functors allows a composition of natural transformations {{nobreak|1=ηε : ''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 {{nobreak|1=η : ''F'' → ''G''}} is a natural transformation between functors {{nobreak|1=''F'',''G'' : ''C'' → ''D''}}, and {{nobreak|1=''H'' : ''D'' → ''E''}} is another functor, then we can form the natural transformation {{nobreak|1=''H''η : ''HF'' → ''HG''}} by defining
| |
| | |
| :<math> (H \eta)_X = H \eta_X. </math>
| |
| | |
| If on the other hand {{nobreak|1=''K'' : ''B'' → ''C''}} is a functor, the natural transformation {{nobreak|1=η''K'' : ''FK'' → ''GK''}} is defined by
| |
| | |
| :<math> (\eta K)_X = \eta_{K(X)}.\, </math>
| |
| | |
| ==Functor categories==
| |
| | |
| {{Main|Functor category}}
| |
| If ''C'' is any category and ''I'' is a [[small category]], we can form the [[functor category]] ''C<sup>I</sup>'' 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 {{nobreak|1=1<sub>''F''</sub> : ''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 [[isomorphism]]s in ''C<sup>I</sup>'' are precisely the natural isomorphisms. That is, a natural transformation {{nobreak|1=η : ''F'' → ''G''}} is a natural isomorphism if and only if there exists a natural transformation {{nobreak|1=ε : ''G'' → ''F''}} such that {{nobreak|1=ηε = 1<sub>''G''</sub>}} and {{nobreak|1=εη = 1<sub>''F''</sub>}}.
| |
| | |
| The functor category ''C<sup>I</sup>'' is especially useful if ''I'' arises from a [[directed graph]]. For instance, if ''I'' is the category of the directed graph {{nobreak|1=• → •}}, then ''C<sup>I</sup>'' has as objects the morphisms of ''C'', and a morphism between {{nobreak|1=φ : ''U'' → ''V''}} and {{nobreak|1=ψ : ''X'' → ''Y''}} in ''C<sup>I</sup>'' is a pair of morphisms {{nobreak|1=''f'' : ''U'' → ''X''}} and {{nobreak|1=''g'' : ''V'' → ''Y''}} in ''C'' such that the "square commutes", i.e. {{nobreak|1=ψ ''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 <math>C</math> and <math>D</math> are the functors from <math>C</math> to <math>D</math>,
| |
| * 2-cells between two 1-cells (functors) <math>F:C\to D</math> and <math>G:C\to D</math> are the natural transformations from <math>F</math> to <math>G</math>.
| |
| The horizontal and vertical compositions are the compositions between natural transformations described previously. A functor category <math>C^I</math> is then simply a hom-category in this category (smallness issues aside).
| |
| | |
| ==Yoneda lemma==
| |
| | |
| {{Main|Yoneda lemma}}
| |
| If ''X'' is an object of a [[locally small category]] ''C'', then the assignment {{nobreak|1=''Y'' {{mapsto}} Hom<sub>''C''</sub>(''X'', ''Y'')}} defines a covariant functor {{nobreak|1=''F''<sub>''X''</sub> : ''C'' → '''Set'''}}. This functor is called ''[[representable functor|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 {{nobreak|1=''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."<ref>{{harv|Mac Lane|1998|loc=§I.4}}</ref> Just as the study of [[group (mathematics)|groups]] is not complete without a study of [[group homomorphism|homomorphisms]], so the study of categories is not complete without the study of [[functor]]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 (mathematics)|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]]
| |
| | |
| ==Notes==
| |
| {{Reflist|group=lower-alpha}}
| |
| | |
| == References ==
| |
| {{Portal|Category theory}}
| |
| {{reflist}}
| |
| {{refbegin}}
| |
| *{{citation| first = Saunders | last = Mac Lane | authorlink = Saunders Mac Lane | year = 1998 | title = [[Categories for the Working Mathematician]] | series = Graduate Texts in Mathematics '''5''' | edition = 2nd | publisher = Springer-Verlag | isbn = 0-387-98403-8}}
| |
| * {{citation|first1=Saunders|last1=MacLane|authorlink1=Saunders MacLane|first2=Garrett|last2=Birkhoff|authorlink2=Garrett Birkhoff|title=Algebra|edition=3rd|publisher=AMS Chelsea Publishing|year=1999|isbn=0-8218-1646-2}}.
| |
| {{refend}}
| |
| | |
| ==External links==
| |
| * [http://ncatlab.org/nlab nLab], a wiki project on mathematics, physics and philosophy with emphasis on the ''n''-categorical point of view
| |
| * [[André Joyal]], [http://ncatlab.org/nlab CatLab], a wiki project dedicated to the exposition of categorical mathematics
| |
| * {{cite web | first = Chris | last = Hillman | title = A Categorical Primer | id = {{citeseerx|10.1.1.24.3264}} | postscript = : }} formal introduction to category theory.
| |
| * J. Adamek, H. Herrlich, G. Stecker, [http://katmat.math.uni-bremen.de/acc/acc.pdf Abstract and Concrete Categories-The Joy of Cats]
| |
| * [[Stanford Encyclopedia of Philosophy]]: "[http://plato.stanford.edu/entries/category-theory/ Category Theory]" -- by Jean-Pierre Marquis. Extensive bibliography.
| |
| * [http://www.mta.ca/~cat-dist/ List of academic conferences on category theory]
| |
| * Baez, John, 1996,"[http://math.ucr.edu/home/baez/week73.html The Tale of ''n''-categories.]" An informal introduction to higher order categories.
| |
| * [http://wildcatsformma.wordpress.com WildCats] is a category theory package for [[Mathematica]]. Manipulation and visualization of objects, [[morphism]]s, categories, [[functor]]s, [[natural transformation]]s, [[universal properties]].
| |
| * [http://www.youtube.com/user/TheCatsters The catsters], a YouTube channel about category theory.
| |
| *{{planetmath reference|id=5622|title=Category Theory}}
| |
| * [http://categorieslogicphysics.wikidot.com/events Video archive] of recorded talks relevant to categories, logic and the foundations of physics.
| |
| *[http://www.j-paine.org/cgi-bin/webcats/webcats.php Interactive Web page] which generates examples of categorical constructions in the category of finite sets.
| |
| | |
| [[Category:Functors]]
| |