Results 1  10
of
17
Weak Factorization Systems and Topological Functors
 Appl. Categ. Struct
, 2000
"... Weak factorization systems, important in homotopy theory, are related to injective objects in comma{categories. Our main result is that full functors and topological functors form a weak factorization system in the category of small categories, and that this is not cobrantly generated. We also prese ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
Weak factorization systems, important in homotopy theory, are related to injective objects in comma{categories. Our main result is that full functors and topological functors form a weak factorization system in the category of small categories, and that this is not cobrantly generated. We also present a weak factorization system on the category of posets which is not cobrantly generated. No such weak factorization systems were known until recently. This answers an open problem posed by M. Hovey.
Natural weak factorization systems
 Archivum Mathematicum
"... Dedicated to Jiˇrí Rosick´y at the occasion of his sixtieth birthday Abstract. In order to facilitate a natural choice for morphisms created by the (left or right) lifting property as used in the definition of weak factorization systems, the notion of natural weak factorization system in the categor ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Dedicated to Jiˇrí Rosick´y at the occasion of his sixtieth birthday Abstract. In order to facilitate a natural choice for morphisms created by the (left or right) lifting property as used in the definition of weak factorization systems, the notion of natural weak factorization system in the category K is introduced, as a pair (comonad, monad) overK 2. The link with existing notions in terms of morphism classes is given via the respective Eilenberg– Moore categories. 1.
LeftDetermined Model Categories and Universal Homotopy Theories
"... We say that a model category is leftdetermined if the weak equivalences are generated (in a sense specified below) by the cofibrations. While the model category of simplicial sets is not leftdetermined, we show that its nonoriented variant, the category of symmetric simplicial sets (in the sense ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
We say that a model category is leftdetermined if the weak equivalences are generated (in a sense specified below) by the cofibrations. While the model category of simplicial sets is not leftdetermined, we show that its nonoriented variant, the category of symmetric simplicial sets (in the sense of Lawvere and Grandis) carries a natural leftdetermined model category structure. This is used to give another and, as we believe simpler, proof of a recent result of D. Dugger about universal homotopy theories. 1
Understanding the small object argument
 Applied Categorical Structures
, 2008
"... The small object argument is a transfinite construction which, starting from a set of maps in a category, generates a weak factorisation system on that ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
The small object argument is a transfinite construction which, starting from a set of maps in a category, generates a weak factorisation system on that
Flow does not model flows up to weak dihomotopy
 Applied Categorical Structures
, 2005
"... In particular, a new approach of dihomotopy involving simplicial presheaves over an appropriate small category is proposed. This small category is obtained by taking a full subcategory of a locally presentable ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
In particular, a new approach of dihomotopy involving simplicial presheaves over an appropriate small category is proposed. This small category is obtained by taking a full subcategory of a locally presentable
Lax Factorization Algebras
"... It is shown that many weak factorization systems appearing in functorial Quillen model categories, including all those that are cofibrantly generated, come with a rich computational structure, defined by a certain lax algebra with respect to the "squaring monad" on CAT. This structure largely facili ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
It is shown that many weak factorization systems appearing in functorial Quillen model categories, including all those that are cofibrantly generated, come with a rich computational structure, defined by a certain lax algebra with respect to the "squaring monad" on CAT. This structure largely facilitates natural choices for left or right liftings once certain basic natural choices have been made. The use of homomorphisms of such lax algebras is also discussed, with focus on "lax freeness". Mathematics Subject Classification: 18A32, 18C20, 18D05, 55P05. Key words: weak factorization system, cofibrantly generated system, (symmetric) lax factorization algebra, lax homomorphism. Supported by the Ministry of Education of the Czech Republic under project MSM 143100009. y Partial financial assistance by NSERC is acknowledged. 1 1. Introduction Weak factorization systems appear prominently in the definition of Quillen model category: for C, W, F the classes of cofibrations, weak equiva...
A generalization of Quillen’s small object argument
 J. Pure Appl. Algebra
"... Abstract. We generalize the small object argument in order to allow for its application to proper classes of maps (as opposed to sets of maps in Quillen’s small object argument). The necessity of such a generalization arose with appearance of several important examples of model categories which were ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Abstract. We generalize the small object argument in order to allow for its application to proper classes of maps (as opposed to sets of maps in Quillen’s small object argument). The necessity of such a generalization arose with appearance of several important examples of model categories which were proven to be noncofibrantly generated [2, 6, 8, 20]. Our current approach allows for construction of functorial factorizations and localizations in the equivariant model structures on diagrams of spaces [10] and diagrams of chain complexes. We also formulate a nonfunctorial version of the argument, which applies in two different model structures on the category of prospaces [11, 20]. The examples above suggest a natural extension of the framework of cofibrantly generated model categories. We introduce the concept of a classcofibrantly
Inverting weak dihomotopy equivalence using homotopy continuous flow
 Theory Appl. Categ
"... Abstract. A flow is homotopy continuous if it is indefinitely divisible up to Shomotopy. The full subcategory of cofibrant homotopy continuous flows has nice features. Not only it is big enough to contain all dihomotopy types, but also a morphism between them is a weak dihomotopy equivalence if and ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. A flow is homotopy continuous if it is indefinitely divisible up to Shomotopy. The full subcategory of cofibrant homotopy continuous flows has nice features. Not only it is big enough to contain all dihomotopy types, but also a morphism between them is a weak dihomotopy equivalence if and only if it is invertible up to dihomotopy. Thus, the category of cofibrant homotopy continuous flows provides an implementation of Whitehead’s theorem for the full dihomotopy relation, and not only for Shomotopy as in previous works of the author. This fact is not the consequence of the existence of a model structure on the category of flows because it is known that there does not exist any model structure on it whose weak equivalences are exactly the weak dihomotopy equivalences. This fact is an application of a general result for the localization of a model category with respect to a weak factorization system. Contents
A Logic of Injectivity
 University of Coimbra
, 2006
"... Injectivity of objects with respect to a set H of morphisms is an important concept of algebra, model theory and homotopy theory. Here we study the logic of injectivity consequences of H, by which we understand morphisms h such that injectivity with respect to H implies injectivity with respect to h ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Injectivity of objects with respect to a set H of morphisms is an important concept of algebra, model theory and homotopy theory. Here we study the logic of injectivity consequences of H, by which we understand morphisms h such that injectivity with respect to H implies injectivity with respect to h. We formulate three simple deduction rules for the injectivity logic and for its finitary version where morphisms between finitely ranked objects are considered only, and prove that they are sound in all categories, and complete in all “reasonable ” categories. 1