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.

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.