1507.03913Jul 14, 2015The unexpected (and actually undue) symmetric behavior of stable recollements (Lemma 4.3 v1) turned out to be the far reaching consequence of a typo in one of the commutative diagrams on page 9. This has now been corrected (i.e., Lemma 4.3 and his corollaries have been removed). Luckily, this was only minimally affecting the remaining part of the article, which has now been revised accordingly
We develop the theory of recollements in a stable ∞-categorical setting. In the axiomatization of Beilinson, Bernstein and Deligne, recollement situations provide a generalization of Grothendieck's "six functors" between derived categories. The adjointness relations between functors in a recollement D0↔D↔D1 induce a "recollée" t
Nearby in the stack
-structure
t0⊎t1
on
D
, given
t
-structures
t0,t1
on
D0,D1
. Such a classical result, well-known in the setting of triangulated categories, is recasted in the setting of stable
∞
-categories and the properties of the associated (
∞
-categorical) factorization systems are investigated. In the geometric case of a stratified space, various recollements arise, which "interact well" with the combinatorics of the intersections of strata to give a well-defined, associative
⊎
operation. From this we deduce a generalized associative property for
n
-fold gluing
t0⊎⋯⊎tn
, valid in any stable
∞
-category.
arXiv did not return neighbours for this paper. Try again in a bit.