Jump to content

Representable functor: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
m Universal elements: fixed notation from Cat to C here too
Citation bot (talk | contribs)
Altered isbn. Added date. Upgrade ISBN10 to 13. | Use this bot. Report bugs. | Suggested by Dominic3203 | Linked from User:Mathbot/Most_linked_math_articles | #UCB_webform_linked 1389/1913
 
(26 intermediate revisions by 14 users not shown)
Line 1: Line 1:
In [[mathematics]], particularly [[category theory]], a '''representable functor''' is a [[functor]] of a special form from an arbitrary [[category (mathematics)|category]] into the [[category of sets]]. Such functors give representations of an abstract category in terms of known structures (i.e. [[Set (mathematics)|sets]] and [[function (mathematics)|function]]s) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings.
In [[mathematics]], particularly [[category theory]], a '''representable functor''' is a certain [[functor]] from an arbitrary [[category (mathematics)|category]] into the [[category of sets]]. Such functors give representations of an abstract category in terms of known structures (i.e. [[Set (mathematics)|sets]] and [[function (mathematics)|function]]s) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings.


From another point of view, representable functors for a category ''C'' are the functors ''given'' with ''C''. Their theory is a vast generalisation of [[upper set]]s in [[poset]]s, and of [[Cayley's theorem]] in [[group theory]].
From another point of view, representable functors for a category ''C'' are the functors ''given'' with ''C''. Their theory is a vast generalisation of [[upper set]]s in [[poset]]s, and [[Yoneda lemma|Yoneda's representability]] theorem generalizes [[Cayley's theorem]] in [[group theory]].


==Definition==
==Definition==


Let '''C''' be a [[locally small category]] and let '''Set''' be the [[category of sets]]. For each object ''A'' of '''C''' let Hom(''A'',–) be the [[hom functor]] which maps objects ''X'' to the set Hom(''A'',''X'').
Let '''C''' be a [[locally small category]] and let '''Set''' be the [[category of sets]]. For each object ''A'' of '''C''' let Hom(''A'',–) be the [[hom functor]] that maps object ''X'' to the set Hom(''A'',''X'').


A [[functor]] ''F'' : '''C''' → '''Set''' is said to be '''representable''' if it is [[naturally isomorphic]] to Hom(''A'',–) for some object ''A'' of '''C'''. A '''representation''' of ''F'' is a pair (''A'', Φ) where
A [[functor]] ''F'' : '''C''' → '''Set''' is said to be '''representable''' if it is [[naturally isomorphic]] to Hom(''A'',–) for some object ''A'' of '''C'''. A '''representation''' of ''F'' is a pair (''A'', Φ) where
Line 11: Line 11:
is a natural isomorphism.
is a natural isomorphism.


A [[contravariant functor]] ''G'' from '''C''' to '''Set''' is the same thing as a functor ''G'' : '''C'''<sup>op</sup> → '''Set''' and is therefore representable just when it is naturally isomorphic to the contravariant hom-functor Hom(&ndash;,''A'') for some object ''A'' of '''C'''.
A [[contravariant functor]] ''G'' from '''C''' to '''Set''' is the same thing as a functor ''G'' : '''C'''<sup>op</sup> → '''Set''' and is commonly called a [[presheaf (category theory)|presheaf]]. A presheaf is representable when it is naturally isomorphic to the contravariant hom-functor Hom(&ndash;,''A'') for some object ''A'' of '''C'''.

==Universal elements==


== Universal elements ==
According to [[Yoneda's lemma]], natural transformations from Hom(''A'',&ndash;) to ''F'' are in one-to-one correspondence with the elements of ''F''(''A''). Given a natural transformation Φ : Hom(''A'',&ndash;) → ''F'' the corresponding element ''u'' ∈ ''F''(''A'') is given by
According to [[Yoneda's lemma]], natural transformations from Hom(''A'',&ndash;) to ''F'' are in one-to-one correspondence with the elements of ''F''(''A''). Given a natural transformation Φ : Hom(''A'',&ndash;) → ''F'' the corresponding element ''u'' ∈ ''F''(''A'') is given by
:<math>u = \Phi_A(\mathrm{id}_A).\,</math>
:<math>u = \Phi_A(\mathrm{id}_A).\,</math>
Line 20: Line 19:
:<math>\Phi_X(f) = (Ff)(u)\,</math>
:<math>\Phi_X(f) = (Ff)(u)\,</math>
where ''f'' is an element of Hom(''A'',''X''). In order to get a representation of ''F'' we want to know when the natural transformation induced by ''u'' is an isomorphism. This leads to the following definition:
where ''f'' is an element of Hom(''A'',''X''). In order to get a representation of ''F'' we want to know when the natural transformation induced by ''u'' is an isomorphism. This leads to the following definition:
:A '''universal element''' of a functor ''F'' : '''C''' &rarr; '''Set''' is a pair (''A'',''u'') consisting of an object ''A'' of '''C''' and an element ''u'' &isin; ''F''(''A'') such that for every pair (''X'',''v'') with ''v'' &isin; ''F''(''X'') there exists a unique morphism ''f'' : ''A'' &rarr; ''X'' such that (''Ff'')''u'' = ''v''.
:A '''universal element''' of a functor ''F'' : '''C''' &rarr; '''Set''' is a pair (''A'',''u'') consisting of an object ''A'' of '''C''' and an element ''u'' &isin; ''F''(''A'') such that for every pair (''X'',''v'') consisting of an object ''X'' of '''C''' and an element ''v'' &isin; ''F''(''X'') there exists a unique morphism ''f'' : ''A'' &rarr; ''X'' such that (''Ff'')(''u'') = ''v''.
A universal element may be viewed as a [[universal morphism]] from the one-point set {•} to the functor ''F'' or as an [[initial object]] in the [[category of elements]] of ''F''.
A universal element may be viewed as a [[universal morphism]] from the one-point set {•} to the functor ''F'' or as an [[initial object]] in the [[category of elements]] of ''F''.


Line 27: Line 26:
==Examples==
==Examples==


* The [[functor represented by a scheme]] ''A'' can sometimes describe families of geometric objects''.'' For example, [[Vector bundle|vector bundles]] of rank ''k'' over a given algebraic variety or scheme ''X'' correspond to algebraic morphisms <math>X\to A</math> where ''A'' is the [[Grassmannian]] of ''k''-planes in a high-dimensional space. Also certain types of subschemes are represented by [[Hilbert scheme|Hilbert schemes]].
* Consider the contravariant functor ''P'' : '''Set''' → '''Set''' which maps each set to its [[power set]] and each function to its [[inverse image]] map. To represent this functor we need a pair (''A'',''u'') where ''A'' is a set and ''u'' is a subset of ''A'', i.e. an element of ''P''(''A''), such that for all sets ''X'', the hom-set Hom(''X'',''A'') is isomorphic to ''P''(''X'') via Φ<sub>''X''</sub>(''f'') = (''Pf'')''u'' = ''f''<sup>–1</sup>(''u''). Take ''A'' = {0,1} and ''u'' = {1}. Given a subset ''S'' ⊆ ''X'' the corresponding function from ''X'' to ''A'' is the [[indicator function|characteristic function]] of ''S''.
* Let ''C'' be the category of [[CW-complex]]es with morphisms given by homotopy classes of continuous functions. For each natural number ''n'' there is a contravariant functor ''H''<sup>''n''</sup> : ''C'' → '''Ab''' which assigns each CW-complex its ''n''<sup>th</sup> [[cohomology group]] (with integer coefficients). Composing this with the [[forgetful functor]] we have a contravariant functor from ''C'' to '''Set'''. [[Brown's representability theorem]] in algebraic topology says that this functor is represented by a CW-complex ''K''('''Z''',''n'') called an [[Eilenberg–MacLane space]].
*Consider the contravariant functor ''P'' : '''Set''' → '''Set''' which maps each set to its [[power set]] and each function to its [[inverse image]] map. To represent this functor we need a pair (''A'',''u'') where ''A'' is a set and ''u'' is a subset of ''A'', i.e. an element of ''P''(''A''), such that for all sets ''X'', the hom-set Hom(''X'',''A'') is isomorphic to ''P''(''X'') via Φ<sub>''X''</sub>(''f'') = (''Pf'')''u'' = ''f''<sup>−1</sup>(''u''). Take ''A'' = {0,1} and ''u'' = {1}. Given a subset ''S'' ⊆ ''X'' the corresponding function from ''X'' to ''A'' is the [[indicator function|characteristic function]] of ''S''.
*[[Forgetful functor]]s to '''Set''' are very often representable. In particular, a forgetful functor is represented by (''A'', ''u'') whenever ''A'' is a [[free object]] over a [[singleton set]] with generator ''u''.
*[[Forgetful functor]]s to '''Set''' are very often representable. In particular, a forgetful functor is represented by (''A'', ''u'') whenever ''A'' is a [[free object]] over a [[singleton set]] with generator ''u''.
** The forgetful functor '''Grp''' → '''Set''' on the [[category of groups]] is represented by ('''Z''', 1).
** The forgetful functor '''Grp''' → '''Set''' on the [[category of groups]] is represented by ('''Z''', 1).
Line 33: Line 34:
** The forgetful functor '''Vect''' → '''Set''' on the [[category of real vector spaces]] is represented by ('''R''', 1).
** The forgetful functor '''Vect''' → '''Set''' on the [[category of real vector spaces]] is represented by ('''R''', 1).
** The forgetful functor '''Top''' → '''Set''' on the [[category of topological spaces]] is represented by any singleton topological space with its unique element.
** The forgetful functor '''Top''' → '''Set''' on the [[category of topological spaces]] is represented by any singleton topological space with its unique element.
*A [[group (mathematics)|group]] ''G'' can be considered a category (even a [[groupoid]]) with one object which we denote by •. A functor from ''G'' to '''Set''' then corresponds to a [[G-set|''G''-set]]. The unique hom-functor Hom(•,&ndash;) from ''G'' to '''Set''' corresponds to the canonical ''G''-set ''G'' with the action of left multiplication. Standard arguments from group theory show that a functor from ''G'' to '''Set''' is representable if and only if the corresponding ''G''-set is simply transitive (i.e. a [[torsor|''G''-torsor]]). Choosing a representation amounts to choosing an identity for the group structure.
*A [[group (mathematics)|group]] ''G'' can be considered a category (even a [[groupoid]]) with one object which we denote by •. A functor from ''G'' to '''Set''' then corresponds to a [[G-set|''G''-set]]. The unique hom-functor Hom(•,&ndash;) from ''G'' to '''Set''' corresponds to the canonical ''G''-set ''G'' with the action of left multiplication. Standard arguments from group theory show that a functor from ''G'' to '''Set''' is representable if and only if the corresponding ''G''-set is simply transitive (i.e. a [[torsor|''G''-torsor]] or [[heap (mathematics)|heap]]). Choosing a representation amounts to choosing an identity for the heap.
*Let ''R'' be a commutative ring with identity, and let '''R'''-'''Mod''' be the category of ''R''-modules. If ''M'' and ''N'' are unitary modules over ''R'', there is a covariant functor ''B'': '''R'''-'''Mod''' → '''Set''' which assigns to each ''R''-module ''P'' the set of ''R''-bilinear maps ''M'' × ''N'' → ''P'' and to each ''R''-module homomorphism ''f'' : ''P'' → ''Q'' the function ''B''(''f'') : ''B''(''P'') → ''B''(''Q'') which sends each bilinear map ''g'' : ''M'' × ''N'' → ''P'' to the bilinear map ''f''∘''g'' : ''M'' × ''N''→''Q''. The functor ''B'' is represented by the ''R''-module ''M'' ⊗<sub>''R''</sub> ''N''.<ref>{{cite book|last1=Hungerford|first1=Thomas|title=Algebra|publisher=Springer-Verlag|isbn=3-540-90518-9|page=470}}</ref>
*Let ''C'' be the category of [[CW-complex]]es with morphisms given by homotopy classes of continuous functions. For each natural number ''n'' there is a contravariant functor ''H''<sup>''n''</sup> : ''C'' → '''Ab''' which assigns each CW-complex its ''n''<sup>th</sup> [[cohomology group]] (with integer coefficients). Composing this with the [[forgetful functor]] we have a contravariant functor from ''C'' to '''Set'''. [[Brown's representability theorem]] in algebraic topology says that this functor is represented by a CW-complex ''K''('''Z''',''n'') called an [[Eilenberg–Mac Lane space]].

== Analogy: Representable functionals ==
Consider a linear functional on a complex [[Hilbert space]] ''H'', i.e. a linear function <math>F: H\to\mathbb C</math>. The [[Riesz representation theorem]] states that if ''F'' is continuous, then there exists a unique element <math>a\in H</math> which represents ''F'' in the sense that ''F'' is equal to the inner product functional <math>\langle a, -\rangle </math>, that is <math>F(v) = \langle a,v\rangle </math> for <math>v\in H</math>.

For example, the continuous linear functionals on the [[Square-integrable function|square-integrable function space]] <math>H = L^2(\mathbb R)</math> are all representable in the form <math>\textstyle F(v) = \langle a,v\rangle = \int_{\mathbb R} a(x)v(x)\,dx</math> for a unique function <math>a(x)\in H</math>. The theory of [[Distribution (mathematics)|distributions]] considers more general continuous functionals on the space of test functions <math>C=C^\infty_c(\mathbb R)</math>. Such a distribution functional is not necessarily representable by a function, but it may be considered intuitively as a generalized function. For instance, the [[Dirac delta function]] is the distribution defined by <math>F(v) = v(0)</math> for each test function <math>v(x)\in C</math>, and may be thought of as "represented" by an infinitely tall and thin bump function near <math>x=0</math>.

Thus, a function <math>a(x)</math> may be determined not by its values, but by its effect on other functions via the inner product. Analogously, an object ''A'' in a category may be characterized not by its internal features, but by its [[Functor represented by a scheme|functor of points]], i.e. its relation to other objects via morphisms. Just as non-representable functionals are described by distributions, non-representable functors may be described by more complicated structures such as [[Stack (mathematics)|stacks]].


==Properties==
==Properties==

===Uniqueness===
===Uniqueness===


Line 68: Line 77:
is a bijection for all ''X'' and ''Y''.
is a bijection for all ''X'' and ''Y''.


The dual statements are also true. Let ''F'' : ''C'' → ''D'' be a functor and let ''Y'' be an object of ''D''. Then (''A'',φ) is a universal morphism from ''F'' to ''Y'' if and only if (''A'',φ) is a representation of the functor Hom<sub>''D''</sub>(''F''&ndash;,''Y'') from ''C'' to '''Set'''. It follows that ''F'' has a right-adjoint ''G'' if and only if Hom<sub>''D''</sub>(''F''&ndash;,''Y'') is representable for all ''Y'' in ''D''.
The dual statements are also true. Let ''F'' : ''C'' → ''D'' be a functor and let ''Y'' be an object of ''D''. Then (''A'',φ) is a universal morphism from ''F'' to ''Y'' if and only if (''A'',φ) is a representation of the functor Hom<sub>''D''</sub>(''F''&ndash;,''Y'') from ''C'' to '''Set'''. It follows that ''F'' has a right-adjoint ''G'' if and only if Hom<sub>''D''</sub>(''F''&ndash;,''Y'') is representable for all ''Y'' in ''D''.<ref>{{cite book |last=Nourani |first=Cyrus |title=A Functorial Model Theory: Newer Applications to Algebraic Topology, Descriptive Sets, and Computing Categories Topos |date=19 April 2016 |publisher=CRC Press |page=28 |isbn=978-1482231502}}</ref>

== See also ==
* [[Subobject classifier]]
* [[Density theorem (category theory)|Density theorem]]


== References ==
== References ==
<references />


*{{cite book | 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 | isbn = 0-387-98403-8}}
*{{cite book | first = Saunders | last = Mac Lane | author-link = Saunders Mac Lane | year = 1998 | title = [[Categories for the Working Mathematician]] | series = Graduate Texts in Mathematics '''5''' | edition = 2nd | publisher = Springer | isbn = 0-387-98403-8}}


{{Functors}}
{{Functors}}
[[Category:Representable functors| ]]


[[Category:Representable functors| ]]
[[de:Darstellbarkeit (Kategorientheorie)]]
[[fr:Foncteur représentable]]
[[zh-yue:表示得函子]]

Latest revision as of 08:39, 16 December 2024

In mathematics, particularly category theory, a representable functor is a certain functor from an arbitrary category into the category of sets. Such functors give representations of an abstract category in terms of known structures (i.e. sets and functions) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings.

From another point of view, representable functors for a category C are the functors given with C. Their theory is a vast generalisation of upper sets in posets, and Yoneda's representability theorem generalizes Cayley's theorem in group theory.

Definition

[edit]

Let C be a locally small category and let Set be the category of sets. For each object A of C let Hom(A,–) be the hom functor that maps object X to the set Hom(A,X).

A functor F : CSet is said to be representable if it is naturally isomorphic to Hom(A,–) for some object A of C. A representation of F is a pair (A, Φ) where

Φ : Hom(A,–) → F

is a natural isomorphism.

A contravariant functor G from C to Set is the same thing as a functor G : CopSet and is commonly called a presheaf. A presheaf is representable when it is naturally isomorphic to the contravariant hom-functor Hom(–,A) for some object A of C.

Universal elements

[edit]

According to Yoneda's lemma, natural transformations from Hom(A,–) to F are in one-to-one correspondence with the elements of F(A). Given a natural transformation Φ : Hom(A,–) → F the corresponding element uF(A) is given by

Conversely, given any element uF(A) we may define a natural transformation Φ : Hom(A,–) → F via

where f is an element of Hom(A,X). In order to get a representation of F we want to know when the natural transformation induced by u is an isomorphism. This leads to the following definition:

A universal element of a functor F : CSet is a pair (A,u) consisting of an object A of C and an element uF(A) such that for every pair (X,v) consisting of an object X of C and an element vF(X) there exists a unique morphism f : AX such that (Ff)(u) = v.

A universal element may be viewed as a universal morphism from the one-point set {•} to the functor F or as an initial object in the category of elements of F.

The natural transformation induced by an element uF(A) is an isomorphism if and only if (A,u) is a universal element of F. We therefore conclude that representations of F are in one-to-one correspondence with universal elements of F. For this reason, it is common to refer to universal elements (A,u) as representations.

Examples

[edit]
  • The functor represented by a scheme A can sometimes describe families of geometric objects. For example, vector bundles of rank k over a given algebraic variety or scheme X correspond to algebraic morphisms where A is the Grassmannian of k-planes in a high-dimensional space. Also certain types of subschemes are represented by Hilbert schemes.
  • Let C be the category of CW-complexes with morphisms given by homotopy classes of continuous functions. For each natural number n there is a contravariant functor Hn : CAb which assigns each CW-complex its nth cohomology group (with integer coefficients). Composing this with the forgetful functor we have a contravariant functor from C to Set. Brown's representability theorem in algebraic topology says that this functor is represented by a CW-complex K(Z,n) called an Eilenberg–MacLane space.
  • Consider the contravariant functor P : SetSet which maps each set to its power set and each function to its inverse image map. To represent this functor we need a pair (A,u) where A is a set and u is a subset of A, i.e. an element of P(A), such that for all sets X, the hom-set Hom(X,A) is isomorphic to P(X) via ΦX(f) = (Pf)u = f−1(u). Take A = {0,1} and u = {1}. Given a subset SX the corresponding function from X to A is the characteristic function of S.
  • Forgetful functors to Set are very often representable. In particular, a forgetful functor is represented by (A, u) whenever A is a free object over a singleton set with generator u.
  • A group G can be considered a category (even a groupoid) with one object which we denote by •. A functor from G to Set then corresponds to a G-set. The unique hom-functor Hom(•,–) from G to Set corresponds to the canonical G-set G with the action of left multiplication. Standard arguments from group theory show that a functor from G to Set is representable if and only if the corresponding G-set is simply transitive (i.e. a G-torsor or heap). Choosing a representation amounts to choosing an identity for the heap.
  • Let R be a commutative ring with identity, and let R-Mod be the category of R-modules. If M and N are unitary modules over R, there is a covariant functor B: R-ModSet which assigns to each R-module P the set of R-bilinear maps M × NP and to each R-module homomorphism f : PQ the function B(f) : B(P) → B(Q) which sends each bilinear map g : M × NP to the bilinear map fg : M × NQ. The functor B is represented by the R-module MR N.[1]

Analogy: Representable functionals

[edit]

Consider a linear functional on a complex Hilbert space H, i.e. a linear function . The Riesz representation theorem states that if F is continuous, then there exists a unique element which represents F in the sense that F is equal to the inner product functional , that is for .

For example, the continuous linear functionals on the square-integrable function space are all representable in the form for a unique function . The theory of distributions considers more general continuous functionals on the space of test functions . Such a distribution functional is not necessarily representable by a function, but it may be considered intuitively as a generalized function. For instance, the Dirac delta function is the distribution defined by for each test function , and may be thought of as "represented" by an infinitely tall and thin bump function near .

Thus, a function may be determined not by its values, but by its effect on other functions via the inner product. Analogously, an object A in a category may be characterized not by its internal features, but by its functor of points, i.e. its relation to other objects via morphisms. Just as non-representable functionals are described by distributions, non-representable functors may be described by more complicated structures such as stacks.

Properties

[edit]

Uniqueness

[edit]

Representations of functors are unique up to a unique isomorphism. That is, if (A11) and (A22) represent the same functor, then there exists a unique isomorphism φ : A1A2 such that

as natural isomorphisms from Hom(A2,–) to Hom(A1,–). This fact follows easily from Yoneda's lemma.

Stated in terms of universal elements: if (A1,u1) and (A2,u2) represent the same functor, then there exists a unique isomorphism φ : A1A2 such that

Preservation of limits

[edit]

Representable functors are naturally isomorphic to Hom functors and therefore share their properties. In particular, (covariant) representable functors preserve all limits. It follows that any functor which fails to preserve some limit is not representable.

Contravariant representable functors take colimits to limits.

Left adjoint

[edit]

Any functor K : CSet with a left adjoint F : SetC is represented by (FX, ηX(•)) where X = {•} is a singleton set and η is the unit of the adjunction.

Conversely, if K is represented by a pair (A, u) and all small copowers of A exist in C then K has a left adjoint F which sends each set I to the Ith copower of A.

Therefore, if C is a category with all small copowers, a functor K : CSet is representable if and only if it has a left adjoint.

Relation to universal morphisms and adjoints

[edit]

The categorical notions of universal morphisms and adjoint functors can both be expressed using representable functors.

Let G : DC be a functor and let X be an object of C. Then (A,φ) is a universal morphism from X to G if and only if (A,φ) is a representation of the functor HomC(X,G–) from D to Set. It follows that G has a left-adjoint F if and only if HomC(X,G–) is representable for all X in C. The natural isomorphism ΦX : HomD(FX,–) → HomC(X,G–) yields the adjointness; that is

is a bijection for all X and Y.

The dual statements are also true. Let F : CD be a functor and let Y be an object of D. Then (A,φ) is a universal morphism from F to Y if and only if (A,φ) is a representation of the functor HomD(F–,Y) from C to Set. It follows that F has a right-adjoint G if and only if HomD(F–,Y) is representable for all Y in D.[2]

See also

[edit]

References

[edit]
  1. ^ Hungerford, Thomas. Algebra. Springer-Verlag. p. 470. ISBN 3-540-90518-9.
  2. ^ Nourani, Cyrus (19 April 2016). A Functorial Model Theory: Newer Applications to Algebraic Topology, Descriptive Sets, and Computing Categories Topos. CRC Press. p. 28. ISBN 978-1482231502.