Concept

Fixed-point subring

In algebra, the fixed-point subring of an automorphism f of a ring R is the subring of the fixed points of f, that is, More generally, if G is a group acting on R, then the subring of R is called the fixed subring or, more traditionally, the ring of invariants under G. If S is a set of automorphisms of R, the elements of R that are fixed by the elements of S form the ring of invariants under the group generated by S. In particular, the fixed-point subring of an automorphism f is the ring of invariants of the cyclic group generated by f. In Galois theory, when R is a field and G is a group of field automorphisms, the fixed ring is a subfield called the fixed field of the automorphism group; see Fundamental theorem of Galois theory. Along with a module of covariants, the ring of invariants is a central object of study in invariant theory. Geometrically, the rings of invariants are the coordinate rings of (affine or projective) GIT quotients and they play fundamental roles in the constructions in geometric invariant theory. Example: Let be a polynomial ring in n variables. The symmetric group Sn acts on R by permuting the variables. Then the ring of invariants is the ring of symmetric polynomials. If a reductive algebraic group G acts on R, then the fundamental theorem of invariant theory describes the generators of RG. Hilbert's fourteenth problem asks whether the ring of invariants is finitely generated or not (the answer is affirmative if G is a reductive algebraic group by Nagata's theorem.) The finite generation is easily seen for a finite group G acting on a finitely generated algebra R: since R is integral over RG, the Artin–Tate lemma implies RG is a finitely generated algebra. The answer is negative for some unipotent groups. Let G be a finite group. Let S be the symmetric algebra of a finite-dimensional G-module. Then G is a reflection group if and only if is a free module (of finite rank) over SG (Chevalley's theorem).

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