Hubbry Logo
Hom functorHom functorMain
Open search
Hom functor
Community hub
Hom functor
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Hom functor
Hom functor
from Wikipedia

In mathematics, specifically in category theory, hom-sets (i.e. sets of morphisms between objects) give rise to important functors to the category of sets. These functors are called hom-functors and have numerous applications in category theory and other branches of mathematics.

Formal definition

[edit]

Let C be a locally small category (i.e. a category for which hom-classes are actually sets and not proper classes).

For all objects A and B in C we define two functors to the category of sets as follows:

Hom(A, –) : CSet Hom(–, B) : CSet[1]
This is a covariant functor given by:
  • Hom(A, –) maps each object X in C to the set of morphisms, Hom(A, X)
  • Hom(A, –) maps each morphism f : XY to the function
    Hom(A, f) : Hom(A, X) → Hom(A, Y) given by
    for each g in Hom(A, X).
This is a contravariant functor given by:
  • Hom(–, B) maps each object X in C to the set of morphisms, Hom(X, B)
  • Hom(–, B) maps each morphism h : XY to the function
    Hom(h, B) : Hom(Y, B) → Hom(X, B) given by
    for each g in Hom(Y, B).

The functor Hom(–, B) is also called the functor of points of the object B.

Note that fixing the first argument of Hom naturally gives rise to a covariant functor and fixing the second argument naturally gives a contravariant functor. This is an artifact of the way in which one must compose the morphisms.

The pair of functors Hom(A, –) and Hom(–, B) are related in a natural manner. For any pair of morphisms f : BB′ and h : A′ → A the following diagram commutes:

Both paths send g : AB to f ∘ g ∘ h : A′ → B′.

The commutativity of the above diagram implies that Hom(–, –) is a bifunctor from C × C to Set which is contravariant in the first argument and covariant in the second. Equivalently, we may say that Hom(–, –) is a bifunctor

Hom(–, –) : Cop × CSet

where Cop is the opposite category to C. The notation HomC(–, –) is sometimes used for Hom(–, –) in order to emphasize the category forming the domain.

Yoneda's lemma

[edit]

Referring to the above commutative diagram, one observes that every morphism

h : A′ → A

gives rise to a natural transformation

Hom(h, –) : Hom(A, –) → Hom(A′, –)

and every morphism

f : BB

gives rise to a natural transformation

Hom(–, f) : Hom(–, B) → Hom(–, B′)

Yoneda's lemma implies that every natural transformation between Hom functors is of this form. In other words, the Hom functors give rise to a full and faithful embedding of the category C into the functor category SetCop (covariant or contravariant depending on which Hom functor is used).

Internal Hom functor

[edit]

Some categories may possess a functor that behaves like a Hom functor, but takes values in the category C itself, rather than Set. Such a functor is referred to as the internal Hom functor, and is often written as

to emphasize its product-like nature, or as

to emphasize its functorial nature, or sometimes merely in lower-case:

For examples, see Category of relations.

Categories that possess an internal Hom functor are referred to as closed categories. One has that

,

where I is the unit object of the closed category. For the case of a closed monoidal category, this extends to the notion of currying, namely, that

where is a bifunctor, the internal product functor defining a monoidal category. The isomorphism is natural in both X and Z. In other words, in a closed monoidal category, the internal Hom functor is an adjoint functor to the internal product functor. The object is called the internal Hom. When is the Cartesian product , the object is called the exponential object, and is often written as .

Internal Homs, when chained together, form a language, called the internal language of the category. The most famous of these are simply typed lambda calculus, which is the internal language of Cartesian closed categories, and the linear type system, which is the internal language of closed symmetric monoidal categories.

Properties

[edit]

Note that a functor of the form

Hom(–, A) : CopSet

is a presheaf; likewise, Hom(A, –) is a copresheaf.

A functor F : CSet that is naturally isomorphic to Hom(A, –) for some A in C is called a representable functor (or representable copresheaf); likewise, a contravariant functor equivalent to Hom(–, A) might be called corepresentable.

Note that Hom(–, –) : Cop × CSet is a profunctor, and, specifically, it is the identity profunctor .

The internal hom functor preserves limits; that is, sends limits to limits, while sends limits in , that is colimits in , into limits. In a certain sense, this can be taken as the definition of a limit or colimit.

The endofunctor Hom(E, –) : SetSet can be given the structure of a monad; this monad is called the environment (or reader) monad.

Other properties

[edit]

If A is an abelian category and A is an object of A, then HomA(A, –) is a covariant left-exact functor from A to the category Ab of abelian groups. It is exact if and only if A is projective.[2]

Let R be a ring and M a left R-module. The functor HomR(M, –): Mod-RAb[clarification needed] is adjoint to the tensor product functor – R M: AbMod-R.

See also

[edit]

Notes

[edit]

References

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In category theory, the Hom functor (also denoted as Hom\operatorname{Hom}) is a fundamental bifunctor that, for a locally small category C\mathcal{C}, maps the product category Cop×C\mathcal{C}^{\mathrm{op}} \times \mathcal{C} to the category of sets Set\mathbf{Set}, assigning to each ordered pair of objects (A,B)(A, B) the set HomC(A,B)\operatorname{Hom}_{\mathcal{C}}(A, B) consisting of all morphisms from AA to BB, while mapping pairs of morphisms to functions induced by composition. This construction, which reverses the direction in the first argument (contravariant) and preserves it in the second (covariant), was introduced by Samuel Eilenberg and Saunders Mac Lane in their seminal 1945 paper as part of the foundational framework for categories, functors, and natural transformations, initially exemplified in the context of abelian groups and topological spaces where Hom(G,H)\operatorname{Hom}(G, H) denotes the set of group homomorphisms. For a fixed object AA in C\mathcal{C}, the covariant Hom functor Hom(A,):CSet\operatorname{Hom}(A, -) : \mathcal{C} \to \mathbf{Set} sends each object BB to HomC(A,B)\operatorname{Hom}_{\mathcal{C}}(A, B) and each morphism f:BCf : B \to C to the post-composition map Hom(A,f):HomC(A,B)HomC(A,C)\operatorname{Hom}(A, f) : \operatorname{Hom}_{\mathcal{C}}(A, B) \to \operatorname{Hom}_{\mathcal{C}}(A, C) defined by gfgg \mapsto f \circ g. Dually, for fixed BB, the contravariant Hom functor Hom(,B):CopSet\operatorname{Hom}(-, B) : \mathcal{C}^{\mathrm{op}} \to \mathbf{Set} sends AA to HomC(A,B)\operatorname{Hom}_{\mathcal{C}}(A, B) and a morphism h:AAh : A' \to A to the pre-composition map Hom(h,B):HomC(A,B)HomC(A,B)\operatorname{Hom}(h, B) : \operatorname{Hom}_{\mathcal{C}}(A, B) \to \operatorname{Hom}_{\mathcal{C}}(A', B) given by gghg \mapsto g \circ h. These functors are representable, meaning Hom(A,)\operatorname{Hom}(A, -) is naturally isomorphic to any functor naturally isomorphic to it, a principle encapsulated by the , which states that the set of natural transformations Nat(Hom(A,),F)F(A)\operatorname{Nat}(\operatorname{Hom}(A, -), F) \cong F(A) for any functor F:CSetF : \mathcal{C} \to \mathbf{Set}, highlighting how Hom functors encode the structure of objects via their morphism sets. Key properties of the Hom functor include its continuity: the covariant Hom(A,)\operatorname{Hom}(A, -) preserves all limits that exist in C\mathcal{C}, while the contravariant Hom(,B)\operatorname{Hom}(-, B) preserves all colimits, making it essential for studying exactness, adjointness, and universal properties in categories like modules or topological spaces. In algebraic contexts, such as the category of abelian groups, Hom(G,H)\operatorname{Hom}(G, H) often carries additional structure, like forming an abelian group under pointwise addition, and the functoriality ensures naturality of isomorphisms, such as those between Hom sets and dual spaces in vector categories. The Hom functor's role extends to higher category theory, internal Hom in enriched categories, and applications in homotopy theory, where it underpins representability and the Yoneda embedding of C\mathcal{C} into the functor category [Cop,Set][\mathcal{C}^{\mathrm{op}}, \mathbf{Set}].

Definition

Covariant Hom Functor

In a locally small category C\mathcal{C}, the covariant Hom functor \HomC(A,)\Hom_{\mathcal{C}}(A, -) is defined for a fixed object ACA \in \mathcal{C} as a functor \HomC(A,) ⁣:CSet\Hom_{\mathcal{C}}(A, -) \colon \mathcal{C} \to \mathbf{Set} that assigns to each object XCX \in \mathcal{C} the set \HomC(A,X)\Hom_{\mathcal{C}}(A, X) consisting of all morphisms from AA to XX. On morphisms, for any f ⁣:XYf \colon X \to Y in C\mathcal{C}, the functor induces a map \HomC(A,f) ⁣:\HomC(A,X)\HomC(A,Y)\Hom_{\mathcal{C}}(A, f) \colon \Hom_{\mathcal{C}}(A, X) \to \Hom_{\mathcal{C}}(A, Y) given by post-composition: it sends each g ⁣:AXg \colon A \to X to fg ⁣:AYf \circ g \colon A \to Y. The assumption that C\mathcal{C} is locally small ensures that each \HomC(A,X)\Hom_{\mathcal{C}}(A, X) is a genuine set, rather than a proper class, allowing the functor to target the category Set\mathbf{Set}. This construction defines a functor because it preserves identities and composition: for the identity morphism \idX ⁣:XX\id_X \colon X \to X, we have \HomC(A,\idX)(g)=\idXg=g\Hom_{\mathcal{C}}(A, \id_X)(g) = \id_X \circ g = g; and for composable morphisms f ⁣:XYf \colon X \to Y and h ⁣:YZh \colon Y \to Z, \HomC(A,hf)(g)=(hf)g=h(fg)=\HomC(A,h)(\HomC(A,f)(g))\Hom_{\mathcal{C}}(A, h \circ f)(g) = (h \circ f) \circ g = h \circ (f \circ g) = \Hom_{\mathcal{C}}(A, h)(\Hom_{\mathcal{C}}(A, f)(g)). The contravariant Hom functor \HomC(,B)\Hom_{\mathcal{C}}(-, B) arises dually by fixing the codomain.

Contravariant Hom Functor

In category theory, for a locally small category C\mathcal{C} and a fixed object BCB \in \mathcal{C}, the contravariant Hom functor \HomC(,B):CopSet\Hom_{\mathcal{C}}(-, B): \mathcal{C}^{\mathrm{op}} \to \mathbf{Set} assigns to each object XCX \in \mathcal{C} the set \HomC(X,B)\Hom_{\mathcal{C}}(X, B) of all morphisms from XX to BB. This construction captures the morphisms into BB as a representable structure, dual to the covariant Hom functor \HomC(A,)\Hom_{\mathcal{C}}(A, -) that fixes the domain instead. The action on morphisms preserves the functorial structure while reversing directions due to the involvement of Cop\mathcal{C}^{\mathrm{op}}. Specifically, for a morphism h:XYh: X \to Y in C\mathcal{C} (corresponding to hop:YXh^{\mathrm{op}}: Y \to X in Cop\mathcal{C}^{\mathrm{op}}), the induced map \HomC(,B)(hop):\HomC(Y,B)\HomC(X,B)\Hom_{\mathcal{C}}(-, B)(h^{\mathrm{op}}): \Hom_{\mathcal{C}}(Y, B) \to \Hom_{\mathcal{C}}(X, B) is given by precomposition: it sends any g:YBg: Y \to B to ghg \circ h. This precomposition ensures that identities map to identities and composition is preserved in the contravariant sense, as (gh)h=g(hh)(g \circ h') \circ h = g \circ (h' \circ h) for composable s. Equivalently, \HomC(,B)\Hom_{\mathcal{C}}(-, B) can be viewed as a covariant functor from C\mathcal{C} to Setop\mathbf{Set}^{\mathrm{op}}, where Setop\mathbf{Set}^{\mathrm{op}} has the same objects as Set\mathbf{Set} but reversed arrows, explicitly reversing the direction of all induced maps on hom-sets. This perspective highlights the duality inherent in contravariant functors, aligning with the general equivalence between functors CSetop\mathcal{C} \to \mathbf{Set}^{\mathrm{op}} and CopSet\mathcal{C}^{\mathrm{op}} \to \mathbf{Set}. Intuitively, the contravariant nature of \HomC(,B)\Hom_{\mathcal{C}}(-, B) transforms colimits in C\mathcal{C} into limits in Set\mathbf{Set}; for instance, the hom-set from a colimit object to BB corresponds to the limit over the diagram of hom-sets from the diagram's objects to BB, reflecting the reversal of universal constructions.

Hom as a Bifunctor

In category theory, the Hom construction extends the individual covariant and contravariant Hom functors into a bifunctor \Hom_C(-,-): \C^{\op} \times \C \to \Set, where \C\C is a category and \Set is the category of sets. This bifunctor assigns to each ordered pair of objects (A,B)(A, B) in \C\op×\C\C^{\op} \times \C the set \HomC(A,B)\Hom_C(A, B) of all morphisms from AA to BB in \C\C. The action of this bifunctor on morphisms is defined as follows. A morphism in the product category \C\op×\C\C^{\op} \times \C consists of a pair (α,β)(\alpha, \beta), where α:AA\alpha: A' \to A is a morphism in \C\C (corresponding to a morphism AAA \to A' in \C\op\C^{\op}) and β:BB\beta: B \to B' is a morphism in \C\C. This pair induces a function \HomC(A,B)\HomC(A,B)\Hom_C(A, B) \to \Hom_C(A', B') given by postcomposing with β\beta and precomposing with α\alpha: for any ϕ\HomC(A,B)\phi \in \Hom_C(A, B), ϕβϕα.\phi \mapsto \beta \circ \phi \circ \alpha. This mapping preserves the structure of the sets of morphisms by ensuring that the result is indeed a morphism from AA' to BB', as the domain of βϕα\beta \circ \phi \circ \alpha is AA' and the codomain is BB'. To verify bifunctoriality, the assignment must respect identities and composition in \C\op×\C\C^{\op} \times \C. For the identity pair (\idA,\idB)(\id_A, \id_B), the induced map sends ϕ\idBϕ\idA=ϕ\phi \mapsto \id_B \circ \phi \circ \id_A = \phi, yielding the identity function on \HomC(A,B)\Hom_C(A, B). For composable pairs (α,β):(A,B)(A,B)(\alpha', \beta'): (A', B') \to (A'', B'') and (α,β):(A,B)(A,B)(\alpha, \beta): (A, B) \to (A', B'), their composition is (αα,ββ):(A,B)(A,B)(\alpha \circ \alpha', \beta' \circ \beta): (A, B) \to (A'', B''). The induced map for this composition sends ϕ(ββ)ϕ(αα)\phi \mapsto (\beta' \circ \beta) \circ \phi \circ (\alpha \circ \alpha'). Applying the maps sequentially gives the same result: starting with ϕ\phi, the first map yields βϕα\beta \circ \phi \circ \alpha, and the second yields β(βϕα)α=ββϕαα\beta' \circ (\beta \circ \phi \circ \alpha) \circ \alpha' = \beta' \circ \beta \circ \phi \circ \alpha \circ \alpha', confirming compatibility with composition. This structure demonstrates that the actions on the first and second components operate independently yet compatibly: the first component induces the contravariant action via precomposition, while the second induces the covariant action via postcomposition, together forming a cohesive bifunctor from the .

Basic Properties

Representable Functors

In , a functor F:CSetF: \mathcal{C} \to \mathbf{Set} from a category C\mathcal{C} to the category of sets is called representable (or left representable) if there exists an object AA in C\mathcal{C} such that FF is naturally isomorphic to the covariant Hom functor \HomC(A,)\Hom_{\mathcal{C}}(A, -), which sends each object XX in C\mathcal{C} to the set of morphisms \HomC(A,X)\Hom_{\mathcal{C}}(A, X). Dually, a contravariant functor G:CopSetG: \mathcal{C}^{\mathrm{op}} \to \mathbf{Set} is representable (or right representable) if it is naturally isomorphic to \HomC(,B)\Hom_{\mathcal{C}}(-, B) for some object BB in C\mathcal{C}, where \HomC(,B)\Hom_{\mathcal{C}}(-, B) assigns to each XX the set \HomC(X,B)\Hom_{\mathcal{C}}(X, B). This notion captures functors that can be "represented" by a single object in the category, providing a concrete model for their action on objects and morphisms. The representing object AA for a representable functor F\HomC(A,)F \cong \Hom_{\mathcal{C}}(A, -) satisfies a universal property: the natural isomorphism identifies elements of F(X)F(X) with morphisms from AA to XX, such that the identity morphism \idA\id_A in \HomC(A,A)\Hom_{\mathcal{C}}(A, A) corresponds to a distinguished "universal element" in F(A)F(A), which generates all other elements via postcomposition with morphisms from A. This universal arrow ensures that any other functor with a natural transformation to FF factors uniquely through the representing object, embodying the essence of representability as a form of universality in the functor category. The assignment of objects AA in C\mathcal{C} to their associated Hom functors defines the Yoneda embedding, a functor y:C[Cop,Set]y: \mathcal{C} \to [\mathcal{C}^{\mathrm{op}}, \mathbf{Set}] given by y(A)=\HomC(A,)y(A) = \Hom_{\mathcal{C}}(A, -), which is full and faithful, embedding C\mathcal{C} densely into the category of presheaves on C\mathcal{C}. This embedding highlights how representable functors form a core subclass within the larger category of all s to sets, with the full faithfulness arising as a consequence of the . A basic example occurs in the category Set\mathbf{Set} of sets, where the singleton set 1={}1 = \{ * \} represents the identity (or forgetful) functor SetSet\mathbf{Set} \to \mathbf{Set} via the natural isomorphism \HomSet(1,X)X\Hom_{\mathbf{Set}}(1, X) \cong X, since morphisms from the singleton to XX are in bijection with elements of XX.

Continuity and Exactness

The covariant Hom functor \Hom(A,)\Hom(A, -) from a category C\mathcal{C} to the category of sets preserves all small limits. Specifically, if limiXi\lim_i X_i is the limit of a small diagram in C\mathcal{C}, then there is a natural isomorphism \Hom(A,limiXi)limi\Hom(A,Xi).\Hom(A, \lim_i X_i) \cong \lim_i \Hom(A, X_i). This follows from the universal property of the limit: a morphism from AA to the limit corresponds precisely to a compatible family of morphisms from AA to each XiX_i. Similarly, the contravariant Hom functor \Hom(,B)\Hom(-, B) from Cop\mathcal{C}^{\mathrm{op}} to the preserves all small limits in Cop\mathcal{C}^{\mathrm{op}}, or equivalently, preserves limits in C\mathcal{C}. If limiXi\lim_i X_i is a limit in C\mathcal{C}, then \Hom(limiXi,B)limi\Hom(Xi,B)\Hom(\lim_i X_i, B) \cong \lim_i \Hom(X_i, B) naturally in BB. Again, this arises from the universal property, as a morphism from the limit to BB is determined by compatible morphisms from each XiX_i to BB. In the context of abelian categories, both Hom functors are left exact, meaning they preserve finite limits and thus the exactness of short exact sequences at the initial terms. For an abelian category A\mathcal{A} and object PAP \in \mathcal{A}, the covariant functor \HomA(P,):A\Ab\Hom_{\mathcal{A}}(P, -) : \mathcal{A} \to \Ab is left exact. If 0XYZ00 \to X \to Y \to Z \to 0 is a short exact sequence in A\mathcal{A}, then 0\HomA(P,X)\HomA(P,Y)\HomA(P,Z)0 \to \Hom_{\mathcal{A}}(P, X) \to \Hom_{\mathcal{A}}(P, Y) \to \Hom_{\mathcal{A}}(P, Z) is exact. Moreover, the functor is exact (preserves the full short exact sequence) if and only if PP is projective. The contravariant functor \HomA(,I):Aop\Ab\Hom_{\mathcal{A}}(-, I) : \mathcal{A}^{\mathrm{op}} \to \Ab is likewise left exact, and exact if and only if II is injective. The contravariant Hom functor \Hom(,B)\Hom(-, B) may be viewed as a presheaf on C\mathcal{C}, while the covariant Hom functor \Hom(A,)\Hom(A, -) is a copresheaf. These perspectives highlight their roles in sheaf theory and representability, where preservation properties ensure compatibility with categorical constructions.

Yoneda Lemma

Statement and Proof Outline

Yoneda's lemma provides a fundamental isomorphism relating the hom-functor to arbitrary functors into the category of sets. Named after Nobuo Yoneda, who introduced it in 1957, in its standard (contravariant) form, for a locally small category C\mathcal{C} and a functor F:CopSetF: \mathcal{C}^{\mathrm{op}} \to \mathbf{Set}, there is a natural isomorphism Nat(HomC(,A),F)F(A),\operatorname{Nat}(\operatorname{Hom}_{\mathcal{C}}(-, A), F) \cong F(A), natural in both the object ACA \in \mathcal{C} and the functor FF. The isomorphism sends a natural transformation η:HomC(,A)F\eta: \operatorname{Hom}_{\mathcal{C}}(-, A) \Rightarrow F to the element ηA(idA)F(A)\eta_A(\operatorname{id}_A) \in F(A); conversely, an element ϕF(A)\phi \in F(A) determines the natural transformation whose component at an object XX is the composite F(f)(ϕ)F(f)(\phi) for each morphism f:XAf: X \to A. The covariant version is dual: for a functor G:CSetG: \mathcal{C} \to \mathbf{Set}, there is a natural isomorphism Nat(HomC(A,),G)G(A),\operatorname{Nat}(\operatorname{Hom}_{\mathcal{C}}(A, -), G) \cong G(A), natural in ACA \in \mathcal{C} and GG. Here, a natural transformation θ:HomC(A,)G\theta: \operatorname{Hom}_{\mathcal{C}}(A, -) \Rightarrow G maps to θA(idA)G(A)\theta_A(\operatorname{id}_A) \in G(A), while an element ψG(A)\psi \in G(A) yields the transformation with component at YY given by G(g)(ψ)G(g)(\psi) for g:AYg: A \to Y. To outline the proof, begin by constructing the bijection explicitly for the covariant case. Define γ:Nat(HomC(A,),G)G(A)\gamma: \operatorname{Nat}(\operatorname{Hom}_{\mathcal{C}}(A, -), G) \to G(A) by γ(θ)=θA(idA)\gamma(\theta) = \theta_A(\operatorname{id}_A). For the inverse, given xG(A)x \in G(A), define θx:HomC(A,)G\theta_x: \operatorname{Hom}_{\mathcal{C}}(A, -) \Rightarrow G by (θx)Y(g)=G(g)(x)(\theta_x)_Y(g) = G(g)(x) for g:AYg: A \to Y; one verifies γ(θx)=x\gamma(\theta_x) = x and θγ(θ)=θ\theta_{\gamma(\theta)} = \theta using the naturality of θ\theta and functoriality of GG. Naturality in AA follows from the commutative diagram for a morphism h:AAh: A \to A': HomC(A,)HomC(h,)HomC(A,)θθGG(h)G\begin{CD} \operatorname{Hom}_{\mathcal{C}}(A, -) @>{\operatorname{Hom}_{\mathcal{C}}(h, -)}>> \operatorname{Hom}_{\mathcal{C}}(A', -) \\ @V{\theta}VV @VV{\theta'}V \\ G @>{G(h)}>> G \end{CD}
Add your contribution
Related Hubs
User Avatar
No comments yet.