Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I'm having trouble seeing how just by having the (co- and contravariant) functors

  • $Hom(a,-)\rightarrow Set$
  • $Hom(-,b)\rightarrow Set$

I can define the bifunctor $F:C\times C\rightarrow Set$.

References:

The issue is that I cannot prove the bifunctor's axiom $F(f,g)\circ (h,i) = F(f,h)\circ F(g,i)$.

share|improve this question

1 Answer 1

up vote 3 down vote accepted

The mapping $(X, Y) \mapsto Hom(X,Y)$ is a functor $C^{op} \times C \to Set$, (where $X, Y$ are objects of $C$) not $C \times C \to Set$. This is how you get functoriality (what you called the bifunctor axiom). To be more precise, if $f, g, h, i$ are morphisms in $C$, such that both $gi$ and $hf$ exist, and $f^*$, $h^*$ are the reversed morphisms in $C^{op}$, we get:

$$ F( (f^*,g) \circ (h^*, i)) = F ( f^*h^*, gi ) = F( (hf)^*, gi) = gi\circ - \circ hf, $$

which is postcomposition by $gi$ and precomposition by $hf$. This mapping acts on $\phi \in Hom(X, Y)$ by $\phi \mapsto gi\phi hf$.

On the other hand,

$$ F(f^*, g) \circ F(h^*, i) = ( g \circ - \circ f ) \circ (i \circ - \circ h) $$

These mappings act on $\phi \in Hom(X, Y)$ by: $$ ( g \circ - \circ f )\Big[(i \circ - \circ h)(\phi)\Big] = ( g \circ - \circ f )[i\phi h] = gi \phi hf. $$

Thus, $$ F( (f^*,g) \circ (h^*, i)) = F( (f^*,g) \circ (h^*, i)). $$

Hope this helps!

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.