Timeline for About small-orthogonality classes of a locally presentable category
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 26, 2017 at 18:41 | vote | accept | Philippe Gaucher | ||
Jul 19, 2017 at 8:59 | comment | added | Philippe Gaucher | @JiříRosický It may be useful to point out that an erratum for your book is available here: tu-braunschweig.de/Medien-DB/iti/cor.pdf | |
Jul 16, 2017 at 8:15 | comment | added | Jiří Rosický | Theorem 1.39 in my book with Adámek is not correct for $\lambda=\omega$ (see my paper with Adámek and Hébert More on orthogonality in locally presentable categories, Cah. Top. Géom. Diff. Cat. XLII (2001), 51-80). Counterexamples there also serve for the question of Philippe. But the theorem is valid for $\lambda$ uncountable (see my paper with Hébert Uncountable orthogonality is a closure property, Bull. London Math. Soc. 33 (2001), 685-688). | |
Jul 15, 2017 at 7:30 | vote | accept | Philippe Gaucher | ||
Jul 15, 2017 at 7:49 | |||||
Jul 15, 2017 at 1:11 | comment | added | Kevin Carlson | @PhilippeGaucher Well, at least in the additive case I was discussing, it seems relevant that $\mathcal A$ sits in a recollement in which $G$ is sent to zero on the other side. Perhaps this would work if $G$ is sent to a(dense?) generator on both sides of a recollement? I'm not sure what the non-additive version of this would be, if anything. | |
Jul 14, 2017 at 19:34 | comment | added | Philippe Gaucher | I perfectly understand your point. The motivation of the question is that in the particular situation I am working on, it is true. And I cannot figure out what $G$ has special. To prove it, I have to make boring annoying (but easy) calculations. I was just wondering whether I was not missing a categorical argument. In my situation, the canonical diagram with respect to $G$ is not even filtered. Maybe there is no way for me to avoid to make the calculations. | |
Jul 14, 2017 at 17:59 | history | answered | Kevin Carlson | CC BY-SA 3.0 |