Concept

Smooth completion

In algebraic geometry, the smooth completion (or smooth compactification) of a smooth affine algebraic curve X is a complete smooth algebraic curve which contains X as an open subset. Smooth completions exist and are unique over a perfect field. An affine form of a hyperelliptic curve may be presented as where and P(x) has distinct roots and has degree at least 5. The Zariski closure of the affine curve in is singular at the unique infinite point added. Nonetheless, the affine curve can be embedded in a unique compact Riemann surface called its smooth completion. The projection of the Riemann surface to is 2-to-1 over the singular point at infinity if has even degree, and 1-to-1 (but ramified) otherwise. This smooth completion can also be obtained as follows. Project the affine curve to the affine line using the x-coordinate. Embed the affine line into the projective line, then take the normalization of the projective line in the function field of the affine curve. A smooth connected curve over an algebraically closed field is called hyperbolic if where g is the genus of the smooth completion and r is the number of added points. Over an algebraically closed field of characteristic 0, the fundamental group of X is free with generators if r>0. (Analogue of Dirichlet's unit theorem) Let X be a smooth connected curve over a finite field. Then the units of the ring of regular functions O(X) on X is a finitely generated abelian group of rank r -1. Suppose the base field is perfect. Any affine curve X is isomorphic to an open subset of an integral projective (hence complete) curve. Taking the normalization (or blowing up the singularities) of the projective curve then gives a smooth completion of X. Their points correspond to the discrete valuations of the function field that are trivial on the base field. By construction, the smooth completion is a projective curve which contains the given curve as an everywhere dense open subset, and the added new points are smooth. Such a (projective) completion always exists and is unique.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.