Unrefined minimal \(K\)-types for \(p\)-adic groups (Q1320054)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Unrefined minimal \(K\)-types for \(p\)-adic groups
scientific article

    Statements

    Unrefined minimal \(K\)-types for \(p\)-adic groups (English)
    0 references
    0 references
    0 references
    29 November 1994
    0 references
    Let \(G\) be a reductive group over a \(p\)-adic field of characteristic zero. It is widely believed that a classification of the admissible dual of \(G\) may be achieved via studying the restriction of an admissible representation of \(G\) to certain compact open subgroups. To this end the first author gave [in Contemp. Math. 86, 249-254 (1989; Zbl 0685.22009)] the definition of a minimal \(K\)-type as a certain type of representation of parahoric filtration subgroups. Contrary to the real case the definition of a minimal \(K\)-type is intrinsic in that it does not involve a given admissible representation of \(G\). To use it for classification arguments one thus must prove that every admissible representation of \(G\) contains a minimal \(K\)-type. In the paper under consideration this is established. The author uses an isomorphism of the graded parts of the parahoric filtration to the graded parts of a corresponding Lie algebra filtration which allows him to switch over to the Lie algebra. Via the minimal \(K\)- types one now can attach to a given admissible representation \(\pi\) a rational number \(\rho(\pi)\), the depth of the minimal \(K\)-type, which should play a key rôle in the classification of the admissible dual similar to the real case.
    0 references
    0 references
    reductive group
    0 references
    \(p\)-adic field
    0 references
    admissible dual
    0 references
    admissible representation
    0 references
    subgroups
    0 references
    minimal \(K\)-type
    0 references
    Lie algebra filtration
    0 references
    depth
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references