ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let q>0q>0 and let bb∈P+bb\in P_+; write VμV_\mu for the irreducible UqgU_q\mathfrak g-module of highest weight μ\mu, with highest-weight and lowest-weight projections denoted by Pλ,μhP^h_{\lambda,\mu} and Pλ,μlP^l_{\lambda,\mu}, respectively. Let fλ,μf_{\lambda,\mu} be the map introduced before Proposition~. For n≥1n\geq 1, consider the tensor product Vλ⊗VnλV_\lambda\otimes V_{n\lambda}. Asymptotic Clebsch--Gordan conjecture. If q≥1q\geq1, then

∥(1−1⊗Pnλh)Pλ,nλh∥→0and∥fλ,nλ((1−Pλh)⊗Pnλh)∥→0\|(1-1\otimes P^h_{n\lambda})P^h_{\lambda,n\lambda}\|\to0\quad\text{and}\quad \big\|f_{\lambda,n\lambda}\big((1-P^h_\lambda)\otimes P^h_{n\lambda}\big)\big\|\to0

as n→+∞n\to+\infty. If q≤1q\leq1, then

∥(1−1⊗Pnλl)Pλ,nλl∥→0and∥fλ,nλ((1−Pλl)⊗Pnλl)∥→0\|(1-1\otimes P^l_{n\lambda})P^l_{\lambda,n\lambda}\|\to0\quad\text{and}\quad \big\|f_{\lambda,n\lambda}\big((1-P^l_\lambda)\otimes P^l_{n\lambda}\big)\big\|\to0

as n→+∞n\to+\infty. Moreover, for q≠1q\ne1 the convergences are exponentially fast: for q>1q>1 there exist C>0C>0 and 0<t<10<t<1 such that

∥(1−1⊗Pnλh)Pλ,nλh∥≤Ctn\|(1-1\otimes P^h_{n\lambda})P^h_{\lambda,n\lambda}\|\le Ct^n

and

∥fλ,nλ((1−Pλh)⊗Pnλh)∥≤Ctn,\big\|f_{\lambda,n\lambda}\big((1-P^h_\lambda)\otimes P^h_{n\lambda}\big)\big\|\le Ct^n,

with the analogous bounds for q<1q<1. Thus every highest-weight vector is asymptotically close to one of the form ξ⊗ξnλ\xi\otimes\xi_{n\lambda}, while vectors with ξ⊥ξλ\xi\perp\xi_\lambda become asymptotically orthogonal to V(n+1)λV_{(n+1)\lambda}; the lowest-weight statement is analogous for q≤1q\leq1.

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.