-completeness is seldom monadic over graphs.
The main aim of this paper is to obtain compositive cone factorizations from non-compositive ones by itereration. This is possible if and only if certain colimits of (possibly large) chains exist. In particular, we show that (strong-epi, mono) factorizations of cones exist if and only if joint coequalizers and colimits of chains of regular epimorphisms exist.
We study matrix factorizations of a potential W which is a section of a line bundle on an algebraic stack. We relate the corresponding derived category (the category of D-branes of type B in the Landau-Ginzburg model with potential W) with the singularity category of the zero locus of W generalizing a theorem of Orlov. We use this result to construct push-forward functors for matrix factorizations with relatively proper support.
We prove a number of results involving categories enriched over CMet, the category of complete metric spaces with possibly infinite distances. The category CPMet of path complete metric spaces is locally -presentable, closed monoidal, and coreflective in CMet. We also prove that the category CCMet of convex complete metric spaces is not closed monoidal and characterize the isometry--generated objects in CMet, CPMet and CCMet, answering questions by Di Liberti and Rosický. Other results include...
In many situations, minimal models are used as representatives of homotopy types. In this paper we state this fact as an equivalence of categories. This equivalence follows from an axiomatic definition of minimal objects. We see that this definition includes examples such as minimal resolutions of Eilenberg-Nakayama-Tate, minimal fiber spaces of Kan and Λ-minimal Λ-extensions of Halperin. For the first one, this is done by generalizing the construction of minimal resolutions of modules to complexes....