PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Revision difference : inverse image of a morphism
Version 3 Version 2
Let $f:A\to B$ be a morphism in a category $\mathcal{C}$. Let $\im(f)$ be the image of $f$ and $i:\im(f)\to B$ be a representing monomorphism. The inverse image of $f$ is the pullback of $f:A\to B$ and $i: \im(f) \to B$: Let $f:A\to B$ be a morphism in a category $\mathcal{C}$. Let $\im(f)$ be the image of $f$ and $i:\im(f)\to B$ be a representing monomorphism. The inverse image of $f$ is the pullback of $f:A\to B$ and $i: \im(f) \to B$:
$$\xymatrix@+=3pc{ $$\xymatrix@+=3pc{
{C}\ar[r] \ar[d] &{A}\ar[d]^{f} \\ {C}\ar[r] \ar[d] &{A}\ar[d]^{f} \\
{\im(f)}\ar[r]^i &{B} {\im(f)}\ar[r]^i &{B}
} }
$$ $$
$C$ is sometimes denoted by $f^{-1}(B)$. Since the diagram is a pullback and $i$ is monomoprhic, the inverse image $f^{-1}(B)$ is a subobject of $A$ (see \PMlinkname{this entry}{PullbackOfAMonomorphismIsAMonomorphism} for more detail.) $C$ is sometimes denoted by $f^{-1}(B)$. Since the diagram is a pullback and $i$ is monomoprhic, the inverse image $f^{-1}(B)$ is a subobject of $A$.
For example, in $\textbf{Set}$, the category of sets, the inverse image, in the sense above, of a morphism $f:A\to B$ is just the \PMlinkname{inverse image}{InverseImage} of $f$ as a function: clearly, $$f^{-1}(B)=\lbrace a\in A\mid f(a)\in B\rbrace$$ is a set (a subset of $A$). Let $j:f^{-1}(B)\to A$ be the canonical inclusion, and $\overline{f}: f^{-1}(B)\to \im(f)$ be the induced function by restricting the domain of $f$ to $f^{-1}(B)$ and the range to $\im(f)$. The diagram above is clearly commutative. Suppose there is a set $S$ and two functions $g:S\to A$ and $h:S\to \im(f)$ such that $f\circ g= i\circ h$. Define $k:S\to f^{-1}(B)$ by $k(s)=g(s)$. This is a well-defined function, since $f(g(s))=i(h(s))=h(s)\in B$, or $g(s)\in f^{-1}(B)$. Furthermore, $j(k(s))=j(g(s))=g(s)$, and $\overline(f)(k(s))=f(k(s))=f(g(s))=i(h(s))=h(s)$. Finally, it is easy to see that $k$ is unique. For example, in $\textbf{Set}$, the category of sets, the inverse image, in the sense above, of a morphism $f:A\to B$ is just the \PMlinkname{inverse image}{InverseImage} of $f$ as a function.
More to come...
\textbf{Remark}. The inverse coimage of a morphism is dually defined. \textbf{Remark}. The inverse coimage of a morphism is dually defined.