Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
GPT-4o
Gemini 2.5 Pro Pro
o3 Pro
GPT-4.1 Pro
DeepSeek R1 via Azure Pro
2000 character limit reached

Comprehensive factorisation systems (1710.09438v2)

Published 25 Oct 2017 in math.CT and math.AT

Abstract: We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems exist for the categories of topological spaces, simplicial sets, small multicategories and Feynman categories. In each case comprehensive factorisation induces a natural notion of universal covering, leading to a Galois-type definition of fundamental group for based objects of the category.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.