2000 character limit reached
Idempotent completion of cubes in posets
Published 10 May 2018 in math.CT | (1805.04126v2)
Abstract: This note concerns the category $\Box$ of cartesian cubes with connections, equivalently the full subcategory of posets on objects $[1]n$ with $n \geq 0$. We show that the idempotent completion of $\Box$ consists of finite complete posets. It follows that cubical sets, ie presheaves over $\Box$, are equivalent to presheaves over finite complete posets. This yields an alternative exposition of a result by Kapulkin and Voevodsky that simplicial sets form a subtopos of cubical sets.
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.