ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let gC{\mathfrak g}_{\mathbb C} be a reductive Lie algebra over C{\mathbb C} with Chevalley basis B{\mathcal B}, let R=Z[1/q∣q is a bad prime for Φ]R={\mathbb Z}[1/q\mid q\text{ is a bad prime for }\Phi], and let gR{\mathfrak g}_R and g{\mathfrak g} be the corresponding integral and characteristic-pp forms. Write tR{\mathfrak t}_R for the induced Cartan lattice, GCG_{\mathbb C} and GG for the corresponding reductive groups, and let Lpχ(λ)L_p^\chi(\lambda) denote the reduced Verma-module quotient defined in the setup. For a primitive ideal II of U(gC)U({\mathfrak g}_{\mathbb C}), call II completely prime when U(gC)/IU({\mathfrak g}_{\mathbb C})/I is a domain, and write VA′(I){{\mathcal V}{\mathcal A}}'(I) for its associated variety. For each nilpotent coadjoint GCG_{\mathbb C}-orbit OC{\mathbb O}_{\mathbb C} in gC∗{\mathfrak g}_{\mathbb C}^{*}, there exists a representative χ∈OC\chi\in{\mathbb O}_{\mathbb C} mapping gR{\mathfrak g}_R into RR, and there exists χ^∈G⋅χ‾\widehat{\chi}\in G\cdot\overline{\chi}, such that, if LL is a minimal-dimensional Uχ^(g)U_{\widehat{\chi}}({\mathfrak g})-module, then there exists λ∈tR∗\lambda\in{\mathfrak t}_R^{*} satisfying

Ann⁡U(gC)(LC(λ)) is completely prime,\operatorname{Ann}_{U({\mathfrak g}_{\mathbb C})}(L_{\mathbb C}(\lambda))\text{ is completely prime}, VA′(Ann⁡U(gC)(LC(λ)))=GC⋅χ‾,{{\mathcal V}{\mathcal A}}'(\operatorname{Ann}_{U({\mathfrak g}_{\mathbb C})}(L_{\mathbb C}(\lambda)))=\overline{G_{\mathbb C}\cdot\chi},

and LL is a composition factor of Lpχ^(λ)L_p^{\widehat{\chi}}(\lambda). This is presented as a weak version of the conjecture of Premet and Topley. The claim links minimal-dimensional modular representations to integral reductions of complex highest-weight modules with completely prime annihilators and prescribed associated varieties; its resolution status is not specified in the supplied material.

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.