An anafunctor[note 1] is a notion introduced by Makkai (1996) for ordinary categories that is a generalization of functors.[1] In category theory, some statements require the axiom of choice, but the axiom of choice can sometimes be avoided when using an anafunctor.[2] For example, the statement "every fully faithful and essentially surjective functor is an equivalence of categories" is equivalent to the axiom of choice, but we can usually follow the same statement without the axiom of choice by using anafunctor instead of functor.[1][3]

Definition

edit

Span formulation of anafunctors

edit
 
Anafunctor (span)

Let X and A be categories. An anafunctor F with domain (source) X and codomain (target) A, and between categories X and A is a category  , in a notation  , is given by the following conditions:[1][4][5][6][7]

  •   is surjective on objects.
  • Let pair   and   be functors, a span of ordinary functors ( ), where   is fully faithful.

Set-theoretic definition

edit
(5)

An anafunctor   following condition:[2][8][9]

  1. A set   of specifications of  , with maps   (source),   (target).   is the set of specifications,   specifies the value   at the argument  . For  , we write   for the class   and   for   the notation   presumes that  .
  2. For each  ,  ,   and   in the class of all arrows   an arrows   in  .
  3. For every  , such that   is inhabited (non-empty).
  4.   hold identity. For all   and  , we have  
  5.   hold composition. Whenever  ,  ,  ,   and  .

See also

edit

Notes

edit
  1. ^ The etymology of anafunctor is an analogy of the biological terms anaphase/prophase.[1]

References

edit
  1. ^ a b c d (Roberts 2011)
  2. ^ a b (Makkai 1998)
  3. ^ (anafunctor in nlab, §1. Idea)
  4. ^ (Makkai 1996, §1.1. and 1.1*. Anafunctors)
  5. ^ (Palmgren 2008, §2. Anafunctors)
  6. ^ (Schreiber & Waldorf 2007, §7.4. Anafunctors)
  7. ^ (anafunctor in nlab, §2. Definitions)
  8. ^ (Makkai 1996, §1.1. Anafunctor)
  9. ^ (anafunctor in nlab, §2. Anafunctors (Explicit set-theoretic definition))

Bibliography

edit
  • Makkai, M. (1996). "Avoiding the axiom of choice in general category theory". Journal of Pure and Applied Algebra. 108 (2): 109–173. doi:10.1016/0022-4049(95)00029-1.
  • Makkai, M. (1998). "Towards a Categorical Foundation of Mathematics". Logic Colloquium '95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9-18, 1995. Vol. 11. Association for Symbolic Logic. pp. 153–191. Zbl 0896.03051.
  • Palmgren, Erik (2008). "Locally cartesian closed categories without chosen constructions". Theory and Applications of Categories. 20: 5–17.
  • Roberts, David M. (2011). "Internal categories, anafunctors and localisations" (PDF). Theory and Application of Categories. arXiv:1101.2363.
  • Schreiber, Urs; Waldorf, Konrad (2007). "Parallel Transport and Functors" (PDF). Journal of Homotopy and Related Structures. arXiv:0705.0452.

Further reading

edit
  • Kelly, G. M. (1964). "Complete functors in homology I. Chain maps and endomorphisms". Mathematical Proceedings of the Cambridge Philosophical Society. 60 (4): 721–735. Bibcode:1964PCPS...60..721K. doi:10.1017/S0305004100038202. - Kelly had already noticed a notion that was essentially the same as anafunctor in this paper, but did not seem to develop the notion further.
edit