Difference between revisions of "Faithful functor"
(Importing text file) |
Ulf Rehmann (talk | contribs) m (tex encoded by computer) |
||
Line 1: | Line 1: | ||
− | A [[Functor|functor]] which is "injective on Hom-sets" . Explicitly, a functor | + | <!-- |
+ | f0381601.png | ||
+ | $#A+1 = 12 n = 0 | ||
+ | $#C+1 = 12 : ~/encyclopedia/old_files/data/F038/F.0308160 Faithful functor | ||
+ | Automatically converted into TeX, above some diagnostics. | ||
+ | Please remove this comment and the {{TEX|auto}} line below, | ||
+ | if TeX found to be correct. | ||
+ | --> | ||
+ | |||
+ | {{TEX|auto}} | ||
+ | {{TEX|done}} | ||
+ | |||
+ | A [[Functor|functor]] which is "injective on Hom-sets" . Explicitly, a functor $ F : \mathfrak C \rightarrow \mathfrak D $ | ||
+ | is called faithful if, given any two morphisms $ \alpha , \beta : A \rightarrow B $ | ||
+ | in $ \mathfrak C $ | ||
+ | with the same domain and codomain, the equation $ F \alpha = F \beta $ | ||
+ | implies $ \alpha = \beta $. | ||
+ | The name derives from the representation theory of groups: a permutation (respectively, $ R $- | ||
+ | linear) representation of a group $ G $ | ||
+ | is faithful if and only if it is faithful when considered as a functor $ G \rightarrow \mathop{\rm Set} $( | ||
+ | respectively $ G \rightarrow \mathop{\rm Mod} _ {R} $). | ||
+ | A faithful functor reflects monomorphisms (that is, $ F \alpha $ | ||
+ | monic implies $ \alpha $ | ||
+ | monic) and epimorphisms; hence if the domain category $ \mathfrak C $ | ||
+ | is balanced (i.e. has the property that any morphism which is both monic and epic is an isomorphism) then it also reflects isomorphisms. A functor with the latter property is generally called conservative; however, some authors include this condition in the definition of faithfulness. | ||
In Russian literature there seems to be some confusion between the terms "faithful functor" and "exact functor" , see also [[Exact functor|Exact functor]]. | In Russian literature there seems to be some confusion between the terms "faithful functor" and "exact functor" , see also [[Exact functor|Exact functor]]. |
Revision as of 19:38, 5 June 2020
A functor which is "injective on Hom-sets" . Explicitly, a functor $ F : \mathfrak C \rightarrow \mathfrak D $
is called faithful if, given any two morphisms $ \alpha , \beta : A \rightarrow B $
in $ \mathfrak C $
with the same domain and codomain, the equation $ F \alpha = F \beta $
implies $ \alpha = \beta $.
The name derives from the representation theory of groups: a permutation (respectively, $ R $-
linear) representation of a group $ G $
is faithful if and only if it is faithful when considered as a functor $ G \rightarrow \mathop{\rm Set} $(
respectively $ G \rightarrow \mathop{\rm Mod} _ {R} $).
A faithful functor reflects monomorphisms (that is, $ F \alpha $
monic implies $ \alpha $
monic) and epimorphisms; hence if the domain category $ \mathfrak C $
is balanced (i.e. has the property that any morphism which is both monic and epic is an isomorphism) then it also reflects isomorphisms. A functor with the latter property is generally called conservative; however, some authors include this condition in the definition of faithfulness.
In Russian literature there seems to be some confusion between the terms "faithful functor" and "exact functor" , see also Exact functor.
References
[a1] | B. Mitchell, "Theory of categories" , Acad. Press (1965) |
Faithful functor. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Faithful_functor&oldid=17844