Timeline for Constrained factorization of monads
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 28, 2013 at 11:28 | history | edited | fosco | CC BY-SA 3.0 |
added 1598 characters in body
|
| Nov 28, 2013 at 11:25 | comment | added | fosco | "Some" = it is unique up to natural iso; nothing more. :) | |
| Nov 28, 2013 at 11:22 | history | edited | fosco | CC BY-SA 3.0 |
added 1598 characters in body
|
| Nov 27, 2013 at 23:27 | answer | added | Michal R. Przybylek | timeline score: 3 | |
| Nov 27, 2013 at 22:59 | comment | added | Michal R. Przybylek | I don't understand your question. What does it mean "$T$ can be factored through $B$", i.e. $T=CB$ for some $B \dashv C$? What does "some" mean here? If $B$ is given, then there are not so many right adjoints $C$... | |
| Nov 27, 2013 at 22:25 | history | asked | fosco | CC BY-SA 3.0 |