2000 character limit reached
Parsummable categories as a strictification of symmetric monoidal categories (2006.15068v3)
Published 26 Jun 2020 in math.CT and math.AT
Abstract: We prove that the homotopy theory of parsummable categories (as defined by Schwede) with respect to the underlying equivalences of categories is equivalent to the usual homotopy theory of symmetric monoidal categories. In particular, this yields a model of symmetric monoidal categories in terms of categories equipped with a strictly commutative, associative, and unital (but only partially defined) operation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.