In mathematics, Hilbert's fourteenth problem, that is, number 14 of Hilbert's problems proposed in 1900, asks whether certain algebras are finitely generated. The setting is as follows: Assume that k is a field and let K be a subfield of the field of rational functions in n variables, k(x1, ..., xn ) over k. Consider now the k-algebra R defined as the intersection Hilbert conjectured that all such algebras are finitely generated over k. Some results were obtained confirming Hilbert's conjecture in special cases and for certain classes of rings (in particular the conjecture was proved unconditionally for n = 1 and n = 2 by Zariski in 1954). Then in 1959 Masayoshi Nagata found a counterexample to Hilbert's conjecture. The counterexample of Nagata is a suitably constructed ring of invariants for the action of a linear algebraic group. The problem originally arose in algebraic invariant theory. Here the ring R is given as a (suitably defined) ring of polynomial invariants of a linear algebraic group over a field k acting algebraically on a polynomial ring k[x1, ..., xn] (or more generally, on a finitely generated algebra defined over a field). In this situation the field K is the field of rational functions (quotients of polynomials) in the variables xi which are invariant under the given action of the algebraic group, the ring R is the ring of polynomials which are invariant under the action. A classical example in nineteenth century was the extensive study (in particular by Cayley, Sylvester, Clebsch, Paul Gordan and also Hilbert) of invariants of binary forms in two variables with the natural action of the special linear group SL2(k) on it. Hilbert himself proved the finite generation of invariant rings in the case of the field of complex numbers for some classical semi-simple Lie groups (in particular the general linear group over the complex numbers) and specific linear actions on polynomial rings, i.e. actions coming from finite-dimensional representations of the Lie-group.

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