ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a real reductive group, let G′G' be a reductive subgroup, and choose a maximal compact subgroup KK of GG such that K′=G′∩KK'=G'\cap K is a maximal compact subgroup of G′G'. For a finite-length g\mathfrak{g}-module XX, write VgC(X)⊆gC∗\mathcal{V}_{\mathfrak{g}_{\mathbb C}}(X)\subseteq\mathfrak{g}_{\mathbb C}^* for its associated variety, and similarly write VgC′(Y)⊆(gC′)∗\mathcal{V}_{\mathfrak{g}'_{\mathbb C}}(Y)\subseteq(\mathfrak{g}'_{\mathbb C})^* for a finite-length g′\mathfrak{g}'-module YY. Let pr⁡g→g′:gC∗→(gC′)∗\operatorname{pr}_{\mathfrak{g}\to\mathfrak{g}'}:\mathfrak{g}_{\mathbb C}^*\to(\mathfrak{g}'_{\mathbb C})^* be the restriction map dual to the embedding gC′→gC\mathfrak{g}'_{\mathbb C}\to\mathfrak{g}_{\mathbb C}. Kobayashi's conjecture. If XX is an irreducible unitarizable (g,K)(\mathfrak{g},K)-module and YY is an irreducible (g′,K′)(\mathfrak{g}',K')-module with Hom⁡g′(Y,X)≠0\operatorname{Hom}_{\mathfrak{g}'}(Y,X)\neq0, then

pr⁡g→g′(VgC(X))=VgC′(Y).\operatorname{pr}_{\mathfrak{g}\to\mathfrak{g}'}\bigl(\mathcal{V}_{\mathfrak{g}_{\mathbb C}}(X)\bigr)=\mathcal{V}_{\mathfrak{g}'_{\mathbb C}}(Y).

The conjecture predicts that the associated variety of every irreducible constituent occurring in the restriction of an irreducible unitarizable representation is obtained by projecting the associated variety of the original representation. The paper confirms it for all discretely decomposable restrictions of minimal holomorphic representations to symmetric subgroups, while the general statement remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.