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

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.

Typos and minor mistakes in Proof of Theorem 4.2.1 and Theorem 5.2.1 have been fixed