2000 character limit reached
Formalizing the zigzag construction of path spaces of pushouts
Published 9 Oct 2025 in math.LO and math.AT | (2510.08452v1)
Abstract: A recent pre-print of W\"arn gives a novel pen-and-paper construction of a type family characterizing the path spaces of an arbitrary pushout, and a natural language argument for its correctness. We present the first formalization of the construction and a proof that it is fiberwise equivalent to the path spaces. The formalization is carried out in axiomatic homotopy type theory, using the Agda proof assistant and the agda-unimath library.
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.