Timeline for Mac Lane strictness theorem and categorifiability of fusion rings
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 20, 2016 at 2:41 | vote | accept | Sebastien Palcoux | ||
| Jan 19, 2016 at 1:33 | comment | added | Sebastien Palcoux | The difficulty for proving the existence of a categorification by the skeletal way is that we have to prove that the pentagon equation (i.e. a huge polynomial system of degree 3) admits a solution. What is the difficulty by the strict way, what kind of equations we have to deal with? | |
| Jan 18, 2016 at 15:50 | history | edited | Dave Penneys | CC BY-SA 3.0 |
added 96 characters in body
|
| Jan 18, 2016 at 15:43 | comment | added | Todd Trimble | Thanks for the detailed answer, Dave. The moral at the end reminds me of a common confusion about the process of strictifying a monoidal category. It's not that you strictify by quotienting the collection of objects; rather you add a whole bunch of new objects and isomorphisms between them, where the new objects are formal tensor products. I call this the method of cliques (reminiscent of cliques in graph theory); see e.g. here for a description: ncatlab.org/nlab/show/clique | |
| Jan 18, 2016 at 15:26 | history | answered | Dave Penneys | CC BY-SA 3.0 |