Concept

Gorenstein scheme

In algebraic geometry, a Gorenstein scheme is a locally Noetherian scheme whose local rings are all Gorenstein. The canonical line bundle is defined for any Gorenstein scheme over a field, and its properties are much the same as in the special case of smooth schemes. For a Gorenstein scheme X of finite type over a field, f: X → Spec(k), the dualizing complex f!(k) on X is a line bundle (called the canonical bundle KX), viewed as a complex in degree −dim(X). If X is smooth of dimension n over k, the canonical bundle KX can be identified with the line bundle Ωn of top-degree differential forms. Using the canonical bundle, Serre duality takes the same form for Gorenstein schemes as it does for smooth schemes. Let X be a normal scheme of finite type over a field k. Then X is regular outside a closed subset of codimension at least 2. Let U be the open subset where X is regular; then the canonical bundle KU is a line bundle. The restriction from the divisor class group Cl(X) to Cl(U) is an isomorphism, and (since U is smooth) Cl(U) can be identified with the Picard group Pic(U). As a result, KU defines a linear equivalence class of Weil divisors on X. Any such divisor is called the canonical divisor KX. For a normal scheme X, the canonical divisor KX is said to be Q-Cartier if some positive multiple of the Weil divisor KX is Cartier. (This property does not depend on the choice of Weil divisor in its linear equivalence class.) Alternatively, normal schemes X with KX Q-Cartier are sometimes said to be Q-Gorenstein. It is also useful to consider the normal schemes X for which the canonical divisor KX is Cartier. Such a scheme is sometimes said to be Q-Gorenstein of index 1. (Some authors use "Gorenstein" for this property, but that can lead to confusion.) A normal scheme X is Gorenstein (as defined above) if and only if KX is Cartier and X is Cohen–Macaulay. An algebraic variety with local complete intersection singularities, for example any hypersurface in a smooth variety, is Gorenstein.

À 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.