Papers
Topics
Authors
Recent
Search
2000 character limit reached

Comprehensive factorisation systems

Published 25 Oct 2017 in math.CT and math.AT | (1710.09438v2)

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

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

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

Collections

Sign up for free to add this paper to one or more collections.