Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/11277
Title: | The orthogonal subcategory problem and the small object argument | Authors: | Adámek, Jirí Hébert, Michel Sousa, Lurdes |
Issue Date: | 2007 | Publisher: | Centro de Matemática da Universidade de Coimbra | Citation: | Pré-Publicações DMUC. 07-40 (2007) | Abstract: | A classical result of P. Freyd and M. Kelly states that in “good” categories, the Orthogonal Subcategory Problem has a positive solution for all classes H of morphisms whose members are, except possibly for a subset, epimorphisms. We prove that under the same assumptions on the base category and on H, the generalization of the Small Object Argument of D. Quillen holds - that is, every object of the category has a cellular H-injective weak reflection. In locally presentable categories, we prove a sharper result: a class of morphisms is called quasi-presentable if for some cardinal ë every member of the class is either ë-presentable or an epimorphism. Both the Orthogonal Subcategory Problem and the Small Object Argument are valid for quasi-presentable classes. Surprisingly, in locally ranked categories (used previously to generalize Quillen’s result), this is no longer true: we present a class H of morphisms, all but one being epimorphisms, such that the orthogonality subcategory H? is not reflective and the injectivity subcategory InjH is not weakly reflective. We also prove that in locally presentable categories, the Injectivity Logic and the Orthogonality Logic are complete for all quasi-presentable classes. | URI: | https://hdl.handle.net/10316/11277 | Rights: | openAccess |
Appears in Collections: | FCTUC Matemática - Vários |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
The orthogonal subcategory problem and the small object argument.pdf | 307.13 kB | Adobe PDF | View/Open |
Page view(s) 50
399
checked on Nov 5, 2024
Download(s) 20
903
checked on Nov 5, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.