Maths encyclopedia and lessons  
Search

Mathematics Encyclopedia and Lessons

 
     
 

Lessons

Popular
Subjects

algebra
arithmetic
calculus
equations
geometry
differential equations
trigonometry
number theory
probability theory
more
 

References

applied mathematics
mathematical games
mathematicians
more
 
 

Full functor

In category theory, a full functor is a functor which is surjective when restricted to each set of morphisms with a given source and target.

In other words, a functor F : CD is full if the maps

FX,Y : MorC(X, Y) → MorD(FX, FY)

are surjective for every pair of objects X and Y in C.

Note that a full functor need not be surjective on objects or morphisms. That is, there may be objects in D not of the form FX for some X in C. Morphisms between such objects clearly cannot come from morphisms in C.

For example, let F : CSet be the functor which maps every object in C to the empty set and every morphism to the empty function. Then F is full, but neither surjective on objects or morphisms.

Another example is the forgetful functor AbGrp. This is full, but neither surjective on objects or morphisms. A counterexample is the forgetful functor GrpSet. This is not full as there are functions between group which are not group homomorphisms.

See also:

01-04-2007 01:18:14
The contents of this article are licensed from Wikipedia.org
under the GNU Free Documentation License. How to see transparent copy