Papers
Topics
Authors
Recent
Search
2000 character limit reached

Algebraic weak factorisation systems I: accessible AWFS

Published 19 Dec 2014 in math.CT and math.AT | (1412.6559v3)

Abstract: Algebraic weak factorisation systems (AWFS) refine weak factorisation systems by requiring that the assignations sending a map to its first and second factors should underlie an interacting comonad--monad pair on the arrow category. We provide a comprehensive treatment of the basic theory of AWFS---drawing on work of previous authors---and complete the theory with two main new results. The first provides a characterisation of AWFS and their morphisms in terms of their double categories of left or right maps. The second concerns a notion of cofibrant generation of an AWFS by a small double category; it states that, over a locally presentable base, any small double category cofibrantly generates an AWFS, and that the AWFS so arising are precisely those with accessible monad and comonad. Besides the general theory, numerous applications of AWFS are developed, emphasising particularly those aspects which go beyond the non-algebraic situation.

Authors (2)

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.