The Complexity of a Flat Groupoid
Matthieu Romagny
IRMAR, Université Rennes 1, Campus de Beaulieu, 35042 Rennes Cedex, FranceDavid Rydh
KTH Royal Institute of Technology, Department of Mathematics, 10044 Stockholm, SwedenGabriel Zalamansky
Universiteit Leiden, Snellius Building, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands
Abstract
Grothendieck proved that any finite epimorphism of noetherian schemes factors into a finite sequence of effective epimorphisms. We define the complexity of a flat groupoid with finite stabilizer to be the length of the canonical sequence of the finite map , where is the Keel-Mori geometric quotient. For groupoids of complexity at most 1, we prove a theorem of descent along the quotient and a theorem on the existence of the quotient of a groupoid by a normal subgroupoid. We expect that the complexity could play an important role in the finer study of quotients by groupoids.
Cite this article
Matthieu Romagny, David Rydh, Gabriel Zalamansky, The Complexity of a Flat Groupoid. Doc. Math. 23 (2018), pp. 1157–1196
DOI 10.4171/DM/644