Concept

Restriction de Weil

In mathematics, restriction of scalars (also known as "Weil restriction") is a functor which, for any finite extension of fields L/k and any algebraic variety X over L, produces another variety ResL/kX, defined over k. It is useful for reducing questions about varieties over large fields to questions about more complicated varieties over smaller fields. Let L/k be a finite extension of fields, and X a variety defined over L. The functor from k-schemesop to sets is defined by (In particular, the k-rational points of are the L-rational points of X.) The variety that represents this functor is called the restriction of scalars, and is unique up to unique isomorphism if it exists. From the standpoint of sheaves of sets, restriction of scalars is just a pushforward along the morphism and is right adjoint to fiber product of schemes, so the above definition can be rephrased in much more generality. In particular, one can replace the extension of fields by any morphism of ringed topoi, and the hypotheses on X can be weakened to e.g. stacks. This comes at the cost of having less control over the behavior of the restriction of scalars. Let be a morphism of schemes. For a -scheme , if the contravariant functor is representable, then we call the corresponding -scheme, which we also denote with , the Weil restriction of with respect to . Where denotes the of the category of schemes over a fixed scheme . For any finite extension of fields, the restriction of scalars takes quasiprojective varieties to quasiprojective varieties. The dimension of the resulting variety is multiplied by the degree of the extension. Under appropriate hypotheses (e.g., flat, proper, finitely presented), any morphism of algebraic spaces yields a restriction of scalars functor that takes algebraic stacks to algebraic stacks, preserving properties such as Artin, Deligne-Mumford, and representability. Simple examples are the following: Let L be a finite extension of k of degree s. Then and is an s-dimensional affine space over Spec k.

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