From Surf Wiki (app.surf) — the open knowledge base
Unipotent representation
In mathematics, a unipotent representation of a reductive group is a representation that has some similarities with unipotent conjugacy classes of groups.
Informally, Langlands philosophy suggests that there should be a correspondence between representations of a reductive group and conjugacy classes of a Langlands dual group, and the unipotent representations should be roughly the ones corresponding to unipotent classes in the dual group.
Unipotent representations are supposed to be the basic "building blocks" out of which one can construct all other representations in the following sense. Unipotent representations should form a small (preferably finite) set of irreducible representations for each reductive group, such that all irreducible representations can be obtained from unipotent representations of possibly smaller groups by some sort of systematic process, such as (cohomological or parabolic) induction.
Finite fields
Over finite fields, the unipotent representations are those that occur in the decomposition of the Deligne–Lusztig characters R of the trivial representation 1 of a torus T . They were classified by . Some examples of unipotent representations over finite fields are the trivial 1-dimensional representation, the Steinberg representation, and θ10.
Non-archimedean local fields
classified the unipotent characters over non-archimedean local fields.
Archimedean local fields
discusses several different possible definitions of unipotent representations of real Lie groups.
References
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Unipotent representation — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report