In algebraic geometry, a stable curve is an algebraic curve that is asymptotically stable in the sense of geometric invariant theory. This is equivalent to the condition that it is a complete connected curve whose only singularities are ordinary double points and whose automorphism group is finite. The condition that the automorphism group is finite can be replaced by the condition that it is not of arithmetic genus one and every non-singular rational component meets the other components in at least 3 points . A semi-stable curve is one satisfying similar conditions, except that the automorphism group is allowed to be reductive rather than finite (or equivalently its connected component may be a torus). Alternatively the condition that non-singular rational components meet the other components in at least three points is replaced by the condition that they meet in at least two points. Similarly a curve with a finite number of marked points is called stable if it is complete, connected, has only ordinary double points as singularities, and has finite automorphism group. For example, an elliptic curve (a non-singular genus 1 curve with 1 marked point) is stable. Over the complex numbers, a connected curve is stable if and only if, after removing all singular and marked points, the universal covers of all its components are isomorphic to the unit disk. Given an arbitrary scheme and setting a stable genus g curve over is defined as a proper flat morphism such that the geometric fibers are reduced, connected 1-dimensional schemes such that has only ordinary double-point singularities Every rational component meets other components at more than points These technical conditions are necessary because (1) reduces the technical complexity (also Picard-Lefschetz theory can be used here), (2) rigidifies the curves so that there are no infinitesimal automorphisms of the moduli stack constructed later on, and (3) guarantees that the arithmetic genus of every fiber is the same.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.