format: text

text:
# Rational solutions to the Pfaff lattice and Jack polynomials

## 1 Introduction

Self-dual partitions: For positive integer $`n`$ and $`n|k`$, define the following sets of partitions,

$`𝕐`$ $`=`$ $`\{\lambda =(\lambda _1,\lambda _2,\mathrm{}),\lambda _1\lambda _2\mathrm{}0\}`$
$`𝕐_k`$ $`=`$ $`\{\lambda 𝕐,|\lambda |={\displaystyle \lambda _i}=k\}`$
$`𝕐_k^{(n)}`$ $`=`$ $`\left\{\begin{array}{cc}\lambda =(\lambda _1,\lambda _2,\mathrm{},\lambda _n)𝕐_k,& \hfill \widehat{\lambda }_1n,\\ & \\ \lambda _i+\lambda _{n+1i}=\frac{2k}{n},& \hfill 1i\left[\frac{n+1}{2}\right]\end{array}\right\},`$
with

$$\mathrm{\#}𝕐_k^{(n)}=\left(\genfrac{}{}{0pt}{}{\left[\frac{n}{2}+\frac{k}{n}\right]}{\left[\frac{n+1}{2}\right]}\right).$$

These are a few examples:

$$𝕐_8^{(4)}=\left\{\begin{array}{cccccc}\text{            },& \text{              },& \text{        },& \text{                },& \text{          },& \text{            }\end{array}\right\}$$

$$𝕐_6^{(3)}=\left\{\begin{array}{ccccc}\text{          },& \text{        },& \text{            }& & \end{array}\right\}.$$

Let $`𝐬_\lambda (t):=det(s_{\lambda _ii+j}(t))_{1i,j}`$ be the Schur polynomials corresponding to $`\lambda `$, with $`𝐬_i(t)`$ being the elementary Schur polynomials, defined by

$$e^{_1^{\mathrm{}}t_iz^i}=\underset{i0}{}𝐬_i(t)z^i\text{ with }𝐬_i(t)=0\text{ for }i<0.$$

The linear space

$$𝕃_k^{(n)}:=\{\underset{\lambda 𝕐_k^{(n)}}{}a_\lambda 𝐬_\lambda |a_\lambda \}$$

will play an ubiquitous role in this work.

The finite Pfaff Lattice: The $`N\times N`$ skew-symmetric matrices,

$`J`$ $`=`$ (0110000110),for N evenmissing-subexpression0110missing-subexpression0missing-subexpressionmissing-subexpressionmissing-subexpressionmissing-subexpressionmissing-subexpressionmissing-subexpression0missing-subexpression0110missing-subexpressionfor N even\displaystyle\left(\begin{array}[]{cc@{}c@{}cc}&\boxed{\begin{array}[]{cc}0&1\\
-1&0\end{array}}&&0&\\
&&\ddots&&\\
&0&&\boxed{\begin{array}[]{cc}0&1\\
-1&0\end{array}}&\\
&&&&\end{array}\right),~{}~{}~{}\mbox{for
\text@underline{$N$ even}} (1.0.10)
$`=`$ (01100001100),for N odd,missing-subexpression0110missing-subexpression0missing-subexpressionmissing-subexpressionmissing-subexpressionmissing-subexpressionmissing-subexpressionmissing-subexpression0missing-subexpression0110missing-subexpressionmissing-subexpressionmissing-subexpressionmissing-subexpressionmissing-subexpression0for N odd\displaystyle\left(\begin{array}[]{cc@{}c@{}cc}&\boxed{\begin{array}[]{cc}0&1\\
-1&0\end{array}}&&0&\\
&&\ddots&&\\
&0&&\boxed{\begin{array}[]{cc}0&1\\
-1&0\end{array}}&\\
&&&&0\end{array}\right),~{}~{}~{}\mbox{for
\text@underline{$N$ odd}}, (1.0.19)
satisfy

$$J^2=\{\begin{array}{c}I_N,\text{ for }N\text{ even}\hfill \\ \\ \left(\begin{array}{cc}I_{N1}& O\\ O& 0\end{array}\right),\text{ for }N\text{ odd.}\hfill \end{array}$$
(1.0.20)
Also consider the Lie algebra $`𝔨`$ of lower-triangular matrices of the form

$$𝔨=\{\begin{array}{c}\left(\begin{array}{ccccc}& \overline{)\begin{array}{cc}a_1& 0\\ 0& a_1\end{array}}& & & O\\ & & & \mathrm{}& \\ & & & & \overline{)\begin{array}{cc}a_{[N/2]}& 0\\ 0& a_{[N/2]}\end{array}}\end{array}\right),\text{ for }N\text{ even}\\ \\ \left(\begin{array}{cccccc}& & & & & \\ & \overline{)\begin{array}{cc}a_1& 0\\ 0& a_1\end{array}}& & & O& \\ & & & \mathrm{}& & \\ & & & & \overline{)\begin{array}{cc}a_{[N/2]}& 0\\ 0& a_{[N/2]}\end{array}}& \\ & & & & & \overline{)\begin{array}{c}a_{(N+1)/2}\end{array}}\end{array}\right),\text{ for }N\text{ odd.}\end{array}$$
(1.0.21)
For each $`agl(N)`$, consider the decomposition111$`a_\pm `$ refers to projection onto strictly upper (strictly lower) triangular matrices, with all $`2\times 2`$ diagonal blocks equal zero. $`a_0`$ refers to projection onto the “diagonal”, consisting of $`2\times 2`$ blocks.

$`a`$ $`=`$ $`(a)_𝔨+(a)_𝔫`$ (1.0.22)
$`=`$ $`\pi _𝔨a+\pi _𝔫a`$
$`=`$ $`\left((a_{}J(a_+)^{}J)+{\displaystyle \frac{1}{2}}(a_0J(a_0)^{}J)\right)`$
$`+\left((a_++J(a_+)^{}J)+{\displaystyle \frac{1}{2}}(a_0+J(a_0)^{}J)\right).`$
For  $`N`$ even, this corresponds to a Lie algebra splitting, given by

$$gl(N)=𝔨+𝔫\{\begin{array}{c}𝔨=\{\text{lower-triangular matrices of the form (1.0.3)}\}\hfill \\ 𝔫=sp(N)=\{a\text{ such that }Ja^{}J=a\},\hfill \end{array}$$

(1.0.23)
For  $`N`$ odd, this is merely a vector space splitting

$$gl(N)=𝔨+𝔫\{\begin{array}{c}𝔨=\{\text{lower-triangular matrices of the form (1.0.3)}\}\hfill \\ 𝔫=\text{span}\{\pi _𝔫(a)\text{with}agl(N)\}.\hfill \end{array}$$

(1.0.24)
The Pfaff lattice is defined on $`N\times N`$ matrices $`L`$ of the form

$`L`$ $`=`$ $`\left(\begin{array}{cccccccc}0& 1& & & & & & \\ & d_1& a_1& & & & & O\\ & & d_1& 1& & & & \\ & & & d_2& a_2& & & \\ & & & & d_2& & & \\ & & & & & \mathrm{}& a_{\frac{N2}{2}}& \\ & & & & & & d_{\frac{N2}{2}}& 1\\ & & & & & & & 0\end{array}\right),\text{for }N\text{ even}`$
$`=`$ $`\left(\begin{array}{cccccccc}0& 1& & & & & & \\ & d_1& a_1& & & & & O\\ & & d_1& 1& & & & \\ & & & d_2& a_2& & & \\ & & & & d_2& & & \\ & & & & & \mathrm{}& 1& \\ & & & & & & d_{\frac{N1}{2}}& a_{\frac{N1}{2}}\\ & & & & & & & d_{\frac{N1}{2}}\end{array}\right),\text{for }N\text{ odd}.`$
(1.0.27)
namely,

$$\frac{L}{t_i}=[(L^i)_𝔨,L].\text{(Pfaff lattice) }$$
(1.0.28)
Given arbitrary, but fixed parameters

$$b_0,\mathrm{},b_{[\frac{N2}{2}]},$$
(1.0.29)
consider the skew-symmetric antidiagonal initial condition,

$`m_N(0)`$ $`=`$ $`\left(\begin{array}{cccccc}& O& & & & b_{\frac{N2}{2}}\\ & & & & \mathrm{}& \\ & & & b_0& & \\ & & b_0& & & \\ & \mathrm{}& & & & \\ b_{\frac{N2}{2}}& & & & O& \end{array}\right)\text{, for }N\text{ even,}`$
$`=`$ $`\left(\begin{array}{ccccccc}& & O& & & & b_{\frac{N3}{2}}\\ & & & & & \mathrm{}& \\ & & & & b_0& & \\ & & & 0& & & \\ & & b_0& & & & \\ & \mathrm{}& & & & & \\ b_{\frac{N3}{2}}& & & & & O& \end{array}\right)\text{, for }N\text{ odd}`$
(1.0.32)
and its time evolution (respecting the skew-symmetry),

$$m_{\mathrm{}}(t)=E_{\mathrm{},N}(t)m_N(0)E_{\mathrm{},N}^{}(t),$$
(1.0.33)
where222$`\mathrm{\Lambda }`$ is the finite shift matrix $`\mathrm{\Lambda }:=(\delta _{i,j1})_{1i,jN}`$ and $`(A)_{\genfrac{}{}{0pt}{}{1,\mathrm{},\mathrm{}}{1,\mathrm{},N}}`$ denotes the matrix formed by the first $`\mathrm{}`$ rows and first $`N`$ columns of $`A`$.

$$E_{\mathrm{},N}(t):=\left(e^{_1^{\mathrm{}}t_i\mathrm{\Lambda }^i}\right)_{\genfrac{}{}{0pt}{}{1,\mathrm{},\mathrm{}}{1,\mathrm{},N}}.$$
(1.0.34)
The Pfaffian $`pfm_{\mathrm{}}(t)`$ of the skew-symmetric matrix $`m_{\mathrm{}}(t)`$ will play an important role in this paper.

Rational solutions to the Pfaff Lattice:

###### Theorem 1.1

Modulo conjugation by a $`N\times N`$ diagonal matrix $`D(t)`$ (see remark below), the finite Pfaff lattice

$$\frac{L}{t_i}=[(L^i)_𝔨,L].\text{(Pfaff lattice) }$$

has rational solutions in $`t_1,t_2,\mathrm{}`$; i.e., the matrix

$$D^1(t)L(t)D(t)=\stackrel{~}{Q}(t)\mathrm{\Lambda }\stackrel{~}{Q}(t)^1$$
(1.0.35)
is rational in $`t_1,t_2,\mathrm{}`$, with $`\stackrel{~}{Q}(t)`$ a lower-triangular $`N\times N`$ matrix with rational entries, obtained by Taylor expanding $`\tau _{2n}(t[z^1])`$ in $`z^1`$, with $`\tau _0=1`$,

$`\stackrel{~}{q}_{2n}(t;z)`$ $`:=`$ $`{\displaystyle \underset{j=0}{\overset{2n}{}}}\stackrel{~}{Q}_{2n+1,j+1}(t)z^j=z^{2n}\tau _{2n}(t[z^1])\text{with}0n\left[{\displaystyle \frac{N1}{2}}\right]`$
$`\stackrel{~}{q}_{2n+1}(t;z)`$ $`:=`$ $`{\displaystyle \underset{j=0}{\overset{2n+1}{}}}\stackrel{~}{Q}_{2n+2,j+1}(t)z^j=z^{2n}(z+{\displaystyle \frac{}{t_1}})\tau _{2n}(t[z^1]),`$
with (see the definition of the $`𝕃`$-space in the beginning of this section)

$`\tau _{\mathrm{}}(t)`$ $`=`$ $`pf\left(E_{\mathrm{},N}(t)m_N(0)E_{\mathrm{},N}^{}(t)\right)`$ (1.0.39)
$`=`$ $`{\displaystyle \underset{\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}}{}}\left({\displaystyle \underset{1}{\overset{[\mathrm{}/2]}{}}}b_{\lambda _ii+\mathrm{}\left[\frac{N+1}{2}\right]}\right)𝐬_\lambda (t),\text{for}\{\begin{array}{c}0\mathrm{}N1\hfill \\ \mathrm{}\text{ even}\hfill \end{array}`$
$``$ $`𝕃_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}.`$ (1.0.40)
The polynomials $`q_k=D_k\stackrel{~}{q}_k`$ (in $`z`$) of degree $`0kN1`$ are “skew-orthonormal” with respect to the skew inner-product $`z^i,z^j=m_{ij}(t)`$, i.e.,

$$q_i,q_j=J_{ij},$$
(1.0.41)
and the $`N`$-vector $`(q_0,\mathrm{},q_{N1})^{}`$ is an eigenvector for the matrix $`L`$, with modified boundary conditions. The fact that $`Q_{2n,2n1}=0`$ defines the skew-orthogonal polynomials in a unique way, up to $`\pm 1`$.

Example: For $`\mathrm{}=2`$, we have

$`\tau _2(t)`$ $`=`$ $`{\displaystyle \underset{i=0}{\overset{\frac{N2}{2}}{}}}b_i𝐬_{\frac{N2}{2}+i,\frac{N2}{2}i}(t),\text{ for }N\text{ even,}`$ (1.0.42)
$`=`$ $`{\displaystyle \underset{i=0}{\overset{\frac{N3}{2}}{}}}b_i𝐬_{\frac{N1}{2}+i,\frac{N3}{2}i}(t),\text{ for }N\text{ odd.}`$
Remark:

$`D(t)`$
$`=`$ $`\mathrm{diag}({\displaystyle \frac{1}{\sqrt{\tau _0\tau _2}}},{\displaystyle \frac{1}{\sqrt{\tau _0\tau _2}}},{\displaystyle \frac{1}{\sqrt{\tau _2\tau _4}}},{\displaystyle \frac{1}{\sqrt{\tau _2\tau _4}}},\mathrm{},{\displaystyle \frac{1}{\sqrt{\tau _{N2}\tau _N}}},{\displaystyle \frac{1}{\sqrt{\tau _{N2}\tau _N}}})\text{for N even}`$
$`=`$ $`\mathrm{diag}({\displaystyle \frac{1}{\sqrt{\tau _0\tau _2}}},{\displaystyle \frac{1}{\sqrt{\tau _0\tau _2}}},,\mathrm{},{\displaystyle \frac{1}{\sqrt{\tau _{N3}\tau _{N1}}}},{\displaystyle \frac{1}{\sqrt{\tau _{N3}\tau _{N1}}}},{\displaystyle \frac{1}{\sqrt{\tau _{N1}}}})\text{for N odd}.`$
Duality: For the case of odd $`N`$, we can even define $`\tau _{\mathrm{}}(t)`$ for odd $`\mathrm{}`$, by slightly deforming the initial moment matrix $`m_N(0)`$. In section 6, we prove a duality between these $`\tau _k`$’s for $`k`$ even and odd, as follows

$$\stackrel{~}{\tau }_{\mathrm{}}(t)=(1)^{\mathrm{}(N\mathrm{})/2}\left(\underset{0}{\overset{\frac{N3}{2}}{}}b_i\right)\left(\tau _N\mathrm{}(t)|_{b_ib_i^1}\right),\text{for }\mathrm{}\text{ odd}.$$

Fay identities:

###### Theorem 1.2

The sequence of functions

$$\tau _{\mathrm{}}(t)=\underset{\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}}{}\left(\underset{1}{\overset{[\mathrm{}/2]}{}}b_{\lambda _ii+\mathrm{}\left[\frac{N+1}{2}\right]}\right)𝐬_\lambda (t),\begin{array}{c}0\mathrm{}N1\hfill \\ \mathrm{}\text{ even}\hfill \end{array},$$
(1.0.43)
together with the “boundary condition”

$$\tau _0=1\text{ and}\{\begin{array}{cc}\tau _N=\underset{0}{\overset{\frac{N2}{2}}{}}b_i,\hfill & \text{for even }N\hfill \\ \tau _{N+1}=0,\hfill & \text{for odd }N\text{,}\hfill \end{array}$$
(1.0.44)
satisfies the the “differential Fay identity333Define the Wronskian $`\{f,g\}=\frac{f}{t_1}g\frac{g}{t_1}f.`$”:

$$\begin{array}{c}\{\tau _{2n}(t[u]),\tau _{2n}(t[v])\}\hfill \\ \hfill +(u^1v^1)(\tau _{2n}(t[u])\tau _{2n}(t[v])\tau _{2n}(t)\tau _{2n}(t[u][v]))\\ \hfill =uv(uv)\tau _{2n2}(t[u][v])\tau _{2n+2}(t).\end{array}$$
(1.0.45)
Vertex operator constructions of the rational solutions: Consider the vertex operator acting on functions $`f(t)`$ of $`t=(t_1,t_2,\mathrm{})^{\mathrm{}}`$, namely

$$X(t;z)=e^{_1^{\mathrm{}}t_iz^i}e^{_1^{\mathrm{}}\frac{z^i}{i}\frac{}{t_i}};$$
(1.0.46)
and the vector vertex operator

$$𝕏(t;z)=\mathrm{\Lambda }^{}e^{_1^{\mathrm{}}t_iz^i}e^{_1^{\mathrm{}}\frac{z^i}{i}\frac{}{t_i}}\chi (z),$$
(1.0.47)
acting on vectors of functions $`F=(f_0(t),f_1(t),\mathrm{})`$, with $`\chi (z):=(z^i)_{i0}`$. Then the composition $`𝕏(t;\lambda )𝕏(t;\mu )`$ is a vertex operator for the Pfaff lattice, i.e., for any $`\tau `$-vector $`=(\tau _0,\tau _2,\tau _4,\mathrm{})`$ of the Pfaff lattice,

$$\tau (t)+a𝕏(t;\mu )𝕏(t;\lambda )\tau (t),a$$

is again a $`\tau `$-vector of the Pfaff lattice, or coordinatewise

$$\tau _{2n}+a\left(1\frac{\lambda }{\mu }\right)\mu ^{2n1}\lambda ^{2n2}e^{{\scriptscriptstyle t_i(\lambda ^i+\mu ^i)}}\tau _{2n2}(t[\lambda ^1][\mu ^1])$$

provides a new sequence of Pfaff $`\tau `$-functions.

In terms of the distributional weight, with the $`b_i`$ as in (1.0.9),

$$\rho _b(x):=\{\begin{array}{c}\rho _b^{(e)}(x)=\underset{i0}{}b_i(x^{i1}x^i),\text{ for }N\text{ even,}\hfill \\ \\ \rho _b^{(0)}(x)=x^{1/2}\underset{i0}{}b_i(x^{i1}x^{i+1}),\text{ for }N\text{ odd.}\hfill \end{array}$$

and

$$\beta :=\frac{N}{2}\mathrm{}+1,$$
(1.0.48)
we define the integrated vertex operator, in terms of the vertex operator (1.0.46),

$`Y_\beta (t)`$ $`:=`$ $`{\displaystyle \frac{1}{(2\pi i)^2}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \underset{\mathrm{}}{}}X(t;y)X(t;z){\displaystyle \frac{\rho _b(y/z)dydz}{z^2(yz)^\beta }}`$
and the integrated vector vertex operator, in terms of the (1.0.47),

$$𝕐_N(t)=\frac{1}{(2\pi i)^2}\underset{\mathrm{}}{}\underset{\mathrm{}}{}𝕏(t;y)𝕏(t;z)\frac{\rho _b(y/z)dydz}{2(yz)^{N/2}z}.$$
(1.0.49)
In both cases, the double integral around two contours about $`\mathrm{}`$ amounts to computing the coefficient of $`1/yz`$.

###### Theorem 1.3

For a given set of $`b_i`$, the sequence of $`\tau `$-functions $`\tau _0,\tau _2,\tau _4,`$, defined in (1.0.40), is generated by the vertex operators $`Y_p`$; to be precise, inductively

$$Y_{\frac{N}{2}\mathrm{}+1}\tau _\mathrm{}2=\mathrm{}\tau _{\mathrm{}}.$$

###### Corollary 1.4

The vector of $`\tau `$-functions

$$I=(I_0,I_2,I_4,\mathrm{}),\text{ with }I_{\mathrm{}}=\left(\frac{\mathrm{}}{2}\right)!\tau _{\mathrm{}}$$

is a fixed point for the vertex operator $`𝕐_N`$, namely

$$(𝕐_NI)_{\mathrm{}}=I_{\mathrm{}},\text{ for even }\mathrm{}\text{.}$$

The rational solutions to the Pfaff lattice can be $`q`$-deformed; this will be reported on at a later stage.

Example 1: Rectangular Jack polynomials

Jack polynomials are symmetric polynomials in the variables $`x_i`$, which are orthogonal with respect to the inner-product

$$p_\lambda ,p_\mu =\delta _{\lambda \mu }(1^{m_1}2^{m_2}\mathrm{})m_1!m_2!\mathrm{}\alpha ^{\lambda _1^{}},$$

where $`m_i=m_i(\lambda )`$ is the number of times that $`i`$ appears in the partition $`\lambda `$ and where

$$p_\lambda (x_1,x_2,\mathrm{}):=p_{\lambda _1}p_{\lambda _2}\mathrm{}=\underset{i}{}x_i^{\lambda _1}\underset{i}{}x_i^{\lambda _2}\mathrm{}.$$

Precise definitions and properties of Jack polynomials can be found in .

###### Proposition 1.5

When

$`b_i`$ $`=`$ $`2i+1\text{for }N\text{ even}`$
$`=`$ $`2i+2\text{for }N\text{ odd},`$
then the $`\tau _{2n}(t)`$’s are Jack polynomials for rectangular partitions

$`\tau _{2n}(t)`$ $`=`$ $`{\displaystyle \underset{\lambda 𝕐_{n(N2n)}^{(2n)}}{}}{\displaystyle \underset{1}{\overset{n}{}}}(k_ik_{2n+1i})𝐬_\lambda (t),\text{ where }\{\begin{array}{c}k_i=\lambda _ii+2n\hfill \\ 02nN,\hfill \end{array}`$
$`=`$ $`pfm_{2n}(t)`$
$`=`$ $`{\displaystyle \frac{1}{n!}}{\displaystyle _^n}\mathrm{\Delta }(z)^4{\displaystyle \underset{k=1}{\overset{n}{}}}e^{2{\displaystyle \underset{1}{\overset{\mathrm{}}{}}}t_iz_k^i}\delta _{(z_k)}^{(N2)}dz_k`$
$`=`$ $`J_\lambda ^{(1/2)}(x)|_{t_i=\frac{1}{i}{\displaystyle \underset{k}{}}x_k^i}\text{for }\lambda =\underset{n}{\underset{}{(N2n,\mathrm{},N2n)}}`$
where the $`m_{2n}(t)`$’s are the $`2n\times 2n`$ upper-left hand corners of

$$m_N(t)=\left((ji)\stackrel{~}{𝐬}_{Nij1}\right)_{0i,jN1}.$$
(1.0.51)
upon setting $`\stackrel{~}{𝐬}_n(t):=𝐬_n(2t)`$.

Example 2: Two-row Jack polynomials

###### Proposition 1.6

For even $`N`$, choosing444$`(a)_k={\displaystyle \frac{\mathrm{\Gamma }(a+k)}{\mathrm{\Gamma }(a)}}=a(a+1)\mathrm{}(a+k1)`$

$$\{\begin{array}{cc}b_0=\mathrm{}=b_{\frac{p}{2}1}=0\hfill & \\ & \\ b_{\frac{p}{2}+k}=\frac{(1\alpha )_k(p+1)_k}{k!(\alpha +p+1)_k},\text{ for }k=0,\mathrm{},\frac{N2p}{2},\hfill & \end{array}$$
(1.0.52)
one finds the most general two-row Jack polynomial for $`\tau _2`$, for arbitrary $`\alpha `$,

$`\tau _2(t)`$ $`=`$ $`pfm_2(t)`$
$`=`$ $`J_{(\frac{N+p2}{2},\frac{Np2}{2})}^{(1/\alpha )}\left(t/\alpha \right)`$
$`=`$ $`c{\displaystyle \frac{dx}{2\pi i}\frac{dy}{2\pi i}\frac{(yx)^{2\alpha }}{(xy)^{\alpha +\frac{N}{2}}}e^{_1^{\mathrm{}}t_i(x^i+y^i)}\left(\frac{x}{y}\right)_2^{p/2}F_1(\alpha ,p;1\alpha p;\frac{y}{x})}.`$
Then $`\tau _{\mathrm{}}(t)`$ for $`\mathrm{}4`$ is given by an integral of the same hypergeometric function in the integrand above.

Acknowledgment: We thank Michael Kleber for useful discussions and insights.

## 2 The vector fields $`m/t_k=\mathrm{\Lambda }^km+m\mathrm{\Lambda }^k`$ and the finite Pfaff lattice

The $`\mathrm{}\times N`$ matrix defined in (1.0.12) reads

$$E_{\mathrm{},N}(t)=\left(\begin{array}{cccccccc}1& 𝐬_1(t)& 𝐬_2(t)& \mathrm{}& 𝐬_\mathrm{}1(t)& 𝐬_{\mathrm{}}(t)& \mathrm{}& 𝐬_{N1}(t)\\ 0& 1& 𝐬_1(t)& \mathrm{}& 𝐬_\mathrm{}2(t)& 𝐬_\mathrm{}1(t)& \mathrm{}& 𝐬_{N2}(t)\\ \mathrm{}& \mathrm{}& & & \mathrm{}& \mathrm{}& & \mathrm{}\\ 0& 0& 0& \mathrm{}& 𝐬_1(t)& 𝐬_2(t)& \mathrm{}& 𝐬_{N\mathrm{}+1}(t)\\ 0& 0& 0& \mathrm{}& 1& 𝐬_1(t)& \mathrm{}& 𝐬_N\mathrm{}(t)\end{array}\right)$$

The main claim of this section can be summarized in the following statement:

###### Proposition 2.1

The commuting equations (for definition of $`\mathrm{\Lambda }`$, see footnote 2)

$$\frac{m_N}{t_k}=\mathrm{\Lambda }^km_N+m_N\mathrm{\Lambda }^k,$$
(2.0.1)
with $`N\times N`$ skew-symmetric initial condition $`m(0)`$, have the following solution

$$m_N(t)=E_{N,N}(t)m_N(0)E_{N,N}^{}(t).$$
(2.0.2)
In particular, each $`\mathrm{}\times \mathrm{}`$ upper-left block of $`m(t)`$ equals

$$m_{\mathrm{}}(t)=E_{\mathrm{},N}(t)m_N(0)E_{\mathrm{},N}^{}(t),$$
(2.0.3)
Proof: Define $`m_{\mathrm{}}(0)`$ as the semi-infinite matrix formed by putting $`m_N(0)`$ in the upper-left corner and setting all other entries equal to 0 and let $`\mathrm{\Lambda }_{\mathrm{}}`$ be the semi-infinite shift matrix. Then the solution to the differential equations

$$\frac{m_{\mathrm{}}}{t_k}=\mathrm{\Lambda }_{\mathrm{}}^km_{\mathrm{}}+m_{\mathrm{}}\mathrm{\Lambda }_{\mathrm{}}^k$$
(2.0.4)
is given by

$$m_{\mathrm{}}(t)=e^{_1^{\mathrm{}}t_k\mathrm{\Lambda }_{\mathrm{}}^k}m_{\mathrm{}}(0)e^{_1^{\mathrm{}}t_k\mathrm{\Lambda }_{\mathrm{}}^k}.$$
(2.0.5)
Result (2.0.1) follows from the Taylor expansion

$$e^{_1^{\mathrm{}}t_k\mathrm{\Lambda }_{\mathrm{}}^k}=\underset{k=0}{\overset{\mathrm{}}{}}𝐬_k(t)\mathrm{\Lambda }_{\mathrm{}}^k,$$

which is an upper-triangular semi-infinite matrix, and considering only the upper-left $`\mathrm{}\times \mathrm{}`$ block. Each upper-left $`\mathrm{}\times \mathrm{}`$ block of $`m_{\mathrm{}}(t)`$ for $`\mathrm{}N`$, equals

$`m_{\mathrm{}}(t)`$ $`=`$ $`E_\mathrm{},\mathrm{}(t)m_{\mathrm{}}(0)E_\mathrm{},\mathrm{}^{}(t)`$
$`=`$ $`E_{\mathrm{},N}(t)m_N(0)E_{\mathrm{},N}^{}(t)`$
from which (2.0.3) follows,and (2.0.2) setting $`\mathrm{}=N`$.

Remark: The flow (2.0.4) maintains the finite upper-left hand corner of $`m_{\mathrm{}}`$ and on that locus it is equivalent to the finite flow (2.0.1). Therefore, the whole semi-infinite theory can be applied to this case. It is possible to give a proof of Theorem 2.1 purely within finite matrices.

###### Theorem 2.2

Consider the commuting equations on the $`N\times N`$ matrix in

$$\frac{m_N}{t_i}=\mathrm{\Lambda }^im_N+m_N\mathrm{\Lambda }^i$$
(2.0.6)
with skew-symmetric initial condition $`m_N(s)`$ and its “skew-Borel decomposition”

$$m_N=Q^1JQ^1,\text{ for }QG_𝔨.$$
(2.0.7)
When $`N`$ is odd, we further impose the differential equations for the last entry $`Q_{NN}`$ of $`Q`$:

$$\frac{Q_{NN}}{t_i}=\frac{1}{2}Q_{N,Ni}.$$
(2.0.8)
Then for arbitrary $`N>0`$ the matrix $`Q`$ evolves according to the equations

$$\frac{Q}{t_i}Q^1=\pi _𝔨(Q\mathrm{\Lambda }^iQ^1)$$
(2.0.9)
and the matrix $`L:=Q\mathrm{\Lambda }Q^1`$ provides a solution to the Lax pair

$$\frac{L}{t_i}=[\pi _𝔨L^i,L]=[\pi _𝔫L^i,L].$$
(2.0.10)
Proof: For a matrix $`A`$, consider the projections

$`A_0`$ $`=`$ $`\left(\begin{array}{ccccccc}& & & & & & \\ & & & & & & O\\ & & & & & & \\ & & & \mathrm{}& & & \\ & & & & & & \\ & O& & & & & \\ & & & & & & \end{array}\right),\text{ for }N\text{ even}`$
$`=`$ $`\left(\begin{array}{cccccccc}& & & & & & & \\ & & & & & & O& \\ & & & & & & & \\ & & & \mathrm{}& & & & \\ & & & & & & & \\ & O& & & & & & \\ & & & & & & & \\ & & & & & & & \end{array}\right),\text{ for }N\text{ odd,}`$
and

$`A_{00}`$ $`=`$ $`A_0,\text{ for }N\text{ even}`$
$`=`$ $`\left(\begin{array}{cccccccc}& & & & & & & \\ & & & & & & O& \\ & & & & & & & \\ & & & \mathrm{}& & & & \\ & & & & & & & \\ & O& & & & & & \\ & & & & & & & \\ & & & & & & & 0\end{array}\right),\text{ for }N\text{ odd.}`$
The main point is to prove that555$`L_+^i:=(L^i)_+`$ and $`L_0^i:=(L^i)_0`$.

$`0`$ $`=`$ $`{\displaystyle \frac{Q}{t_i}}Q^1+\pi _𝔨L^i`$
$`=`$ $`{\displaystyle \frac{Q}{t_i}}Q^1+(L_{}^iJ(L_+^i)^{}J)+{\displaystyle \frac{1}{2}}(L_0^iJ(L_0^i)^{}J)`$
$`=:`$ $`A.`$
Also define

$$(L^i+\frac{Q}{t_i}Q^1)J(L^i+\frac{Q}{t_i}Q^1)^{}J=:B.$$

we have, setting $`{}_{}{}^{.}={\displaystyle \frac{}{t_i}}`$,

$`0`$ $`=`$ $`Q\left(\mathrm{\Lambda }^im+m\mathrm{\Lambda }^i{\displaystyle \frac{m}{t_i}}\right)Q^{}`$
$`=`$ $`(Q\mathrm{\Lambda }^iQ^1)J+JQ^1\mathrm{\Lambda }^iQ^{}+(\dot{Q}Q^1)J+JQ^1\dot{Q}^{}`$
$`=`$ $`(L^i+\dot{Q}Q^1)J+J(L^i+\dot{Q}Q^1)^{}.`$
Hence666$`A_{,00}=A_{}+A_{00}`$.

$`0`$ $`=`$ $`\left(Q\left(\mathrm{\Lambda }^im+m\mathrm{\Lambda }^i{\displaystyle \frac{m}{t_i}}\right)Q^{}\right)_{,00}`$
$`=`$ $`\left(\left((L^i+\dot{Q}Q^1)J(L^i+\dot{Q}Q^1)^{}J\right)J\right)_{,00}`$
$`=`$ $`\left((L^i+\dot{Q}Q^1)J(L^i+\dot{Q}Q^1)^{}J\right)_{,00}J`$
$`=`$ $`B_{,oo}J.`$
Therefore

$$0=B_{,00}J^2=\{\begin{array}{cc}B_{,0},\hfill & \text{ for }N\text{ even}\hfill \\ & \\ B_{,00}\left(\begin{array}{cc}I_{N1}& O\\ O& 0\end{array}\right)\hfill & \text{for }N\text{ odd}\hfill \end{array}$$

and so

$$B_{}=0\text{and}B_{00}=0.$$
(2.0.14)
But

$`B_{}`$ $`=`$ $`(L^i+\dot{Q}Q^1J(L_+^i)^{}J)_{}`$ (2.0.15)
$`=`$ $`(\dot{Q}Q^1)_{}+((L^i)_{}J(L_+^i)^{}J)`$
$`=`$ $`A_{}`$
and

$`B_{00}`$ $`=`$ $`2(\dot{Q}Q^1)_{00}+(L^iJ(L^i)^{}J)_{00}`$ (2.0.16)
$`=`$ $`2A_{00}.`$
Then, by (2.0.12) and (2.0.13),

$$0=B_{}+\frac{1}{2}B_{00}=A_{}+A_{00}=A_{}+A_{00}+A_+,\text{since }A_+=0.$$

Therefore, when $`N`$ is even, $`A=0`$ and the proof is finished. When $`N`$ is odd, we have

$$A=0,\text{ except for the }(N,N)\text{-entry}.$$

But the $`(N,N)`$th entry of $`L^i`$ is given by, since $`Q`$ is lower-triangular,

$$(L^i)_{NN}=(Q\mathrm{\Lambda }^iQ^1)_{NN}=\frac{Q_{N,Ni}}{Q_{NN}},$$

and thus we have, using the fact that the $`(N,N)`$th entry of $`J(L^i)_0J`$ vanishes,

$`A_{NN}`$ $`=`$ $`{\displaystyle \frac{}{t_i}}\mathrm{log}Q_{NN}+{\displaystyle \frac{1}{2}}(L^i)_{NN}`$
$`=`$ $`{\displaystyle \frac{1}{Q_{NN}}}\left({\displaystyle \frac{Q_{NN}}{t_i}}+{\displaystyle \frac{1}{2}}Q_{N,Ni}\right),`$
$`=`$ $`0,\text{ by the assumption (}\text{2.0.8}\text{),}`$
thus ending the proof of Theorem 2.2.

## 3 The solution to the Pfaff lattice with anti-diagonal skew-symmetric initial condition

Consider the equations

$$\frac{m_N}{t_i}=\mathrm{\Lambda }^im_N+m_N\mathrm{\Lambda }^i,$$
(3.0.1)
with initial condition,

$`m_N(0)`$ $`=`$ $`\left(\begin{array}{cccccc}& O& & & & b_{\frac{N2}{2}}\\ & & & & \mathrm{}& \\ & & & b_0& & \\ & & b_0& & & \\ & \mathrm{}& & & & \\ b_{\frac{N2}{2}}& & & & O& \end{array}\right)\text{, for }N\text{ even,}`$
$`=`$ $`\left(\begin{array}{ccccccc}& & O& & & & b_{\frac{N3}{2}}\\ & & & & & \mathrm{}& \\ & & & & b_0& & \\ & & & 0& & & \\ & & b_0& & & & \\ & \mathrm{}& & & & & \\ b_{\frac{N3}{2}}& & & & & O& \end{array}\right)\text{, for }N\text{ odd.}`$
(3.0.4)
###### Proposition 3.1

The system of equations (3.0.1), with initial condition (3.0.4) have for solution the matrix $`m_N(t)`$, with entries, for $`0\mathrm{}<kN`$,

$`\mu _{\mathrm{},k}(t)={\displaystyle \underset{j=0}{\overset{[\frac{N2}{2}]k}{}}}𝐬_j𝐬_{N\mathrm{}kj1}(b_{[\frac{N2}{2}]kj}b_{[\frac{N2}{2}]\mathrm{}j})`$ (3.0.5)
$`{\displaystyle \underset{[\frac{N2}{2}]k+1}{\overset{[\frac{N2}{2}]\mathrm{}}{}}}𝐬_j𝐬_{N\mathrm{}kj1}(b_{[\frac{N2}{2}]\mathrm{}j}).`$
In particular

$`\mu _{01}(t)`$ $`=`$ $`{\displaystyle \underset{i=0}{\overset{\frac{N2}{2}}{}}}b_i𝐬_{\frac{N2}{2}+i,\frac{N2}{2}i}(t),\text{ for }N\text{ even}`$ (3.0.6)
$`=`$ $`{\displaystyle \underset{i=0}{\overset{\frac{N3}{2}}{}}}b_i𝐬_{\frac{N1}{2}+i,\frac{N3}{2}i}(t),\text{ for }N\text{ odd.}`$
Proof: Equation (3.0.5) is established by explicit computation of

$`m_N(t)`$ $`=`$ $`E_{N,N}(t)m_N(0)E_{N,N}(t)^{}`$
$`=`$ $`\left({\displaystyle \underset{i,j=0}{\overset{N\mathrm{}1}{}}}𝐬_i(t)\mu _{i+\mathrm{},j+k}(0)𝐬_j(t)\right)_{0\mathrm{},kN1}.`$
From (3.0.5), one computes, for $`N`$ even,

$`\mu _{01}(t)`$ $`=`$ $`𝐬_0𝐬_{N2}(b_{\frac{N}{2}1}b_{\frac{N}{2}2})+𝐬_1𝐬_{N3}(b_{\frac{N}{2}2}b_{\frac{N}{2}3})+`$
$`\mathrm{}+𝐬_{\frac{N}{2}2}𝐬_{\frac{N}{2}}(b_1b_0)+(𝐬_{\frac{N}{2}1})^2b_0`$
$`=`$ $`{\displaystyle \underset{i=0}{\overset{\frac{N}{2}1}{}}}b_i(𝐬_{\frac{N}{2}1i}𝐬_{\frac{N}{2}1+i}𝐬_{\frac{N}{2}2i}𝐬_{\frac{N}{2}+i})`$
$`=`$ $`{\displaystyle \underset{i=0}{\overset{\frac{N}{2}1}{}}}b_i𝐬_{\frac{N}{2}1+i,\frac{N}{2}1i}(t),`$
and for $`N`$ odd,

$`\mu _{01}(t)`$ $`=`$ $`𝐬_0𝐬_{N2}(b_{\frac{N3}{2}}b_{\frac{N5}{2}})+𝐬_1𝐬_{N3}(b_{\frac{N5}{2}}b_{\frac{N7}{2}})+`$
$`\mathrm{}+𝐬_{\frac{N5}{2}}𝐬_{\frac{N+1}{2}}(b_1b_0)+𝐬_{\frac{N3}{2}}𝐬_{\frac{N1}{2}}b_0`$
$`=`$ $`{\displaystyle \underset{i=0}{\overset{\frac{N3}{2}}{}}}b_i𝐬_{\frac{N1}{2}+i,\frac{N3}{2}i}(t),`$
ending the proof of Proposition 3.1.

Define777$`\epsilon _{i,j}`$ denotes the matrix with all zero entries, except for a $`1`$ at the $`(i,j)`$th entry.

$`m_N(0;z)`$ $`:=`$ $`m_N(0),\text{ for }N\text{ even,}`$
$`m_N(0;z)`$ $`:=`$ $`m_N(0)+z^2\epsilon _{\frac{N+1}{2},\frac{N+1}{2}},\text{ for }N\text{ odd,}`$
$`=`$ $`\left(\begin{array}{ccccccc}& & O& & & & b_{\frac{N3}{2}}\\ & & & & & \mathrm{}& \\ & & & & b_0& & \\ & & & z^2& & & \\ & & b_0& & & & \\ & \mathrm{}& & & & & \\ b_{\frac{N3}{2}}& & & & & O& \end{array}\right)`$
(3.0.8)
###### Proposition 3.2

$`det{}_{}{}^{1/2}\left(E_{\mathrm{},N}(t)m_N(0;z)E_{\mathrm{},N}^{}(t)\right)`$
$`=`$ $`z^{\eta (N,\mathrm{})}{\displaystyle \underset{\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}}{}}\left({\displaystyle \underset{1}{\overset{[\mathrm{}/2]}{}}}b_{\lambda _ii+\mathrm{}\left[\frac{N+1}{2}\right]}\right)𝐬_{\lambda _1\mathrm{}\lambda _{\mathrm{}}}(t).`$
with

$$\eta (N,\mathrm{})=\{\begin{array}{c}1,\text{for }N\text{ and }\mathrm{}\text{ odd.}\hfill \\ 0,\text{otherwise}.\hfill \end{array}$$

###### Lemma 3.3

Consider an arbitrary $`N\times N`$ matrix $`A=(A_{ij})_{1i,jN}`$, with $`r=\left[{\displaystyle \frac{N}{2}}\right]`$ and $`A_{\mathrm{}}:=(A_{ij})_{\genfrac{}{}{0pt}{}{1i\mathrm{}}{1jN}}`$ and consider the anti-diagonal matrix

$`m_N`$ $`=`$ $`\left(\begin{array}{ccccccc}& & & & & c_r& \\ & & & & \mathrm{}& & \\ & O& & & & & \\ & & & c_1& & & \\ & & c_1& & & & \\ & \mathrm{}& & & O& & \\ c_r& & & & & & \end{array}\right)\text{ for }N\text{ even}`$
$`=`$ $`\left(\begin{array}{cccccccc}& & & & & & c_r& \\ & & & & & \mathrm{}& & \\ & & O& & & & & \\ & & & & c_1& & & \\ & & & z^2& & & & \\ & & c_1& & & & & \\ & \mathrm{}& & & O& & & \\ c_r& & & & & & & \end{array}\right)\text{ for }N\text{ odd.}`$
Setting888$`B_{(j_1,\mathrm{},j_n)}`$ denotes the matrix formed with the columns $`j_1,\mathrm{},j_n`$ of $`B`$

$$m_{\mathrm{}}^A(z):=A_{\mathrm{}}m_N(z)A_{\mathrm{}}^{}$$

and

$`P_{N,\mathrm{}}={\displaystyle \underset{1i_1\mathrm{}i_{[\mathrm{}/2]}r}{}}c_{i_1}\mathrm{}c_{i_{[\mathrm{}/2]}}`$ (3.0.16)
$`\times \{\begin{array}{c}det(A_{\mathrm{}})_{(ri_{[\mathrm{}/2]}+1,\mathrm{},ri_1+1,r+i_1,\mathrm{},r+i_{[\mathrm{}/2]})}\text{ for }N\text{ even, }\mathrm{}\text{ even}\hfill \\ \\ det(A_{\mathrm{}})_{(ri_{[\mathrm{}/2]}+1,\mathrm{},ri_1+1,r+i_1+1,\mathrm{},r+i_{[\mathrm{}/2]}+1)}\text{ for }N\text{ odd, }\mathrm{}\text{ even}\hfill \\ \\ \\ det(A_{\mathrm{}})_{(ri_{[\mathrm{}/2]}+1,\mathrm{},ri_1+1,r+1,r+i_1+1,\mathrm{},r+i_{[\mathrm{}/2]}+1)}\text{ for }N\text{ odd, }\mathrm{}\text{ odd}\hfill \end{array}`$
we have

$$detm_{\mathrm{}}^A=\{\begin{array}{cc}0& \text{for }N\text{ even, }\mathrm{}\text{ odd}\hfill \\ & \\ (pfm_{\mathrm{}}^A)^2=(P_{N,\mathrm{}})^2& \text{for }N\text{ even, }\mathrm{}\text{ even}\hfill \\ & \\ z^2P_{N,\mathrm{}}^2& \text{for }N\text{ odd, }\mathrm{}\text{ odd}\hfill \\ & \\ (pfm_{\mathrm{}}^A(0))^2=(P_{N,\mathrm{}})^2& \text{for }N\text{ odd, }\mathrm{}\text{ even.}\hfill \end{array}$$

Proof: Let $`w_i^{\mathrm{}}`$ be the columns of $`A_{\mathrm{}}`$

$$A_{\mathrm{}}=[w_0,w_1,\mathrm{},w_{2r}],$$

and observe

$`m_{\mathrm{}}^A(z)=A_{\mathrm{}}m_N(z)A_{\mathrm{}}^{}`$ $`=`$ $`A_{\mathrm{}}\left(z^2\epsilon _{r+1,r+1}+m_N(0)\right)A_{\mathrm{}}^{}`$
$`=`$ $`z^2w_rw_r+m_{\mathrm{}}^A(0).`$
Let $`U`$ be a $`\mathrm{}\times \mathrm{}`$ matrix, rational in the $`a_{ij}`$, such that

$$Uw_r=\alpha e_1,detU=1.$$

Then, using $`U(xy)V=(Ux)(V^{}y)`$ and setting $`M:=Um_{\mathrm{}}^A(0)U^{}`$, which is skew-symmetric, we find

$`detm_{\mathrm{}}^A(z)`$ $`=`$ $`detUm_{\mathrm{}}^A(z)U^{}`$
$`=`$ $`det\left(z^2U(w_rw_r)U^{}+Um_{\mathrm{}}^A(0)U^{}\right)`$
$`=`$ $`det\left(z^2\alpha ^2e_1e_1+Um_{\mathrm{}}^A(0)U^{}\right),`$
$`=`$ $`det\left(\begin{array}{ccccc}(z\alpha )^2& M_{12}& M_{13}& \mathrm{}& M_1\mathrm{}\\ & & \multicolumn{-1}{c}{}& & \\ M_{12}& 0& M_{23}& \mathrm{}& M_2\mathrm{}\\ M_{13}& M_{23}& & & \\ \mathrm{}& \mathrm{}& & & \mathrm{}\\ M_1\mathrm{}& M_2\mathrm{}& \mathrm{}& & 0\end{array}\right)`$
$`=`$ $`(z\alpha )^2det(M_{ij})_{2i,j\mathrm{}}+det(M_{ij})_{1i,j\mathrm{}},`$
with $`M_{ij}=M_{ji}`$. Therefore

$$\begin{array}{ccc}detm_{\mathrm{}}^A(z)\hfill & =detm_{\mathrm{}}^A(0)=(pfm_{\mathrm{}}^A(0))^2,\hfill & \text{ for }\mathrm{}\text{ even}\hfill \\ & & \\ & =(z\alpha )^2det(M_{ij})_{2i,j\mathrm{}}=(z\alpha pf(M_{ij})_{2i,j\mathrm{}})^2,\hfill & \text{ for }\mathrm{}\text{ odd,}\hfill \end{array}$$
(3.0.19)
the latter being the square of a polynomial in $`z`$, the $`c_i`$ and the entries of the matrix $`A`$.

Using the Cauchy-Bonnet formula twice, one computes, say, for $`N`$ and $`\mathrm{}`$ odd,

$`detm_{\mathrm{}}^A(z)=detA_{\mathrm{}}m_N(z)A_{\mathrm{}}^{}`$

$`=`$ $`{\displaystyle \underset{1\alpha _1<\mathrm{}<\alpha _{\mathrm{}}N}{}}det\left((A_{\mathrm{}})_{i,\alpha _j}\right)_{1i,j\mathrm{}}det\left((A_{\mathrm{}}m^{})_{i,\alpha _j}\right)_{1i,j\mathrm{}}`$
$`=`$ $`{\displaystyle \underset{\genfrac{}{}{0pt}{}{1\alpha _1<\mathrm{}<\alpha _{\mathrm{}}N}{\genfrac{}{}{0pt}{}{1\beta _1<\mathrm{}<\beta _{\mathrm{}}N}{\alpha _i+\beta _{\mathrm{}i+1}=N+1}}}{}}det\left((A_{\mathrm{}})_{i,\alpha _j}\right)_{1i,j\mathrm{}}det\left((A_{\mathrm{}})_{i,\beta _j}\right)_{1i,j\mathrm{}}det\left((m^{})_{\beta _i,\alpha _j}\right)_{1i,j\mathrm{}}`$
$`=`$ $`{\displaystyle \underset{\genfrac{}{}{0pt}{}{1\alpha _1<\mathrm{}<\alpha _{\mathrm{}}N}{\genfrac{}{}{0pt}{}{1\beta _1<\mathrm{}<\beta _{\mathrm{}}N}{\genfrac{}{}{0pt}{}{\alpha _i+\beta _{\mathrm{}i+1}=N+1}{\mathrm{for}1i\mathrm{}}}}}{}}det\left((A_{\mathrm{}})_{i,\alpha _j}\right)_{1i,j\mathrm{}}det\left((A_{\mathrm{}})_{i,\beta _j}\right)_{1i,j\mathrm{}}det(m_{\alpha _i,\beta _j})_{1i,j\mathrm{}}`$
$`=`$ $`\left({\displaystyle \underset{\genfrac{}{}{0pt}{}{1\alpha _1<\mathrm{}<\alpha _{\mathrm{}}N}{1\beta _1<\mathrm{}<\beta _{\mathrm{}}N}}{}}+{\displaystyle \underset{\genfrac{}{}{0pt}{}{1\alpha _1<\mathrm{}<\alpha _{\mathrm{}}N}{1\beta _1<\mathrm{}<\beta _{\mathrm{}}N}}{}}\right)det\left((A_{\mathrm{}})_{i,\alpha _j}\right)_{1i,j\mathrm{}}det\left((A_{\mathrm{}})_{i,\beta _j}\right)_{1i,j\mathrm{}}`$
$`{}_{\genfrac{}{}{0pt}{}{(\alpha _1,\mathrm{},\alpha _{\mathrm{}})=(\beta _1,\mathrm{},\beta _{\mathrm{}})}{\genfrac{}{}{0pt}{}{\alpha _i+\beta _{\mathrm{}i+1}=N+1}{\mathrm{for}1i\mathrm{}}}}{}^{}_{\genfrac{}{}{0pt}{}{(\alpha _1,\mathrm{},\alpha _{\mathrm{}})(\beta _1,\mathrm{},\beta _{\mathrm{}})}{\genfrac{}{}{0pt}{}{\alpha _i+\beta _{\mathrm{}i+1}=N+1}{\mathrm{for}1i\mathrm{}}}}`$
$`\times det(m_{\alpha _i,\beta _j})_{1i,j\mathrm{}}`$
$`\stackrel{}{=}`$ $`z^2{\displaystyle \underset{\genfrac{}{}{0pt}{}{1\alpha _1<\mathrm{}<\alpha _{\frac{\mathrm{}1}{2}}<\frac{N+1}{2}}{\genfrac{}{}{0pt}{}{\alpha _{\frac{\mathrm{}+1}{2}+i}+\alpha _{\frac{\mathrm{}+1}{2}i}=N+1}{\mathrm{for}0i\frac{\mathrm{}1}{2}}}}{}}c_{\frac{N+1}{2}\alpha _1}^2\mathrm{}c_{\frac{N+1}{2}\alpha _{\frac{\mathrm{}1}{2}}}^2\mathrm{det}^2\left((A_{\mathrm{}})_{i,\alpha _j}\right)_{1i,j\mathrm{}}+\mathrm{}`$
$`=`$ $`\left(z{\displaystyle \underset{\genfrac{}{}{0pt}{}{1\alpha _1<\mathrm{}<\alpha _{\frac{\mathrm{}1}{2}}<\frac{N+1}{2}}{\alpha _{\frac{\mathrm{}+1}{2}+i}+\alpha _{\frac{\mathrm{}+1}{2}i}=N+1}}{}}c_{\frac{N+1}{2}\alpha _1}\mathrm{}c_{\frac{N+1}{2}\alpha _{\frac{\mathrm{}1}{2}}}det\left((A_{\mathrm{}})_{i,\alpha _j}\right)_{1i,j\mathrm{}}\right)^2\text{using (}\text{3.0.19}\text{)}`$
$`=`$ $`\left(z{\displaystyle \underset{1i_1<\mathrm{}<i_{\frac{\mathrm{}1}{2}}\frac{N1}{2}}{}}c_{i_{\frac{\mathrm{}1}{2}}}\mathrm{}c_{i_1}det(A_{\mathrm{}})_{(\frac{N+1}{2}i_{\frac{\mathrm{}1}{2}},\mathrm{},\frac{N+1}{2}i_1,\frac{N+1}{2},\frac{N+1}{2}+i_1,\mathrm{},\frac{N+1}{2}+i_{\frac{\mathrm{}1}{2}})}\right)^2.`$
In $`\stackrel{}{=}`$ we have used the fact that

$$\begin{array}{c}(\alpha _1,\mathrm{},\alpha _{\mathrm{}})=(\beta _1,\mathrm{},\beta _{\mathrm{}})\\ \alpha _i+\beta _{\mathrm{}i+1}=N+1\end{array}\}\{\begin{array}{c}\alpha _{\frac{\mathrm{}+1}{2}+i}+\alpha _{\frac{\mathrm{}+1}{2}i}=N+1,\\ \text{for }0i\frac{\mathrm{}1}{2}\\ \beta _{\mathrm{}i+1}=N+1\alpha _i.\end{array}$$
(3.0.20)
Indeed, for $`N`$ odd consider sequences $`\alpha _i`$ symmetric about

$$\alpha _{\frac{\mathrm{}+1}{2}}=\frac{N+1}{2}$$
(3.0.21)
i.e.

$$\alpha _{\frac{\mathrm{}+1}{2}+i}+\alpha _{\frac{\mathrm{}+1}{2}i}=N+1,\text{for}0i\frac{\mathrm{}1}{2}.$$
(3.0.22)
Then, using (3.0.20) and (3.0.22)

$$\beta _{\frac{\mathrm{}+1}{2}i}=N+1\alpha _{\frac{\mathrm{}+1}{2}+i}=\alpha _{\frac{\mathrm{}+1}{2}i},$$

thus implying

$$(\alpha _1,\mathrm{},\alpha _{\mathrm{}})=(\beta _1,\mathrm{},\beta _{\mathrm{}}).$$

Vice versa, the latter implies (3.0.20) and thus (3.0.21). This establishes Lemma 3.3 for the case $`N`$ and $`\mathrm{}`$ odd; for the other cases, one proceeds in a similar fashion.

Proof of Proposition 3.2: Apply Lemma 3.3 to $`A_{\mathrm{}}=E_{\mathrm{},N}(t)=(𝐬_{ji})_{\genfrac{}{}{0pt}{}{1i\mathrm{}}{1jN}}`$, with $`1k_1<k_2<\mathrm{}<k_{\mathrm{}}`$:

$`det(A_{\mathrm{}})_{k_1,\mathrm{},k_{\mathrm{}}}`$ $`=`$ $`det\left(\begin{array}{cccc}𝐬_{k_11}& \mathrm{}& 𝐬_{k_\mathrm{}11}& 𝐬_{k_{\mathrm{}}1}\\ \mathrm{}& & \mathrm{}& \mathrm{}\\ 𝐬_{k_1\mathrm{}}& \mathrm{}& 𝐬_{k_\mathrm{}1\mathrm{}}& 𝐬_k_{\mathrm{}}\mathrm{}\end{array}\right)`$ (3.0.26)
$`=`$ $`det\left(\begin{array}{cccc}𝐬_k_{\mathrm{}}\mathrm{}& 𝐬_{k_{\mathrm{}}\mathrm{}+1}& \mathrm{}& 𝐬_{k_{\mathrm{}}1}\\ 𝐬_{k_\mathrm{}1\mathrm{}}& 𝐬_{k_\mathrm{}1\mathrm{}+1}& \mathrm{}& 𝐬_{k_\mathrm{}11}\\ \mathrm{}& & & \mathrm{}\\ 𝐬_{k_1\mathrm{}}& & \mathrm{}& 𝐬_{k_11}\end{array}\right)`$
$`=`$ $`𝐬_{k_{\mathrm{}}\mathrm{},k_\mathrm{}1\mathrm{}+1,\mathrm{},k_1\mathrm{}+(\mathrm{}1)}`$
$`=`$ $`𝐬_{\lambda _1\mathrm{}\lambda _{\mathrm{}}}`$
$`=`$ $`𝐬_\lambda `$ (3.0.32)
where

$$\lambda _i=k_{\mathrm{}i+1}\mathrm{}+i1,\text{ for }1i\mathrm{}.$$
(3.0.33)
In order to apply Lemma 3.3, the $`k_i`$ inherent in formula (LABEL:Bonnet) must be as in formula (6.0.4); i.e., setting $`r=[N/2]`$, the $`k_j`$’s must satisfy

$$k_j=\left[\frac{N}{2}\right]i_{[\mathrm{}/2]j+1}+1=N+1k_{\mathrm{}j+1},\text{for}1j\left[\frac{\mathrm{}+1}{2}\right]$$
(3.0.34)
and thus

$`i_{[\mathrm{}/2]+1j}1`$ $`=`$ $`k_{\mathrm{}+1j}\left[{\displaystyle \frac{N+1}{2}}\right]1`$
$`=`$ $`\lambda _j+\mathrm{}j\left[{\displaystyle \frac{N+1}{2}}\right].`$
Therefore, formula (LABEL:Bonnet) can be applied with

$$c_{i_{[\mathrm{}/2]j+1}}=b_{\lambda _j+\mathrm{}j[(N+1)/2]},\text{for}1j\left[\frac{\mathrm{}}{2}\right].$$

From (3.0.33) and (3.0.34), it follows that

$$\lambda _i+\lambda _{\mathrm{}+1i}=k_{\mathrm{}+1i}+k_i\mathrm{}1=N+1\mathrm{}1=N\mathrm{},$$

showing that

$$\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})},$$

establishing Proposition 3.2.

## 4 Proof of Theorem 1.1

Using the standard notation for the partition $`1^j=\stackrel{j}{\stackrel{}{(1,\mathrm{},1)}}`$, we state

###### Lemma 4.1

For

$$\begin{array}{c}𝐬_i(\stackrel{~}{})𝐬_{1^j}(t)\\ \\ \left(\frac{}{t_i}\right)𝐬_{1^j}(t)\end{array}\}=(1)^i𝐬_{1^{ji}}(t).$$
(4.0.1)
Proof: Using the usual inner-product between symmetric functions, we have

$`𝐬_i(\stackrel{~}{})𝐬_j(t)`$ $`=`$ $`𝐬_i(t+u)1,𝐬_j(t+u)`$
$`=`$ $`𝐬_j(t+u),𝐬_i(t+u)1`$
$`=`$ $`𝐬_{ji}(t+u),1`$
$`=`$ $`1,𝐬_{ji}(t+u)`$
$`=`$ $`𝐬_{ji}(t+u)|_{u=0}`$
$`=`$ $`𝐬_{ji}(t)`$
and so, changing $`tt`$,

$$𝐬_i(\stackrel{~}{})𝐬_j(t)=𝐬_{ji}(t),$$

from which this first relation follows upon noticing that

$$𝐬_j(t)=(1)^j𝐬_{1^j}(t).$$
(4.0.2)
This last relation (4.0.2) also leads to the second identity (4.0.1), using $`(/t_i)𝐬_j(t)=𝐬_{ji}(t)`$.

Proof of Theorem 1.1: By Proposition 2.1, the equations for the $`N\times N`$ matrix $`m_N`$

$$\frac{m_N}{t_k}=\mathrm{\Lambda }^km_N+m_N\mathrm{\Lambda }^k,$$

with skew-symmetric initial condition $`m_N(0)`$ has the following solution

$$m_N(t)=E_{\mathrm{},N}m_N(0)E_{\mathrm{},N}^{}(t),$$

which remains skew-symmetric in time. Define a $`t`$-dependent skew-inner product such that $`y^i,z^j_t=m_{ij}(t)`$, i.e.999$`\chi (y):=(1,y,y^2,\mathrm{})^{}.`$,

$$\chi _N(y)\chi (z)^{}=m_N(t).$$

Performing the skew Borel decomposition

$$m_N(t)=Q^1(t)JQ^1,\text{with }Q(t)G_k$$
(4.0.3)
is tantamount to the process of finding a finite set of skew-orthonormal polynomials; that is, satisfying

$$\left(q_i(t;z),q_j(t;z)\right)_{1i,jN}=J.$$

Indeed, the polynomials $`q_i(t;z)`$ in $`z`$, depending on $`t`$,

$$\left(\begin{array}{c}q_0\\ q_1\\ \mathrm{}\\ q_{N1}\end{array}\right)=Q\left(\begin{array}{c}1\\ z\\ \mathrm{}\\ z^{N1}\end{array}\right)$$

satisfy

$`\left(q_i(t;y),q_i(t;z)\right)_{0i,jN1}`$ $`=`$ $`Q(t)\chi _N(y),Q(t)\chi _N(z)`$
$`=`$ $`Q(t)\chi _N(y)\chi _N(z)Q^{}(t)`$
$`=`$ $`Q(t)\chi _N(y)\chi _N(z)Q^{}(t)`$
$`=`$ $`Q(t)m_N(t)Q^{}(t)`$
$`=`$ $`J.`$
According to , the skew-orthogonal polynomials are related to the $`\tau `$-functions $`(\tau _0=1`$, $`\tau _N=c`$)

$$\tau _{\mathrm{}}(t)=pfm_{\mathrm{}}(t)$$

as follows

$`q_{2n}`$ $`=`$ $`{\displaystyle \frac{z^{2n}}{\sqrt{\tau _{2n}\tau _{2n+2}}}}\tau _{2n}(t[z^1])`$
$`q_{2n+1}`$ $`=`$ $`{\displaystyle \frac{z^{2n}}{\sqrt{\tau _{2n}\tau _{2n+2}}}}\left(z+{\displaystyle \frac{}{t_1}}\right)\tau _{2n}(t[z^1]),02nN2.`$
This ends the proof of Theorem 1.1 for $`N`$ even. However for odd $`N`$, we must verify condition (2.0.8) of Theorem 2.2. This requires knowing $`q_{N1}(t;z)`$ explicitly. For later purposes we shall also need $`q_{N1}(t;z)`$ for even $`N`$.

For $`N`$ even, $`q_{N1}`$ takes on the following form

$$q_{N1}(t;z)=\frac{z^{N2}}{\sqrt{\tau _{N2}\tau _N}}\left(z+\frac{}{t_1}\right)\tau _{N2}(t[z^1]),$$

with (using Proposition 3.2)

$$\tau _{N2}(t)=\underset{\lambda 𝕐_{N2}^{(N2)}}{}\left(\underset{1}{\overset{\frac{N2}{2}}{}}b_{\lambda _ii+\frac{N}{2}2}\right)𝐬_\lambda (t),$$

where

$$𝕐_{N2}^{(N2)}=\{1^{N2},(2,1^{N4}),(2^2,1^{N6}),\mathrm{},(2^i,1^{N2i2}),\mathrm{}\}.$$

For $`N`$ odd, $`q_{N1}`$ has the form

$$q_{N1}(t;z)=\frac{z^{N1}}{\sqrt{\tau _{N1}}}\tau _{N1}(t[z^1])$$

with

$$\tau _{N1}(t)=b_0\mathrm{}b_{\frac{N3}{2}}𝐬_{\left(1^{\frac{N1}{2}}\right)}(t).$$
(4.0.4)
Indeed, observe that the set of partitions

$`𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{\mathrm{}}|_{\mathrm{}=N1}=𝕐_{\frac{N1}{2}}^{(N1)}`$ $`=`$ $`\left\{\begin{array}{c}(\lambda _1,\mathrm{},\lambda _{N1})𝕐_{\frac{N1}{2}}\hfill \\ \\ \text{with }\lambda _i+\lambda _{\mathrm{}+1i}=1\hfill \end{array}\right\}`$
$`=`$ $`\left\{1^{\frac{N1}{2}}\right\}`$
consists of one element $`1^{\frac{N1}{2}}`$. Therefore, setting $`\lambda _i=1`$ for $`1i\frac{N1}{2}`$ one finds, again by Proposition 3.2,

$$\tau _{N1}(t)=b_0\mathrm{}b_{\frac{N3}{2}}𝐬_{\left(1^{\frac{N1}{2}}\right)}(t).$$

The last row of $`\stackrel{~}{Q}`$ is given by:

$`{\displaystyle \underset{0}{\overset{N1}{}}}\stackrel{~}{Q}_{N,j+1}z^j`$ $`=`$ $`z^{N1}\tau _{N1}(t[z^1])`$
$`=`$ $`{\displaystyle \underset{i=0}{\overset{N1}{}}}𝐬_i(\stackrel{~}{})\tau _{N1}(t)z^{N1i}`$
$`=`$ $`b_0\mathrm{}b_{\frac{N3}{2}}{\displaystyle \underset{i=0}{\overset{N1}{}}}𝐬_i(\stackrel{~}{})𝐬_{\left(1^{\frac{N1}{2}}\right)}(t)z^{N1i}`$
$`=`$ $`b_0\mathrm{}b_{\frac{N3}{2}}{\displaystyle \underset{i=0}{\overset{\frac{N1}{2}}{}}}z^{N1i}(1)^i𝐬_{\left(1^{\frac{N1}{2}i}\right)}(t),`$
using Lemma 4.1, and so

$$\stackrel{~}{Q}_{N,Ni}=(1)^i\left(\underset{0}{\overset{\frac{N3}{2}}{}}b_k\right)𝐬_{\left(1^{\frac{N1}{2}i}\right)}.$$

So, the last row of $`\stackrel{~}{Q}`$ reads

$$\underset{0}{\overset{\frac{N3}{2}}{}}b_i(\underset{\frac{N1}{2}}{\underset{}{0,\mathrm{},0}},(1)^{\frac{N1}{2}},(1)^{\frac{N3}{2}}𝐬_1(t),(1)^{\frac{N5}{2}}𝐬_{(1^2)}(t),\mathrm{},𝐬_{\left(1^{\frac{N1}{2}}\right)}(t))$$

and and the last row of $`Q=D\stackrel{~}{Q}`$:

$`Q_{N,Ni}=(D\stackrel{~}{Q})_{N,Ni}`$ $`=`$ $`(1)^i{\displaystyle \underset{0}{\overset{\frac{N3}{2}}{}}}b_k{\displaystyle \frac{𝐬_{\left(1^{\frac{N1}{2}i}\right)}(t)}{\sqrt{\tau _{N1}}}}`$
$`=`$ $`(1)^i\left({\displaystyle \underset{0}{\overset{N3}{}}}b_k\right)^{1/2}{\displaystyle \frac{𝐬_{\left(1^{\frac{N1}{2}i}\right)}(t)}{\left(𝐬_{\left(1^{\frac{N1}{2}}\right)}(t)\right)^{1/2}}}`$
and so, using Lemma 4.1,

$$\frac{Q_{N,N}}{t_i}=\frac{(1)^i}{2}\left(\underset{0}{\overset{N3}{}}b_k\right)^{1/2}\frac{𝐬_{\left(1^{\frac{N1}{2}i}\right)}(t)}{\left(𝐬_{\left(1^{\frac{N1}{2}}\right)}(t)\right)^{1/2}}=\frac{1}{2}Q_{N,Ni}.$$

Having checked (2.0.6), (2.0.7) and (2.0.8) (in the odd case) of Theorem 2.2, we have found a solution of the Pfaff lattice. This finally concludes the proof of Theorem 1.1.

Proof of Theorem 1.2: According to , Pfaff $`\tau `$-functions satisfy bilinear relations101010 $`\stackrel{~}{}=(/t_1,(1/2)/t_2,(1/3)/t_3,\mathrm{})`$, $`\stackrel{~}{D}=(D_1,(1/2)D_2,(1/3)D_3,\mathrm{})`$ is the corresponding Hirota symbol: $`P(\stackrel{~}{D})fg:=P(/y_1,(1/2)/y_2,\mathrm{})f(t+y)g(ty)|_{y=0}`$, and $`𝐬_k`$ are the previously defined elementary Schur functions: $`_{k=0}^{\mathrm{}}𝐬_k(t)z^k:=\mathrm{exp}(_{i=1}^{\mathrm{}}t_iz^i)`$. For further notations, see Dickey .: for all $`t,t^{}^{\mathrm{}}`$ and $`m,n`$ positive integers

$$\begin{array}{c}_{z=\mathrm{}}\tau _{2n}(t[z^1])\tau _{2m+2}(t^{}+[z^1])e^{_{i=0}^{\mathrm{}}(t_it_i^{})z^i}z^{2n2m2}𝑑z\hfill \\ \hfill +_{z=0}\tau _{2n+2}(t+[z])\tau _{2m}(t^{}[z])e^{_{i=0}^{\mathrm{}}(t_i^{}t_i)z^i}z^{2n2m}𝑑z=0,\end{array}$$
(4.0.6)
Shifting appropriately and taking residues leads to the “differential Fay identity”:

$$\begin{array}{c}\{\tau _{2n}(t[u]),\tau _{2n}(t[v])\}\hfill \\ \hfill +(u^1v^1)(\tau _{2n}(t[u])\tau _{2n}(t[v])\tau _{2n}(t)\tau _{2n}(t[u][v]))\\ \hfill =uv(uv)\tau _{2n2}(t[u][v])\tau _{2n+2}(t),\end{array}$$
(4.0.7)
and Hirota bilinear equations, involving nearest neighbors:

$$\left(𝐬_{k+4}(\stackrel{~}{})\frac{1}{2}\frac{}{t_1}\frac{}{t_{k+3}}\right)\tau _{2n}\tau _{2n}=𝐬_k(\stackrel{~}{})\tau _{2n+2}\tau _{2n2}.$$
(4.0.8)
It only remains to check the“boundary condition”:

$$\{\begin{array}{cc}\tau _N=\underset{0}{\overset{\frac{N2}{2}}{}}b_i,\hfill & \text{for even }N\text{,}\hfill \\ & \\ \tau _{N+1}=0,\hfill & \text{for odd }N\text{.}\hfill \end{array}$$
(4.0.9)
Indeed, for even $`N`$, using $`detE_{NN}(t)=1`$ and the matrix (3.0.2), we have that

$$(pfm_N(t))^2=det\left(E_{N,N}(t)m_N(0)E_{N,N}^{}(t)\right)=detm_N(0)=\underset{0}{\overset{\frac{N2}{2}}{}}b_i.$$

Moreover, for odd $`N`$, according to (4.0.4), $`\tau _{N1}`$ is a pure Schur polynomial, which is known to satisfy the KP Fay identity; i.e., the equation (4.0.5), without right hand side. This justifies setting $`\tau _{N+1}=0`$ for odd $`N`$.

In the next Proposition, we show that the finite vector of skew-orthogonal polynomials form an eigenvector of the matrix $`L`$, with modified boundary condition.

###### Proposition 4.2

For even $`N`$, the skew-orthonormal polynomials $`q=(q_0,\mathrm{},q_{N1})^{}=Q(1,\mathrm{},z^{N1})^{}`$ are eigenfunctions for $`L`$, with the boundary condition:

$$Lq=zq(0,\mathrm{},0,z^N)\sqrt{pfm_{N2}}\left(\underset{0}{\overset{\frac{N2}{2}}{}}b_i\right)^{1/2}.$$

Proof: Indeed

$`Lq`$ $`=`$ $`Q\mathrm{\Lambda }Q^1Q\left(\begin{array}{c}1\\ \mathrm{}\\ z^{N1}\end{array}\right)`$
$`=`$ $`Q\mathrm{\Lambda }\left(\begin{array}{c}1\\ \mathrm{}\\ z^{N1}\end{array}\right)`$
$`=`$ $`Qz\left(\begin{array}{c}1\\ \mathrm{}\\ z^{N2}\\ 0\end{array}\right)`$
$`=`$ $`z\left(\begin{array}{c}q_0\\ q_1\\ \mathrm{}\\ q_{N2}\\ \overline{q}_{N1}\end{array}\right)=zq+z(0,\mathrm{},0,\overline{q}_{N1}q_{N1}),`$
where $`\overline{q}_{N1}`$ is the same as $`q_{N1}`$, but without leading term, i.e., $`\overline{q}_{N1}=q_{N1}Q_{NN}z^{N1}`$, where by (4.0.7) we have

$$Q_{NN}=\sqrt{\frac{\tau _{N2}}{\tau _N}}=\sqrt{pfm_{N2}}\left(\underset{0}{\overset{\frac{N2}{2}}{}}b_i\right)^{1/2},$$

ending the proof of Proposition 4.2.

## 5 Vertex operators

The purpose of this section is to prove Theorem 1.3 and Corollary 1.4. Define as in (1.0.48),

$$\beta :=\frac{N}{2}\mathrm{}+1.$$
(5.0.1)
Remembering from (1.0.46) the vertex operator $`X(t;z)`$, consider now its formal expansion in powers of $`z`$

$$X(t;z)=e^{_1^{\mathrm{}}t_iz^i}e^{_1^{\mathrm{}}\frac{z^i}{i}\frac{}{t_i}}=:\underset{i}{}B_iz^i,$$
(5.0.2)
with differential operators (see footnote 10)

$$B_i:=B_i^{(\alpha )}|_{\alpha =1}\text{and}B_i^{(\alpha )}:=\underset{j0}{}𝐬_{i+j}(\alpha t)𝐬_j(\alpha \stackrel{~}{}_t).$$
(5.0.3)
Also define as in (1.0.47) the vector vertex operator111111$`\chi (z):=(z^i)_{i0}`$.

$$𝕏(t;z)=\mathrm{\Lambda }^{}e^{_1^{\mathrm{}}t_iz^i}e^{_1^{\mathrm{}}\frac{z^i}{i}\frac{}{t_i}}\chi (z).$$
(5.0.4)
Also remember the definitions of the integrated vertex operator, in terms of the vertex operator (5.0.2) and a function $`\rho _b`$, defined in (5.0.8) below,

$`Y_\beta (t)`$ $`:=`$ $`{\displaystyle \frac{1}{(2\pi i)^2}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \underset{\mathrm{}}{}}X(t;y)X(t;z){\displaystyle \frac{\rho _b(y/z)dydz}{z^2(yz)^\beta }}`$
and the integrated vector vertex operator, in terms of (5.0.4),

$$𝕐_N(t)=\frac{1}{(2\pi i)^2}\underset{\mathrm{}}{}\underset{\mathrm{}}{}𝕏(t;y)𝕏(t;z)\frac{\rho _b(y/z)dydz}{2(yz)^{N/2}z}.$$
(5.0.5)
In both cases, the double integral around two contours about $`\mathrm{}`$ amounts to computing the coefficient of $`1/yz`$. The next Theorem is nothing but a rephrasing of Theorem 1.3 and Corollary 1.4.

###### Theorem 5.1

For a given set of $`b_i`$, the sequence of $`\tau `$-functions $`\tau _0,\tau _2,\tau _4,`$, defined in (1.0.40), is generated by the vertex operators $`Y_\beta `$:

$$Y_\beta \tau _\mathrm{}2=\mathrm{}\tau _{\mathrm{}}.$$
(5.0.6)
The vector $`I=(I_0,I_2,I_4,\mathrm{}),\text{ with }I_{\mathrm{}}=\left(\frac{\mathrm{}}{2}\right)!\tau _{\mathrm{}}`$ is a fixed point for the vector vertex operator $`𝕐_N`$, namely

$$(𝕐_NI)_{\mathrm{}}=I_{\mathrm{}},\text{ for even }\mathrm{}\text{.}$$
(5.0.7)
We shall first need a few propositions.

###### Proposition 5.2

Defining

$$\rho _b(x):=\{\begin{array}{c}\rho _b^{(e)}(x):=\underset{i0}{}b_i(x^{i1}x^i),\text{ for }N\text{ even,}\hfill \\ \\ \rho _b^{(o)}(x):=x^{1/2}\underset{i0}{}b_i(x^{i1}x^{i+1}),\text{ for }N\text{ odd,}\hfill \end{array}$$
(5.0.8)
we have

$`Y_\beta (t)`$ $`=`$ $`{\displaystyle \frac{1}{(2\pi i)^2}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \underset{\mathrm{}}{}}X(t;y)X(t;z){\displaystyle \frac{\rho _b(y/z)dydz}{z^2(yz)^\beta }}`$ (5.0.12)
$`=`$ $`\{\begin{array}{c}{\displaystyle \underset{j0}{}}b_j(B_{\beta +j}B_{\beta j}B_{\beta j1}B_{\beta +j+1}),\text{ for }N\text{ even}\hfill \\ \\ {\displaystyle \underset{j0}{}}b_j(B_{\beta +j+1/2}B_{\beta j1/2}B_{\beta j3/2}B_{\beta +j+3/2}),\text{ for }N\text{ odd.}\hfill \end{array}`$
Proof: Compute for $`N`$ even,

$`{\displaystyle \frac{X(t;y)X(t;z)}{(yz)^\beta }}`$ $`=`$ $`{\displaystyle \underset{i}{}}B_iy^{i\beta }{\displaystyle \underset{j}{}}B_jz^{j\beta }`$
$`=`$ $`{\displaystyle \underset{i}{}}B_{\beta +i}y^i{\displaystyle \underset{j}{}}B_{\beta j}z^j`$
$`=`$ $`{\displaystyle \underset{i,j}{}}B_{\beta +i}B_{\beta j}{\displaystyle \frac{y^i}{z^j}}`$
$`=`$ $`{\displaystyle \underset{j}{}}B_{\beta +j}B_{\beta j}\left({\displaystyle \frac{y}{z}}\right)^j+{\displaystyle \underset{ij}{}}a_{ij}{\displaystyle \frac{y^i}{z^j}}`$
and so,

$`\rho _b^{(e)}\left({\displaystyle \frac{y}{z}}\right){\displaystyle \frac{X(t;y)X(t;z)}{z^2(yz)^\beta }}`$
$`=`$ $`{\displaystyle \frac{1}{z^2}}\left({\displaystyle \underset{i0}{}}b_i\left[\left({\displaystyle \frac{y}{z}}\right)^{(i+1)}\left({\displaystyle \frac{y}{z}}\right)^i\right]\right)\left({\displaystyle \underset{j}{}}B_{\beta +j}B_{\beta j}\left({\displaystyle \frac{y}{z}}\right)^j+{\displaystyle \underset{ij}{}}a_{ij}{\displaystyle \frac{y^i}{z^j}}\right)`$
$`=`$ $`{\displaystyle \frac{1}{yz}}\left({\displaystyle \underset{j0}{}}b_j(B_{\beta +j}B_{\beta j}B_{\beta j1}B_{\beta +j+1})\right)+{\displaystyle \underset{i\mathrm{or}j0}{}}c_{ij}y^{i1}z^{j1}`$
and therefore, upon taking the double residue,

$$\underset{\mathrm{}}{}\underset{\mathrm{}}{}\frac{\rho _b^{(e)}(y/z)X(t;y)X(t;z)}{z^2(yz)^\beta }\frac{dydz}{(2\pi i)^2}=\underset{j0}{}b_j(B_{\beta +j}B_{\beta j}B_{\beta j1}B_{\beta +j+1}).$$

For $`N`$ odd,

$$\frac{X(t;y)X(t;z)}{(yz)^\beta (y/z)^{1/2}}=\underset{j}{}B_{\beta +\frac{1}{2}+j}B_{\beta \frac{1}{2}j}\left(\frac{y}{z}\right)^j+\underset{ij}{}a_{ij}\frac{y^i}{z^j}$$

and so

$`\rho _b^{(o)}\left({\displaystyle \frac{y}{z}}\right){\displaystyle \frac{X(t;y)X(t;z)}{z^2(yz)^\beta }}`$

$$=\frac{1}{yz}\underset{j0}{}b_j\left(B_{\beta +j+\frac{1}{2}}B_{\beta j\frac{1}{2}}B_{\beta j\frac{3}{2}}B_{\beta +j+\frac{3}{2}}\right)+\underset{i\mathrm{or}j0}{}c_{ij}y^{i1}z^{j1}$$

and therefore

$$\underset{\mathrm{}}{}\underset{\mathrm{}}{}\frac{\rho _b^{(o)}(y/z)X(t;y)X(t;z)}{z^2(yz)^\beta }\frac{dydz}{(2\pi i)^2}=\underset{j0}{}b_j\left(B_{\beta +j+\frac{1}{2}}B_{\beta j\frac{1}{2}}B_{\beta j\frac{3}{2}}B_{\beta +j+\frac{3}{2}}\right),$$

ending the proof of Proposition 5.2.

Defining the set

$$𝕊_N^{(\mathrm{})}:=\left\{\begin{array}{c}\sigma _1>\sigma _2>\mathrm{}>\sigma _{\mathrm{}/2},\sigma _i\hfill \\ \\ \frac{\mathrm{}}{2}\sigma _i+i\left[\frac{N}{2}\right]\hfill \end{array}\right\},$$
(5.0.13)
the map

$$\sigma :𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}𝕊_N^{(\mathrm{})}:\lambda \sigma (\lambda )=\left(\lambda _ii+\mathrm{}\left[\frac{N+1}{2}\right]\right)_{1in/2}.$$
(5.0.14)
is a bijection.

Indeed, $`\lambda _1\lambda _2\mathrm{}`$ implies at once the strict inequalities $`\sigma _1>\sigma _2>\mathrm{}`$ and also implies, together with the fact that for $`\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}`$ and $`1i\mathrm{}/2`$,

$$2\lambda _i\lambda _i+\lambda _{\mathrm{}+1i}=N\mathrm{}\text{and, clearly}\lambda _iN\mathrm{}.$$

Conversely, every $`\sigma 𝕊_N^{(\mathrm{})}`$ comes from a $`\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}`$.

###### Lemma 5.3

For a given partition

$$\lambda =(\lambda _1\lambda _2\mathrm{}\lambda _\mathrm{}2)𝕐_{\frac{(\mathrm{}2)(N\mathrm{}+2)}{2}}^{(\mathrm{}2)},$$

and $`j0`$, the following holds

$$B_{\beta +j}B_{\beta j}𝐬_\lambda =B_{\beta j1}B_{\beta +j+1}𝐬_\lambda =\{\begin{array}{cc}0,\hfill & \text{if }\beta +j=\text{ some }\lambda _\nu \nu 1\hfill \\ & \text{for }1\nu \mathrm{}/21\text{,}\hfill \\ & \text{or if }jN/2\hfill \\ & \\ 𝐬_\lambda ^{},\hfill & \text{if }\beta +j\text{ every }\lambda _\nu \nu 1\hfill \\ & \text{for }1\nu \mathrm{}/21\text{,}\hfill \end{array}$$
(5.0.15)
where

$`\lambda ^{}=(\lambda _12`$ $``$ $`\mathrm{}\lambda _\nu 2\beta +j+\nu \lambda _{\nu +1}1\mathrm{}\lambda _{\frac{\mathrm{}}{2}1}1`$ (5.0.16)
$``$ $`\lambda _\frac{\mathrm{}}{2}1\mathrm{}\lambda _{\mathrm{}2\nu }1(N\mathrm{})(\beta +j+\nu )`$
$``$ $`\lambda _{\mathrm{}1\nu }\mathrm{}\lambda _\mathrm{}2)𝕐^{(\mathrm{})}_{\frac{\mathrm{}(N\mathrm{})}{2}}.`$
Moreover for $`j`$’s such that $`\beta +j`$ every $`\lambda _\nu \nu 1`$, the maps $`B_{\beta +j}B_{\beta j}`$ induce maps

$$B_{\beta +j}B_{\beta j}:𝕐_{\frac{(\mathrm{}2)(N\mathrm{}+2)}{2}}^{(\mathrm{}2)}𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}:\lambda \lambda ^{}$$
(5.0.17)
having, as a whole, a “surjectivity property”, meaning that to each $`\lambda ^{}𝕐_{(\mathrm{}2)(N\mathrm{})/2}^{\mathrm{}}`$, there are $`\mathrm{}/2`$ choices of $`j0`$ and $`\lambda 𝕐_{(\mathrm{}2)(N\mathrm{}+2)/2}^{(\mathrm{}2)}`$ mapping to $`\lambda ^{}`$, by means of the map $`B_{\beta +j}B_{\beta j}`$, as in (5.0.12).

At the level of the $`𝕊`$-spaces, the maps $`B_{\beta +j}B_{\beta j}`$ induce maps

$$𝕊_N^{(\mathrm{}2)}𝕊_N^{(\mathrm{})}:\sigma =(\sigma _1,\mathrm{},\sigma _{\frac{\mathrm{}2}{2}})\sigma ^{}=(\sigma _1,\mathrm{},\sigma _\nu ,j,\sigma _{\nu +1},\mathrm{},\sigma _{\frac{\mathrm{}2}{2}}),$$
(5.0.18)
having the same “surjectivity property” as above.

For $`N`$ odd, all formulae above remain the same , except for the substitution $`jj+\frac{1}{2}`$ in (5.0.15) and (5.0.16).

Proof: Extending a classic identity (see MacDonald ) to arbitrary sequences $`(\lambda _1,\mathrm{},\lambda _n)`$, we have

$$B_{\lambda _1},\mathrm{},B_{\lambda _n}(1)=(\lambda _1,\mathrm{},\lambda _n):=det\left(𝐬_{\lambda _i+ji}(t)\right)_{1i,jn}$$

and, in particular, for a partition $`(\lambda _1\lambda _2\mathrm{}\lambda _{\mathrm{}})`$, we have, for an arbitrary choice of $`j0`$,

$`B_{\beta +j}B_{\beta j}𝐬_{(\lambda _1,\mathrm{},\lambda _\mathrm{}2)}`$ $`=`$ $`𝐬_{(\beta +j,\beta j,\lambda _1,\mathrm{},\lambda _\mathrm{}2)}`$ (5.0.24)
$`=`$ $`det\left(\begin{array}{ccccc}𝐬_{\beta +j}& 𝐬_{\beta +j+1}& 𝐬_{\beta +j+2}& \mathrm{}& 𝐬_{\beta +j+\mathrm{}1}\\ 𝐬_{\beta j1}& 𝐬_{\beta j}& 𝐬_{\beta j+1}& \mathrm{}& 𝐬_{\beta j+\mathrm{}2}\\ 𝐬_{\lambda _12}& 𝐬_{\lambda _11}& 𝐬_{\lambda _1}& \mathrm{}& 𝐬_{\lambda _1+\mathrm{}3}\\ \mathrm{}& & & \mathrm{}& \mathrm{}\\ 𝐬_{\lambda _\mathrm{}2\mathrm{}+1}& \mathrm{}& \mathrm{}& \mathrm{}& 𝐬_{\lambda _\mathrm{}2}\end{array}\right).`$
Using the value (5.0.1) of $`\beta `$, it is immediately clear, from the matrix (LABEL:Schurmatrix), that for $`jN/2`$, the second row of the matrix (LABEL:Schurmatrix) vanishes and therefore the determinant. Therefore we assume $`0j\frac{N}{2}1`$. We give the proof for even $`N`$; for odd $`N`$, it is identical with $`jj+1/2`$.

The first column of the matrix above involves the indices

$$\frac{N}{2}\mathrm{}+1+j,\frac{N}{2}\mathrm{}j,\lambda _12,\lambda _23,\mathrm{},\lambda _\frac{\mathrm{}}{2}\frac{\mathrm{}}{2}1,\mathrm{},\lambda _\mathrm{}2\mathrm{}+1.$$
(5.0.26)
Consider now an arbitrary integer $`j0`$ and an arbitrary partition

$$\lambda 𝕐_{\frac{(\mathrm{}2)(N\mathrm{}+2)}{2}}^{(\mathrm{}2)};$$

it has the property that

$$\lambda _i+\lambda _{\mathrm{}1i}=N\mathrm{}+2\text{ for }1i\frac{\mathrm{}2}{2}.$$

Hence, for $`i=\frac{\mathrm{}2}{2}`$

$$2\lambda _\frac{\mathrm{}}{2}\lambda _{\frac{\mathrm{}}{2}1}+\lambda _\frac{\mathrm{}}{2}=N\mathrm{}+2,$$

and so

$$\lambda _{\mathrm{}/2}\frac{N\mathrm{}+2}{2};$$

thus, for the arbitrary $`j0`$ chosen above

$$\lambda _{\mathrm{}/2}\mathrm{}/21\frac{N}{2}\mathrm{}<\frac{N}{2}\mathrm{}+j+1.$$

The partition $`\lambda _1\lambda _2\mathrm{}`$ implies the strict inequalities

$$\lambda _111>\lambda _221>\lambda _331>\mathrm{}>\lambda _{\nu +1}(\nu +1)1>\mathrm{}>\lambda _{\mathrm{}/2}\mathrm{}/21$$

and therefore, there exist $`0\nu \frac{\mathrm{}}{2}1`$ such that

$$\lambda _\nu \nu 1\frac{N}{2}\mathrm{}+j+1\lambda _{\nu +1}\nu 2.$$

These inequalities together with the fact that

$$\lambda _\nu +\lambda _{\mathrm{}1\nu }=N\mathrm{}+2,\lambda _{\nu +1}+\lambda _{\mathrm{}2\nu }=N\mathrm{}+2$$

also imply

$$\lambda _{\mathrm{}2\nu }(\mathrm{}1\nu )\frac{N}{2}\mathrm{}j\lambda _{\mathrm{}1\nu }(\mathrm{}\nu ).$$

Therefore, the indices (5.0.26) of the first column of the matrix (LABEL:Schurmatrix) are now rearranged by order, as follows:

$`\lambda _12>\lambda _23>\mathrm{}>\lambda _\nu \nu 1{\displaystyle \frac{N}{2}}\mathrm{}+1+j\lambda _{\nu +1}\nu 2`$
$`>\mathrm{}>\lambda _{\frac{\mathrm{}}{2}1}{\displaystyle \frac{\mathrm{}}{2}}>\lambda _\frac{\mathrm{}}{2}{\displaystyle \frac{\mathrm{}}{2}}1>\mathrm{}>\lambda _{\mathrm{}2\nu }(\mathrm{}1\nu )`$
$`{\displaystyle \frac{N}{2}}\mathrm{}j\lambda _{\mathrm{}1\nu }(\mathrm{}\nu )>\mathrm{}>\lambda _\mathrm{}2\mathrm{}+1.`$ (5.0.27)
Notice that the determinant (LABEL:Schurmatrix) vanishes if any of the equalities hold in (5.0.27) above. Therefore we may assume strict inequalities. Upon rearranging the rows of the matrix (LABEL:Schurmatrix) according to the order in (5.0.27), we now list the corresponding partitions by looking at the indices on the diagonal. This amounts to adding $`i1`$ to the $`i^{\mathrm{th}}`$ entry of (5.0.27), thus leading to

$$\begin{array}{ccccccccc}\lambda ^{}=\hfill & (\lambda _12& \lambda _22& \mathrm{}\hfill & \lambda _\nu 2& \frac{N}{2}\mathrm{}+1+j+\nu & \lambda _{\nu +1}1& \mathrm{}\hfill & \lambda _{\frac{\mathrm{}}{2}1}1\\ & \stackrel{}{1}& \stackrel{}{2}& & \stackrel{}{\nu }& \stackrel{}{\nu +1}& \stackrel{}{\nu +2}& & \stackrel{}{\mathrm{}/2}\end{array}$$

$$\begin{array}{cccccccc}\hfill & \lambda _\frac{\mathrm{}}{2}1& \mathrm{}\hfill & \lambda _{\mathrm{}2\nu }1& \frac{N}{2}j\nu 1& \lambda _{\mathrm{}1\nu }& \mathrm{}\hfill & \lambda _\mathrm{}2)\\ & \stackrel{}{\mathrm{}/2+1}& & \stackrel{}{\mathrm{}2\nu +1}& \stackrel{}{\mathrm{}2\nu +2}& \stackrel{}{\mathrm{}2\nu +3}& & \stackrel{}{\mathrm{}}\end{array}$$

(5.0.28)
The rearrangement does not change the sign of the determinant (LABEL:Schurmatrix). Knowing that $`\lambda 𝕐_{\frac{(\mathrm{}2)(N\mathrm{}+2)}{2}}^{(\mathrm{}2)}`$, we now prove that the new partition $`\lambda ^{}`$ (obtained in (5.0.28)),

$$\lambda ^{}𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})};$$

i.e., we prove

$`(\mathrm{i}){\displaystyle \underset{i}{\overset{\mathrm{}}{}}}\lambda _i^{}`$ $`=`$ $`{\displaystyle \underset{1}{\overset{\mathrm{}2}{}}}\lambda _i2\nu (\mathrm{}22\nu )+\left({\displaystyle \frac{N}{2}}\mathrm{}+1+j+\nu \right)`$
$`+\left({\displaystyle \frac{N}{2}}j\nu 1\right)`$
$`=`$ $`{\displaystyle \frac{\mathrm{}(N\mathrm{})}{2}},`$
and

$$\lambda _i^{}+\lambda _{\mathrm{}+1i}^{}=N\mathrm{}\text{for all }1i\frac{\mathrm{}}{2}\text{;}$$
$`(\mathrm{ii})`$
e.g.,

$`\lambda _i^{}+\lambda _{\mathrm{}+1i}^{}`$ $`=`$ $`\lambda _i2+\lambda _{\mathrm{}1i}=N\mathrm{}\text{for }1i\nu `$
$`\lambda _{\nu +1}^{}+\lambda _\mathrm{}\nu ^{}`$ $`=`$ $`\left({\displaystyle \frac{N}{2}}\mathrm{}+1+j+\nu \right)+\left({\displaystyle \frac{N}{2}}j\nu 1\right)=N\mathrm{}`$
$`\lambda _i^{}+\lambda _{\mathrm{}+1i}^{}`$ $`=`$ $`\lambda _{i1}1+\lambda _\mathrm{}i1=N\mathrm{}\text{for }\nu +2i\mathrm{}/2.`$
So far, we have shown that to an arbitrary integer $`j0`$ and a partition

$$\lambda =(\lambda _1\lambda _2\mathrm{}\lambda _\mathrm{}2)𝕐_{\frac{(\mathrm{}2)(N\mathrm{}+2)}{2}}^{(\mathrm{}2)},$$

such that the inequalities in (5.0.28) are strict, corresponds a new partition

$$\lambda ^{}=(\lambda _1^{}\mathrm{}\lambda _{\mathrm{}}^{})𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})},$$

with $`\lambda ^{}`$ totally determined by (5.0.28). Then $`\mathrm{}/2`$ different choices of $`\lambda 𝕐_{(\mathrm{}2)(N\mathrm{}+2)/2}^{(\mathrm{}2)}`$ and $`j0`$ will lead to the same sequence of numbers (5.0.28), as appears from the next argument.

In view of the $`\sigma `$-map in (5.0.14), it is obvious to see that the $`\nu +1`$-st number in $`\lambda ^{}`$ of (5.0.28) gets mapped by $`\sigma `$ into $`j`$, namely

$$\frac{N}{2}\mathrm{}+1+j+\nu j,$$

and, in general, (5.0.15) holds. The “surjectivity property” is straightforward in this description, since given a sequence $`\sigma ^{}𝕊_N^{(\mathrm{})}`$, you may choose $`j`$ to be any of the $`\mathrm{}/2`$ numbers appearing in $`\sigma ^{}`$; then $`\sigma `$ is the sequence formed by the remaining numbers in order. This establishes Lemma 5.3.

###### Proposition 5.4

Given positive integers $`N`$ and $`\mathrm{}`$ with even $`\mathrm{}`$ and the operator

$$Y_\beta =\{\begin{array}{c}\underset{j0}{}b_j\left(B_{\beta +j}B_{\beta j}B_{\beta j1}B_{\beta +j+1}\right),N\text{ even,}\hfill \\ \\ \underset{j0}{}b_j\left(B_{\beta +j+\frac{1}{2}}B_{\beta j\frac{1}{2}}B_{\beta j\frac{3}{2}}B_{\beta +j+\frac{3}{2}}\right),N\text{ odd,}\hfill \end{array}$$

we have

$$Y_{\frac{N}{2}\mathrm{}+1}\tau _\mathrm{}2=\mathrm{}\tau _{\mathrm{}}.$$

Proof: The indices of the $`b_i`$ in the $`\mathrm{}`$th tau-function can now be expressed in terms of the $`\sigma `$-map, as follows

$$\tau _{\mathrm{}}(t)=\underset{\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}}{}\left(\underset{1}{\overset{\mathrm{}/2}{}}b_{\lambda _ii+\mathrm{}\left[\frac{N+1}{2}\right]}\right)𝐬_\lambda (t)=\underset{\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}}{}\left(\underset{1}{\overset{\mathrm{}/2}{}}b_{\sigma _i(\lambda )}\right)𝐬_\lambda (t).$$

We give the proof for even $`N`$. From (5.0.18), it follows at once that

$$b_j\underset{1}{\overset{(\mathrm{}2)/2}{}}b_{\sigma _i(\lambda )}=\underset{1}{\overset{\mathrm{}/2}{}}b_{\sigma _i(\lambda ^{})}.$$
(5.0.29)
Setting $`Y_\beta ={\displaystyle \underset{i0}{}}b_i\mathrm{\Gamma }_i`$, one computes, using Lemma 5.3, (5.0.29) and in $`\stackrel{}{=}`$ the $`\mathrm{}/2`$-to-$`1`$ “surjectivity” of the maps (5.0.17) or (5.0.18):

$`Y_{\frac{N}{2}\mathrm{}+1}\tau _\mathrm{}2(t)`$ $`=`$ $`{\displaystyle \underset{\lambda 𝕐_{\frac{(\mathrm{}2)(N\mathrm{}2)}{2}}^{(\mathrm{}2)}}{}}\left({\displaystyle \underset{1}{\overset{\frac{\mathrm{}2}{2}}{}}}b_{\sigma _i(\lambda )}\right)Y_\beta (s_\lambda (t))`$
$`=`$ $`{\displaystyle \underset{\lambda 𝕐_{\frac{(\mathrm{}2)(N\mathrm{}2)}{2}}^{(\mathrm{}2)}}{}}{\displaystyle \underset{j0}{}}\left({\displaystyle \underset{1}{\overset{\frac{\mathrm{}2}{2}}{}}}b_{\sigma _i(\lambda )}\right)b_j\mathrm{\Gamma }_j(s_\lambda (t))`$
$`\stackrel{}{=}`$ $`{\displaystyle \frac{\mathrm{}}{2}}{\displaystyle \underset{\lambda ^{}𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{\mathrm{}}}{}}{\displaystyle \underset{1}{\overset{\mathrm{}/2}{}}}b_{\sigma _i(\lambda ^{})}2s_\lambda ^{}(t)`$
$`=`$ $`\mathrm{}\tau _{\mathrm{}}(t),`$
ending the proof of Proposition 5.4.

Proof of Theorem 5.1: Formula (5.0.6) follows at once from Propositions 5.2 and 5.4. To prove (5.0.7), first notice that, upon setting $`I_{\mathrm{}}:=\left({\displaystyle \frac{\mathrm{}}{2}}\right)!\tau _{\mathrm{}}`$,

$$(𝕏(t;y)𝕏(t;z)I)_{\mathrm{}}=y^\mathrm{}1z^\mathrm{}2X(t;y)X(t;z)I_\mathrm{}2.$$

Then

$`(𝕐(t)I)_{\mathrm{}}`$ $`=`$ $`\left({\displaystyle \frac{1}{(2\pi i)^2}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \underset{\mathrm{}}{}}𝕏(t;y)𝕏(t;z){\displaystyle \frac{\rho _b(y/z)dydz}{2z(yz)^{N/2}}}I\right)_{\mathrm{}}`$
$`=`$ $`{\displaystyle \frac{1}{(2\pi i)^2}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \frac{dydz\rho _b(y/z)}{2z^2(yz)^{N/2\mathrm{}+1}}}X(t;y)X(t;z)I_\mathrm{}2`$
$`=`$ $`{\displaystyle \frac{1}{2}}Y_{\frac{N}{2}\mathrm{}+1}I_\mathrm{}2,\text{by definition (5.0.5) of }Y_\beta \text{,}`$
$`=`$ $`{\displaystyle \frac{1}{2}}Y_{\frac{N}{2}\mathrm{}+1}\left({\displaystyle \frac{\mathrm{}2}{2}}\right)!\tau _\mathrm{}2`$
$`=`$ $`\left({\displaystyle \frac{\mathrm{}}{2}}\right)!\tau _{\mathrm{}},\text{ using (}\text{5.0.6}\text{)}`$
$`=`$ $`I_{\mathrm{}},`$
ending the proof of Theorem 5.1.

Example: For $`b_i=2i+1`$ and even $`N`$, the function $`\rho _b(x)`$, defined in (5.0.8), equals121212$`\rho _b(x)`$ is actually a distribution!

$$\rho _b(x)=\underset{i0}{}b_i(x^{i1}x^i)=\frac{1+x}{(1x)^2}+x^1\frac{1+x^1}{(1x^1)^2}.$$
(5.0.30)
The corresponding vertex operator (5.0.12) takes on a particularly simple form:

$$Y_{\frac{N}{2}\mathrm{}+1}=2B_{N2\mathrm{}+2}^{(2)}=2\underset{}{}𝑑u\delta ^{(N2)}(u)u^{2\mathrm{}4}X^{(2)}(u),$$
(5.0.31)
where $`\delta ^{(N2)}`$ is the $`(N2)`$nd derivative of the customary $`\delta `$-function and where the $`B_i^{(2)}`$ are the differential operators (5.0.3) in the $`t_i`$,

$$B_i^{(2)}:=\underset{j0}{}𝐬_{i+j}(2t)𝐬_j(2\stackrel{~}{}_t),$$

given by the coefficients of the expansion in powers of $`z`$ of the vertex operator

$$X^{(2)}(z):=e^{2_1^{\mathrm{}}t_iz^i}e^{2_1^{\mathrm{}}\frac{z^i}{i}\frac{}{t_i}}=\underset{i}{}B_i^{(2)}z^i.$$

Proof: Formula (5.0.30) follows immediately from the series

$$\frac{1+x}{(1x)^2}=1+3x+5x^2+7x^3+\mathrm{}.$$

Setting, for convenience,

$$X(t;y,z):=e^{_1^{\mathrm{}}t_i(y^i+z^i)}e^{_1^{\mathrm{}}\left(\frac{y^i+z^i}{i}\right)\frac{}{t_i}}$$

and using $`X(t;y)X(t;z)=\left(1{\displaystyle \frac{z}{y}}\right)X(t;y,z)`$ and $`X(t;z,z)=X^{(2)}(t;z)`$, one computes ($`\beta =\frac{N}{2}\mathrm{}+1`$)

$`Y_\beta `$ $`=`$ $`{\displaystyle \frac{1}{(2\pi i)^2}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \frac{\rho ^e(y/z)}{(yz)^\beta z^2}}X(t;y)X(t;z)𝑑y𝑑z`$
$`=`$ $`{\displaystyle \frac{1}{(2\pi i)^2}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \underset{\mathrm{}}{}}\left({\displaystyle \frac{z(1+z/y)}{y(1z/y)^2}}{\displaystyle \frac{(1+y/z)}{(1y/z)^2}}\right){\displaystyle \frac{(1z/y)}{z^2(zy)^\beta }}X(t;y,z)𝑑y𝑑z`$
$`=`$ $`{\displaystyle \frac{1}{(2\pi i)^2}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \frac{z}{y}}{\displaystyle \frac{(1+z/y)}{(1z/y)^2}}{\displaystyle \frac{(1z/y)}{z^2(zy)^\beta }}X(t;y,z)𝑑y𝑑z`$
$`=`$ $`{\displaystyle \underset{\mathrm{}}{}}\left({\displaystyle \underset{\mathrm{}}{}}{\displaystyle \frac{(1+z/y)}{(yz)z(zy)^\beta }}X(t;y,z){\displaystyle \frac{dy}{2\pi i}}\right){\displaystyle \frac{dz}{2\pi i}}`$
$`=`$ $`2{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \frac{X(t;z,z)}{z^{2\beta +1}}}{\displaystyle \frac{dz}{2\pi i}}`$
$`=`$ $`2{\displaystyle \underset{\mathrm{}}{}}{\displaystyle \frac{X^{(2)}(t;z)}{z^{2\beta +1}}}{\displaystyle \frac{dz}{2\pi i}}`$
$`=`$ $`2B_{2\beta }^{(2)}=2B_{N2\mathrm{}+2}^{(2)}=2{\displaystyle \underset{}{}}𝑑u\delta ^{(N2)}(u)u^{2\mathrm{}4}X^{(2)}(t;u),`$
establishing (5.0.31).

## 6 Duality

###### Proposition 6.1

For odd $`N`$ and odd $`\mathrm{}`$, the following holds:

$`\stackrel{~}{\tau }_{\mathrm{}}(t)`$ $`:=`$ $`z^1det{}_{}{}^{1/2}\left(E_{\mathrm{},N}(t)(m_N(0)+z^2\epsilon _{\frac{N+1}{2},\frac{N+1}{2}})E_{\mathrm{},N}^{}(t)\right)`$ (6.0.1)
$`=`$ $`{\displaystyle \underset{\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}}{}}\left({\displaystyle \underset{1}{\overset{[\mathrm{}/2]}{}}}b_{\lambda _ii+\mathrm{}\left[\frac{N+1}{2}\right]}\right)𝐬_{\lambda _1\mathrm{}\lambda _{\mathrm{}}}(t).`$
Then these functions

$$\stackrel{~}{\tau }_{\mathrm{}}(t)=(1)^{\mathrm{}(N\mathrm{})/2}\left(\underset{0}{\overset{\frac{N3}{2}}{}}b_i\right)\left(\tau _N\mathrm{}(t)|_{b_ib_i^1}\right),\text{for }\mathrm{}\text{ odd}.$$
(6.0.2)
are the $`\tau `$-functions $`\tau _k(t)`$ (in reverse order and modulo a multiplicative factor) of the Pfaff lattice for odd $`N`$ and even $`k`$, with $`tt`$, and with initial condition

$$\left(\begin{array}{ccccccc}& & O& & & & b_{\frac{N3}{2}}^1\\ & & & & & \mathrm{}& \\ & & & & b_0^1& & \\ & & & 0& & & \\ & & b_0^1& & & & \\ & \mathrm{}& & & & & \\ b_{\frac{N3}{2}}^1& & & & & O& \end{array}\right).$$
(6.0.3)
Proof: Defining $`k_i`$ and $`k_i^{}`$ by

$$\lambda _i=k_i\mathrm{}+i,\lambda _i^{}=k_i^{}(N\mathrm{})+i,$$
(6.0.4)
it is easy to see the one-to-one correspondence between

$$𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}\left\{\begin{array}{c}N1k_1>k_2>\mathrm{}>k_{\mathrm{}}0\hfill \\ \\ \text{with }k_i+k_{\mathrm{}+1i}=N1\text{ for }1i\frac{\mathrm{}+1}{2}\hfill \end{array}\right\}$$

and also between

$$𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(N\mathrm{})}\left\{\begin{array}{c}N1k_1^{}>k_2^{}>\mathrm{}>k_N\mathrm{}^{}0\hfill \\ \\ \text{with }k_i^{}+k_{N\mathrm{}+1i}^{}=N1\text{ for }1i\frac{N\mathrm{}}{2}\hfill \end{array}\right\}.$$
(6.0.5)
###### Lemma 6.2

(1) The following correspondence holds

$$\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}\lambda ^{}𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(N\mathrm{})},$$
(6.0.6)
(2) For $`\lambda `$ and $`\lambda ^{}`$, we have the following disjoint union

$$\{k_1>\mathrm{}>k_{\mathrm{}}\}\{k_1^{}>\mathrm{}>k_N\mathrm{}^{}\}=\{0,1,\mathrm{},N1\}.$$
(6.0.7)
Proof: Considering

$$(\lambda _1\lambda _2\mathrm{}\lambda _{\mathrm{}})𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{\mathrm{}},$$

we have

$`\lambda _1^{}=\mathrm{}=\lambda _\lambda _{\mathrm{}}^{}=\mathrm{}`$
$`\lambda _{\lambda _{\mathrm{}}+1}^{}=\mathrm{}=\lambda _{\lambda _\mathrm{}1}^{}=\mathrm{}1`$
$`\lambda _{\lambda _\mathrm{}1+1}^{}=\mathrm{}=\lambda _{\lambda _\mathrm{}2}^{}=\mathrm{}2`$ (6.0.8)
$`\mathrm{}`$
and so, since

$`k_i=N1k_{\mathrm{}+1i}`$ $`=`$ $`N1(\lambda _{\mathrm{}+1i}+\mathrm{}(\mathrm{}+1i))`$
$`=`$ $`N(\lambda _{\mathrm{}+1i}+i)`$
we have, on the one hand

$$k_1=N\lambda _{\mathrm{}}1>k_2=N\lambda _\mathrm{}12>k_3=N\lambda _\mathrm{}23,$$
(6.0.9)
and on the other hand, using (6.0.4) and (6.0.8),

$`k_1^{}=N1>k_2^{}=N2>\mathrm{}>k_\alpha ^{}=N\alpha >\mathrm{}>k_\lambda _{\mathrm{}}^{}=N\lambda _{\mathrm{}}>`$
$`k_{\lambda _{\mathrm{}}+1}^{}=N\lambda _{\mathrm{}}2>\mathrm{}>k_\beta ^{}=N\beta 1>\mathrm{}>k_{\lambda _\mathrm{}1}^{}=N\lambda _\mathrm{}11>`$
$`k_{\lambda _\mathrm{}1+1}^{}=N\lambda _\mathrm{}13>\mathrm{}>k_\gamma ^{}=N\gamma 2>\mathrm{}>k_{\lambda _\mathrm{}2}^{}=N\lambda _\mathrm{}22>\mathrm{}`$
(6.0.10)
So the gaps in (6.0.10) coincide with the sequence (6.0.9). This ends the proof of Lemma 6.2.

Proof of Proposition 6.1: One checks, using Proposition 3.2,

$`\stackrel{~}{\tau }_{\mathrm{}}(t)`$ $`=`$ $`{\displaystyle \underset{\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}}{}}{\displaystyle \underset{1}{\overset{\frac{\mathrm{}1}{2}}{}}}b_{\lambda _ii+\mathrm{}\frac{N+1}{2}}𝐬_\lambda (t)`$
$`=`$ $`(1)^{|\lambda |}{\displaystyle \underset{\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}}{}}{\displaystyle \underset{1}{\overset{\frac{\mathrm{}1}{2}}{}}}b_{k_i\frac{N+1}{2}}𝐬_\lambda ^{}(t)`$
$`=`$ $`(1)^{|\lambda |}{\displaystyle \underset{0}{\overset{\frac{N3}{2}}{}}}b_i{\displaystyle \underset{\lambda 𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(\mathrm{})}}{}}{\displaystyle \frac{1}{{\displaystyle \underset{1}{\overset{\frac{N\mathrm{}}{2}}{}}}b_{k_i^{}\frac{N+1}{2}}}}𝐬_\lambda ^{}(t),\text{using Lemma 6.2,}`$
$`=`$ $`(1)^{|\lambda |}{\displaystyle \underset{0}{\overset{\frac{N3}{2}}{}}}b_i{\displaystyle \underset{\lambda ^{}𝕐_{\frac{\mathrm{}(N\mathrm{})}{2}}^{(N\mathrm{})}}{}}{\displaystyle \underset{1}{\overset{\frac{N\mathrm{}}{2}}{}}}b_{\lambda _i^{}i+\mathrm{}\frac{N+1}{2}}^1𝐬_\lambda ^{}(t)`$
$`=`$ $`(1)^{\frac{\mathrm{}(N\mathrm{})}{2}}{\displaystyle \underset{0}{\overset{\frac{N3}{2}}{}}}b_i\left(\tau _N\mathrm{}(t)|_{b_ib_i^1}\right),`$
which is, using Theorem 1.1, the $`\tau `$-function (modulo a constant) for the case where $`N`$ is odd and $`N\mathrm{}`$ even, concluding the proof of the Proposition.

## 7 Examples

### Example 1: Rectangular Jack polynomials

###### Proposition 7.1

When

$`b_i`$ $`=`$ $`2i+1\text{for }N\text{ even}`$ (7.0.1)
$`=`$ $`2i+2\text{for }N\text{ odd},`$
then the $`\tau _{2n}(t)`$’s are Jack polynomials for rectangular partitions, with $`n[N/2]`$,

$`\tau _{2n}(t)`$ $`=`$ $`pfm_{2n}(t)`$ (7.0.2)
$`=`$ $`{\displaystyle \underset{\lambda 𝕐_{n(N2n)}^{(2n)}}{}}{\displaystyle \underset{1}{\overset{n}{}}}(k_ik_{2n+1i})𝐬_\lambda (t),\text{ where }k_i=\lambda _ii+2n`$
$`=`$ $`J_\lambda ^{(1/2)}(x)|_{t_i=\frac{1}{i}{\displaystyle \underset{k}{}}x_k^i}\text{for the partition }\lambda =(N2n)^n`$
$`=`$ $`{\displaystyle \frac{1}{n!}}{\displaystyle _^n}\mathrm{\Delta }(z)^4{\displaystyle \underset{k=1}{\overset{n}{}}}e^{2{\displaystyle \underset{1}{\overset{\mathrm{}}{}}}t_iz_k^i}\delta ^{(N2)}(z_k)dz_k.`$
Then

$$m_{\mathrm{}}(t)=E_{\mathrm{},N}(t)m_N(0)E_{\mathrm{},N}^{}(t),$$

with

$`m_N(0)`$ $`=`$ $`\left(\begin{array}{cccccccc}& & O& & & & & N1\\ & & & & & & N3& \\ & & & & & \mathrm{}& & \\ & & & & 1& & & \\ & & & 1& & & & \\ & & \mathrm{}& & & & & \\ & N+3& & & & & & \\ N+1& & & & & & O& \end{array}\right)\text{, for }N\text{ even,}`$
$`m_N(0)`$ $`=`$ $`\left(\begin{array}{ccccccccc}& & O& & & & & & N1\\ & & & & & & & N3& \\ & & & & & & \mathrm{}& & \\ & & & & & 2& & & \\ & & & & 0& & & & \\ & & & 2& & & & & \\ & & \mathrm{}& & & & & & \\ & N+3& & & & & & & \\ N+1& & & & & & & O& \end{array}\right)\text{, for }N\text{ odd}`$
where (setting $`\stackrel{~}{𝐬}_n(t)=𝐬_n(2t)`$)

$`m_N(t)`$
$`=`$ $`\left((ji)\stackrel{~}{𝐬}_{Nij1}\right)_{0i,jN1}`$
$`=`$ $`\left(\begin{array}{cccccccccc}0& \stackrel{~}{𝐬}_{N2}& & 2\stackrel{~}{𝐬}_{N3}& & \mathrm{}& \left(N2\right)\stackrel{~}{𝐬}_1& & N1& \\ & & & & & & & & & \\ \stackrel{~}{𝐬}_{N2}& 0& & \stackrel{~}{𝐬}_{N4}& & \mathrm{}& N3& & & \\ & & & & & & & & & \\ 2\stackrel{~}{𝐬}_{N3}& \stackrel{~}{𝐬}_{N4}& & 0& & \mathrm{}& & & & \\ & & & & & & & & & \\ & & & & 1& & & & & \\ \mathrm{}& \mathrm{}& & 1& & & & & & \\ & & & & & & & & & \\ & & \mathrm{}& & & & & & & \\ & & & & & & & & & \\ \left(N2\right)\stackrel{~}{𝐬}_1& N+3& & & & & & & & \\ & & & & & & & & & \\ & & & & & & & O& & \\ N+1& & & & & & & & & \end{array}\right)`$
for $`N`$ even
$`=`$ $`\left(\begin{array}{cccccccccc}0& \stackrel{~}{𝐬}_{N2}& & 2\stackrel{~}{𝐬}_{N3}& & \mathrm{}& \left(N2\right)\stackrel{~}{𝐬}_1& & N1& \\ & & & & & & & & & \\ \stackrel{~}{𝐬}_{N2}& 0& & \stackrel{~}{𝐬}_{N4}& & \mathrm{}& N3& & & \\ & & & & & & & & & \\ 2\stackrel{~}{𝐬}_{N3}& \stackrel{~}{𝐬}_{N4}& & 0& & \mathrm{}& & & & \\ & & & & & & & & & \\ & & & & 2& & & & & \\ & & & 0& & & & & & \\ \mathrm{}& \mathrm{}& 2& & & & & & & \\ & & & & & & & & & \\ & & \mathrm{}& & & & & & & \\ & & & & & & & & & \\ \left(N2\right)\stackrel{~}{𝐬}_1& N+3& & & & & & & & \\ & & & & & & & & & \\ & & & & & & & O& & \\ N+1& & & & & & & & & \end{array}\right)`$
for $`N`$ odd
Proof: Setting

$$t_k=\frac{1}{k}\underset{i=1}{\overset{\mathrm{}}{}}x_i^k$$

we have

$`e^{\beta {\displaystyle \underset{1}{\overset{\mathrm{}}{}}}t_kz^k}`$ $`=`$ $`e^{\beta {\displaystyle \underset{i=1}{\overset{\mathrm{}}{}}}{\displaystyle \underset{k=1}{\overset{\mathrm{}}{}}}{\displaystyle \frac{1}{k}}\left(x_iz\right)^k}`$
$`=`$ $`{\displaystyle \underset{i=1}{\overset{\mathrm{}}{}}}\left(e^{{\displaystyle \underset{k=1}{\overset{\mathrm{}}{}}}{\displaystyle \frac{1}{k}}\left(x_iz\right)^k}\right)^\beta `$
$`=`$ $`{\displaystyle \underset{i=1}{\overset{\mathrm{}}{}}}(1x_iz)^\beta `$
According to Awata et al. , the Jack polynomials for rectangular partitions $`s^n`$ have the following integral representation: (for connections with random matrix theory, see )

$`cJ_{s^n}^{1/\beta }`$ $`=`$ $`{\displaystyle _{z_1=\mathrm{}=z_n=0}}|\mathrm{\Delta }(z)|^{2\beta }{\displaystyle \underset{j=1}{\overset{n}{}}}z_j^{(n1)\beta s}{\displaystyle \underset{i=1}{\overset{\mathrm{}}{}}}(1x_iz_j)^\beta {\displaystyle \frac{dz_j}{2\pi iz_j}}`$
$`=`$ $`{\displaystyle _{z_1=\mathrm{}=z_n=0}}|\mathrm{\Delta }(z)|^{2\beta }{\displaystyle \underset{j=1}{\overset{n}{}}}z_j^{(n1)\beta s}e^{\beta {\displaystyle \underset{k=1}{\overset{\mathrm{}}{}}}t_kz_j^k}{\displaystyle \frac{dz_j}{2\pi iz_j}}`$
$`=`$ $`c_n{\displaystyle _^n}|\mathrm{\Delta }_n(z)|^{2\beta }{\displaystyle \underset{j=1}{\overset{n}{}}}e^{\beta {\displaystyle \underset{k=1}{\overset{\mathrm{}}{}}}t_kz_j^k}\delta ^{s+(n1)\beta }(z_j)dz_j.`$
Setting $`\beta =2,s=N2n`$ and $`22nN`$ in the last integral , we have, using the standard derivation of the “symplectic” matrix integral, (see )

$`{\displaystyle \frac{1}{n!}}{\displaystyle _^n}\mathrm{\Delta }_n^4(z){\displaystyle \underset{k=1}{\overset{n}{}}}e^{2_{k=1}^{\mathrm{}}t_kz_j^k}\delta ^{N2}(z_j)dz_j`$
$`=`$ $`pf\left({\displaystyle _{}}\{y^k,y^{\mathrm{}}\}e^{2_{i=1}^{\mathrm{}}t_iy^i}\delta ^{(N2)}(y)𝑑y\right)_{0k,\mathrm{}2n1}`$
$`=`$ $`pf\left((k\mathrm{}){\displaystyle _{}}y^{k+\mathrm{}1}e^{2_{i=1}^{\mathrm{}}t_iy^i}\delta ^{(N2)}(y)𝑑y\right)_{0k,\mathrm{}2n1}`$
$`=`$ $`pf\left((k\mathrm{}){\displaystyle \underset{i=0}{\overset{\mathrm{}}{}}}\stackrel{~}{𝐬}_i(t){\displaystyle _{}}y^{i+k+\mathrm{}1}\delta ^{(N2)}(y)𝑑y\right)`$
$`=`$ $`pf\left((1)^{N2}(N2)!(k\mathrm{})\stackrel{~}{𝐬}_{N1k\mathrm{}}(t)\right)_{0k,\mathrm{}2n1}`$
$`=`$ $`c_{N,n}pf\left((\mathrm{}k)\stackrel{~}{𝐬}_{N1k\mathrm{}}(t)\right)_{0k,\mathrm{}2n1}.`$
(7.0.39)
In order to find the initial condition $`m_N(0)`$, one sets $`t=0`$ in the last matrix appearing in (7.0.3), to yield

$$\left((\mathrm{}k)\stackrel{~}{𝐬}_{N1k\mathrm{}}(0)\right)_{0k,\mathrm{}N1}.$$

All entries of this matrix vanish, except the antidiagonal, from which one reads off the $`b_i`$’s:

For $`N`$ even, we have $`b_i=2i+1`$ and thus

$`b_{\lambda _ii+\mathrm{}N/2}`$ $`=`$ $`2\left(\lambda _ii+\mathrm{}{\displaystyle \frac{N}{2}}\right)+1`$
$`=`$ $`\lambda _i\lambda _{\mathrm{}+1i}2i+\mathrm{}+1\text{ using }\lambda _i+\lambda _{\mathrm{}+1i}=N\mathrm{}`$
$`=`$ $`k_ik_{\mathrm{}+1i}\text{ using }k_i=\lambda _ii+2n.`$
For $`N`$ odd, we have $`b_i=2i+2`$ and thus

$`b_{\lambda _ii+\mathrm{}(N+1)/2}`$ $`=`$ $`2\left(\lambda _ii+\mathrm{}{\displaystyle \frac{N+1}{2}}\right)+2`$
$`=`$ $`\lambda _i\lambda _{\mathrm{}+1i}2i+\mathrm{}+1\text{ using }\lambda _i+\lambda _{\mathrm{}+1i}=N\mathrm{}`$
$`=`$ $`k_ik_{\mathrm{}+1i},`$
ending the proof of Proposition 7.1.

Example: For $`n=4`$ and $`b_0=1,b_1=3`$, the solution to the system (1.0.8) is given by

$$L=\frac{1}{(t_2+t_1^2)^2}\left(\begin{array}{cccc}0& 1& 0& 0\\ & & & \\ t_1& 2(t_2t_1^2)& \sqrt{3}t_1& 0\\ & & & \\ \frac{2}{\sqrt{3}}(t_2t_1^2)& \frac{16}{\sqrt{3}}t_1t_2& 2(t_2t_1^2)& 1\\ & & & \\ \sqrt{3}t_1& 2\sqrt{3}(t_2t_1^2)& 3t_1& 0\end{array}\right).$$
(7.0.40)
Indeed

$$m_4=\left(\begin{array}{cccc}0& \stackrel{~}{𝐬}_2& 2\stackrel{~}{𝐬}_1& 3\\ \stackrel{~}{𝐬}_2& 0& 1& 0\\ 2\stackrel{~}{𝐬}_1& 1& 0& 0\\ 3& 0& 0& 0\end{array}\right)=Q^1JQ^1,$$

with

$$Q=D\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& 1& 0& 0\\ 1& 2\stackrel{~}{𝐬}_1& \stackrel{~}{𝐬}_2& 0\\ 0& 3& 0& \stackrel{~}{𝐬}_2\end{array}\right)$$

where

$$D=\mathrm{diag}(\frac{1}{\sqrt{\stackrel{~}{𝐬}_2}},\frac{1}{\sqrt{\stackrel{~}{𝐬}_2}},\frac{1}{\sqrt{3\stackrel{~}{𝐬}_2}},\frac{1}{\sqrt{3\stackrel{~}{𝐬}_2}}).$$

Therefore

$`L`$ $`=`$ $`Q\mathrm{\Lambda }Q^1`$
$`=`$ $`{\displaystyle \frac{1}{\stackrel{~}{𝐬}_2^2}}\left(\begin{array}{cccc}0& 1& 0& 0\\ & & & \\ 2\stackrel{~}{𝐬}_1& 4(\stackrel{~}{𝐬}_2\stackrel{~}{𝐬}_1^2)& 2\sqrt{3}\stackrel{~}{𝐬}_1& 0\\ & & & \\ \frac{4}{\sqrt{3}}(\stackrel{~}{𝐬}_2\stackrel{~}{𝐬}_1^2)& \frac{8\stackrel{~}{𝐬}_1}{\sqrt{3}}(2\stackrel{~}{𝐬}_2\stackrel{~}{𝐬}_1^2)& 4(\stackrel{~}{𝐬}_2\stackrel{~}{𝐬}_1^2)& 1\\ & & & \\ \frac{6}{\sqrt{3}}\stackrel{~}{𝐬}_1& \frac{12}{\sqrt{3}}(\stackrel{~}{𝐬}_2\stackrel{~}{𝐬}_1^2)& 6\stackrel{~}{𝐬}_1& 0\end{array}\right),`$
leads to formula (7.0.5).

### Example 2: Two-column Jack polynomials

###### Proposition 7.2

For even $`N`$, choosing131313$`(a)_k={\displaystyle \frac{\mathrm{\Gamma }(a+k)}{\mathrm{\Gamma }(a)}}=a(a+1)\mathrm{}(a+k1)`$

$$\{\begin{array}{cc}b_0=\mathrm{}=b_{\frac{p}{2}1}=0\hfill & \\ & \\ b_{\frac{p}{2}+k}=\frac{(1\alpha )_k(p+1)_k}{k!(\alpha +p+1)_k},\text{ for }k=0,\mathrm{},\frac{N2p}{2},\hfill & \end{array}$$
(7.0.42)
one finds the most general two-row Jack polynomial for $`\tau _2`$, for arbitrary $`\alpha `$,

$`\tau _2(t)`$ $`=`$ $`pfm_2(t)`$
$`=`$ $`J_{(\frac{N+p2}{2},\frac{Np2}{2})}^{(1/\alpha )}\left(t/\alpha \right)`$
$`=`$ $`c{\displaystyle \frac{dx}{2\pi i}\frac{dy}{2\pi i}\frac{(yx)^{2\alpha }}{(xy)^{\alpha +\frac{N}{2}}}e^{_1^{\mathrm{}}t_i(x^i+y^i)}\left(\frac{x}{y}\right)_2^{p/2}F_1(\alpha ,p;1\alpha p;\frac{y}{x})}`$
and for general $`\mathrm{}2`$,

$`\tau _{\mathrm{}}(t)`$ $`=`$ $`{\displaystyle \frac{2c}{\mathrm{}!!}}{\displaystyle \frac{(z_2z_1)^{2\alpha 1}}{z_2(z_1z_2)^{\alpha 1}}\left(\frac{z_1}{z_2}\right)_2^{p/2}F_1(\alpha ,p;1\alpha p;\frac{z_2}{z_1})}`$
$`{\displaystyle \frac{{\displaystyle \underset{i=2}{\overset{\mathrm{}/2}{}}}\rho (z_{2i}/z_{2i1})}{{\displaystyle \underset{i=1}{\overset{\mathrm{}/2}{}}}z_{2i1}^{\frac{N}{2}2i+3}z_{2i}^{\frac{N}{2}2i+1}}}{\displaystyle \underset{1i<j\mathrm{}}{}}\left(1{\displaystyle \frac{z_i}{z_j}}\right){\displaystyle \underset{j=1}{\overset{\mathrm{}}{}}}e^{_{k=1}^{\mathrm{}}t_kz_j^k}{\displaystyle \frac{dz_j}{2\pi i}},`$
where

$$\rho (x)=\underset{i=0}{\overset{\frac{N2}{2}}{}}b_i(x^{i1}x^i).$$
(7.0.45)
Proof: According to a formula by Stanley , two-column Jack polynomials can be expressed as a linear combination of two-column Schur polynomials. So, setting in the end $`2s=N2p`$, we have

$`\tau _2(t)`$ $`=`$ $`{\displaystyle \underset{k=0}{\overset{\frac{N2}{2}}{}}}b_k𝐬_{\frac{N2}{2}+k,\frac{N2}{2}k}(t),\text{ with }b_k\text{ as in (}\text{7.0.42}\text{),}`$
$`=`$ $`{\displaystyle \underset{k=\frac{p}{2}}{\overset{\frac{N2}{2}}{}}}{\displaystyle \frac{(1\alpha )_{kp/2}(p+1)_{kp/2}(1)^{N2}}{(kp/2)!(\alpha +p+1)_{kp/2}}}𝐬_{\frac{N2}{2}+k,\frac{N2}{2}k}(t)`$
$`=`$ $`{\displaystyle \underset{k=\frac{p}{2}}{\overset{\frac{N2}{2}}{}}}{\displaystyle \frac{(1\alpha )_{kp/2}(p+1)_{kp/2}}{(kp/2)!(\alpha +p+1)_{kp/2}}}𝐬_{2^{\frac{N2}{2}k}1^{2k}}(t)`$
$`=`$ $`{\displaystyle \underset{k=0}{\overset{\frac{Np2}{2}}{}}}{\displaystyle \frac{(1\alpha )_k(p+1)_k}{k!(\alpha +p+1)_k}}𝐬_{2^{\frac{N2}{2}kp/2}1^{2k+p}}(t)`$
$`=`$ $`{\displaystyle \underset{k=0}{\overset{s}{}}}{\displaystyle \frac{(1\alpha )_k(p+1)_k}{k!(\alpha +p+1)_k}}𝐬_{2^{sk}1^{2k+p}}(t)`$
$`=`$ $`J_{2^s1^p}^{(\alpha )}(t)\text{(Stanley’s formula)}`$
$`=`$ $`J_{(p+s,s)}^{(1/\alpha )}(t/\alpha )\text{using duality,}`$
showing that any two-row Jack polynomial can serve as Pfaff $`\tau `$-function $`\tau _2`$.

According to , Jack polynomials also have an integral representation, and so $`\tau _2(t)`$ can also be expressed as

$`\tau _2(t)`$ $`=`$ $`J_{(p+s,s)}^{(1/\alpha )}(t/\alpha )`$
$`=`$ $`c^{}{\displaystyle \frac{dx}{2\pi ix}\frac{dy}{2\pi iy}\frac{dz}{2\pi iz}\frac{(xy)^{2\alpha }(xy)^sz^p}{((xz)(yz))^\alpha }e^{_1^{\mathrm{}}t_i(x^i+y^i)}}`$
$`=`$ $`c^{}{\displaystyle \frac{dx}{2\pi ix}\frac{dy}{2\pi iy}(xy)^{2\alpha }(xy)^se^{_1^{\mathrm{}}t_i(x^i+y^i)}D_z^p((xz)(yz))^\alpha }|_{z=0}`$
$`=`$ $`c^{}(\alpha )_p{\displaystyle \frac{dx}{2\pi ix}\frac{dy}{2\pi iy}\frac{(xy)^{2\alpha }}{(xy)^{\alpha +s}y^p}e_2^{_1^{\mathrm{}}t_i(x^i+y^i)}F_1(\alpha ,p;1\alpha p;\frac{y}{x})},`$
where we used the identity:

$`D_z^p((xz)(yz))^\alpha |_{z=0}`$
$`=`$ $`(xy)^\alpha D_z^p\left(\left(1{\displaystyle \frac{z}{x}}\right)^\alpha \left(1{\displaystyle \frac{z}{y}}\right)^\alpha \right)|_{z=0}`$
$`=`$ $`(xy)^\alpha D_z^p\left({\displaystyle \underset{k,\mathrm{}=0}{\overset{\mathrm{}}{}}}{\displaystyle \frac{(\alpha )_k(\alpha )_{\mathrm{}}}{k!\mathrm{}!}}{\displaystyle \frac{z^{k+\mathrm{}}}{x^ky^{\mathrm{}}}}\right)|_{z=0}`$
$`=`$ $`p!(xy)^\alpha {\displaystyle \underset{k+\mathrm{}=p}{}}{\displaystyle \frac{(\alpha )_k(\alpha )_{\mathrm{}}}{k!\mathrm{}!}}x^ky^{\mathrm{}}`$
$`=`$ $`p!(xy)^\alpha y^p{\displaystyle \underset{k=0}{\overset{p}{}}}{\displaystyle \frac{(\alpha )_k(\alpha )_{pk}}{k!(pk)!}}\left({\displaystyle \frac{y}{x}}\right)^k`$
$`=`$ $`(\alpha )_p(xy)^\alpha y^p{\displaystyle \underset{k=0}{\overset{p}{}}}{\displaystyle \frac{(\alpha )_k(p)_k}{k!(1\alpha p)_k}}\left({\displaystyle \frac{y}{x}}\right)^k`$
$`\text{using }{\displaystyle \frac{p!(\alpha )_{pk}}{(pk)!(\alpha )_p}}={\displaystyle \frac{(p)_k}{(1\alpha p)_k}}`$
$`=`$ $`(\alpha )_p(xy)^\alpha y_2^pF_1(\alpha ,p;1\alpha p;{\displaystyle \frac{y}{x}}).`$
This proves identity (1.0.29).

Applying Theorem 1.3, we find the higher $`\tau _{\mathrm{}}`$’s, by applying the integrated vertex operator

$$Y_{\frac{N2}{2}2j}(t)=\frac{1}{(2\pi i)^2}\underset{\mathrm{}}{}\underset{\mathrm{}}{}X(t;z_{2j+2})X(t;z_{2j+1})\frac{\rho _b(z_{2j+2}/z_{2j+1})dz_{2j+2}dz_{2j+1}}{z_{2j+1}^2(z_{2j+1}z_{2j+2})^{\frac{N2}{2}2j}},$$
(7.0.46)
for $`j=1,2,\mathrm{},(\mathrm{}2)/2`$ to $`\tau _2`$ (see formula (1.0.29)); so, one finds141414replacing $`x,y`$ in $`\tau _2`$ with $`z_1,z_2`$.

$`\tau _{\mathrm{}}`$ $`=`$ $`{\displaystyle \frac{2}{\mathrm{}!!}}Y_{\frac{N}{2}\mathrm{}+1}\mathrm{}Y_{\frac{N}{2}5}Y_{\frac{N}{2}3}\tau _2`$
$`=`$ $`{\displaystyle \frac{2c^{}(\alpha )_p}{\mathrm{}!!}}{\displaystyle \frac{(z_2z_1)^{2\alpha }}{(z_1z_2)^{\alpha +\frac{N}{2}}}\left(\frac{z_1}{z_2}\right)_2^{p/2}F_1(\alpha ,p;1\alpha p;\frac{z_2}{z_1})}`$
$`{\displaystyle \frac{\rho (z_{\mathrm{}}/z_\mathrm{}1)\mathrm{}\rho (z_4/z_3)}{(z_3z_5\mathrm{}z_\mathrm{}1)^2(z_3z_4)^{\frac{N}{2}3}(z_5z_6)^{\frac{N}{2}5}\mathrm{}(z_\mathrm{}1z_{\mathrm{}})^{\frac{N}{2}\mathrm{}+1}}}`$
$`X(t;z_{\mathrm{}})X(t;z_\mathrm{}1)\mathrm{}X(t;z_4)X(t;z_3)e^{_1^{\mathrm{}}t_k(z_1^k+z_2^k)}{\displaystyle \underset{j=1}{\overset{\mathrm{}}{}}}{\displaystyle \frac{dz_j}{2\pi i}}`$
$`=`$ $`{\displaystyle \frac{2c^{}(\alpha )_p}{\mathrm{}!!}}{\displaystyle \frac{(z_2z_1)^{2\alpha }z_1^2(z_1z_2)^{N/21}}{(z_1z_2)^{\alpha +\frac{N}{2}}}\left(\frac{z_1}{z_2}\right)_2^{p/2}F_1(\alpha ,p;1\alpha p;\frac{z_2}{z_1})}`$
$`\left(1{\displaystyle \frac{z_1}{z_2}}\right)^1{\displaystyle \frac{\rho (z_{\mathrm{}}/z_\mathrm{}1)\mathrm{}\rho (z_4/z_3)}{{\displaystyle \underset{1}{\overset{\mathrm{}/2}{}}}z_{2i1}^2(z_{2i1}z_{2i})^{\frac{N}{2}2i+1}}}{\displaystyle \underset{1i<j\mathrm{}}{}}\left(1{\displaystyle \frac{z_i}{z_j}}\right){\displaystyle \underset{j=1}{\overset{\mathrm{}}{}}}e^{_1^{\mathrm{}}t_kz_j^k}{\displaystyle \frac{dz_j}{2\pi i}}`$
$`=`$ $`{\displaystyle \frac{2c^{}(\alpha )_p}{\mathrm{}!!}}{\displaystyle \frac{(z_2z_1)^{2\alpha 1}}{z_2(z_1z_2)^{\alpha 1}}\left(\frac{z_1}{z_2}\right)_2^{p/2}F_1(\alpha ,p;1\alpha p;\frac{z_2}{z_1})}`$
$`{\displaystyle \frac{{\displaystyle \underset{i=2}{\overset{\mathrm{}/2}{}}}\rho (z_{2i}/z_{2i1})}{{\displaystyle \underset{i=1}{\overset{\mathrm{}/2}{}}}z_{2i1}^{\frac{N}{2}2i+3}z_{2i}^{\frac{N}{2}2i+1}}}{\displaystyle \underset{1i<j\mathrm{}}{}}\left(1{\displaystyle \frac{z_i}{z_j}}\right){\displaystyle \underset{j=1}{\overset{\mathrm{}}{}}}e^{_{k=1}^{\mathrm{}}t_kz_j^k}{\displaystyle \frac{dz_j}{2\pi i}},`$
establishing formula (LABEL:c).

Alternative formula: The following formula has the advantage to be more symmetric, but the disadvantage to have many more integrations:

$$\tau _{\mathrm{}}(t)=\underset{i=1}{\overset{\mathrm{}}{}}\underset{j=1}{\overset{i}{}}\frac{dz_j^{(i)}}{z_j^{(i)}}\underset{i=1}{\overset{\mathrm{}}{}}e^{_1^{\mathrm{}}t_k(z_i^{(\mathrm{})})^k}\frac{{\displaystyle \underset{k=1}{\overset{\mathrm{}}{}}}{\displaystyle \underset{\genfrac{}{}{0pt}{}{1i,jk}{ij}}{}}\left(1{\displaystyle \frac{z_i^{(k)}}{z_j^{(k)}}}\right)}{{\displaystyle \underset{k=1}{\overset{\mathrm{}1}{}}}{\displaystyle \underset{\genfrac{}{}{0pt}{}{1ik+1}{1jk}}{}}\left(1{\displaystyle \frac{z_i^{(k+1)}}{z_j^{(k)}}}\right)}K_{N,p,\mathrm{}}(Z)$$

with

$`K_{N,p,\mathrm{}}`$ $`=`$ $`{\displaystyle \frac{\left({\displaystyle \underset{j=1}{\overset{\mathrm{}}{}}}z_j^{(\mathrm{})}\right)^{\frac{Np}{2}1}\left({\displaystyle \underset{j=1}{\overset{\mathrm{}/2}{}}}z_j^{(\mathrm{}/2)}\right)^{p+1}}{{\displaystyle \underset{i=1}{\overset{\mathrm{}1}{}}}{\displaystyle \underset{1}{\overset{i}{}}}z_j^{(i)}}}`$
$`{\displaystyle \underset{i=1}{\overset{\mathrm{}/2}{}}}{}_{2}{}^{}F_{1}^{}(1\alpha ,p+1;1+\alpha +p;{\displaystyle \frac{{\displaystyle \underset{j=1}{\overset{i}{}}}z_j^{(i)}{\displaystyle \underset{j=1}{\overset{\mathrm{}i}{}}}z_j^{(\mathrm{}i)}}{{\displaystyle \underset{j=1}{\overset{i1}{}}}z_j^{(i1)}{\displaystyle \underset{j=1}{\overset{\mathrm{}+ii}{}}}z_j^{(\mathrm{}+1i)}}}).`$