Can forgetful functor be defined accurately? I feel the wikipedia article and Categories for the Working Mathematician don't define the concept rigorously.
- Is a forgetful functor necessarily unfaithful?
- Is a forgetful functor necessarily not isomorphic?
An isomorphism $T: C \to B$ of categories is a functor $T$ from $ C $ to $B $ which is a bijection, both on objects and on arrows. Alternatively, but equivalently, a functor $T: C \to B$ is an isomorphism if and only if there is a functor $S: B\to C$ for which both composites $ST$ and $TS$ are identity functors; then $S$ is the two-sided inverse $S = T^{-1}$.
As far as I know there is no rigorous definition of a forgetful functor. However often the term "forgetful functor" is used in conjunction with generalized concrete categories (here by "generalized" I mean that we can use any fixed category $\textbf{X}$ instead of $\textbf{Set}$). In that scenario it is faithful by the definition.
I've never heard about a case when forgetful functor is not faithful. I'm not sure what wiki means by "Forgetful functors are almost always faithful." (emphasis mine)
And in this setup forgetful functors can be isomorphisms, e.g. the identity $\textbf{Set}\to\textbf{Set}$.