The complexity of a flat groupoid

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…