Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Finitary Functors

Published 15 Feb 2019 in math.CT | (1902.05788v3)

Abstract: A simple criterion for a functor to be finitary is presented: we call $F$ finitely bounded if for all objects $X$ every finitely generated subobject of $FX$ factorizes through the $F$-image of a finitely generated subobject of $X$. This is equivalent to $F$ being finitary for all functors between `reasonable' locally finitely presentable categories, provided that $F$ preserves monomorphisms. We also discuss the question when that last assumption can be dropped. The answer is affirmative for functors between categories such as Set, K-Vec (vector spaces), boolean algebras, and actions of any finite group either on Set or on K-Vec for fields K of characteristic 0. All this generalizes to locally $\lambda$-presentable categories, $\lambda$-accessible functors and $\lambda$-presentable algebras. As an application we obtain an easy proof that the Hausdorff functor on the category of complete metric spaces is $\aleph_1$-accessible.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.