English

The complexity of a flat groupoid

Algebraic Geometry 2018-05-08 v4

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 RXR\rightrightarrows X with finite stabilizer to be the length of the canonical sequence of the finite map RX×_X/RXR\to X\times\_{X/R} X, where X/RX/R is the Keel-Mori geometric quotient. For groupoids of complexity at most 1, we prove a theorem of descent along the quotient XX/RX\to X/R and a theorem of 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.

Keywords

Cite

@article{arxiv.1609.00516,
  title  = {The complexity of a flat groupoid},
  author = {Matthieu Romagny and David Rydh and Gabriel Zalamansky},
  journal= {arXiv preprint arXiv:1609.00516},
  year   = {2018}
}
R2 v1 2026-06-22T15:38:27.655Z