Papers
Topics
Authors
Recent
Search
2000 character limit reached

Six-Functor Formalisms II : The $\infty$-categorical compactification

Published 4 Dec 2024 in math.AG and math.CT | (2412.03231v2)

Abstract: This paper is part of a series of articles in which we reproduce the statements regarding the abstract six-functor formalism developed by Liu-Zheng. In this paper, we prove a theorem, which is an $\infty$-categorical version for defining the exceptional pushforward functor in an abstract-six functor formalism. The article describes specific combinatorial simplicial sets related to compactifications and pullback squares. This theorem plays a key role in constructing the abstract six-functor formalism, which will be discussed in the forthcoming article.

Summary

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.

Authors (1)

Collections

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