Strict \(\omega\)-categories are monadic over polygraphs (Q2826240)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strict \(\omega\)-categories are monadic over polygraphs |
scientific article; zbMATH DE number 6637043
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Strict \(\omega\)-categories are monadic over polygraphs |
scientific article; zbMATH DE number 6637043 |
Statements
11 October 2016
0 references
strict omega-category
0 references
polygraph (or computad)
0 references
monadicity
0 references
math.CT
0 references
Strict \(\omega\)-categories are monadic over polygraphs (English)
0 references
A direct proof is presented of the monadicity of the category of strict \(\omega\)-categories over the category of polygraphs (also known as computads). The proof uses similar steps as in [\textit{M. A. Batanin}, Contemp. Math. 230, 37--57 (1998; Zbl 0932.18004)] in the finitary case. The crucial difference is that here the category of polygraphs is no longer a presheaf category; arguments relying on that are replaced by a lifting result.
0 references
