On finitary functors

zbMATH Open1470.18006arXiv1902.05788MaRDI QIDQ5243045FDOQ5243045

Jiří Adámek, Stefan Milius, Thorsten Wißmann, Lurdes Sousa

Publication date: 14 November 2019

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 $alep{h}_1$-accessible.

Full work available at URL: https://arxiv.org/abs/1902.05788

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On finitary functors and their presentations
• scientific article; zbMATH DE number 7379294
• scientific article; zbMATH DE number 1166263
• On the fullness of certain functors
• How accessible are categories of algebras?

zbMATH Keywords

finitary functorfinitely presentable object(strictly) locally finitely presentable categoryfinitely bounded functorfinitely generated object

Mathematics Subject Classification ID

Categories of algebras (08C05) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Accessible and locally presentable categories (18C35)

Cites Work

• On tree coalgebras and coalgebra presentations
• Nominal sets. Names and symmetry in computer science
• Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
• Title not available (Why is that?)
• Title not available (Why is that?)
• A final coalgebra theorem
• Congruences of convex algebras.
• Title not available (Why is that?)
• On coalgebra based on classes
• Shorter Notes: Redei's Finiteness Theorem for Commutative Semigroups
• Title not available (Why is that?)
• Recursively defined metric spaces without contraction
• Title not available (Why is that?)
• Title not available (Why is that?)
• A small final coalgebra theorem
• Atomic toposes
• Title not available (Why is that?)
• A formula for codensity monads and density comonads
• On finitary functors and their presentations

Cited In (22)

• Recursive coalgebras of finitary functors
• Finite presentability of strongly finite dilators
• A point-free perspective on lax extensions and predicate liftings
• Continuous functions on final coalgebras
• Title not available (Why is that?)
• On the fullness of certain functors
• Title not available (Why is that?)
• New perspectives on semi-primal varieties
• A coalgebraic view on reachability
• Finitary monads on the category of posets
• Finitary Functors: From Set to Preord and Poset
• Finitely Presentable Algebras For Finitary Monads
• The homotopy automorphisms of a marked n-stage
• BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
• Graded monads and behavioural equivalence games
• Decidable (= separable) objects and morphisms in lextensive categories
• Title not available (Why is that?)
• A new foundation for finitary corecursion and iterative algebras
• Positive enumerable functors
• Exterior bundles in diffeology
• On finitary functors and their presentations
• Polyadic sets and homomorphism counting

This page was built for publication: On finitary functors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5243045)