Papers
Topics
Authors
Recent
Search
2000 character limit reached

On stability of exactness properties under the pro-completion

Published 6 Feb 2020 in math.CT | (2002.02204v2)

Abstract: In this paper we formulate and prove a general theorem of stability of exactness properties under the pro-completion, which unifies several such theorems in the literature and gives many more. The theorem depends on a formal approach to exactness properties proposed in this paper, which is based on the theory of sketches. Our stability theorem has applications in proving theorems that establish links between exactness properties, as well as in establishing embedding (representation) theorems for classes of categories defined by exactness properties.

Summary

Paper to Video (Beta)

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.