ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g\mathfrak{g} be a finite-dimensional simple Lie algebra with weight lattice PP, dominant weights P+P^+, and lacing data rir_i. Set ri∨=1+r−rir_i^\vee=1+r-r_i, where rr is the lacing number, and define

P′=∑i∈Iri∨Zωi.P'=\sum_{i\in I}r_i^\vee\mathbb{Z}\omega_i.

Let PLP^L be the weight lattice of the Langlands dual Lie algebra Lg{}^L\mathfrak{g}, and define Π:P→PL\Pi:P\to P^L by

Π(λ)=∑i∈Iλ(αˇi)(ri∨)−1ωˇi\Pi(\lambda)=\sum_{i\in I}\lambda(\check\alpha_i)(r_i^\vee)^{-1}\check\omega_i

for λ∈P′\lambda\in P', and Π(λ)=0\Pi(\lambda)=0 otherwise. Let χ\chi and χL\chi^L denote the character maps for g\mathfrak{g} and Lg{}^L\mathfrak{g}, respectively. Suppose q,t∈C×q,t\in\mathbb{C}^\times satisfy qZ∩tZ={1}q^\mathbb{Z}\cap t^\mathbb{Z}=\{1\}, Uq(g^)U_q(\widehat{\mathfrak{g}}) is untwisted and not Langlands self-dual, and VV is a simple finite-dimensional representation whose highest weight as a Uq(g)U_q(\mathfrak{g})-module is λ∈P′\lambda\in P'.

Langlands dual character conjecture. There exists an irreducible representation VLV^L of Ut(g^L)U_t(\widehat{\mathfrak{g}}^L) of highest weight Π(λ)\Pi(\lambda) such that

Π(χ(V))⪰χL(VL).\Pi(\chi(V))\succeq\chi^L(V^L).

The conjecture is a representation-theoretic refinement of the relation between characters of a quantum affine algebra and its Langlands dual. It is proved in the paper for Kirillov–Reshetikhin modules, with VLV^L also a Kirillov–Reshetikhin module, while uniqueness of VLV^L is not guaranteed in general.

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.