Concept

Unitarian trick

In mathematics, the unitarian trick is a device in the representation theory of Lie groups, introduced by for the special linear group and by Hermann Weyl for general semisimple groups. It applies to show that the representation theory of some group G is in a qualitative way controlled by that of some other compact group K. An important example is that in which G is the complex general linear group, and K the unitary group acting on vectors of the same size. From the fact that the representations of K are completely reducible, the same is concluded for those of G, at least in finite dimensions. The relationship between G and K that drives this connection is traditionally expressed in the terms that the Lie algebra of K is a real form of that of G. In the theory of algebraic groups, the relationship can also be put that K is a dense subset of G, for the Zariski topology. The trick works for reductive Lie groups, of which an important case are semisimple Lie groups. Weyl's theorem on complete reducibility The complete reducibility of finite-dimensional linear representations of compact groups, or connected semisimple Lie groups and complex semisimple Lie algebras goes sometimes under the name of Weyl's theorem. A related result, that the universal cover of a compact semisimple Lie group is also compact, also goes by the same name. Adolf Hurwitz had shown how integration over a compact Lie group could be used to construct invariants, in the cases of unitary groups and compact orthogonal groups. Issai Schur in 1924 showed that this technique can be applied to show complete reducibility of representations for such groups via the construction of an invariant inner product. Weyl extended Schur's method to complex semisimple Lie algebras by showing they had a compact real form.

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