Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cofibrantly generated lax orthogonal factorisation systems

Published 24 Oct 2015 in math.CT, math.AT, and math.GN | (1510.07131v3)

Abstract: The present note has three aims. First, to complement the theory of cofibrant generation of algebraic weak factorisation systems (AWFSs) to cover some important examples that are not locally presentable categories. Secondly, to prove that cofibrantly KZ-generated AWFSs (a notion we define) are always lax orthogonal. Thirdly, to show that the two known methods of building lax orthogonal AWFSs, namely cofibrantly KZ-generation and the method of "simple adjunctions", construct different AWFSs. We study in some detail the example of cofibrant KZ-generation that yields representable multicategories, and a counterexample to cofibrant generation provided by continuous lattices.

Authors (1)

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.