This paper introduces a new class of eigenfunctions for the Calogero-Sutherland model using vector-valued Jack polynomials, expanding the mathematical framework for quantum many-body systems on the torus.
Contribution
It develops a novel construction of eigenfunctions employing generalized Jack polynomials valued in symmetric group modules, applicable to all irreducible representations.
Findings
01
Constructed eigenfunctions using matrix solutions of differential systems.
02
Generated symmetric probability densities on the N-torus from these eigenfunctions.
03
Extended the theory of Jack polynomials to vector-valued cases for quantum models.
Abstract
The Hamiltonian of the quantum Calogero-Sutherland model of N identical particles on the circle with 1/r2 interactions has eigenfunctions consisting of Jack polynomials times the base state. By use of the generalized Jack polynomials taking values in modules of the symmetric group and the matrix solution of a system of linear differential equations one constructs novel eigenfunctions of the Hamiltonian. Like the usual wavefunctions each eigenfunction determines a symmetric probability density on the N-torus. The construction applies to any irreducible representation of the symmetric group. The methods depend on the theory of generalized Jack polynomials due to Griffeth, and the Yang-Baxter graph approach of Luque and the author.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Vector-valued Jack Polynomials and Wavefunctions on the Torus
Charles F. Dunkl
Department of Mathematics, University of Virginia,
Charlottesville, VA 22904-4137, U.S
(7 February 2017)
Abstract
The Hamiltonian of the quantum Calogero-Sutherland model of N identical
particles on the circle with 1/r2 interactions has eigenfunctions
consisting of Jack polynomials times the base state. By use of the generalized
Jack polynomials taking values in modules of the symmetric group and the
matrix solution of a system of linear differential equations one constructs
novel eigenfunctions of the Hamiltonian. Like the usual wavefunctions each
eigenfunction determines a symmetric probability density on the N-torus. The
construction applies to any irreducible representation of the symmetric group.
The methods depend on the theory of generalized Jack polynomials due to
Griffeth, and the Yang-Baxter graph approach of Luque and the author.
1 Introduction
The quantum Calogero-Sutherland model for N identical particles with
1/r2 interactions on the unit circle has the Hamiltonian
[TABLE]
where xj=eiθj and −π<θj≤π for 1≤j≤N. The time-independent Schrödinger equation Hψ=Eψ has solutions expressible as the product of the base-state
[TABLE]
with a Jack polynomial (Lapointe and Vinet [8], Awata [1]).
The base-state is a solution of the first-order linear differential system
[TABLE]
and Hψ0=121κ2N(N2−1)ψ0. The theory of Jack polynomials has been generalized to polynomials
taking values in modules of the symmetric group (Griffeth [6]). In
this paper the Hamiltonian H will be interpreted in that context.
The base state ψ0 is replaced by a matrix function satisfying an
analogous differential system and the generalized wavefunctions are
vector-valued. Nevertheless for an interval of parameter values depending on
the module the wavefunctions do give rise to symmetric probability density
functions on the torus. The interval is symmetric about κ=0 hence this
is qualitatively different from the usual scalar case where κ is
unbounded above.
Section 2 is a brief overview of representation theory for the
symmetric groups, and the commutative set of operators on polynomials of which
the nonsymmetric Jack polynomials are simultaneous eigenfunctions. Section
3 concerns the first-order linear differential system defining the
basic matrix function needed to map the polynomials to eigenfunctions of the
Hamiltonian modified with twisted exchange operators. In Section 4
there is a description of the Hermitian form related to integration of
vector-valued polynomials on the torus, and the Yang-Baxter graph technique
for constructing the nonsymmetric Jack polynomials. Section 5
presents the adaptation of the method of Baker and Forrester [2] to
form symmetric Jack polynomials from the nonsymmetric polynomials; the
analysis involves tableaux with certain properties. Also this section contains
the formulae for the squared norms of the Jack polynomials. Then Section
6 uses the vector-valued Jack polynomials and the matrix function
from Section 3 to construct vector-valued eigenfunctions of the
Hamiltonian H and the associated probability density. Also the
Jack polynomial of minimal degree is described, and finally there is a brief
description of the matrix function in the case of the two-dimensional
representation of S4.
2 The generalized Jack polynomials and associated
operators
The symmetric groupSN, the set of permutations of
{1,2,…,N}, acts on CN by permutation of
coordinates. For α∈ZN the norm is ∣α∣:=∑i=1N∣αi∣ and the
monomial is xα:=∏i=1Nxiαi. Denote
N0:={0,1,2,…}. The space of polynomials
P:=spanC{xα:α∈N0N}. Elements of spanC{xα:α∈ZN} are called
Laurent polynomials. The action of SN is extended to
polynomials by wp(x)=p(xw) where (xw)i=xw(i) (consider x as a row vector and w
as a permutation matrix, [w]ij=δi,w(j), then xw=x[w]). This is a representation of SN, that is, w1(w2p)(x)=(w2p)(xw1)=p(xw1w2)=(w1w2)p(x) for all w1,w2∈SN.
Furthermore SN is generated by reflections in the mirrors
{x:xi=xj} for 1≤i<j≤N. These are
*transpositions, *denoted by (i,j), interchanging
xi and xj. Define the SN-action on α∈ZN so that (xw)α=xwα
[TABLE]
that is (wα)i=αw−1(i)
(consider α as a column vector, then wα=[w]α).
The simple reflectionssi:=(i,i+1), 1≤i<N,
suffice to generate SN. They are the key devices for applying
inductive methods, and satisfy the braid relations:
[TABLE]
We consider the situation where the group SN acts on the range
as well as on the domain of the polynomials. We use vector spaces, called
SN-modules, on which SN has an irreducible
unitary (orthogonal) representation:τ:SN→Om(R) (τ(w)−1=τ(w−1)=τ(w)T). See James and Kerber
[7] for representation theory and a modern discussion of Young’s methods.
Denote the set of partitions N0N,+={λ∈N0N:λ1≥λ2≥⋯≥λN}. We identify τ with a partition of N given the same
label, that is τ∈N0N,+ and ∣τ∣=N. The length of τ is ℓ(τ)=max{i:τi>0}. There is a Ferrers diagram of shape τ (also
given the same label), with boxes at points (i,j) with 1≤i≤ℓ(τ) and 1≤j≤τi. A tableau
of shape τ is a filling of the boxes with numbers, and a reverse
standard Young tableau (RSYT) is a filling with the numbers {1,2,…,N} so that the entries decrease in each row and each
column. We require dimVτ≥2, thus excluding the one-dimensional
representations corresponding to one-row (N) or one-column
(1,1,…,1) partitions (the trivial and determinant
representations, respectively). The hook-length of the node (i,j)∈τ is
[TABLE]
and hτ is the maximum hook-length of τ. Denote the set of RSYT’s
of shape τ by Y(τ) and let Vτ=spanC{T:T∈Y(τ)} with orthogonal basis Y(τ). The
formulae for the action of si on Y(τ) are
described in Proposition 1 below. The hook-length formula
is #Y(τ)=N!/(i,j)∈τ∏h(i,j). Set nτ:=dimVτ=#Y(τ). For 1≤i≤N and T∈Y(τ) the entry i is at coordinates (rw(i,T),cm(i,T)) and the
content is c(i,T):=cm(i,T)−rw(i,T). Each T∈Y(τ)
is uniquely determined by its content vector[c(i,T)]i=1N. Let S1(τ):=∑i=1Nc(i,T) (this sum depends only on τ) and
γ:=S1(τ)/N. The SN-invariant inner
product on Vτ is defined by
[TABLE]
It is unique up to multiplication by a constant.
The Jucys-Murphy elements ωi:=j=i+1∑N(i,j) satisfy j=i+1∑Nτ(i,j)T=c(i,T)T and thus the central element 1≤i<j≤N∑(i,j) (in the group algebra RSN) satisfies 1≤i<j≤N∑τ(i,j)T=S1(τ)T for each T∈Y(τ). We abbreviate τ((i,j)) to
τ(i,j).
The generalized Jack polynomials are elements of Pτ=P⊗Vτ, the space of Vτ-valued polynomials,
which is equipped with the SN action:
[TABLE]
extended by linearity. A symmetric polynomial p satisfies wp=p, that is,
p(xw)=τ(w)−1p(x) for all
w∈SN. . The following describes the transformation rules for
τ(si) acting on Y(τ) and
on symmetric polynomials.
Proposition 1
Suppose p∈Pτ is symmetric, 1≤i<N, and
T∈Y(τ). Express p(x)=T′∈Y(τ)∑⟨T′,T′⟩01pT′(x)⊗T′. If c(i,T)=c(i+1,T)+1 then τ(si)T=T and sipT=pT;
if c(i,T)=c(i+1,T)−1 then τ(si)T=−T and sipT=−pT; if c(i,T)−c(i+1,T)≥2 and T(i) is T with
i,i+1 interchanged then τ(si)T=T(i)+bT and sipT=pT(i)+bpT, where b=c(i,T)−c(i+1,T)1.
Proof. The transformation properties of pT follow from si(pT(x)⊗T)=p(xsi)⊗τ(si)T. The first case is when rw(i,T)=rw(i+1,T) and τ(si)T=T; the second case is when cm(i,T)=cm(i+1,T) and τ(si)T=−T. In the case
c(i,T)−c(i+1,T)≥2 the relations
τ(si)T(i)=(1−b2)T−bT(i) and ⟨T(i),T(i)⟩0=(1−b2)⟨T,T⟩0 hold. By hypothesis
[TABLE]
Replace x by xsi and conclude that sipT=pT(i)+bpT and sipT(i)=(1−b2)pT−bpT(i).
The polynomials pT can be derived from pT0 where T0 is the
root RSYT (with N,N−1,… entered column by column), but determining
which polynomials can serve as pT0 is nontrivial in general.
There is a parameter κ∈R (in general, κ could be transcendental).
Definition 2
The Dunkl and Cherednik-Dunkl operators are (1≤i≤N,p∈Pτ)
[TABLE]
The commutation relations analogous to the scalar case hold:
[TABLE]
The commutation properties for the Ui and sj are derived
as follows:
if j>i then sj commutes with each term in Ui,
2. 2.
if j<i−1 then Dixisj−κ∑k<i(k,i)sj=sjDixi−κ∑k<isj(k,i) because (k,i)sj=sj(k,i)
unless k=j or j+1 and then {(i,j)+(i,j+1)}sj=sj{(i,j+1)+(i,j)},
3. 3.
if j=i then siUisi=Di+1xi+1−κ∑k<isi(k,i)si=Di+1xi+1−κ∑k<i(k,i+1)=Ui+1+κ(i,i+1); the relations Uisi=siUi+1+κ,Ui+1si=siUi−κ follow from
right and left multiplication by si.
From the commutation Dixi−xiDi=1+κ∑j=i(i,j) we obtain
[TABLE]
Proposition 3
If q(x1,x2,…,xN) is a symmetric
polynomial then q(U1,U2,…,UN) commutes with each w∈SN, as an
operator on Pτ.
Proof. It suffices to prove the commutativity for each si with 1≤i<N and
each elementary symmetric polynomial in {Ui},
that is, for j=1∏N(1+tUj). By
the above formulae it suffices to show si commutes with (1+tUi)(1+tUi+1)=1+t(Ui+Ui+1)+t2UiUi+1. Indeed
[TABLE]
The nonsymmetric (vector-valued) Jack polynomials (NSJP) are
defined to be simultaneous eigenfunctions of the commuting set {Ui:1≤i≤N}. The symmetric vector-valued Jack
polynomials are simultaneous eigenfunctions of the symmetric polynomials in
{Ui}. If p is a NSJP then the sum
w∈SN∑wp is either a scalar multiple of a
symmetric Jack polynomial or zero. The details are presented in Section
5.
3 The matrix analogue of the base state
This is a summary of the pertinent results from [4]. Vectors and
matrices throughout are of size nτ and nτ×nτ and
are expressed with respect to the orthonormal basis {⟨T,T⟩0−1/2T:T∈Y(τ)}.
With ∂i:=∂xi∂ for 1≤i≤N the
differential system for the matrix function L is
[TABLE]
The effect of the term xiγI is to make L(x) homogeneous of degree zero, that is, ∑i=1Nxi∂iL(x)=0. The differential system is defined on
CregN:=C×N\1≤i<j≤N⋃{x:xi=xj} (where C×:=C\{0}), and it is Frobenius integrable
and analytic, thus any local solution can be continued analytically to any
point in CregN. The equation is a modified version of the
Knizhnik-Zamolodchikov equation. For the trivial representation τ=(N) the solution L(x)=ψ0(x) (up
to scalar multiplication) because τ(i,j)=I and
γ=2N−1. The notations for the torus and its surface measure in
terms of polar coordinates are
[TABLE]
Let TregN:=TN∩CregN, then
TregN has (N−1)! connected components and
each component is homotopic to a circle; if x is in some component then so
is ux=(ux1,…,uxN) for each u∈T.
Definition 4
Let x0:=(1,e2πi/N,e4πi/N,…,e2(N−1)πi/N) and denote the connected
component of TregN containing x0 by C0,
called the fundamental chamber.
Thus C0 is the set consisting of (eiθ1,…,eiθN) with θ1<θ2<⋯<θN<θ1+2π. The homogeneity L(ux)=L(x) for ∣u∣=1 shows that
L(x) has a well-defined analytic continuation to all of
C0 starting from x0. Let w0:=(1,2,3,…N)=(12)(23)⋯(N−1,N), an N-cycle, and let ⟨w0⟩ denote the cyclic
group generated by w0. There are two components of TregN
which are set-wise invariant under ⟨w0⟩ namely
C0 and the reverse {θN<θN−1<…<θ1<θN+2π}. Indeed ⟨w0⟩ is the stabilizer of C0 as a subgroup of
SN. A list of properties of L(x) (from
[4]):
If L(x) is a solution of (5) in some connected
open subset U of CregN then L(xw)τ(w)−1 is a solution in Uw−1;
2. 2.
If L(x0) is nonsingular then L is nonsingular on
all of C0; this follows from
[TABLE]
3. 3.
Suppose L(x) is normalized by L(x0)=I then L(xw0m)=τ(w0)−mL(x)τ(w0)m for all x∈C0 and
m∈Z;
For w∈SN and for x∈TregN define wx∈SN such that xwx−1∈C0 and
wx(1)=1; then wx is uniquely defined and is constant
on connected components. Then define L(x) on the other
connected components of TregN by
[TABLE]
In order to derive a formula for the relation of L(xw)τ(w)−1 to L(x) we need a twist: for
w∈SN and for x∈TregN define
[TABLE]
Henceforth the assumption L(x0)=I is relaxed to L(x0) commuting with τ(w0) and being
nonsingular (so L(xw0m)=τ(w0)−mL(x)τ(w0)m still holds for
x∈C0). Then M(w,x) and L(x)
have the following properties (x∈TregN):
[TABLE]
With the goal of analyzing vector functions of the form f(x)=L(x)p(x) where p∈Pτ
consider
[TABLE]
in other words L(x)wL(x)−1f(x)=M(w,x)−1f(xw). Accordingly define a twisted
action of SN on vector-valued functions f(x)
(defined on TregN) by
[TABLE]
Proposition 5
Suppose w∈SN then L(x)wL(x)−1=σM(w) and σM is a
representation of SN.
Proof. Using formula (7) let g(x)=σM(w2)f(x)=M(w2,x)−1f(xw2), then
[TABLE]
If p(x) is symmetric (τ(w)p(xw)=p(x)) then
[TABLE]
This is crucial in the sequel where the operator L(x)∑i=1N(Ui−1−κγ)2L(x)−1 is related to the Hamiltonian H.
Proposition 6
For 1≤i≤N
[TABLE]
Proof. Write the differential system as ∂iL(x)=κL(x)Ai(x) then
[TABLE]
thus ∂iL(x)−1=−κAi(x)L(x)−1. Next by formula (8) L(x)(i,j)L(x)−1=σM(i,j).
For the other term in Ui=xiDi+1+κωi (formula (4)) we obtain L(x)ωiL(x)−1=∑j>iσM(i,j). Consider
[TABLE]
Thus
[TABLE]
We will use an elementary double sum formula: suppose g(i,j)
is a function defined on all pairs (i,j) with 1≤i,j≤N then
The double sum is of the form (10) and for i<j one obtains
g(i,j)+g(j,i)=xi−xjxiσM(i,j)+xj−xixiσM(j,i)=0. From ∑i=1Nxi∂iL(x)=0
it follows that ∑i=1Nxi∂i commutes with L(x) and together with γ=S1(τ)/N completes
the proof. to get the stated formula.
Lemma 8
For 1≤i≤N
[TABLE]
Proof. In the square of formula (9) group the terms as
[TABLE]
because
[TABLE]
and M(w,x) is locally constant in x. Next consider
[TABLE]
because σM(i,j)xi−xjxi=xj−xixjσM(i,j) and σM(i,j)2=I (by Proposition 5).
More detailed analysis of the terms in line (14) shows that there are
four different coefficients of (xi−xj)(xj−xk)κ2σM((i,j)(i,k)) depending on the numerical order of i,j,k:
xixj if j<k<i or k<j<i,
2. 2.
xixk if j<i<k,
3. 3.
xjxk if i<j<k or i<k<j,
4. 4.
xj2 if k<i<j.
The next step is to sum over 1≤i≤N. Lines (12,13)
sum to zero by using Formula (10). We show that all the terms in
line (14) sum to zero. This is a sum over all cycles of order 3.
Any 3-cycle is of the form (a,b,c) with 1≤a<b<c≤N
or 1≤a<c<b≤N. Each 3-cycle appears three times in the sum since
[TABLE]
If a<b<c then by the above formulae the coefficient of κ2σM((a,b,c)) is
[TABLE]
If a<c<b then the coefficient of κ2σM((a,b,c)) is
[TABLE]
Each pair {i,j} appears twice in the sum of the terms in
(11). We have proven the following:
Theorem 9
The L(x) conjugate of ∑i=1N(Ui−1−κγ)2 is
[TABLE]
Thus HM agrees with H when applied to L(x)p(x) where p is a symmetric (τ(w)p(xw)=p(x)) polynomial. By
Proposition 3 the operators L(x)∑i=1NUimL(x)−1 commute with HM and with σM(w) for w∈SN, for
m=1,2,3,… and L(x)p(x) is an
eigenfunction of HM for any NSJP p(x).
4 Hermitian forms and nonsymmetric Jack polynomials
The results in this section come from [4],[5],[6].
To obtain square-integrable and mutually orthogonal wavefunctions we start
with a Hermitian form ⟨⋅,⋅⟩T
for Pτ with the properties (f,g∈Pτ;1≤i≤N;c∈C;T,T′∈Y(τ))
[TABLE]
The properties define the form uniquely and imply ⟨Uif,g⟩T=⟨f,Uig⟩T and thus the orthogonality of the NSJP’s
(Theorem 13 below). The form is not defined for all κ and
need not be positive-definite. The key results from [4] (recall the
maximum hook-length hτ from (1)) are:
Theorem 10
Suppose −1/hτ<κ<1/hτ and L0(x) is the
solution of (5) satisfying L0(x0)=I and
extended to TregN by (6) then there exists a unique
positive-definite matrix B such that Bτ(w0)=τ(w0)B and
[TABLE]
Each f∈Pτ has the expansion ∑T∈Y(τ)⟨T,T⟩−1/2fT(x)⊗T with fT∈P and f(x) is considered
as a column vector [fT]T∈Y(τ) in the integral formula. It is implicit in the theorem that
L0(x)∗BL0(x) is integrable, and
B depends on κ. Henceforth we use ∥p∥2:=⟨p,p⟩T (which need not be positive
for κ outside the above interval).
There is a unique positive-definite matrix C such that C2=B; as a
consequence C commutes with τ(w0) (because there is
real polynomial r(t) such that r(B)=C). We
apply the results of the previous section to
[TABLE]
and the integral formula becomes
[TABLE]
Here is an outline of the structure and properties of NSJP’s: The operators
Ui have a triangularity property with respect to a partial
order on N0N. For α∈N0N let
α+ denote the nonincreasing rearrangement of α so that
α+ is a partition.
Definition 11
The dominance order ≺ and the derived order ⊲ on
N0N are given by (i) α≺β if and only if
∑j=1iαj≤∑j=1iβj, for1≤i≤N
andα=β; (ii) α⊲β if and only if
∣α∣=∣β∣, α+≺β+ ,or α+=β+ and α≺β.
For example: (3,1,1)⊲(0,2,4)⊲(4,0,2); while (4,1,1),(3,3,0) are not ⊲-comparable.
The NSJP’s are labeled by pairs (α,T)∈N0N×Y(τ) but the leading term involves
a twist.
Definition 12
For α∈N0N the rank function on {1,…,N} is given by
[TABLE]
then rα∈SN and rαα=α+ the
nonincreasing rearrangement of α.
For example if α=(1,2,1,4) then rα=[3,2,4,1] and rαα=α+=(4,2,1,1)
(recall wαi=αw−1(i) ).
Theorem 13
For (α,T)∈N0N×Y(τ) and for all κ except for a
discrete subset of Q there is a unique simultaneous eigenfunction
ζα,T∈Pτ of {Ui}, homogeneous of degree ∣α∣, such that
[TABLE]
The ζα,T are called nonsymmetric Jack polynomials. The condition
on κ for existence is satisfied if each pair (α,T) is determined by its spectral vectorξα,T:=[αi+1+κc(rα(i),T)]i=1N; this includes the interval −1/hτ≤κ≤1/hτ.
There is an algorithmic approach to the construction based on the Yang-Baxter
(directed) graph. The edges involve the adjacent transpositions si, which
act by transposition on the spectral vector, and a degree-raising operation
which shifts and increments the spectral vector. The nodes of the graph are of
the form
[TABLE]
(abbreviated to (α,T)) the root is (0N,T0,[1+κc(i,T0)]i=1N,I,1⊗T0) where T0 is formed by entering
N,N−1,…,1 column-by-column in the Ferrers diagram. The degree-raising
edge uses the map Φ:(c1,c2,…,cN)→(c2,c3,…,cN,c1+1) on N-tuples.
It is called an* affine step *and is defined by
[TABLE]
[TABLE]
(recall w0=(1,2,…,N), an N-cycle) the leading term
is xΦα⊗τ(w0−1rα−1)T and
w0−1rα−1=rΦα−1 because rΦα=rαw0 for any α: rαw0(i)=rα(w0(i))=rα(i+1) for 1≤i<N, rαw0(N)=rα(1). For example: α=(0,3,5,0),
rα=[3,2,1,4]; Φα=(3,5,0,1),
rΦα=[2,1,4,3].
The other edges are called steps or jumps, both labeled by si: the
formulae for both rely on the commutation (3) and the coefficient
b is determined by the condition that siζα,T−bζα,T is an eigenfunction of Ui.
If αi<αi+1, then the step si is
[TABLE]
[TABLE]
If αi=αi+1, set j=rα(i), so that
j+1=rα(i+1) and sirα−1=rα−1sj. Thus ξα,T(i)=αi+1+κc(j,T) and ξα,T(i+1)=αi+1+κc(j+1,T). Set
[TABLE]
If b′=1 {rw(j,T)=rw(j+1,T)} or −1 {cm(j,T)=cm(j+1,T)} then siζα,T=ζα,T or
−ζα,T respectively. Otherwise let T(j)
denote the result of interchanging j and j+1 in T. If 0<b′≤21, that is, rw(j,T)<rw(j+1,T) (and cm(j,T)>cm(j+1,T); if one takes the (1,1) cell of T as
northwest then j is northeast of j+1) then the jump si is
(“jump” suggests jumping from one tableau
to another)
[TABLE]
[TABLE]
The leading term is transformed si(xα⊗τ(rα−1)T)=(xsi)α⊗τ(sirα−1)T=xα⊗τ(rα−1)τ(sj)T and τ(sj)T=T(j)+b′T. The jump applies to the
situation α=0N and provides the transformation formulae for si
acting on T∈Y(τ) (that is, on 1⊗T and
rα(i)=i).
Example 14
Let N=3,τ=(2,1) and T_{0}=\begin{array}[c]{cc}3&1\\
2&\end{array},T_{1}=\begin{array}[c]{cc}3&2\\
1&\end{array}, and consider (α,T)=((0,1,1),T0). Then rα=[3,1,2] and ξα,T0=[1,2+κ,2−κ]. The step s1 is
ζ(1,0,1),T0=s1ζα,T0+1+κκζα,T0; for the jump s2 one finds
j=1,b′=21 and ζ(0,1,1),T1=s2ζα,T0−21ζα,T0. Note
ξ(0,1,1),T1=[1,2−κ,2+κ].
and thus ⟨ζα,T,ζβ,T′⟩T=0, (for permitted values of κ). The orthogonality
provides an inductive process for computing ⟨ζα,T,ζα,T⟩T: for the step si with
αi<αi+1 we have siζα,T=ζsiα,T+bζα,T (where b=ξα,T(i)−ξα,T(i+1)κ) and
[TABLE]
A similar formula holds for the jump (αi=αi+1). For the
affine step, the hypotheses (15) imply ∥ζΦα,T∥2=∥ζα,T∥2.
Together with ⟨1⊗T,1⊗T′⟩T=⟨T,T′⟩0 this procedure
leads to formulae for all ∥ζα,T∥2.
Theorem 15
For λ∈N0N,+ (λ1≥λ2…≥λN) and T∈Y(τ)
[TABLE]
There is an additional factor for nonpartition indices.
Definition 16
For α∈N0N,T∈Y(τ) and
ε=±1 set
[TABLE]
Theorem 17
Suppose α∈N0N,T∈Y(τ)
then ∥ζα,T∥2=(E1(α,T)E−1(α,T))−1∥ζα+,T∥2.
It is important that −1/hτ<κ<1/hτ implies ∥ζα,T∥2>0 for all (α,T) and
thus ⟨⋅,⋅⟩T is
positive-definite. Observe that the value of ∥ζα,T∥2 depends only on the differences αi−αj.
This is a consequence of the torus property ⟨xif,xig⟩T=⟨f,g⟩T and
the commutation (where eN:=x1x2⋯xN )
[TABLE]
Thus Ui(eNmζα,T)=(m+αi+κc(rα(i),T))eNmζα,T, and eNmζα,T is a simultaneous
eigenfunction of {Ui} with the same
eigenvalues and the same leading term as ζα+m1,T
for m≥0 (with 1:=(1,1,…,1)∈N0N). Hence ζα+m1,T=eNmζα,T. There are Laurent polynomial eigenfunctions of {Ui}. The structure of NSJP’s is extended to Vτ-valued Laurent polynomials, thereby producing a basis:
Definition 18
Suppose α∈ZN then set ζα,T=eN−mζα+m1,T where m∈N0 and
satisfies m≥−minjαi. This is well-defined since
α+m1∈N0N and ζα+k1,T=eNkζα,T for k∈N0.
5 Symmetric vector-valued polynomials
For an arbitrary (α,T)∈N0N×Y(τ) we can define a symmetric polynomial
simply by averaging: p=N!1∑w∈SNwζα,T. From Proposition 3 it follows that p is an
eigenfunction of ∑i=1NUim for each m=1,2,3,…. The idea of using this method to construct Jack polynomials from the scalar
nonsymmetric Jack polynomials is due to Baker and Forrester [2]; the
usual Jack parameter is α=1/κ. It is possible that for some
(α,T) the sum p=0, and for some pairs (α,T) and (β,T′) that the sums agree
up to multiplication by a constant. In this section we present the structure
of Jack polynomials, the assignment of unique labels, and orthogonality
properties (henceforth, unmodified “Jack” implies symmetry). Multiplication by L(x) will yield
symmetric eigenfunctions of H, the vector-valued wavefunctions.
The results are mostly from [5, Sec. 5.2]. The Jack polynomials
correspond to certain connected components of the Yang-Baxter graph after the
affine jumps are removed.
Definition 19
For α∈N0N,T∈Y(τ) define
⌊α,T⌋ to be the filling of the Ferrers diagram
of τ obtained by replacing i by αi+ in T, for all i.
Obviously ⌊α,T⌋=⌊α+,T⌋.
Example 20
Let τ=(3,2),α=(1,4,2,0,3) and
[TABLE]
Proposition 21
([5, Prop. 5.2]) (α,T) and (β,T′) are connected by edges and jumps (without regard to
the orientation) if and only if ⌊α,T⌋=⌊β,T′⌋.
From the properties of steps and jumps it follows that the spectral vectors of
(α,T) and (β,T′) are
permutations of each other. Set T(α,T)={(β,T′):⌊β,T′⌋=⌊α,T⌋}, the set of nodes in the
connected component.
A tableau is column-strict if the entries are increasing in each
column, and nondecreasing in each row.
Theorem 22
For (α,T)∈N0N×Y(τ) the span{ζβ,T′:(β,T′)∈T(α,T)}
contains a unique nonzero symmetric polynomial if and only if ⌊α,T⌋ is column-strict.
As usual in this context, unique means up to multiplication by a scalar.
Suppose λ∈N0N,+ and consider the sum p=(β,T′)∈T(λ,T)∑a(β,T′)ζβ,T′
subject to the conditions sip=p for 1≤i<N (sufficing for symmetry).
Suppose there is a step or jump si from (β,T′) to (γ,T′′) then ζ(γ,T′′)=siζ(β,T′)−bζ(β,T′) for some b; this implies
siζ(γ,T′′)=−bζ(β,T′)+(1−b2)ζ(γ,T′′). The condition si(a(β,T′)ζβ,T′+a(γ,T′′)ζγ,T′′)=a(β,T′)ζβ,T′+a(γ,T′′)ζγ,T′′ implies a(β,T′)=(1+b)a(γ,T′′). The column strictness hypothesis implies that b=−1 can not
occur. The relation is used in an inductive evaluation of a(β,T′) once the beginning and end have been identified.
Definition 23
For α∈NN and T∈Y(τ) let
[TABLE]
Thus a step reduces inv(α) by 1 (that is,
inv(siα)=inv(α)−1) and a jump reduces inv(T) by 1 (in Example
14inv(T0)=1 and inv(T1)=0). Hence the root (α,T) of
∈T(α,T) has maximum inv(α)+inv(T) and the sink has minimum
inv(α)+inv(T). Clearly
inv(α) is minimized at α+ and
maximized at α−, the nondecreasing rearrangement of α. In
[5, Def. 5.6] it is shown that there are unique tableaux
TR,TS in ∈T(α,T) such that (α−,TR) is the root and (α+,TS)
is the sink (maximizes, respectively minimizes inv(β)+inv(T′) for (β,T′)∈T(α,T)). The
formulae for TR and TS are (with T=⌊α,T⌋)
[TABLE]
[TABLE]
Example 24
α=(33,23,1,0),
[TABLE]
As motivation for the formulae for a(β,T′) in the
sum suppose βi<βi+1 (and ε=±1) then
[TABLE]
where ζsiβ,T=siζβ,T−bζβ,T. We
introduce two functions on Y(τ) to deal
analogously with jumps:
Definition 25
For T∈Y(τ) and ε=±1 set
[TABLE]
From (2) ⟨T,T⟩0=C1(T)C−1(T). In the jump with βi=βi+1,rβ(i)=j and c(j,T)−c(j+1,T)≥2 (as in 17) T(j)
has j and j+1 interchanged so that c(j,T(j))−c(j+1,T(j))=c(j+1,T)−c(j,T)≤−2. Then
[TABLE]
so that C−1(T(j))=C−1(T)(1+b) where b=(c(j,T)−c(j+1,T))−1. From these relations it
can be shown:
Proposition 26
Suppose (α,T)∈N0N×Y(τ) and ⌊α,T⌋ is
column-strict then
[TABLE]
is symmetric and nonzero.
To proceed with the analysis we impose a normalization and then find a closed
formula for the squared-norm ∥⋅∥2. Replace
α by λ=α+ and use the sink (λ,TS) as normalization by requiring that the coefficient of
xλvTS is 1. From the sink property and the
⊳-triangularity of the NSJP’s it follows that xλvTS appears only in ζλ,TS in the sum p, with
coefficient 1. Thus define (for λ∈N0N,+)
[TABLE]
By orthogonality ∥Jλ,TS∥2=(β,T′)∈T(λ,TS)∑(C−1(T′)C−1(TS)E−1(β,T′))2∥ζβ,T′∥2; fortunately there is a formula without summation. Suppose
(β,T′)∈T(λ,TS) and Jλ,TS=cw∈SN∑wζβ,T′ then
[TABLE]
if we write Jλ,TS=(β,T′)∈T(λ,TS)∑a(β,T′)ζβ,T′ then ∥Jλ,TS∥2=(N!c)a(β,T′)∥ζβ,T′∥2 and c can be determined by careful
choice of (β,T′). Consider the stabilizer group
Gλ,TS of ζλ,TS (w∈Gλ,TS
implies wζλ,TS=ζλ,TS). The group is
generated by {si:λi=λi+1,rw(i,TS)=rw(i+1,TS)}. It was
shown ([5, Prop. 5.11]) that the coefficient of ζλ,TS in w∈SN∑wζλ−,TR is #Gλ,TS, hence that w∈SN∑wζλ−,TR=#Gλ,TSJλ,TS. We deduce
[TABLE]
Also
[TABLE]
and ⟨TR,TR⟩0∥ζλ,TR∥2=⟨TS,TS⟩0∥ζλ,TS∥2 (from Theorem
15). From (2) it follows that ⟨TS,TS⟩0⟨TR,TR⟩0=C1(TS)C−1(TS)C1(TR)C−1(TR), and #Gλ,TSN!=#Tλ,TS. To summarize:
Theorem 27
Suppose (λ,T)∈N0N,+×Y(τ) and ⌊λ,T⌋ is column-strict. Define TR and TS by formulae
(18) and (19) then
[TABLE]
Suppose ⌊λ,TS⌋,⌊λ′,TS⌋ are unequal column-strict tableaux. By
definition T(λ,TS)∩T(λ′,TS)=∅ and from the mutual orthogonality
of the terms in the sums (20) it follows that ⟨Jλ,TS,Jλ′,TS⟩T=0.
Multiplication of Jλ,TS by eNm produces the Jack
polynomial Jλ+m1,TS (see Definition 18);
here m=−1,−2,…is valid and defines Jack Laurent polynomials. The
expression eNmJλ,TS is made unique by the requirement
λN=0.
We see that there is a unique symmetric polynomial pλ,T of minimum
degree: the tableau ⌊λ,T⌋ has the entry i−1
in each box in row #i. The degree is n(τ)=∑i≥1(i−1)τi.
Remark 28
A weak reverse tableau of shape τ and weight n has its entries
nondecreasing in each row and in each column and the sum of the entries is
n. Such a tableau can be transformed to a column-strict tableau by adding
i−1 to each entry in row #i for 1≤i≤ℓ(τ).
The number of the weak reverse tableaux is the coefficient of zn in
Hτ(z):=∏(i,j)∈τ(1−zh(i,j))−1 (see [9, p.379], h(i,j) from Formula (1)). Thus the number of Jack polynomials
of degree n is the coefficient of zn in zn(τ)Hτ(z). For example take τ=(3,2)
then zn(τ)Hτ(z)=z2{(1−z)2(1−z2)(1−z3)(1−z4)}−1. The analogous number when
λN=0 is the coefficient of zn in (1−zN)zn(τ)Hτ(z).
If (β,T′)∈T(λ,TS) then the spectral vector ξβ,T′ is a
permutation of ξλ,TS thus ∑i=1NUimJλ,TS=∑j=1Nξj(λ,TS)mJλ,TS for m=1,2,3,…. and
[TABLE]
Set S2:=∑i=1ℓ(τ)c(i,TS)2=61∑i=1ℓ(τ)τi{(τi−1)(τi−2)−6(τi−i)(i−1)}. The eigenvalue can be written as ∑i=1Nλi2+2κ∑i=1Nλi(c(i,TS)−γ)+κ2(S2−Nγ2). In the trivial case τ=(N) the last term becomes
121κ2N(N2−1). The effect of multiplying
by eNm on the eigenvalue is
[TABLE]
This is minimized over m when m is the nearest integer to −∑i=1Nλi/N.
6 Symmetric wavefunctions
In the notation of Section 5 there is a set of mutually orthogonal
wavefunctions L(x)Jλ,TS(x) such
that
is a probability density function on TN. Since multiplication of
L(x)Jλ,TS(x) by powers of eN
does not change the density function, we can assume λN=0. In
contrast to the scalar case the matrix L(x) has singularities
of order ∣xi−xj∣±κ in neighborhoods of
points x with xi=xj and all other xk being pairwise distinct.
Nevertheless we can show that the symmetric wavefunctions are bounded in such
sets when 0<κ<hτ1. By the invariance it suffices to
prove this near {x:xN−1=xN} in the fundamental
chamber. More precisely let δ>0 and define
[TABLE]
Theorem 29
Suppose 0<κ<hτ1 and (λ,TS) is
as in Theorem 27 then L(x)Jλ,TS(x) is uniformly bounded in Ωδ.
The proof depends on a power series formulation for L proven in [4, Sec.
5]. Arrange Y(τ) linearly listing the
tableaux T with c(N−1,T)=−1 first (that is, cm(N−1,T)=1,rw(N−1,T)=2). This results
in the matrix representation of τ(N−1,N) being
[TABLE]
where nτ:=dimVτ=#Y(τ) and
mτ is given by tr(τ(N−1,N))=nτ−2mτ. From the sum ∑i<jτ(i,j)=S1(τ)I it follows that (2N)tr(τ(N−1,N))=S1(τ)nτ and
mτ=nτ(21−N(N−1)S1(τ)). (The traces of the transpositions are
equal because they are conjugate to each other.) The property of a matrix
commuting or anti-commuting with σ:=τ(N−1,N) is used
in the argument; to express this neatly we introduce the σ-block
decomposition (mτ+(nτ−mτ))×(mτ+(nτ−mτ)) of a
matrix
[TABLE]
Then σασ=α if and only if α12=O=α21
and σασ=−α if and only if α11=O=α22.
For z1,z2∈C let
[TABLE]
We showed in [4, Sec. 5] that there exist matrix coefficients
αn(x′) with x′:=(x1,…,xN−2,2xN−1+xN), analytic on the closure of
Ωδ∪Ωδ(N−1,N), such that (with
z:=2xN−xN−1)
[TABLE]
and σαn(x′)σ=(−1)nαn(x′). In particular the σ-block
decomposition of α0(x′) is \left[\begin{array}[c]{cc}\alpha_{0,11}\left(x^{\prime}\right)&O\\
O&\alpha_{0,22}\left(x^{\prime}\right)\end{array}\right]. The series converges absolutely for 21∣xN−xN−1∣<1≤j≤N−2minxj−2xN−1+xN.
Suppose Jλ,TS is nonzero as in (20) then express
Jλ,TS(x)=T∈Y(τ)∑⟨T,T⟩01/21pT(x)⊗T where each pT(x) is a scalar polynomial. If c(N−1,T)=−1 then
τ(N−1,N)T=−T and the relation (N−1,N)Jλ,TS=Jλ,TS implies pT(x(N−1,N))=−p(x) (see Proposition. 1).
In the order of the basis chosen above the first mτ coefficients of
Jλ,TS are divisible by xN−xN−1. Write Jλ,TS as a column vector [p1tr,p2tr]tr with
p1 consisting of the first mτ coordinates. Suppose κ>0
then the dominant part of (L(x)Jλ,TS(x))∗L(x)Jλ,TS(x) is
[TABLE]
(with z=2xN−xN−1) the omitted terms are of order ∣xN−xN−1∣1−2∣κ∣. Each component
of p1(x) is divisible by xN−xN−1 and thus the
first part of the expression is of order ∣xN−xN−1∣2−2κ and the second part is of order ∣xN−xN−1∣2κ. Hence (L(x)Jλ,TS(x))∗L(x)Jλ,TS(x) is bounded on Ωδ. It may be suspected that the
bound holds for all of TN but the behaviour of L(x) near a point with multiple repeated entries (say xN−2=xN−1=xN) is complicated and the power series method used here does not apply.
6.1 Minimal degree symmetric polynomials
To produce the minimal degree Jλ,TS, or equivalently, the
minimal degree column-strict tableau of shape τ, the entries in row #i
all equal i−1. The corresponding TS has the numbers N,N−1,…,2,1
entered row-by-row, and TR=TS. With l=ℓ(τ) and
using superscripts to denote multiplicity λ=((l−1)τl,(l−2)τl−1,…,1τ2,0τ1). There is an explicit formula for Jλ,TS. It is
derived from Proposition 1 and involves the Specht polynomials. For
1≤n1≤n2≤N define the alternating polynomial a(x;n1,n2)=n1≤i<j≤n2∏(xi−xj) (the empty product a(x;n1,n1)=1).
Denote the transpose of the partition τ by τ′ then τ1′=ℓ(τ). Form pT0 as the product of
the alternating polynomials for each column of T0: that is, set
kj=N−∑i=1jτj′,0≤j≤τ1 and
[TABLE]
Then the other polynomials pT are produced by the formulae in the
Proposition and the minimal Jλ,TS=⟨TS,TS⟩0T′∈Y(τ)∑⟨T′,T′⟩01pT′(x)⊗T′ (see [5, Sec.
5.4]). For example let τ=(2,2) then
[TABLE]
[TABLE]
because b=(c(2,T0)−c(3,T0))−1=21. Observe that s1pT1=pT1=s3pT1.
Also ⟨T0,T0⟩0=1 and ⟨T1,T1⟩0=43 (see (2), λ=(1,1,0,0) and Jλ,T1=43pT0⊗T0+pT1⊗T1.
There is a formula for the minimal (λ,TS) proven in
[3, Thm. 8]:
[TABLE]
where leg(i,j):=#{l:l>i,τl≥j} (equivalently τj′−i), and (m)n is the Pochhammer symbol ∏j=1n(m+j−1).
The energy eigenvalue ∑i=1Nλi2+2κ∑i=1Nλi(c(i,TS)−γ)+κ2(S2−Nγ2) from (21) specializes to
[TABLE]
for the minimal degree Jλ,TS.
6.2 Example
Let N=4,τ=(2,2),Y(τ)={T0,T1} see (22), hτ=3. The
system (5) can be reduced to a hypergeometric equation in one
variable by the substitution ζ(x)=(x1−x3)(x2−x4)(x1−x2)(x3−x4). The bounds 0<ζ(x)<1 hold
in the fundamental domain C0. A fundamental solution LF is
given in terms of the functions
[TABLE]
[TABLE]
Then the solution L(x) which satisfies (16) is up to
a positive multiplicative constant
[TABLE]
where γ(κ):=Γ(1+κ)Γ(1+3κ)Γ(1+2κ)2;
observe that γ(κ)>0 for κ>−31. As
yet the problem of determining the normalizing constant is still open. The
purpose of the example is to demonstrate the qualitative difference of
L(x) from the scalar case, so the underlying computations are
not presented here. The method uses the known transformation properties of the
hypergeometric series for the change-of-variable ζ→1−ζ ,
since ζ(xw0)=1−ζ(x) where
w0=(1,2,3,4), a 4-cycle.
Bibliography9
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Awata, H., Hidden algebraic structure of the Calogero-Sutherland model, integral formula for Jack polynomial and their relativistic analog. Calogero-Moser-Sutherland Models (Montréal, QC, 1997), 23–35, CRM Ser. Math. Phys. , Springer, New York.
2[2] T. Baker and P. Forrester, Symmetric Jack polynomials from non-symmetric theory, Ann. Comb. 3 (1999), 159-170.
3[3] Dunkl, C. F., Symmetric and antisymmetric vector-valued Jack polynomials, Sém. Lothar. Combin. B 64a (2010), 31 pp.
4[4] Dunkl, C. F., A linear system of differential equations related to vector-valued Jack polynomials on the torus, ar Xiv:1612.01486 v 1 [math.CA] 5 Dec 2016.
5[5] C. F. Dunkl and J.-G. Luque, Vector-valued Jack polynomials from scratch, SIGMA 7 (2011) 26, 48 pp, ar Xiv:1009.2366.
6[6] S. Griffeth, Orthogonal functions generalizing Jack polynomials, Trans. Amer. Math. Soc. 362 (2010), 6131-6157, ar Xiv:0707.0251.
7[7] G. James and A. Kerber, The Representation Theory of the Symmetric Group , Encyc. of Math. and its Applic. 16 , Addison-Wesley, Reading MA, 1981; Cambridge University Press, Cambridge, 2009.
8[8] Lapointe L. and Vinet L., Exact operator solution of the Calogero-Sutherland model, Comm. Math. Phys. 178 , (1996), 425-452.