2000 character limit reached
Free algebras through Day convolution (2006.08269v2)
Published 15 Jun 2020 in math.AT and math.CT
Abstract: Building on the foundations in our previous paper, we study Segal conditions that are given by finite products, determined by structures we call cartesian patterns. We set up Day convolution on presheaves in this setting and use it to give conditions under which there is a colimit formula for free algebras and other left adjoints. This specializes to give a simple proof of Lurie's results on operadic left Kan extensions and free algebras for symmetric $\infty$-operads.
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.
