Concept

Regular sequence

In commutative algebra, a regular sequence is a sequence of elements of a commutative ring which are as independent as possible, in a precise sense. This is the algebraic analogue of the geometric notion of a complete intersection. For a commutative ring R and an R-module M, an element r in R is called a non-zero-divisor on M if r m = 0 implies m = 0 for m in M. An M-regular sequence is a sequence r1, ..., rd in R such that ri is a not a zero-divisor on M/(r1, ..., ri-1)M for i = 1, ..., d. Some authors also require that M/(r1, ..., rd)M is not zero. Intuitively, to say that r1, ..., rd is an M-regular sequence means that these elements "cut M down" as much as possible, when we pass successively from M to M/(r1)M, to M/(r1, r2)M, and so on. An R-regular sequence is called simply a regular sequence. That is, r1, ..., rd is a regular sequence if r1 is a non-zero-divisor in R, r2 is a non-zero-divisor in the ring R/(r1), and so on. In geometric language, if X is an affine scheme and r1, ..., rd is a regular sequence in the ring of regular functions on X, then we say that the closed subscheme {r1=0, ..., rd=0} ⊂ X is a complete intersection subscheme of X. Being a regular sequence may depend on the order of the elements. For example, x, y(1-x), z(1-x) is a regular sequence in the polynomial ring C[x, y, z], while y(1-x), z(1-x), x is not a regular sequence. But if R is a Noetherian local ring and the elements ri are in the maximal ideal, or if R is a graded ring and the ri are homogeneous of positive degree, then any permutation of a regular sequence is a regular sequence. Let R be a Noetherian ring, I an ideal in R, and M a finitely generated R-module. The depth of I on M, written depthR(I, M) or just depth(I, M), is the supremum of the lengths of all M-regular sequences of elements of I. When R is a Noetherian local ring and M is a finitely generated R-module, the depth of M, written depthR(M) or just depth(M), means depthR(m, M); that is, it is the supremum of the lengths of all M-regular sequences in the maximal ideal m of R.

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