Transport function: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Bearcat
No edit summary
 
en>Addbot
m Bot: Removing Orphan Tag (Nolonger an Orphan) (Report Errors)
 
Line 1: Line 1:
Globe is driven by availability plus demand. We will shall examine the Greek-Roman model. Consuming additional care to highlight the involvement of clash of clans hack tool no evaluation within the vast system which usually this provides.<br><br>Returning to conclude, [http://prometeu.net clash of clans hack tool] no record must not be left to get in approach of the bigger question: what makes we at this point? Putting this particular aside its of great signification. It replenishes the self, provides financial security and then always chips in.<br><br>Interweaving social trends form effective net in which we all have been trapped. When The Tygers of Pan Tang sang 'It's lonely start. Everyones trying to do we in', these people acquired much from clash of clans get into tool no survey. A society without conflict of clans hack tool no survey is like a society with no knowledge, in that it very good.<br><br>Games are fun, nonetheless informative also be costly. The costs of game titles and consoles can set you back more than many people might choose those to be, but this may easily be eliminated.<br><br>Golf season is here and furthermore going strong, and like for example many fans we very for Sunday afternoon when the games begin. If you have grinded and liked Soul Caliber, you will love this game. The  best is the Microchip Cell which will at random , fill in some pieces. Defeating players including that by any means necessary can be the reason that pushes these folks to use Words that has Friends Cheat. Each app requires you within order to answer 40 questions by having varying degrees of difficulty.<br><br>Had you been aware that some software games are educational tools and supplies? If you know a children that likes to enjoy video games, educational various options are a fantastic indicates to combine learning who have entertaining. The Www can connect you sufficient reason for thousands of parents that have similar values and are unquestionably more than willing to help share their reviews as well as notions with you.<br><br>Evidently individuals who produced this [http://www.uniqueCrack.net/ unique Crack] Clash of Tourists are true fans of the sport themselves,  this is exactly the thing that ensures the potency at our alternative, because experts needed to do this task ourselves.
In [[category theory]], a branch of [[mathematics]], the [[functor]]s between two given categories form a category, where the objects are the functors and the morphisms are [[natural transformation]]s between the functors. Functor categories are of interest for two main reasons:
* many commonly occurring categories are (disguised) functor categories, so any statement proved for general functor categories is widely applicable;
* every category embeds in a '''functor category''' (via the [[Yoneda embedding]]); the functor category often has nicer properties than the original category, allowing certain operations that were not available in the original setting.
 
== Definition ==
Suppose ''C'' is a [[small category]] (i.e. the objects and morphisms form a set rather than a [[proper class]]) and ''D'' is an arbitrary category. The category of functors from ''C'' to ''D'', written as Fun(''C'', ''D''), Funct(''C'',''D'') or ''D''<sup>''C''</sup>, has as objects the covariant functors from ''C'' to ''D'', and as morphisms the natural transformations between such functors. Note that natural transformations can be composed: if μ(''X'') : ''F''(''X'') → ''G''(''X'') is a natural transformation from the functor ''F'' : ''C'' → ''D'' to the functor ''G'' : ''C'' → ''D'', and η(''X'') : ''G''(''X'') → ''H''(''X'') is a natural transformation from the functor ''G'' to the functor ''H'', then the collection η(''X'')μ(''X'') : ''F''(''X'') → ''H''(''X'') defines a natural transformation from ''F'' to ''H''. With this composition of natural transformations (known as vertical composition, see [[natural transformation]]), ''D''<sup>''C''</sup> satisfies the axioms of a category.
 
In a completely analogous way, one can also consider the category of all ''contravariant'' functors from ''C'' to ''D''; we write this as Funct(''C''<sup>op</sup>,''D'').
 
If ''C'' and ''D'' are both [[preadditive category|preadditive categories]] (i.e. their morphism sets are [[abelian group]]s and the composition of morphisms is [[bilinear operator|bilinear]]), then we can consider the category of all [[additive functor]]s from ''C'' to ''D'', denoted by Add(''C'',''D'').
 
== Examples ==
* If ''I'' is a small [[discrete category]] (i.e. its only morphisms are the identity morphisms), then a functor from ''I'' to ''C'' essentially consists of a family of objects of ''C'', indexed by ''I''; the functor category ''C''<sup>''I''</sup> can be identified with the corresponding product category: its elements are families of objects in ''C'' and its morphisms are families of morphisms in ''C''.
* An [[arrow category]] <math>\mathcal{C}^\rightarrow</math> (whose objects are the morphisms of <math>\mathcal{C}</math>, and whose morphisms are commuting squares in <math>\mathcal{C}</math>) is just <math>\mathcal{C}^\mathbf{2}</math>, where '''2''' is the category with two objects and their identity morphisms as well as an arrow from one object to the other (but not another arrow back the other way).
* A [[graph theory|directed graph]] consists of a set of arrows and a set of vertices, and two functions from the arrow set to the vertex set, specifying each arrow's start and end vertex. The category of all directed graphs is thus nothing but the functor category '''Set'''<sup>''C''</sup>, where ''C'' is the category with two objects connected by two morphisms, and '''Set''' denotes the [[category of sets]].
* Any [[group (mathematics)|group]] ''G'' can be considered as a one-object category in which every morphism is invertible. The category of all [[Group action#Definition|''G''-sets]] is the same as the functor category '''[[category of sets|Set]]'''<sup>''G''</sup>.
* Similar to the previous example, the category of ''k''-linear [[group representation|representations]] of the group ''G'' is the same as the functor category '''''k''-Vect'''<sup>''G''</sup> (where '''''k''-Vect''' denotes the category of all [[vector space]]s over the [[field (mathematics)|field]] ''k'').
* Any [[ring (mathematics)|ring]] ''R'' can be considered as a one-object preadditive category; the category of left [[module (mathematics)|modules]] over ''R'' is the same as the additive functor category Add(''R'','''Ab''') (where '''Ab''' denotes the [[category of abelian groups]]), and the category of right ''R''-modules is Add(''R''<sup>op</sup>,'''Ab'''). Because of this example, for any preadditive category ''C'', the category Add(''C'','''Ab''') is sometimes called the "category of left modules over ''C''" and Add(''C''<sup>op</sup>,'''Ab''') is the category of right modules over ''C''.
* The category of [[presheaf|presheaves]] on a topological space ''X'' is a functor category: we turn the topological space into a category ''C'' having the open sets in ''X'' as objects and a single morphism from ''U'' to ''V'' if and only if ''U'' is contained in ''V''. The category of presheaves of sets (abelian groups, rings) on ''X'' is then the same as the category of contravariant functors from ''C'' to '''Set''' (or '''Ab''' or '''Ring'''). Because of this example, the category Funct(''C''<sup>op</sup>, '''Set''') is sometimes called the "[[Presheaf (category theory)|category of presheaves]] of sets on ''C''" even for general categories ''C'' not arising from a topological space. To define [[sheaf (mathematics)|sheaves]] on a general category ''C'', one needs more structure: a [[Grothendieck topology]] on ''C''. (Some authors refer to categories that are  [[equivalence (category theory)|equivalent]] to '''Set'''<sup>''C''</sup> as ''[[presheaf (category theory)|presheaf]] categories''.<ref>{{cite book
| author = Tom Leinster
| year = 2004
| title = Higher Operads, Higher Categories
| publisher = Cambridge University Press
| url = http://www.maths.gla.ac.uk/~tl/book.html
}}</ref>)
 
== Facts ==
Most constructions that can be carried out in ''D'' can also be carried out in ''D''<sup>''C''</sup> by performing them "componentwise", separately for each object in ''C''. For instance, if any two objects ''X'' and ''Y'' in ''D'' have a [[product (category theory)|product]] ''X''×''Y'', then any two functors ''F'' and ''G'' in ''D''<sup>''C''</sup> have a product ''F''×''G'', defined by (''F''×''G'')(''c'') = ''F''(''c'')×''G''(''c'') for every object ''c'' in ''C''. Similarly, if η<sub>''c''</sub> : ''F''(''c'')→''G''(''c'') is a natural transformation and each η<sub>''c''</sub> has a kernel ''K''<sub>''c''</sub> in the category ''D'', then the kernel of η in the functor category ''D''<sup>''C''</sup> is the functor ''K'' with ''K''(''c'') = ''K''<sub>''c''</sub> for every object ''c'' in ''C''.
 
As a consequence we have the general [[rule of thumb]] that the functor category ''D''<sup>''C''</sup> shares most of the "nice" properties of ''D'':
* if ''D'' is [[complete category|complete]] (or cocomplete), then so is ''D''<sup>''C''</sup>;
* if ''D'' is an [[abelian category]], then so is ''D''<sup>''C''</sup>;
 
We also have:
* if ''C'' is any small category, then the category '''Set'''<sup>''C''</sup> of [[presheaf (category theory)|presheaves]] is a [[topos]].
 
So from the above examples, we can conclude right away that the categories of directed graphs, ''G''-sets and presheaves on a topological space are all complete and cocomplete topoi, and that the categories of representations of ''G'', modules over the ring ''R'', and presheaves of abelian groups on a topological space ''X'' are all abelian, complete and cocomplete.
 
The embedding of the category ''C'' in a functor category that was mentioned earlier uses the [[Yoneda lemma]] as its main tool. For every object ''X'' of ''C'', let Hom(-,''X'') be the contravariant [[representable functor]] from ''C'' to '''Set'''. The Yoneda lemma states that the assignment
:<math>X \mapsto \operatorname{Hom}(-,X)</math>
is a [[full embedding]] of the category ''C'' into the category Funct(''C''<sup>op</sup>,'''Set'''). So ''C'' naturally sits inside a topos.
 
The same can be carried out for any preadditive category ''C'': Yoneda then yields a full embedding of ''C'' into the functor category Add(''C''<sup>op</sup>,'''Ab'''). So ''C'' naturally sits inside an abelian category.
 
The intuition mentioned above (that constructions that can be carried out in ''D'' can be "lifted" to ''D''<sup>''C''</sup>) can be made precise in several ways; the most succinct formulation uses the language of [[adjoint functors]]. Every functor ''F'' : ''D'' → ''E'' induces a functor ''F''<sup>''C''</sup> : ''D''<sup>''C''</sup> → ''E''<sup>''C''</sup> (by composition with ''F''). If ''F'' and ''G'' is a pair of adjoint functors, then ''F''<sup>''C''</sup> and ''G''<sup>''C''</sup> is also a pair of adjoint functors.
 
The functor category ''D''<sup>''C''</sup> has all the formal properties of an [[exponential object]]; in particular the functors from ''E'' × ''C'' → ''D'' stand in a natural one-to-one correspondence with the functors from ''E'' to ''D''<sup>''C''</sup>. The category '''Cat''' of all small categories with functors as morphisms is therefore a [[cartesian closed category]].
 
==See also==
* [[Diagram (category theory)]]
 
==References==
{{reflist}}
 
[[Category:Functors]]
[[Category:Category-theoretic categories]]

Latest revision as of 01:31, 9 January 2013

In category theory, a branch of mathematics, the functors between two given categories form a category, where the objects are the functors and the morphisms are natural transformations between the functors. Functor categories are of interest for two main reasons:

  • many commonly occurring categories are (disguised) functor categories, so any statement proved for general functor categories is widely applicable;
  • every category embeds in a functor category (via the Yoneda embedding); the functor category often has nicer properties than the original category, allowing certain operations that were not available in the original setting.

Definition

Suppose C is a small category (i.e. the objects and morphisms form a set rather than a proper class) and D is an arbitrary category. The category of functors from C to D, written as Fun(C, D), Funct(C,D) or DC, has as objects the covariant functors from C to D, and as morphisms the natural transformations between such functors. Note that natural transformations can be composed: if μ(X) : F(X) → G(X) is a natural transformation from the functor F : CD to the functor G : CD, and η(X) : G(X) → H(X) is a natural transformation from the functor G to the functor H, then the collection η(X)μ(X) : F(X) → H(X) defines a natural transformation from F to H. With this composition of natural transformations (known as vertical composition, see natural transformation), DC satisfies the axioms of a category.

In a completely analogous way, one can also consider the category of all contravariant functors from C to D; we write this as Funct(Cop,D).

If C and D are both preadditive categories (i.e. their morphism sets are abelian groups and the composition of morphisms is bilinear), then we can consider the category of all additive functors from C to D, denoted by Add(C,D).

Examples

  • If I is a small discrete category (i.e. its only morphisms are the identity morphisms), then a functor from I to C essentially consists of a family of objects of C, indexed by I; the functor category CI can be identified with the corresponding product category: its elements are families of objects in C and its morphisms are families of morphisms in C.
  • An arrow category 𝒞 (whose objects are the morphisms of 𝒞, and whose morphisms are commuting squares in 𝒞) is just 𝒞2, where 2 is the category with two objects and their identity morphisms as well as an arrow from one object to the other (but not another arrow back the other way).
  • A directed graph consists of a set of arrows and a set of vertices, and two functions from the arrow set to the vertex set, specifying each arrow's start and end vertex. The category of all directed graphs is thus nothing but the functor category SetC, where C is the category with two objects connected by two morphisms, and Set denotes the category of sets.
  • Any group G can be considered as a one-object category in which every morphism is invertible. The category of all G-sets is the same as the functor category SetG.
  • Similar to the previous example, the category of k-linear representations of the group G is the same as the functor category k-VectG (where k-Vect denotes the category of all vector spaces over the field k).
  • Any ring R can be considered as a one-object preadditive category; the category of left modules over R is the same as the additive functor category Add(R,Ab) (where Ab denotes the category of abelian groups), and the category of right R-modules is Add(Rop,Ab). Because of this example, for any preadditive category C, the category Add(C,Ab) is sometimes called the "category of left modules over C" and Add(Cop,Ab) is the category of right modules over C.
  • The category of presheaves on a topological space X is a functor category: we turn the topological space into a category C having the open sets in X as objects and a single morphism from U to V if and only if U is contained in V. The category of presheaves of sets (abelian groups, rings) on X is then the same as the category of contravariant functors from C to Set (or Ab or Ring). Because of this example, the category Funct(Cop, Set) is sometimes called the "category of presheaves of sets on C" even for general categories C not arising from a topological space. To define sheaves on a general category C, one needs more structure: a Grothendieck topology on C. (Some authors refer to categories that are equivalent to SetC as presheaf categories.[1])

Facts

Most constructions that can be carried out in D can also be carried out in DC by performing them "componentwise", separately for each object in C. For instance, if any two objects X and Y in D have a product X×Y, then any two functors F and G in DC have a product F×G, defined by (F×G)(c) = F(cG(c) for every object c in C. Similarly, if ηc : F(c)→G(c) is a natural transformation and each ηc has a kernel Kc in the category D, then the kernel of η in the functor category DC is the functor K with K(c) = Kc for every object c in C.

As a consequence we have the general rule of thumb that the functor category DC shares most of the "nice" properties of D:

We also have:

  • if C is any small category, then the category SetC of presheaves is a topos.

So from the above examples, we can conclude right away that the categories of directed graphs, G-sets and presheaves on a topological space are all complete and cocomplete topoi, and that the categories of representations of G, modules over the ring R, and presheaves of abelian groups on a topological space X are all abelian, complete and cocomplete.

The embedding of the category C in a functor category that was mentioned earlier uses the Yoneda lemma as its main tool. For every object X of C, let Hom(-,X) be the contravariant representable functor from C to Set. The Yoneda lemma states that the assignment

XHom(,X)

is a full embedding of the category C into the category Funct(Cop,Set). So C naturally sits inside a topos.

The same can be carried out for any preadditive category C: Yoneda then yields a full embedding of C into the functor category Add(Cop,Ab). So C naturally sits inside an abelian category.

The intuition mentioned above (that constructions that can be carried out in D can be "lifted" to DC) can be made precise in several ways; the most succinct formulation uses the language of adjoint functors. Every functor F : DE induces a functor FC : DCEC (by composition with F). If F and G is a pair of adjoint functors, then FC and GC is also a pair of adjoint functors.

The functor category DC has all the formal properties of an exponential object; in particular the functors from E × CD stand in a natural one-to-one correspondence with the functors from E to DC. The category Cat of all small categories with functors as morphisms is therefore a cartesian closed category.

See also

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

  1. 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

    My blog: http://www.primaboinca.com/view_profile.php?userid=5889534