Injectivity theorems and cubical descent for schemes, stacks, and analytic spaces
Takumi Murayama

TL;DR
This paper extends key theorems like injectivity, torsion-freeness, and vanishing to a broad range of geometric spaces, using cubical hyperresolutions, thereby advancing the minimal model program and Deligne-Hodge theory.
Contribution
It provides a uniform proof of fundamental theorems across various categories of spaces and introduces a general extension criterion using cubical hyperresolutions.
Findings
Proved injectivity, torsion-freeness, and vanishing theorems in diverse geometric categories.
Developed a general extension criterion for functors using cubical hyperresolutions.
Established foundations for Deligne-Du Bois complexes and weight filtrations in new settings.
Abstract
We prove relative injectivity, torsion-freeness, and vanishing theorems for generalized normal crossing pairs on schemes, algebraic stacks, formal schemes, semianalytic germs of complex analytic spaces, rigid analytic spaces, Berkovich spaces, and adic spaces locally of weakly finite type over a field, all in equal characteristic zero. We give a uniform proof for all these theorems in all the categories of spaces mentioned above, which were previously only known for varieties and complex analytic spaces due to work of Ambro and Fujino. Ambro and Fujino's results are integral in the proofs of the fundamental theorems of the minimal model program for (semi-)log canonical pairs and the theory of quasi-log structures. Our results resolve a significant barrier to extending these results on (semi-)log canonical pairs and quasi-log structures beyond the setting of varieties and complex…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Polynomial and algebraic computation · Algebraic structures and combinatorial models
