Weak factorization systems
by
J. Rosicky
Masaryk University, Brno, Czech Republic
Coauthors: J. Adamek, H. Herrlich, W. Tholen

Weak factorization systems generalize usual factorization systems by not requiring the unicity of a factorization. They have their origin in homotopy theory. We will present basic results about weak factorization systems by stressing their connection with injectivity in comma categories. We will also show that full functors and topological functors form a weak factorization system in the category of small categories. In particular, order embeddings form a left part of a weak factorization system in the category of posets. This weak factorization system is not cofibrantly generated. It has been an open problem to find examples of such weak factorization systems.

Date received: June 23, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caeq-51.