Timeline for Reedy-indexed diagrams in higher categories
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2017 at 21:44 | vote | accept | Edouard | ||
| Nov 10, 2017 at 16:46 | answer | added | Dylan Wilson | timeline score: 2 | |
| Nov 10, 2017 at 15:05 | history | edited | Edouard | CC BY-SA 3.0 |
added 168 characters in body
|
| Nov 10, 2017 at 15:03 | comment | added | Edouard | Yes, will edit. | |
| Nov 10, 2017 at 14:22 | comment | added | Tim Campion | An $(n,k)$ category $\mathcal{M}$ is in particular an $(n,1)$-category by discarding noninvertible higher morphisms. Latching and matching are certain (co)limits, and thus depend only on the $(n,1)$-structure of $\mathcal{M}$. So it suffices to show this when $\mathcal{M}$ is an $(\infty,1)$-category. Then if $\mathcal{M}$ is presented as a model category, this is just the usual theory of the Reedy model structure. Are you particularly interested in cases where $\mathcal{M}$ is not presented as a model category? | |
| Nov 10, 2017 at 13:51 | history | asked | Edouard | CC BY-SA 3.0 |