2.1 Symmetric function side

Integer partitions are written $\lambda = (\lambda _{1}\geq \cdots \geq \lambda _{l})$ , sometimes with trailing zeroes allowed. We set $|\lambda | = \lambda _{1}+\cdots +\lambda _{l}$ and let $\ell (\lambda )$ be the number of nonzero parts. We identify a partition $\lambda $ with its French style Ferrers shape, the set of lattice squares (or boxes) with northeast corner in the set

(2) $$ \begin{align} \{(i,j)\mid 1\leq j\leq \ell(\lambda ),\; 1\leq i \leq \lambda _{j} \}. \end{align} $$

The shape generator of $\lambda $ is the polynomial

(3) $$ \begin{align} B_{\lambda }(q,t) = \sum _{(i,j)\in \lambda} q^{i-1}\, t^{j-1}. \end{align} $$

Let $\Lambda = \Lambda _{{\mathbf k} }(X)$ be the algebra of symmetric functions in an infinite alphabet of variables $X = x_{1},x_{2},\ldots $ , with coefficients in the field ${\mathbf k} = {\mathbb Q} (q,t)$ . We follow the notation of Macdonald [Reference Macdonald18] for the graded bases of $\Lambda $ . Basis elements are indexed by a partition $\lambda $ and have homogeneous degree $|\lambda |$ . Examples include the elementary symmetric functions $e_{\lambda } = e_{\lambda _{1}}\cdots e_{\lambda _{k}}$ , complete homogeneous symmetric functions $h_{\lambda } = h_{\lambda _{1}}\cdots h_{\lambda _{k}}$ , power-sums $p_{\lambda } = p_{\lambda _{1}}\cdots p_{\lambda _{k}}$ , monomial symmetric functions $m_{\lambda }$ and Schur functions $s_{\lambda }$ .

As is conventional, $\omega \colon \Lambda \rightarrow \Lambda $ denotes the ${\mathbf k} $ -algebra involution defined by $ \omega s_{\lambda } = s_{\lambda ^*}$ , where $\lambda ^{*}$ denotes the transpose of $\lambda $ , and $\langle -, - \rangle $ denotes the symmetric bilinear inner product such that $\langle s_{\lambda },s_{\mu } \rangle = \delta _{\lambda ,\mu }$ .

The basis of modified Macdonald polynomials, $\tilde {H}_{\mu }(X;q,t)$ , is defined [Reference Garsia and Haiman9] from the integral form Macdonald polynomials $J_{\mu }(X;q,t)$ of [Reference Macdonald18] using the device of plethystic evaluation. For an expression A in terms of indeterminates, such as a polynomial, rational function or formal series, $p_{k}[A]$ is defined to be the result of substituting $a^{k}$ for every indeterminate a occurring in A. We define $f[A]$ for any $f\in \Lambda $ by substituting $p_{k}[A]$ for $p_{k}$ in the expression for f as a polynomial in the power-sums $p_{k}$ so that $f\mapsto f[A]$ is a homomorphism. The variables $q, t$ from our ground field ${\mathbf k} $ count as indeterminates. The modified Macdonald polynomials are defined by

(4) $$ \begin{align} \tilde{H} _{\mu }(X;q,t) = t^{n(\mu )} J_{\mu }\left[\frac{X}{1-t^{-1}};q,t^{-1}\right], \end{align} $$

where

(5) $$ \begin{align} n(\mu ) = \sum _{i} (i-1)\mu _{i}\,. \end{align} $$

For any symmetric function $f\in \Lambda $ , let $f[B]$ denote the eigenoperator on the basis $\{\tilde {H_{\mu }} \}$ of $\Lambda $ such that

(6) $$ \begin{align} f[B]\, \tilde{H} _{\mu } = f[B_{\mu }(q,t)]\, \tilde{H} _{\mu }\,. \end{align} $$

The left-hand side of equation (1) is expressed in the notation of [Reference Haglund, Remmel and Wilson14], where $\Delta _f=f[B]$ and $\Delta _f'=f[B-1]$ . Hence, the symmetric function side of the extended delta conjecture is

(7) $$ \begin{align} h_l[B]e_{k-1}[B-1] e_n\,. \end{align} $$

2.2 The combinatorial side

The right-hand side of the extended delta conjecture (1) is a combinatorial generating function that counts labelled lattice paths.

Definition 2.2.1. A Dyck path is a south-east lattice path lying weakly below the line segment connecting the points $(0,N)$ and $(N,0)$ . The set of such paths is denoted $\mathbf {D}_N$ . The staircase path $\delta $ is the Dyck path alternating between south and east steps.

Each $\lambda \in \mathbf {D}_N$ has $\operatorname {\mathrm {area}}(\lambda )=|\delta /\lambda |$ defined to be the number of lattice squares lying above $\lambda $ and below $\delta $ . Let $r_i(\lambda )$ be the area contribution from squares in the i-th row, numbered from north to south; in other words, $r_{i}$ is the distance from the i-th south step of $\lambda $ to the i-th south step of $\delta $ . Note that

(8) $$ \begin{align} r_1(\lambda)=0,\qquad r_i(\lambda)\leq r_{i-1}(\lambda)+1 \quad \text{for }i>1, \quad\text{and}\quad \sum_{i=1}^{N} r_i(\lambda)=|\delta/\lambda|\,. \end{align} $$

Definition 2.2.2. A labelling $P = (P_1,\dots ,P_N) \in {\mathbb N}^N$ attaches a label in ${\mathbb N}=\{0,1,\ldots \}$ to each south step of $\lambda \in \mathbf {D}_N$ so that the labels increase from north to south along vertical runs of south steps, as shown in Figure 1. The set of labellings is denoted by ${\mathbf {L}}_N(\lambda )$ , or simply ${\mathbf {L}}(\lambda )$ . Given $0\leq l<N$ , a partial labelling of $\lambda \in \mathbf {D}_{N}$ is a labelling where $0$ occurs exactly l times and never on the run at $x=0$ . We denote the set of these partial labellings by ${\mathbf {L}}_{N,l}(\lambda )$ .

Figure 1

A path $\lambda $ and partial labelling $P\in {\mathbf {L}}_{11,2}(\lambda )$ , with $\operatorname {\mathrm {area}}(\lambda )=10$ , $\operatorname {\mathrm {dinv}}(P) = 15$ , $x^{\operatorname {\mathrm {wt}}_+(P)} = x_1^2 x_2 x_3^2 x_4^2 x_5 x_6$ and $x^{\operatorname {\mathrm {wt}}(P)} = x_0^2 x_1^2 x_2 x_3^2 x_4^2 x_5 x_6$ .

Each labelling $P \in {\mathbf {L}}(\lambda )$ is assigned a statistic $\operatorname {\mathrm {dinv}}(P)$ , defined to be the number of pairs $(i < j)$ such that either

(9) $$ \begin{align} \begin{cases} r_i(\lambda)=r_j(\lambda) \text{ and } P_i<P_j \;\;\mathrm{or}\\ r_i(\lambda)=r_j(\lambda)+1 \text{ and } P_i>P_j \,. \end{cases} \end{align} $$

The weight of a labelling P is defined so zero labels do not contribute by

(10) $$ \begin{align} x^{\operatorname{\mathrm{wt}}_+(P)} = \prod_{i\in [N]\colon P_i\neq 0}x_{P_i}\,. \end{align} $$

This is equivalent to letting $x_0 = 1$ in $x^{\operatorname {\mathrm {wt}}(P)} := \prod _{i \in [N]} x_{P_i} $ .

The above defines the right-hand side of (1), with $\langle z^{n-k}\rangle $ denoting the coefficient of $z^{n-k}$ .

Remark 2.2.3. In [Reference Haglund, Remmel and Wilson14], a Dyck path is a northeast lattice path lying weakly above the line segment connecting $(0,0)$ and $(N,N)$ , and labellings increase from south to north along vertical runs. After reflecting the picture about a horizontal line, our conventions on paths, labellings and the definition of $\operatorname {\mathrm {dinv}} (P)$ match those in [Reference Haglund, Remmel and Wilson14]. Separately, [Reference Haglund, Haiman, Loehr, Remmel and Ulyanov13] uses the same conventions that we do for Dyck paths but defines labellings to increase from south to north and defines $\operatorname {\mathrm {dinv}} (P)$ with the inequalities in equation (9) reversed. However, since the sum

(11) $$ \begin{align} \sum_{P \in {\mathbf {L}}(\lambda)} q^{\operatorname{\mathrm{dinv}}(P)} x^{\operatorname{\mathrm{wt}}(P)}\, \end{align} $$

is a symmetric function [Reference Haglund, Haiman, Loehr, Remmel and Ulyanov13], it is unchanged if we reverse the ordering on labels; after which, the conventions in [Reference Haglund, Haiman, Loehr, Remmel and Ulyanov13] agree with those used here.

We prefer another slight modification based on the following lemma which was mentioned in [Reference Haglund, Remmel and Wilson14] without details.

Lemma 2.2.4. For any Dyck path $\lambda \in \mathbf {D}_N$ , we have

(12) $$ \begin{align} \prod_{\substack{1<i\leq N\\r_{i}(\lambda)=r_{i-1}(\lambda)+1}} (1+ z\, t^{-r_i(\lambda)}) = \prod_{\substack{1 <i \leq N \\ c_i(\lambda) = c_{i-1}(\lambda)+1}} (1+z\, t^{-c_i(\lambda)}) \,, \end{align} $$

where $c_i(\lambda )=r_i(\lambda ^*)$ is the contribution to $|\delta /\lambda |$ from boxes in the i-th column, numbered from right to left.

Proof. The condition $r_{i}(\lambda )=r_{i-1}(\lambda )+1$ means that $\lambda $ has consecutive south steps in rows $i-1$ and i with no intervening east step. Similarly, $c_{i}(\lambda )=c_{i-1}(\lambda )+1$ if and only if $\lambda $ has consecutive east steps in columns $i-1$ and i (numbered right to left). Consider the word formed by listing the steps in $\lambda $ in the south-east direction from $(0,N)$ to $(N,0)$ , as shown here for the example in Figure 1.

Treating south and east steps as left and right parentheses, each south step pairs with an east step to its right, and we have $r_{i}(\lambda ) = c_{j}(\lambda )$ if the i-th south step (numbered left to right) pairs with the j-th east step (numbered right to left). Furthermore, the leftmost member of each double south step pairs with the rightmost member of a double east step, as indicated in the word displayed above.

Since each index $i-1$ such that $r_i(\lambda )= r_{i-1}(\lambda )+1$ pairs with an index $j-1$ such that $c_j(\lambda ) = c_{j-1}(\lambda )+1$ , we have

(13) $$ \begin{align} \prod_{\substack{1 < i \leq N \\ r_i(\lambda) = r_{i-1}(\lambda)+1}} (1+z\, t^{-r_{i-1}(\lambda)-1}) \,\,\, = \!\!\! \prod_{\substack{1 < j \leq N \\ c_j(\lambda) = c_{j-1}(\lambda)+1}} (1+z\, t^{-c_{j-1}(\lambda)-1}) \,. \end{align} $$

Now, equation (12) follows.

Setting $N=n+l$ and $m=k+l$ , the right-hand side of equation (1), or the combinatorial side of the extended delta conjecture, is equal to

(14) $$ \begin{align} \langle z^{N-m} \rangle \sum_{\substack{\lambda\in\mathbf {D}_{N}\\ P\in{\mathbf {L}}_{N,l}(\lambda)}} t^{|\delta/\lambda|} \, q^{\operatorname{\mathrm{dinv}}(P)} \, x^{\operatorname{\mathrm{wt}}_+(P)} \prod_{\substack{1 <i \leq N \\ c_i(\lambda)= c_{i-1}(\lambda)+1}} (1+z\, t^{-c_i(\lambda)}) \,. \end{align} $$

3.1 Description of ${\mathcal E}$

Let ${\mathbf k} = {\mathbb Q} (q,t)$ , as in §2. The Schiffmann algebra ${\mathcal E} $ is generated by a central Laurent polynomial subalgebra $F = {\mathbf k} [c_{1}^{\pm 1}, c_{2}^{\pm 1}]$ and a family of subalgebras $\Lambda _{F}(X^{m,n})$ isomorphic to the algebra of symmetric functions $\Lambda _{F}(X)$ over F, one for each pair of coprime integers $(m,n)$ . These are subject to defining relations spelled out below.

For any algebra A containing a copy of $\Lambda $ , there is an adjoint action of $\Lambda $ on A arising from the Hopf algebra structure of $\Lambda $ . Using two formal alphabets X and Y to distinguish between the tensor factors in $\Lambda \otimes \Lambda \cong \Lambda (X) \Lambda (Y)$ , the coproduct and antipode for the Hopf algebra structure are given by the plethystic substitutions

(15) $$ \begin{align} \Delta f = f[X+Y],\qquad S(f) = f[-X]. \end{align} $$

The adjoint action of $f\in \Lambda $ on $\zeta \in A$ is then given by

(16) $$ \begin{align} (\operatorname{\mathrm{Ad}} f)\, \zeta = \sum_{i} f_{i} \, \zeta \, g_{i},\quad \text{where} \quad f[X-Y] = \sum_{i} f_{i}(X)g_{i}(Y) \end{align} $$

since the formula on the right is another way to write $(1\otimes S)\Delta f = \sum _{i} f_{i}\otimes g_{i}$ . More explicitly, we have

(17) $$ \begin{align} (\operatorname{\mathrm{Ad}} p_{n})\, \zeta =[p_{n},\zeta ]\quad \text{and} \quad (\operatorname{\mathrm{Ad}} h_{n})\, \zeta = \sum _{j+k=n} (-1)^{k} h_{j}\, \zeta \, e_{k}. \end{align} $$

The last formula can be expressed for all n at once as a generating function identity

(18) $$ \begin{align} (\operatorname{\mathrm{Ad}} \Omega [zX])\, \zeta = \Omega [zX]\, \zeta\, \Omega [-zX], \end{align} $$

where

(19) $$ \begin{align} \Omega (X) = \sum _{n = 0}^{\infty } h_{n}(X). \end{align} $$

We fix notation for the quantities

(20) $$ \begin{align} M=(1-q)(1-t),\qquad \widehat{M} = (1-(q\, t)^{-1})M, \end{align} $$

which play a role in the presentation of ${\mathcal E} $ and will be referred to again later.

3.1.1 Basic structure and symmetries

The algebra ${\mathcal E}$ is ${\mathbb Z}^2$ graded with the central subalgebra F in degree $(0,0)$ and $f(X^{m,n})$ in degree $(dm,dn)$ for $f(X) $ of degree d in $\Lambda (X)$ .

The universal central extension $\widehat {\operatorname {\mathrm {SL}}_{2}({\mathbb Z} )}\rightarrow \operatorname {\mathrm {SL}} _{2}({\mathbb Z} )$ acts on the set of tuples

(21) $$ \begin{align} \{(m,n,\theta )\in ({\mathbb Z} ^{2}\setminus {\boldsymbol 0})\times {\mathbb R} \mid \theta \text{ is a value of } \arg (m+in) \}, \end{align} $$

lifting the $\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )$ action on pairs $(m,n)$ , with the central subgroup ${\mathbb Z} $ generated by the ‘rotation by $2\pi $ ’ map $(m,n,\theta )\mapsto (m,n,\theta +2\pi )$ . The group $\widehat {\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )}$ acts on ${\mathcal E} $ by ${\mathbf k} $ -algebra automorphisms, compatibly with the action of $\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )$ on the grading group ${\mathbb Z} ^{2}$ . Before giving the defining relations of ${\mathcal E} $ , we specify how $\widehat {\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )}$ acts on the generators.

For each pair of coprime integers $(m,n)$ , we introduce a family of alphabets $X^{m,n}_{\theta }$ , one for each value $\theta $ of $\arg (m+in)$ , related by

(22) $$ \begin{align} X^{m,n}_{\theta+2\pi} = c_1^m c_2^n X^{m,n}_{\theta}. \end{align} $$

We make the convention that $X^{m,n}$ without a subscript means $X^{m,n}_{\theta }$ with $\theta \in (-\pi ,\pi ]$ . For comparison, the implied convention in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2] is $\theta \in [-\pi ,\pi )$ . The subalgebra $\Lambda _{F}(X^{m,n}) = \Lambda _{F}(X^{m,n}_{\theta })$ only depends on $(m,n)$ and so does not depend on the choice of branch for the angle $\theta $ . When we refer to a subalgebra $\Lambda _{{\mathbf k} } (X^{m,n})$ , which does depend on the branch, the convention $\theta \in (-\pi ,\pi ]$ applies.

The $\widehat {\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )}$ action is now given by $\rho \cdot f(X^{m,n}_{\theta }) = f(X^{m',n'}_{\theta '})$ for $f(X)\in \Lambda _{{\mathbf k} }(X)$ , where $\rho \in \widehat {\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )}$ acts on the indexing data in equation (21) by $\rho \cdot (m,n,\theta ) = (m',n',\theta ')$ . Note that, if $m,n$ are coprime, then so are $m',n'$ . The action on F factors through the action of $\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )$ on the group algebra ${\mathbf k} \cdot {\mathbb Z} ^{2}\cong F$ .

For instance, the ‘rotation by $2\pi $ ’ element $\rho \in \widehat {\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )}$ fixes F and has $\rho \cdot f(X_{\theta }^{m,n}) = f(X_{\theta +2\pi }^{m,n}) = f[c_{1}^{m} c_{2}^{n}X^{m,n}_{\theta }]$ . Thus, $\rho $ coincides with multiplication by $c_{1}^{r} c_{2}^{s}$ in degree $(r,s)$ and automatically preserves all relations that respect the ${\mathbb Z} ^{2}$ grading.

We now turn to the defining relations of ${\mathcal E}$ . Apart from the relations implicit in $F = {\mathbf k} [c_{1}^{\pm 1},c_{2}^{\pm 1}]$ being central and each $\Lambda _{F}(X^{m,n})$ being isomorphic to $\Lambda _{F}(X)$ , these fall into three families: Heisenberg relations, internal action relations and axis-crossing relations.

3.1.2 Heisenberg relations

Each pair of subalgebras $\Lambda _{F}(X^{m,n})$ and $\Lambda _{F}(X^{-m,-n})$ in degrees along opposite rays in ${\mathbb Z} ^{2}$ satisfy Heisenberg relations

(23) $$ \begin{align} [p_k(X_{\theta}^{-m,-n}),\, p_l(X_{\theta+\pi}^{m,n})] = \delta_{k,l}\, k \, p_k[(c_{1}^{m}c_{2}^{n}-1) / \widehat{M}], \end{align} $$

where $\widehat {M}$ is given by equation (20). As an exercise, the reader can check, using equation (22), that the relations in equation (23) are consistent with swapping the roles of $\Lambda _{F} (X^{m,n})$ and $\Lambda _{F}(X^{-m,-n})$ .

3.1.3 Internal action relations

The internal action relations describe the adjoint action of each $\Lambda _{F}(X^{m,n})$ on ${\mathcal E} $ . For simplicity, we write these relations and also the axis-crossing relations below, with $\Lambda _{F}(X^{1,0})$ distinguished. The full set of relations is understood to be given by closing the stated relations under the $\widehat {\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )}$ action.

Bearing in mind that $X^{m,n}$ means $X^{m,n}_{\theta }$ with $\theta \in (-\pi ,\pi ]$ , the relations for the internal action of $\Lambda _{F}(X^{1,0})$ are:

(24) $$ \begin{align} \begin{aligned} (\operatorname{\mathrm{Ad}} f(X^{1,0}))\, p_1(X^{m,1}) & = (\omega f)[z] \Bigl| z^k \mapsto p_1(X^{m+ k,1})\\ (\operatorname{\mathrm{Ad}} f(X^{1,0}))\, p_1(X^{m,-1}) & = (\omega f)[-z] \Bigl| z^k \mapsto p_1(X^{m+ k,-1}). \end{aligned} \end{align} $$

3.1.4 Axis-crossing relations

Again distinguishing $\Lambda _{F}(X^{1,0})$ and taking angles on the branch $\theta \in (-\pi ,\pi ]$ , the final set of relations is the closure under the $\widehat {\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )}$ action of

(25) $$ \begin{align} [p_1(X^{b,-1}),\, p_1(X^{a,1})] = -\frac{e_{a+b}[-\widehat{M}X^{1,0}]}{\widehat{M}} \quad \text{for } a+b>0. \end{align} $$

More generally, rotating this relation by $\pi $ determines $[p_1(X^{b,-1}),\, p_1(X^{a,1})]$ for $a + b < 0$ , and the Heisenberg relations determine it when $a + b = 0$ . Combining these gives

(26) $$ \begin{align} [p_1(X^{b,-1}),\, p_1(X^{a,1})] = -\frac{1}{\widehat{M}} \begin{cases} e_{a+b}[-\widehat{M}X^{1,0}] & a+b>0\\ 1-c_1^{-b}c_2 & a + b = 0\\ -c_1^{-b}c_2e_{-(a+b)}[-\widehat{M}X^{-1,0}] & a+b < 0\,.\\ \end{cases} \end{align} $$

3.1.6 Anti-involution

One can check from the defining relations above that ${\mathcal E} $ has a further symmetry given by an involutory antiautomorphism (product reversing automorphism)

(27) $$ \begin{align} \begin{gathered} \Phi \colon {\mathcal E} \rightarrow {\mathcal E} \\ \Phi (g(c_{1},c_{2})) = g(c_{2}^{-1},c_{1}^{-1}),\quad \Phi (f(X^{m,n}_{\theta })) = f(X^{n,m}_{\pi /2-\theta }). \end{gathered} \end{align} $$

Note that $\Phi $ is compatible with reflecting degrees in ${\mathbb Z} ^{2}$ about the line $x = y$ . Together with $\widehat {\operatorname {\mathrm {SL}} _{2}({\mathbb Z} )}$ , it generates a $\widehat {\operatorname {\mathrm {GL}} _{2}({\mathbb Z} )}$ action on ${\mathcal E} $ for which $\rho \in \widehat {\operatorname {\mathrm {GL}} _{2}({\mathbb Z} )}$ is an anti-automorphism if $\widehat {\operatorname {\mathrm {GL}} _{2}({\mathbb Z} )}\rightarrow \operatorname {\mathrm {GL}} _{2}({\mathbb Z} )\overset {\det }{\rightarrow }\{\pm 1 \}$ sends $\rho $ to $-1$ .

3.2 Action of ${\mathcal E} $ on $\Lambda $

We write $f^{\bullet }$ for the operator of multiplication by a function f to better distinguish between operator expressions such as $(\omega f)^{\bullet }$ and $\omega \cdot f^{\bullet }$ . For f a symmetric function, $f^{\perp }$ denotes the $\langle -, - \rangle $ adjoint of $f^{\bullet }$ .

Here and again later on, we use an overbar to indicate inverting the variables in any expression; for example,

(28) $$ \begin{align} \overline{M} = (1-q^{-1})(1-t^{-1}). \end{align} $$

We extend the notation in equation (6) accordingly, setting

(29) $$ \begin{align} f[\overline{B}]\, \tilde{H} _{\mu } = f[B_{\mu }(q^{-1},t^{-1})]\, \tilde{H} _{\mu }\,. \end{align} $$

We will make particular use of operators representing the action on $\Lambda $ of elements $p_{1}(X^{a,1})$ and $p_{1}(X^{1,a})$ in ${\mathcal E} $ . For the first, we need the operator $\nabla $ , defined in [Reference Bergeron, Garsia, Haiman and Tesler1] as an eigenoperator on the modified Macdonald basis by

(33) $$ \begin{align} \nabla \tilde{H} _{\mu } = t^{n(\mu )}q^{n(\mu ^{*})} \tilde{H} _{\mu }, \end{align} $$

where $n(\mu )$ is given by equation (5) and $\mu ^{*}$ denotes the transpose partition.

For the second, we introduce the doubly infinite generating series

(34) $$ \begin{align} D(z) = \omega \Omega [z^{-1}X] ^{\bullet }(\omega \Omega [-z M X])^{\perp }\,, \end{align} $$

where $\Omega (X)$ is given by equation (19).

Definition 3.2.2. For $a\in {\mathbb Z}$ , we define operators on $\Lambda = \Lambda _{{\mathbf k} }(X)$ :

(35) $$ \begin{align} E_a &= \nabla^a e_1(X)^{\bullet }\, \nabla^{-a}, \end{align} $$

(36) $$ \begin{align} D_a &= \langle z^{-a} \rangle D(z). \end{align} $$

The operators $D_a$ are the same as in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2] and differ by a sign $(-1)^{a}$ from those in [Reference Bergeron, Garsia, Haiman and Tesler1, Reference Garsia, Haiman and Tesler10].

3.3 $\operatorname {\mathrm {GL}}_{l}$ characters and the shuffle algebra

As usual, the weight lattice of $\operatorname {\mathrm {GL}} _{l}$ is ${\mathbb Z} ^{l}$ , with Weyl group $W = S_{l}$ permuting the coordinates. A weight $\lambda $ is dominant if $\lambda _{1}\geq \cdots \geq \lambda _{l}$ . A polynomial weight is a dominant weight $\lambda $ such that $\lambda _{l}\geq 0$ . In other words, polynomial weights of $\operatorname {\mathrm {GL}} _{l}$ are integer partitions of length at most l.

As in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2], §2.3, we identify the algebra of virtual $\operatorname {\mathrm {GL}} _{l}$ characters over ${\mathbf k} $ with the algebra of symmetric Laurent polynomials ${\mathbf k} [x_{1}^{\pm 1},\ldots ,x_{l}^{\pm 1}]^{S_{l}}$ . If $\lambda $ is a polynomial weight, the irreducible character $\chi _{\lambda }$ is equal to the Schur function $s_{\lambda }(x_{1},\ldots ,x_{l})$ . Given a virtual $\operatorname {\mathrm {GL}} _{l}$ character $f(x)= f(x_1,\dots ,x_l) = \sum _{\lambda }c_{\lambda }\chi _{\lambda }$ , the partial sum over polynomial weights $\lambda $ is a symmetric polynomial in l variables, which we denote by $f(x)_{\operatorname {\mathrm {pol}} }$ (this is different from the polynomial terms of $f(x)$ considered as a Laurent polynomial). We use the same notation for infinite formal sums $f(x)$ of irreducible $\operatorname {\mathrm {GL}} _{l}$ characters, in which case $f(x)_{\operatorname {\mathrm {pol}} }$ is a symmetric formal power series.

The Weyl symmetrization operator for $\operatorname {\mathrm {GL}} _{l}$ is

(37) $$ \begin{align} {\boldsymbol \sigma } (\phi (x_{1},\ldots,x_{l})) = \sum _{w\in S_{l}} w\left(\frac{\phi (x)}{ \prod _{i<j} (1-x_{j}/x_{i})} \right). \end{align} $$

For dominant weights $\lambda $ , the Weyl character formula can be written $\chi _{\lambda } = {\boldsymbol \sigma } (x^{\lambda })$ . More generally, if $\phi (x) = \phi (x_{1},\ldots ,x_{l})$ is a Laurent polynomial over any field ${\mathbf k} $ , then ${\boldsymbol \sigma } (\phi (x))$ is a virtual $\operatorname {\mathrm {GL}}_{l}$ character over ${\mathbf k} $ .

The Hall–Littlewood symmetrization operator is defined by

(38) $$ \begin{align} {\mathbf H} ^{l}_q(\phi (x)) = {\boldsymbol \sigma } \left( \frac{\phi (x)}{ \prod _{i<j}(1-q\, x_{i}/x_{j})} \right). \end{align} $$

If $\phi (x) = \phi (x_{1},\ldots ,x_{l})$ is a rational function over a field ${\mathbf k} $ containing ${\mathbb Q} (q)$ , then ${\mathbf H} ^{l}_{q}(\phi (x))$ is a symmetric rational function over ${\mathbf k} $ . If $\phi (x)$ is a Laurent polynomial, we can also regard ${\mathbf H} ^{l}_{q}(\phi (x))$ as an infinite formal sum of $\operatorname {\mathrm {GL}} _{l}$ characters with coefficients in ${\mathbf k} $ , by interpreting the factors $1/(1-q\, x_{i}/x_{j})$ as geometric series $1+q\, x_{i}/x_{j}+(q\, x_{i}/x_{j})^2 + \cdots $ . We always understand ${\mathbf H} ^{l}_{q}(\phi (x))$ in this sense when taking the polynomial part ${\mathbf H} ^{l}_{q}(\phi (x))_{\operatorname {\mathrm {pol}} }$ .

We also use the two-parameter symmetrization operator

(39) $$ \begin{align} {\mathbf H}^{l}_{q,t}(\phi(x)) = {\mathbf H}^l_q\left(\phi(x) \prod_{i<j}\frac{ (1-q\,t\,x_{i}/x_{j})} {(1-t\, x_{i}/x_{j})} \right) = {\boldsymbol \sigma } \left(\frac{\phi (x)\prod _{i<j}(1-q\, t\, x_{i}/x_{j})}{\prod _{i<j}\bigl((1-q\, x_{i}/x_{j})(1-t\, x_{i}/x_{j})\bigr)} \right). \end{align} $$

Again, if $\phi (x)$ is a rational function over ${\mathbf k} ={\mathbb Q} (q,t)$ , then ${\mathbf H}^{l}_{q,t}(\phi (x))$ is a symmetric rational function over ${\mathbf k} $ , while if $\phi (x)$ is a Laurent polynomial, or more generally a Laurent polynomial times a rational function which has a power series expansion in the $x_{i}/x_{j}$ for $i<j$ , we can also interpret ${\mathbf H}^{l}_{q,t}(\phi (x))$ as an infinite formal sum of $\operatorname {\mathrm {GL}} _l$ characters, similarly to equation (38). This series interpretation always applies when taking ${\mathbf H}^{l}_{q,t}(\phi (x))_{\operatorname {\mathrm {pol}} }$ .

Fixing ${\mathbf k} ={\mathbb Q} (q,t)$ once again, let $T = T({\mathbf k}[z^{\pm 1}])$ be the tensor algebra on the Laurent polynomial ring in one variable, that is, the noncommutative polynomial algebra with generators corresponding to the basis elements $z^{a}$ of ${\mathbf k} [z^{\pm 1}]$ as a vector space. Identifying $T^{m} = T^{m}({\mathbf k} [z^{\pm 1}])$ with ${\mathbf k}[z_{1}^{\pm 1},\ldots ,z_{m}^{\pm 1}]$ , the product in T is given by ‘concatenation’,

(40) $$ \begin{align} f\cdot g = f(z_{1},\ldots,z_{k})g(z_{k+1},\ldots,z_{k+l}),\quad \text{for } f\in T^{k}, g\in T^{l}. \end{align} $$

The Feigin–Tsymbaliuk shuffle algebra [Reference Feigin and Tsymbaliuk8] is the quotient $S=T/I$ , where I is the graded two-sided ideal whose degree l component $I^{l}\subseteq T^{l}$ is the kernel of the symmetrization operator ${\mathbf H} ^{l}_{q,t}$ in variables $z_{1},\ldots ,z_{l}$ , as explained further in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, §3.5].

Let ${\mathcal E} ^{+} \subseteq {\mathcal E}$ be the subalgebra generated by the $\Lambda _{{\mathbf k} }(X^{m,n})$ for $m>0$ . We leave out the central subalgebra F since the relations of ${\mathcal E} ^{+}$ (as we will see in a moment) do not depend on the central parameters.

The image of ${\mathcal E} ^{+}$ under the antiautomorphism $\Phi $ in §3.1.6 is the subalgebra $\Phi ({\mathcal E} ^{+})$ generated by the $\Lambda _{{\mathbf k} }(X^{m,n})$ for $n>0$ . Note that our convention $\theta \in (-\pi ,\pi ]$ when the subscript is omitted yields $\Phi (f(X^{m,n})) = f(X^{n,m})$ for $\Lambda _{{\mathbf k} }(X^{m,n})\subseteq {\mathcal E} ^{+}$ since the branch cut is in the third quadrant.

Schiffmann and Vasserot [Reference Schiffmann and Vasserot25] proved the following result. See [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, §3.5] for more details on the translation of their theorem into our notation.

To be clear, on monomials in m variables, representing elements of tensor degree m in S, the maps in Proposition 3.3.1 are given by

(41) $$ \begin{align} \psi (z_{1}^{a_{1}}\cdots z_{m}^{a_{m}})& = p_{1}[-M X^{1,a_{1}}]\cdots p_{1}[-M X^{1,a_{m}}] \end{align} $$

(42) $$ \begin{align} \psi ^{\operatorname{\mathrm{op}} }(z_{1}^{a_{1}}\cdots z_{m}^{a_{m}})& = p_{1}[-M X^{a_{m},1}]\cdots p_{1}[-M X^{a_{1},1}]. \end{align} $$

Later, we will need the following formula for the action of $\psi (\phi (z))$ on $\Lambda (X)$ .

Proposition 3.3.2 [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, Proposition 3.5.2].

Let $\phi (z) = \phi (z_{1},\ldots ,z_{l})$ be a Laurent polynomial representing an element of tensor degree l in S, and let $\zeta = \psi (\phi (z)) \in {\mathcal E} ^{+}$ be its image under the map in equation (41). With ${\mathcal E} $ acting on $\Lambda $ as in Proposition 3.2.1, we have

(43) $$ \begin{align} \omega (\zeta \cdot 1)(x_{1},\ldots,x_{l}) = {\mathbf H}^l _{q,t}(\phi(x))_{\operatorname{\mathrm{pol}} }. \end{align} $$

4.1 Distinguished elements $D_{{\mathbf b} }$ and $E_{{\mathbf a} }$

Negut [Reference Negut19] defined a family of distinguished elements $D_{{\mathbf b} }\in {\mathcal E} ^{+}$ , indexed by ${\mathbf b} \in {\mathbb Z} ^{l}$ , which in the case $l=1$ reduce to the elements in Proposition 3.2.3(i). Here, a remarkable symmetry between these elements and their images $E_{{\mathbf a} }$ under the anti-involution $\Phi $ will play a crucial role. After defining the Negut elements, we derive this symmetry in Proposition 4.3.3 with the help of a commutator formula of Negut [Reference Negut20].

Definition 4.1.1 (see also [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, §3.6]).

Given ${\mathbf b} = (b_1,\ldots ,b_l) \in {\mathbb Z}^l$ , set

(44) $$ \begin{align} \phi ({z}) = \frac{z_{1}^{b_1}\cdots z_{l}^{b_{l}}}{ \prod _{i=1}^{l-1}(1-q\, t\, z_{i}/z_{i+1})}, \end{align} $$

and let $\nu (z)=\nu (z_{1},\ldots ,z_{l})$ be a Laurent polynomial satisfying ${\mathbf H}_{q,t}^l(\nu (z)) = {\mathbf H}_{q,t}^l(\phi (z))$ . Such a $\nu (z)$ exists by [Reference Negut19, Proposition 6.1] and represents a well-defined element of the shuffle algebra S. The Negut element $D_{{\mathbf b} }$ and the transposed Negut element $E_{{\mathbf a} }$ , where ${\mathbf a} = (b_{l},\ldots ,b_{1})$ is the reversed sequence of indices, are defined by

(45) $$ \begin{align} D_{{\mathbf b}} = D_{b_{1},\ldots,b_{l}} & = \psi (\nu (z)) \in {\mathcal E}^+ \end{align} $$

(46) $$ \begin{align} E_{{\mathbf a} } = E_{b_{l},\ldots,b_{1}} & =\Phi ( D_{\mathbf b} ) = \psi ^{\operatorname{\mathrm{op}} }(\nu (z))\in \Phi({\mathcal E} ^{+}). \end{align} $$

We should point out that, strictly speaking, the Negut elements in the case $l=1$ are defined to be elements $D_{a} = p_{1}[-M X^{1,a}]$ and $E_{a} = p_{1}[-M X^{a,1}]$ of ${\mathcal E} $ , while in Definition 3.2.2, we used the notation $D_{a}$ and $E_{a}$ for operators on $\Lambda $ . However, by Proposition 3.2.3, these Negut elements act as the operators with the same name, so no confusion should ensue.

Later, we will use the following product formulas, which are immediate from Definition 4.1.1.

(47) $$ \begin{align} D_{b_{1},\ldots,b_{l}}\, D_{b_{l +1},\ldots,b_{n}} &= D_{b_{1},\ldots,b_{n}} - q\, t\, D_{b_{1},\ldots,b_{l} + 1, b_{l +1} - 1,\ldots,b_{n}}\,, \end{align} $$

(48) $$ \begin{align} E_{a_{n},\ldots,a_{l +1}}\, E_{a_{l},\ldots,a_{1}} &= E_{a_{n},\ldots,a_{1}} - q\, t\, E_{a_{n},\ldots, a_{l +1} - 1,a_{l} + 1,\ldots,a_{1}}\,. \end{align} $$

As noted in §3.1.5, the internal action relations determine the action of $\Lambda _{{\mathbf k} }(X^{0,1})$ on $\Phi ( {\mathcal E} ^{+})$ . Using the anti-isomorphism between $\Phi ({\mathcal E} ^{+})$ and the shuffle algebra, we can make this more explicit.

Lemma 4.1.2. Let $\phi (z)=\phi (z_{1},\ldots ,z_{n})$ be a Laurent polynomial representing an element of tensor degree n in S. Then

(49) $$ \begin{align} (\operatorname{\mathrm{Ad}} f(X^{1,0}))\, \psi ^{\operatorname{\mathrm{op}} }(\phi (z)) = \psi ^{\operatorname{\mathrm{op}} }\bigl((\omega f)(z_{1},\ldots,z_{n})\cdot \phi (z)\bigr). \end{align} $$

As a particular consequence, we have

(50) $$ \begin{align} (\operatorname{\mathrm{Ad}} f(X^{1,0})) E_{a_{n},\ldots,a_{1}}= \psi^{\operatorname{\mathrm{op}}}\left( \frac{(\omega f)(z_{1},\ldots,z_{n})\cdot z_{1}^{a_{1}}\cdots z_{n}^{a_{n}}}{\prod_{i=1}^{n-1} (1-q\, t\, z_{i} / z_{i+1})}\right). \end{align} $$

4.2 Commutator identity

We use a formula for the commutator of elements $D_{a}$ and $D_{{\mathbf b} }$ and a similar identity for $E_{a}$ and $E_{{\mathbf b} }$ . This commutation relation was proved geometrically by Negut in [Reference Negut20], but to keep things self-contained, we provide an elementary algebraic proof. It is convenient to express the formula using the notation

(51)

As a mnemonic device, note that both cases can be interpreted as $\sum _{i = a}^{\infty } f_i - \sum _{i = b+1}^{\infty } f_i$ .

Proposition 4.2.1 [Reference Negut20, Proposition 4.7].

For any $a\in {\mathbb Z}$ and $\mathbf {b} = (b_1,\ldots ,b_l) \in {\mathbb Z}^l$ , we have

(52)

(53)

We will need the following lemma for the proof. The notation $\Omega (X)$ is defined in equation (19). Since plethystic substitution into $\Omega (X)$ is characterized by

(54) $$ \begin{align} \Omega [a_{1}+a_{2}+\cdots -b_{1}-b_{2}-\cdots ] = \frac{\prod _{i}(1-b_{i})}{\prod _{i}(1-a_{i})}, \end{align} $$

we have

(55) $$ \begin{align} \Omega[Mz] = \frac{(1-q\, z)(1-t\, z)}{(1-z) (1-q\, t\, z)} \quad \text{and}\quad \Omega[-Mz] = \frac{(1-z) (1-q\, t\, z)}{(1-q\,z)(1-t\, z)}\,. \end{align} $$

Lemma 4.2.2. For any $f(z)=f(z_1,\ldots ,z_m)$ antisymmetric in $z_i$ and $z_{i+1}$ , we have

(56) $$ \begin{align} {\mathbf H}^m_{q,t}\bigl(\Omega[M\, z_i/z_{i+1}] f(z)\bigr) = 0 \,. \end{align} $$

Proof. The definition of ${\mathbf H}^m_{q,t}$ and equation (55) imply that

(57) $$ \begin{align} {\mathbf H}^m_{q,t}\bigl(\Omega[M\, z_i/z_{i+1}]f(z)\bigr) = \sum_{w\in S_m} w\left( f(z)\prod_{j \neq k} \frac{1}{1-z_j/z_k}\prod_ {\substack{j<k \\ (j,k)\neq (i,i+1)}} \Omega[-M\, z_j/z_{k}] \right), \end{align} $$

which vanishes since $f(z)$ is antisymmetric in $z_i$ and $z_{i+1}$ .

Proof of Proposition 4.2.1.

Identity (53) for $[E_{b_{l},\ldots ,b_{1}},\, E_{a}]$ follows from equation (52) by applying the antihomomorphism $\Phi $ , so we only prove equation (52), which can be written

(58)

Using Definition 4.1.1 and the isomorphism $\psi \colon S\rightarrow {\mathcal E} ^{+}$ , we can prove equation (58) by showing that a rational function representing the left-hand side is in the kernel of the symmetrization operator ${\mathbf H} ^{l+1}_{q,t}$ . For this, we can work directly with the rational functions $\phi (z)$ in equation (44); there is no need to replace them explicitly with Laurent polynomials having the same symmetrization.

Let $\phi (z)$ be the function in equation (44) for $D_{{\mathbf b} }$ , and set

(59) $$ \begin{align} \phi (\hat z_i) = \phi(z_1,\ldots,z_{i-1},z_{i+1},\ldots,z_{l+1}) = \dfrac{z_{1}^{ b_1}\cdots z_{i-1}^{b_{i-1}}z_{i+1}^{b_{i}}\cdots z_{l+1}^{b_{l} }}{ (1-q\, t\, z_{i-1}/z_{i+1})\prod\limits _ {\substack{1\leq j\leq l\\ j\neq i,i-1}} (1-q\, t\, z_{j}/z_{j+1})}\,. \end{align} $$

To prove equation (58), we want to show

(60)

Since $z_i^a\phi (\hat z_i) -\phi (\hat z_{i+1})z_{i+1}^a$ is antisymmetric in $z_i$ and $z_{i+1}$ , Lemma 4.2.2 implies

(61) $$ \begin{align} \sum _{i=1}^{l} {\mathbf H}_{q,t}^{l+1} \biggl( \Omega [M\, z_{i}/z_{i+1}] (z_i^a\phi(\hat z_i) -\phi(\hat z_{i+1})z_{i+1}^a) \biggr) = 0. \end{align} $$

The first formula in equation (55) is algebraically the same as

$$\begin{align*}\Omega[M\, z] = 1-\dfrac{M}{(1-z^{-1})(1-q\, t\, z)}.\end{align*}$$

After substituting this into equation (61), the linearity of ${\mathbf H}_{q,t}^{l+1}$ gives

(62) $$ \begin{align} {\mathbf H}_{q,t}^{l+1}\bigg(\sum_{i = 1}^{l} \Big(z_i^a\phi(\hat{z_i}) -\phi(\hat{z_{i+1}})z_{i+1}^a -M \frac{z_i^a\phi(\hat{z_i}) -\phi(\hat{z_{i+1}})z_{i+1}^a}{(1-z_{i+1}/z_i)(1-q\, t\, z_i/z_{i+1})}\Big) \bigg)=0. \end{align} $$

The terms $z_i^a\phi (\hat {z_i}) -\phi (\hat {z_{i+1}})z_{i+1}^a$ telescope, reducing this to

(63) $$ \begin{align} {\mathbf H}_{q,t}^{l+1}\bigg( z_1^a\phi(\hat{z_1 }) -\phi(\hat{z_{l+1}})z_{l+1}^a -M \sum_{i = 1}^{l} \frac{z_i^a\phi(\hat{z_i}) -\phi(\hat{z_{i+1}})z_{i+1}^a}{(1-z_{i+1}/z_i)(1-q\, t\, z_i/z_{i+1})}\bigg)=0. \end{align} $$

If we use the convention $z_0=0$ and $z_{l+2}=\infty $ , collecting terms in $z_{i}^{a}\phi (\hat {z_{i}})$ and some further algebra manipulations give

$$ \begin{align*} \sum _{i=1}^{l} \frac{z_i^a \phi(\hat{z_i}) - \phi(\hat{z_{i+1}}) z_{i+1}^a}{(1 - \frac{z_{i+1}}{z_{i}})(1 - q\, t \frac{z_{i}}{z_{i+1}})} & = \sum _{i=1}^{l+1} \left[\frac{1}{(1 - \frac{z_{i+1}}{z_{i}})(1 - q\, t\frac{z_{i}}{z_{i+1}})} - \frac{1}{(1 - \frac{z_{i}}{z_{i-1}})(1 - q\, t\frac{z_{i-1}}{z_{i}})}\right] z_i^a \phi(\hat{z_i}) \\ & = \sum _{i=1}^{l+1} \frac{z_i^a \phi(\hat{z_i}) (1 - q\, t \frac{z_{i-1}}{z_{i+1}})}{(1 - q\, t \frac{z_{i-1}}{z_{i}})(1 - q\, t \frac{z_{i}}{z_{i+1}})} \Big( \frac{1}{1 - \frac{z_{i+1}}{z_{i}}} - \frac{1}{1 - \frac{z_{i}}{z_{i-1}}}\Big)\\ & = \sum _{i=1}^{l+1} \frac{\dfrac{z_i^a \phi(\hat{z_i}) (1 - q\, t \frac{z_{i-1}}{z_{i+1}})}{(1 - q\, t \frac{z_{i-1}}{z_{i}})(1 - q\, t \frac{z_{i}}{z_{i+1}})} - \dfrac{z_{i+1}^a \phi(\hat{z_{i+1}}) (1 - q\, t \frac{z_{i}}{z_{i+2}})}{(1 - q\, t \frac{z_{i}}{z_{i+1}})(1 - q\, t \frac{z_{i+1}}{z_{i+2}})}}{1 - \frac{z_{i+1}}{z_i}}\,. \end{align*} $$

Expanding the definition (59) of $\phi (\hat {z_{i}})$ for each i yields

$$ \begin{align*} \frac{z_i^a \phi(\hat{z_i}) (1 -q\, t\, z_{i-1}/z_{i+1})}{(1 -q\, t\, z_{i-1} / z_{i}) (1- q\, t\, z_{i}/z_{i+1})} = \frac{z_1^{b_1}\cdots z_{i-1}^{b_{i-1}} z_i^a z_{i+1}^{b_i} \cdots z_{l+1}^{b_l}}{\prod_{j=1}^{l} (1 - q\, t\, z_j / z_{j+1})} \, \end{align*} $$

so that

Identity (60) follows by substituting this back into equation (63).

4.3 Symmetry identity for $D_{{\mathbf b} }$ and $E_{{\mathbf a} }$

Next, we will prove an identity between certain instances of the Negut elements $D_{{\mathbf b} }\in {\mathcal E} ^{+}$ and transposed Negut elements $E_{{\mathbf a} }\in \Phi ({\mathcal E} ^{+})$ . Before stating the identity, we need to describe how the indices ${\mathbf a} $ and ${\mathbf b} $ will correspond.

Note that, if $\gamma ^{*}$ is the transpose of an admissible path $\gamma $ with ${\mathbf b} (\gamma ) = (b_1, \ldots , b_m)$ and ${\mathbf a} (\gamma ) = (a_n, \ldots , a_1)$ , as above, then ${\mathbf a} (\gamma ^{*}) = (b_m,\dots ,b_1) $ and ${\mathbf b} (\gamma ^{*}) = (a_1,\dots ,a_n)$ , and $E_{\gamma } =\Phi (D_{\gamma ^*})$ .

Example 4.3.2. Paths $\gamma $ and $\gamma ^*$ below are both admissible. Path $\gamma $ is from $(0,8)$ to $(4,0)$ with ${\mathbf b}(\gamma )=(2,1,3,2)$ and ${\mathbf a}(\gamma )=(0,1,1,0,0,1,0,1)$ , whereas $\gamma ^*$ is from $(0,4)$ to $(8,0)$ and has ${\mathbf a}(\gamma ^*)=(2,3,1,2)$ and ${\mathbf b}(\gamma ^*)=(1,0,1,0,0,1,1,0)$ .

Proof. Let $\gamma $ be an admissible path $\gamma $ from $(0,n)$ to $(m,0)$ , where $m,n$ are positive integers.

We first establish the case when $n = 1$ . In this case, $E_{\gamma } = E_{m} = p_{1}[-M X^{m,1}]$ and $D_{\gamma } = D_{10^{m-1}}$ . If $m=1$ , these are $E_{1} = D_{1} = p_{1}[-M X^{1,1}]$ . In general, equation (24) implies $E_{m}= p_1[-M X^{m,1}] = (\operatorname {\mathrm {Ad}} p_1(X^{1,0}))^{m-1} p_1[-M X^{1,1}] = (\operatorname {\mathrm {Ad}} p_1(X^{1,0}))^{m-1} D_{1}$ , while equation (17) and the commutator identity (52) imply $(\operatorname {\mathrm {Ad}} p_1(X^{1,0})) D_{10^k} = [p_1(X^{1,0}),\, D_{10^k}] = -(1/M)[D_0, D_{10^k}] = D_{10^{k+1}}$ , and therefore $(\operatorname {\mathrm {Ad}} p_{1}(X^{1,0}))^{m-1} D_{1} = D_{10^{m-1}}$ .

Using the involution $\Phi $ , we can deduce the $m=1$ case from the $n=1$ case:

(64) $$ \begin{align} D_{\gamma} = D_n = \Phi (E_n) = \Phi (D_{1,0^{n-1}}) = E_{0^{n-1},1} = E_{\gamma}. \end{align} $$

For $m, n> 1$ , we proceed by induction, assuming that the result holds for paths from $(0,n')$ to $(m',0)$ when $m'\leq m$ and $n'\leq n$ and $(m',n')\not =(m,n)$ .

For a given $m,n$ , there are finitely many admissible paths $\gamma $ , and thus a finite-dimensional space V of linear combinations $\sum _{\gamma } c_{\gamma } D_{\gamma }$ involving these paths. Let $V'\subseteq V$ denote the subspace consisting of linear combinations which form the left-hand side of a valid instance of the identity

(65) $$ \begin{align} \sum _{\gamma } c_{\gamma } D_{\gamma } = \sum _{\gamma } c_{\gamma } E_{\gamma }. \end{align} $$

Note that $V'=V$ if and only if $D_{\gamma } = E_{\gamma }$ for all the paths $\gamma $ in question.

We will use the induction hypothesis to construct enough instances of equation (65) to reduce each $D_{\gamma }$ modulo $V'$ to a scalar multiple of $D_{\gamma _{0}}$ , where $\gamma _0$ is the path with a south run from $(0,n)$ to $(0,0)$ followed by an east run to $(m,0)$ . We will then prove one more instance of equation (65) for which the left-hand side reduces to a nonzero scalar multiple of $D_{\gamma _{0}}$ , showing that $V' = V$ .

Suppose now that $\gamma \not =\gamma _{0}$ . Then $\gamma $ contains an east step from $(m_1-1, n_2)$ to $(m_1, n_2)$ and a south step from $(m_1, n_2)$ to $(m_1, n_2-1)$ for some $m_1+m_2=m$ and $n_1+n_2=n$ . In particular, $\gamma = \nu \cdot \eta $ for shorter admissible paths $\nu $ and $\eta $ , where $\nu \cdot \eta $ is defined to be the lattice path obtained by placing $\nu $ and $\eta $ end to end; thus, $\nu \cdot \eta $ traces a copy of $\nu $ from $(0,n_1 + n_2)$ to $(m_1,n_2) $ and then traces a copy of $\eta $ from $(m_1, n_2)$ to $(m_1 + m_2,0)$ .

Define $\gamma '=\nu \cdot ' \eta $ to be the admissible path obtained from $\nu \cdot \eta $ by replacing the east-south corner at $(m_1,n_2)$ with a south-east corner at $(m_1-1,n_2 -1)$ ; $\gamma '$ contains a south step from $(m_1-1, n_2)$ to $(m_1-1, n_2-1)$ and an east step from $(m_1 -1, n_2 -1)$ to $(m_1 , n_2-1)$ .

The product formulas (47) and (48) imply that the elements corresponding to the paths constructed in this way satisfy

(66) $$ \begin{align} D_{\nu} D_{\eta} = D_{\nu\cdot\eta} - q\, t\, D_{\nu\cdot'\eta} \qquad\text{and}\qquad E_{\nu} E_{\eta} = E_{\nu\cdot\eta} - q\, t\, E_{\nu\cdot'\eta} \,. \end{align} $$

By induction, $D_{\nu }=E_{\nu }$ and $D_{\eta } =E_{\eta }$ , so equation (66) implies $D_{\gamma } - q\, t\, D_{\gamma '} = E_{\gamma } - q\, t\, E_{\gamma '}$ . In other words, in terms of the space $V'$ defined above, we have $D_{\gamma } \equiv q\, t\, D_{\gamma '} \pmod {V'}$ . Using this repeatedly, we obtain $D_{\gamma }\equiv (q\, t)^{h(\gamma )} D_{\gamma _{0}}\pmod {V'}$ for every path $\gamma $ , where $h(\gamma )$ is the area enclosed by the path $\gamma $ and the x and y axes.

To complete the proof it suffices to establish one more identity of the form (65), for which the congruences $D_{\gamma }\equiv (q\, t)^{h(\gamma )} D_{\gamma _{0}}\pmod {V'}$ reduce the left-hand side to a nonzero scalar multiple of $D_{\gamma _{0}}$ .

We can assume by induction that $D_{n,0^{m-2}} = E_{0^{n-1},m-1}$ since this case has the same n and a smaller m. Taking the commutator with $p_{1}(X^{1,0})$ on both sides gives

(67) $$ \begin{align} -\frac{1}{M}[D_{0},\, D_{n,0^{m-2}}] = [p_1(X^{1,0}),\, D_{n,0^{m-2}}] = (\operatorname{\mathrm{Ad}} p_1(X^{1,0})) E_{0^{n-1},m-1}. \end{align} $$

Using equation (52) on the left-hand side and equation (50) on the right-hand side gives

(68) $$ \begin{align} \sum\limits_{k=0}^{n-1}D_{(n-k,k,0^{m-2})} = \sum\limits_{k = 0}^{n-1} E_{(0^{n-1},m-1)+\varepsilon_{n-k}}. \end{align} $$

Now, for $1\leq k\leq n-1$ , we have $D_{(n-k,k,0^{m-2})} = D_{\gamma }$ and $E_{(0^{n-1}, m-1)+\varepsilon _{n-k}} = E_{\gamma }$ for an admissible path with $h(\gamma ) = k$ , as displayed below.

This shows that equation (68) is an instance of equation (65). The previous congruences reduce the left-hand side of (68) to $(1+q\, t+\cdots +(q\, t)^{n-1}) D_{\gamma _{0}}$ . Since the coefficient is nonzero, we have now established a set of instances of equation (65) whose left-hand sides span V.

Corollary 4.3.4. For any indices $a_1, \dots , a_l$ , we have

(69) $$ \begin{align} E_{a_l, \dots, a_2, a_1}\cdot 1 = E_{a_l, \dots, a_2, 0}\cdot 1. \end{align} $$

4.4 Shuffling the symmetric function side of the extended delta conjecture

We can now give the promised reformulation of (7).

Theorem 4.4.1. For $0\leq l<m\leq N$ , we have

(70) $$ \begin{align} \bigl( \omega ( h_l[B]e_{m-l-1}[B-1] e_{N-l}) \bigr) (x_1,\ldots,x_{m}) = {\mathbf H}^{m}_{q,t} \left( \phi(x)\right)_{\mathrm{ pol}}\,, \end{align} $$

where

(71) $$ \begin{align} \phi(x)= \frac{x_1\cdots x_{m}}{\prod _{i } (1 - q\, t\, x_i/x_{i+1})} h_{N-m}(x_1,\ldots,x_{m}) \overline{e_l(x_2,\ldots,x_{m})}, \end{align} $$

and $\overline {e_l(x_2,\ldots ,x_{m})} = e_l(x_2^{-1},\ldots ,x_{m}^{-1})$ by our convention on the use of the overbar.

Proof. For any symmetric function f set $g(X) = (\omega f)[X+1/M]$ ; then equation (31) gives an identity in $\Lambda $ for every $\zeta \in {\mathcal E} $

(72) $$ \begin{align} f[B]\, \zeta \cdot 1 = g(X^{1,0})\, \zeta \cdot 1 = \sum ((\operatorname{\mathrm{Ad}} g_{(1)}(X^{1,0}))\, \zeta )\, g_{(2)}(X^{1,0}) \cdot 1, \end{align} $$

where $g[X+Y] = \sum g_{(1)}(X)g_{(2)}(Y)$ in Sweedler notation and we used the general formula $g \,\zeta = \sum ((\operatorname {\mathrm {Ad}} g_{(1)}) \zeta )g_{(2)}$ . Since $g[X+Y] = (\omega f)[X+Y+1/M]$ , and $h[B]\cdot 1 = h[0]\cdot 1$ for any $h(X)$ , the right-hand side of equation (72) is equal to

(73) $$ \begin{align} \sum &((\operatorname{\mathrm{Ad}} \, (\omega f)_{(1)}(X^{1,0}))\, \zeta )\, (\omega f)_{(2)}[X^{1,0}+1/M] \cdot 1 \notag \\ &\qquad\qquad\qquad = \sum ((\operatorname{\mathrm{Ad}} \, (\omega f)_{(1)}(X^{1,0}))\, \zeta )\, (\omega f)_{(2)}[0] \cdot 1 = ((\operatorname{\mathrm{Ad}} \, (\omega f)(X^{1,0}))\, \zeta )\cdot 1. \end{align} $$

Let $n=N-l$ . Taking $\zeta = E_{a_{n},\ldots ,a_{1}}$ and using equation (50), this gives

(74) $$ \begin{align} f[B] E_{a_n,\ldots,a_1}\cdot 1 = f(z_{n},\ldots ,z_{1}) \mathbin{\Big|} {z_n^{r_n}\cdots z_1^{r_1}\mapsto E_{a_n + r_n, \ldots, a_2 + r_2, a_1+r_{1}}} \cdot 1. \end{align} $$

By Corollary 4.3.4, the right-hand side is a function of $f(z_{n},\ldots ,z_{2},1)$ since the substitution for the monomial $z^{\mathbf {r}}$ does not depend on the exponent $r_{1}$ . Expressing $f(z_{n},\ldots ,z_{2},1)$ as $f[z_{n}+\cdots +z_{2}+1]$ and then substituting $f[X-1]$ for $f(X)$ yields

(75) $$ \begin{align} f[B-1] E_{a_n,\ldots,a_1}\cdot 1 = f[z_{n} +\cdots +z_{2}] \mathbin{\Big|} {z_n^{r_n}\cdots z_2^{r_2}\mapsto E_{a_n + r_n, \ldots, a_2 + r_2, a_1}} \cdot 1. \end{align} $$

By [Reference Negut19, Proposition 6.7], $E_{0^n} = \Phi (D_{0^n}) = \Phi (e_n[-MX^{1,0}]) = e_n[-MX^{0,1}]$ (see also [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, Proposition 3.6.1]).

Using equation (75), we therefore obtain

(76) $$ \begin{align} e_{k-1}[B-1]e_n =e_{k-1} [z_n+\cdots+z_2] \mathbin{\Big|} z_n^{r_n}\cdots z_2^{r_2}&\mapsto E_{r_n, \ldots, r_2, 0} \cdot 1 \notag\\ &=\sum\limits_{|I|=k-1} E_{\varepsilon_I,0}\cdot 1 = \sum\limits_{|I|=k-1} E_{\varepsilon_I,1}\cdot 1\,, \end{align} $$

where the sum is over subsets $I\subseteq [n-1]$ and $\varepsilon _{I} = \sum _{i\in I}\varepsilon _{i}$ . The terms in the last sum are just $E_{{\mathbf a}(\nu )}\cdot 1$ for paths $\nu $ from $(0,n)$ to $(k,0)$ with single east steps on any $k-1$ chosen lines $y=j$ for $j\in [n-1]$ , and a final east step at $y = 0$ . Denote the set of these admissible paths by $\mathcal P_{k,n}$ . For instance, with $n=8$ and $k=4$ , the path $\gamma $ in Example 4.3.2 corresponds to $E_{\gamma } = E_{0,1,1,0,0,1,0,1}$ .

By equation (74), applying $h_l[B]$ to equation (76) gives

(77) $$ \begin{align} h_l[B]e_{k-1}[B-1]e_n = \sum_{\nu\in\mathcal P_{k,n}} \; \sum_{\substack{{\mathbf r} \in\mathbb N^{n} \\ |{\mathbf r} |=l}} E_{{\mathbf r} +{\mathbf a}(\nu)}\cdot 1 \,. \end{align} $$

This last expression is the sum of $E_{\gamma }\cdot 1$ over admissible paths $\gamma $ from $(0,n)$ to $(k+l,0)$ , together with a choice of $k-1$ indices $j\in [n-1]$ for which $\gamma $ has at least one east step on the line $y = j$ . We can consider these indices as distinguishing $k-1$ east-south corners in $\gamma $ . However, we can also distinguish these corners by their x coordinates, that is, by a set of $k-1$ indices $i\in [k+l-1]$ for which $\gamma $ has at least one south step on the line $x = i$ . Setting $m = k+l$ and using Proposition 4.3.3, this yields the identity

(78) $$ \begin{align} h_l[B] e_{m-l-1}[B-1] e_n = \sum_{\substack{{\mathbf s} \in {\mathbb N}^{m}: |{\mathbf s} |=n-k \\ I\subseteq [2,m],|I|=l}} D_{{\mathbf s} + (1^{m})-\varepsilon_I}\cdot 1 \,. \end{align} $$

Now, since

(79) $$ \begin{align} \sum _{\substack{{\mathbf s} \in {\mathbb N} ^{m}: |{\mathbf s}|=n-k \\ I\subseteq [2,m],|I|=l}} {x^{{\mathbf s} + (1^{m}) - \varepsilon_I}} = x_1\, x_2 \cdots x_{m} h_{n-k}(x_1,\ldots, x_{m})\overline{e_l(x_2,\ldots,x_{m})}\,, \end{align} $$

the definition of $D_{{\mathbf b} }$ and Proposition 3.3.2 imply that

(80) $$ \begin{align} \omega \biggl(\, \, \sum_{\substack{{\mathbf s} \in {\mathbb N}^{m}: |{\mathbf s} |=n-k \\ I\subseteq [2,m],|I|=l}} D_{{\mathbf s} + (1^{m})-\varepsilon_I}\cdot 1 \biggr)(x_{1},\ldots,x_{m}) = {\mathbf H} ^{m}_{q,t}(\phi (x))_{\operatorname{\mathrm{pol}} } \end{align} $$

with $\phi (x)$ given by equation (71).

5.1 Statement of the reformulation

We reformulate (14) by explicitly extracting the coefficient of $z^{N-m}$ . The most natural form of the resulting expression involves a generating function $N_{\beta /\alpha }$ for q-weighted tableaux rather than partially labelled paths. For now, we work only with the tableau description of $N_{\beta /\alpha }$ , but in §6.2, we will see that $N_{\beta /\alpha }$ is a truncation of an LLT series introduced by Grojnowski and Haiman in [Reference Grojnowski and Haiman12].

The q-weight in our reformulation involves two auxiliary statistics: for $\eta ,\tau \in {\mathbb N}^m$ , define

(81) $$ \begin{align} d(\eta,\tau) = \sum_{1 \leq j < r \leq m} \big| [\eta_{j},\eta_{j}+\tau_j] \cap [\eta_{r},\eta_{r}+\tau_r-1] \big| \,, \end{align} $$

with $[a,b]=\{a,\ldots ,b\}$ and $[b]=[1,b]$ , and for a vector $\eta $ of length n and $I\subseteq [n]$ , define

(82) $$ \begin{align} h_I(\eta)=\left|\{(r<s) : r\in I, s\not\in I,\eta_s=\eta_{r}+1\}\right|\,, \end{align} $$

where $(r<s)$ denotes a pair of positions $(r,s)$ in $\eta $ with $1\leq r<s\leq n$ .

Our reformulation of (14) is stated in the following theorem, proven at the end of this section.

Theorem 5.1.1. For $0\leq l < m\leq N$ , we have

(83) $$ \begin{align} \langle z^{N-m}\rangle & \sum_{\substack{\lambda\in\mathbf {D}_{N}\\ P\in{\mathbf {L}}_{N,l}(\lambda)}} t^{|\delta/\lambda|}\,\prod_{\substack{1<i\leq N\\ c_i(\lambda)=c_{i-1}(\lambda)+1}} (1+z\,t^{-c_i(\lambda)})\ q^{\mathrm{dinv}(P)}x^{\operatorname{\mathrm{wt}}_+(P)} \notag \\&\qquad\qquad = \sum_{\substack{J \subseteq [m-1]\\ |J|=l}} \, \sum_{\substack{\tau,(0,{\mathbf a})\in \mathbb N^{m}\\ |\tau|=N-m}} t^{|{\mathbf a}|} q^{d((0,{\mathbf a}),\tau)+h_J({\mathbf a})} N_{((0,{\mathbf a})+(1^{m})+\tau )/(({\mathbf a},0)+\varepsilon_J)}(X;q)\,, \end{align} $$

where $N_{\beta /\alpha }$ is given by Definition 5.2.1 below.

5.2 Definition of $N_{\beta /\alpha }$

For $\alpha ,\beta \in {\mathbb Z} ^{l}$ such that $\alpha _{j}\leq \beta _{j}$ for all j, define $\beta /\alpha $ to be the tuple of single row skew shapes $(\beta _{j})/(\alpha _{j})$ such that the x coordinates of the right edges of boxes a in the j-th row are the integers $\alpha _{j}+1,\ldots ,\beta _{j}$ . The boxes just outside the j-th row, adjacent to the left and right ends of the row, then have x coordinates $\alpha _{j}$ and $\beta _{j}+1$ . We consider these two boxes to be adjacent to the ends of an empty row, with $\alpha _{j} = \beta _{j}$ , as well.

Given a tuple of skew row shapes $\beta /\alpha $ , three boxes $(u,v,w)$ form a $w_0$ -triple when box v is in row r of $\beta /\alpha $ , boxes u and w are in or adjacent to a row j with $j>r$ and the x-coordinates $i_u, i_v, i_w$ of these boxes satisfy $i_u=i_{v}$ and $i_w=i_v+1$ . These triples are a special case of $\sigma $ -triples defined for any $\sigma \in S_l$ in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2]. We denote the number of $w_0$ -triples in $\beta /\alpha $ by $h_{w_0}(\beta /\alpha )$ . The reader can verify that

(84) $$ \begin{align} h_{w_0}(\beta/\alpha) = \sum_{r < j} \big| [\alpha_r+1,\beta_r] \cap [\alpha_j, \beta_j] \big| \,. \end{align} $$

For a totally ordered alphabet ${\mathcal A}$ , a row strict tableau of shape $\beta /\alpha $ is a map $S \colon \beta /\alpha \to {\mathcal A}$ that is strictly increasing on each row. The set of these maps is denoted by $\operatorname {\mathrm {RST}}(\beta /\alpha ,{\mathcal A})$ . For convenience, given $\alpha ,\beta \in {\mathbb Z} ^{l}$ with some $\alpha _{j}> \beta _{j}$ , we set $\operatorname {\mathrm {RST}}(\beta /\alpha ,{\mathcal A}) = \varnothing $ .

A $w_0$ -triple $(u,v,w)$ is an increasing $w_0$ -triple in S if $S(u) < S(v) < S(w)$ , with the convention that $S(u) = -\infty $ if u is adjacent to the left end of a row of $\beta /\alpha $ and $S(w) = \infty $ if w is adjacent to the right end of a row. Let $h_{w_0}(S)$ be the number of increasing $w_0$ -triples in S.

For $S \in \operatorname {\mathrm {RST}}(\beta /\alpha ,{\mathbb N})$ , define

(85) $$ \begin{align} x^{\operatorname{\mathrm{wt}}_+(S)} = \prod_{u \in \beta/\alpha, \, S(u) \neq 0} x_{S(u)}\qquad\text{and}\qquad x^{\operatorname{\mathrm{wt}}(S)} = \prod_{u \in \beta/\alpha} x_{S(u)}\,. \end{align} $$

Definition 5.2.1. For $\alpha ,\beta \in {\mathbb N}^{m}$ , define

(86) $$ \begin{align} N_{\beta/\alpha} = N_{\beta/\alpha}(X;q) = \sum_{S \in \operatorname{\mathrm{RST}}(\beta/\alpha, {\mathbb Z} _{>0} )} q^{h_{w_0}(S)} x^{\operatorname{\mathrm{wt}}(S)}\,. \end{align} $$

Note that, if $\alpha _{j}> \beta _{j}$ for any j, then $N_{\beta /\alpha }=0$ by our convention that $\operatorname {\mathrm {RST}}(\beta /\alpha ,{\mathcal A}) = \varnothing $ .

5.3 Transforming the combinatorial side

To prove equation (83), we first associate each Dyck path with a tuple of row shapes recording vertical runs.

Definition 5.3.1. The LLT data associated to a path $\lambda \in \mathbf {D}_N$ are

$$ \begin{align*} \beta= (1,c_2(\lambda)+1,\ldots,c_N(\lambda)+1) \;\;\text{and}\;\;\alpha= (c_2(\lambda),\ldots,c_N(\lambda),0)\,, \end{align*} $$

where $c_{i}(\lambda )$ counts lattice squares between $\lambda $ and the line segment connecting $(0,N)$ to $(N,0)$ in column i, numbered from right to left, as in Lemma 2.2.4.

Figure 2 shows the LLT data $\beta ,\alpha $ associated to the path $\lambda $ in Figure 1. Note that $\beta _i$ (resp. $\alpha _i$ ) is the furthest (resp. closest) distance from the diagonal to the path $\lambda $ on the line $x = N-i$ so that $\beta _i-\alpha _i$ is the number of south steps of $\lambda $ on that line.

Figure 2

For $\beta =(12211123233)$ , $\alpha =(11000121220)$ , there are $h_{w_0}(\beta /\alpha )=29 \ w_0$ -triples in $\beta /\alpha $ . The row strict tableau S of shape $\beta /\alpha $ has $h_{w_0}(S)=15$ increasing $w_0$ -triples, $x^{\operatorname {\mathrm {wt}}_+(S)} \!= x_1^2 x_2 x_3^2 x_4^2 x_5 x_6$ , and $x^{\operatorname {\mathrm {wt}}(S)} = x_0^2 x_1^2 x_2 x_3^2 x_4^2 x_5 x_6$ .

This association allows us to relate q-weighted sums over partial labellings to the $N_{\beta /\alpha }$ .

Lemma 5.3.2. For $\lambda \in \mathbf {D}_{N}$ and its associated LLT data $\alpha ,\beta $ , we have

(87) $$ \begin{align} \sum_{P\in{\mathbf {L}}_{N,l}(\lambda)} q^{\operatorname{\mathrm{dinv}}(P)} x^{\operatorname{\mathrm{wt}}_+(P)} = \sum_{\substack{I\subseteq [N-1] \\ |I|=l}} q^{h_I(\alpha)} N_{\beta/(\alpha+\varepsilon_I)}(X;q)\,. \end{align} $$

Proof. There is a natural weight-preserving bijection mapping $P \in {\mathbf {L}}_N(\lambda )$ to $S \in \operatorname {\mathrm {RST}}(\beta /\alpha ,{\mathbb N})$ , where the labels of column $x=i$ of P, read north to south, are placed into row $N-i$ of $\beta /\alpha $ , west to east. See Figures 1 and 2. Moreover, $\operatorname {\mathrm {dinv}}(P) = h_{w_0}(S)$ . To see this, let $\hat P$ be the same labelling as P but with the ordering on letters taken to be $0>1>2\cdots $ . It is proven in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, Proposition 6.1.1] that $\operatorname {\mathrm {dinv}}_1(\hat P) = h_{w_0}(S)$ , where $\operatorname {\mathrm {dinv}}_1(\hat P)$ was introduced in [Reference Haglund, Haiman, Loehr, Remmel and Ulyanov13] and matches $\operatorname {\mathrm {dinv}}(P)$ as discussed in Remark 2.2.3. The bijection restricts to a bijection from ${\mathbf {L}}_{N,l}(\lambda )$ to the subset of tableaux $S \in \operatorname {\mathrm {RST}}(\beta /\alpha ,{\mathbb N})$ with exactly l 0’s, none in row N. This gives

(88) $$ \begin{align} \sum_{P\in{\mathbf {L}}_{N,l}(\lambda)} q^{\operatorname{\mathrm{dinv}}(P)} x^{\operatorname{\mathrm{wt}}_+(P)} = \sum_{\substack{I\subseteq [N-1]\\ |I|=l }} \sum_{\substack{S\in\operatorname{\mathrm{RST}}(\beta/\alpha, {\mathbb N})\\ 0\text{ in rows }i\in I}} q^{h_{w_0}(S)} x^{\operatorname{\mathrm{wt}}_+(S)} \,. \end{align} $$

The claim then follows from Definition 5.2.1 and the following Lemma.

Lemma 5.3.3. For $\alpha ,\beta \in {\mathbb N}^{N}$ and $S \in \operatorname {\mathrm {RST}}(\beta /\alpha ,{\mathbb N})$ , let $I\subseteq [N]$ be the rows of S containing a zero and let T be the tableau in $\operatorname {\mathrm {RST}}(\beta /(\alpha +\varepsilon _I), {\mathbb Z} _{>0} )$ obtained by deleting all zeros from S. Then

(89) $$ \begin{align} h_{w_0}(T) = h_{w_0}(S)-h_I(\alpha)\,, \end{align} $$

where $h_I(\alpha )$ is defined in equation (82).

Example 5.3.5. For ${\mathbf a}=(130012)$ and $\tau = (2311022)$ ,

(90)

The wider spaces show the division into blocks of size $\tau _i+1$ . The last entry of $\alpha _{{\mathbf a} \tau }$ in each block is $a_i$ , and the next block in $\alpha _{{\mathbf a} \tau }$ and $\beta _{{\mathbf a} \tau }$ starts with $a_i+1$ .

Lemma 5.3.6. For $0\leq l<m\le N$ ,

(91) $$ \begin{align} \langle z^{N-m}\rangle\!\!\! \sum_{\substack{\lambda\in \mathbf {D} _{N}\\ P\in{\mathbf {L}}_{N,l}(\lambda)}} t^{|\delta/\lambda|} &\prod_{\substack{1 <i \leq N \\ c_i(\lambda) = c_{i-1}(\lambda)+1}} (1+z\,t^{-c_i(\lambda)})\, q^{\operatorname{\mathrm{dinv}}(P)} x^{\operatorname{\mathrm{wt}}_+(P)} \notag \\ &\qquad\qquad= \sum_{\substack{I\subseteq [N-1]\\ |I|=l}} \, \sum_{\substack{\tau, \, (0,{\mathbf a})\, \in \, {\mathbb N}^{m}\\ |\tau|=N-m}} t^{|{\mathbf a}|} q^{h_I(\alpha_{{\mathbf a}\tau})} N_{\beta_{{\mathbf a}\tau}/(\alpha_{{\mathbf a}\tau}+\varepsilon_I)}(X;q)\,. \end{align} $$

Proof. Use Lemma 5.3.2 to rewrite the left-hand side of equation (91) as

(92) $$ \begin{align} \langle z^{N-m}\rangle \sum_{\lambda\in\mathbf {D}_{N}} t^{|\delta/\lambda|} \prod_{\substack{1 <i \leq N \\ c_i(\lambda) = c_{i-1}(\lambda)+1}} (1+z\,t^{-c_i(\lambda)}) \sum_{\substack{I\subseteq [N-1]\\ |I|=l}} q^{h_I(\alpha)}N_{\beta/(\alpha+\varepsilon_I),} \end{align} $$

where $\beta = (1^{N})+(0,c_2(\lambda ),\ldots ,c_{N}(\lambda ))$ , $\alpha = (c_2(\lambda ),\ldots ,c_{N}(\lambda ),0)$ are the LLT data for $\lambda $ . Note that a tuple $\mathbf c=(c_1,c_2,\ldots ,c_{N}) \in {\mathbb N}^N$ is the sequence of column heights $c_{i}(\lambda )$ of a path $\lambda \in \mathbf {D}_{N}$ if and only if $c_s\leq c_{s-1}+1$ for all $s>1$ and $c_1=0$ ; in this case, $|\delta /\lambda |=|\mathbf c|$ . Replace $\mathbf {D}_{N}$ in equation (92) by these tuples, and expand the product to obtain

(93) $$ \begin{align} \langle z^{N-m}\rangle \sum_{A\subseteq [N]\setminus \{1\}}\,\, &\sum_{\substack{c_i \leq c_{i-1}+1 \ \forall i \\ c_i = c_{i-1}+1 \ \forall i \in A}} \!\!\! t^{|\mathbf c|-\sum_{i\in A}c_i} \, z^{|A|} \sum _{\substack{I\subseteq [N-1]\\ |I|=l}} q^{h_I(\alpha)}\,N_{\beta/(\alpha+\varepsilon_I)} \notag\\ &\qquad\qquad\quad = \sum_{\substack{\{1\} \subseteq J\subseteq [N] \\ |J| = m}} \,\, \sum_{c_j = c_{j-1}+1 \ \forall j \notin J } \!\! t^{\sum_{j\in J}c_j} \sum_{\substack{I\subseteq [N-1]\\ |I|=l}} q^{h_I(\alpha)}\,N_{\beta/(\alpha+\varepsilon_I)}\,, \end{align} $$

where the equality comes from reindexing with $J = [N]\setminus A$ and noting that we can drop the condition $c_j \leq c_{j-1}+1 \ \forall j\in J$ because $N_{\beta /(\alpha +\varepsilon _I)}=0$ if any $(\alpha +\varepsilon _I)_j\geq \alpha _j>\beta _j$ .

If we replace the sum over J by a sum over $\{\tau \in {\mathbb N}^m : |\tau |=N-m\}$ using $J= \{1,\tau _1+2,\tau _1+\tau _2+3,\ldots ,\tau _1+\cdots +\tau _{m-1}+m\}$ , then, for fixed J (or fixed $\tau $ ), the sum over $\mathbf {c}$ can be replaced by a sum over

(94) $$ \begin{align} \mathbf c = (0,1,2,\ldots,\tau_1,a_1,a_1+1,\ldots,a_1+\tau_2,a_2,\ldots, a_{m-1}+\tau_{m}) \end{align} $$

for $\mathbf a$ ranging over ${\mathbb N}^{m-1}$ . Note that $\sum _{j\in J} c_j = |{\mathbf a}|$ . With this encoding of $\mathbf {c}$ , we have $\beta /\alpha = \beta _{{\mathbf a}\tau }/\alpha _{{\mathbf a}\tau }$ in the notation of Definition 5.3.4, and the quantity in equation (93) becomes the right-hand side of equation (91).

We make a final adjustment to the right-hand side of equation (91). This sum runs over tuples $\beta _{{\mathbf a}\tau }/(\alpha _{{\mathbf a}\tau }+\varepsilon _I)$ with $|\tau |$ necessarily empty rows which can be removed at the cost of a q factor. We introduce some notation depending on a given ${\mathbf a}\in {\mathbb N}^{m-1}$ , $\tau =(\tau _1,\ldots ,\tau _{m})\in {\mathbb N}^{m}$ , and the associated $\beta _{{\mathbf a}\tau }/\alpha _{{\mathbf a}\tau }$ from Definition 5.3.4. First, we set $j_{\uparrow }=j+\sum _{x\leq j}\tau _x$ for $j\in [m]$ , so the entry of $\beta _{{\mathbf a} \tau }$ in position $j_{\uparrow }$ is $a_{j-1}+\tau _{j}+1$ , or $\tau _{1}+1$ if $j = 1$ , and the entry of $\alpha _{{\mathbf a} \tau }$ in the same position is $a_{j}$ or $0$ if $j = m$ . For a subset $J\subseteq [m]$ , we set $J_{\uparrow } = \{j_{\uparrow }: j\in J\}$ . In positions $i\not \in [m]_{\uparrow }$ , the sequences $\beta _{{\mathbf a} \tau }$ and $ \alpha _{{\mathbf a} \tau }$ agree, so row i is empty in $\beta _{{\mathbf a}\tau } /\alpha _{{\mathbf a}\tau } $ . The tuple of row shapes obtained by deleting these empty rows from $\beta _{{\mathbf a} \tau }/\alpha _{{\mathbf a} \tau }$ is $((0,{\mathbf a})+(1^m)+\tau )/({\mathbf a},0)$ , where row $j\in [m]$ corresponds to row $j_{\uparrow }$ of $\beta _{{\mathbf a} \tau }/\alpha _{{\mathbf a} \tau }$ ; note that rows $(j-1)_{\uparrow }$ and $j_{\uparrow }$ are separated by $\tau _j$ empty rows. See Figure 3.

Figure 3

Comparing the tuples of rows $\beta _{{\mathbf a} \tau }/\alpha _{{\mathbf a} \tau }$ and $((0,{\mathbf a})+(1^m)+\tau )/({\mathbf a},0)$ for ${\mathbf a} \in {\mathbb N}^{m-1}$ and $\tau \in {\mathbb N}^m$ . Here, $a_j=2$ , $a_{r-1} = 0, a_r = 3$ and $\tau _r = 5$ .

Lemma 5.3.7. For $J\subseteq [m]$ , ${\mathbf a}\in {\mathbb N}^{m-1}$ and $\tau \in {\mathbb N}^m$ , let $I=J_{\uparrow }$ . Then

(95) $$ \begin{align} N_{\beta_{{\mathbf a}\tau}/(\alpha_{{\mathbf a}\tau}+\varepsilon_I)} = q^{d((0,{\mathbf a}),\tau)-h^{\prime}_J({\mathbf a},\tau)} N_{((0,{\mathbf a})+(1^m)+\tau)/(({\mathbf a},0)+\varepsilon_J)}\,, \end{align} $$

where $h^{\prime }_J({\mathbf a},\tau )=\left |\{(j<r): j\in J, r\in [m],a_j\in [a_{r-1},a_{r-1}+\tau _r-1]\}\right |$ with $a_0=0$ , and $d((0,{\mathbf a}),\tau )$ is defined by equation (81).

Proof. Set $a_0=0$ . We can assume $a_j+(\varepsilon _J)_j \leq a_{j-1}+\tau _j+1$ for all $j\in [m]$ since otherwise both sides of equation (95) vanish by Definition 5.2.1. Hence, each side is a q-generating function for row strict tableaux on tuples of single row skew shapes; rows of $\beta _{{\mathbf a}\tau }/(\alpha _{{\mathbf a}\tau }+\varepsilon _I)$ on the left-hand side differ from the right-hand side only by the removal of empty rows $r\not \in [m]_{\uparrow }$ . Thus, the two sides agree up to a factor $q^{d}$ , where d counts $w_0$ -triples of $\beta _{{\mathbf a}\tau }/(\alpha _{{\mathbf a}\tau }+\varepsilon _I)$ involving one of these empty rows.

To evaluate d, consider such an empty row $(b)/(b)$ , coming from $b\in \{a_{r-1}+1,\ldots ,a_{r-1}+\tau _r\}$ for some $r\in [m]$ . The adjacent boxes on the left and right of this empty row form a $w_{0}$ -triple, increasing in every tableau, with one box in each nonempty lower row $j_{\uparrow }$ , of the form $(a_{j-1}+\tau _j+1)/(a_j+(\varepsilon _J)_j)$ , such that $b\in [a_j+(\varepsilon _J)_j +1,a_{j-1}+\tau _j+1]$ . Hence,

$$ \begin{align*} d & = \sum_{1\leq j<r\leq m} \big| [a_j+(\varepsilon_J)_j ,a_{j-1}+\tau_j] \cap [a_{r-1},a_{r-1}+\tau_r-1] \big| \\ & = \sum_{1\leq j<r\leq m} \big| [a_j,a_{j-1}+\tau_j] \cap [a_{r-1},a_{r-1}+\tau_r-1] \big| - \sum_{\substack{1\leq j<r\leq m \\ j\in J}} \big|\{a_j\}\cap [a_{r-1},a_{r-1}+\tau_r-1] \big|. \end{align*} $$

The sum after the minus sign is $h_J'({\mathbf a},\tau )$ . To prove that the remaining sum is $d((0,{\mathbf a}),\tau )$ , first rewrite it as

(96) $$ \begin{align} \! \sum_{1\leq j<r \leq m} \!\!\! \left( \big| [a_j,\infty) \cap [a_{r-1},a_{r-1}+\tau_r-1] \big|- \big| [a_{j-1}+\tau_j+1,\infty) \cap [a_{r-1},a_{r-1}+\tau_r-1] \big|\right),\! \end{align} $$

using the fact that $a_{j}\leq a_{j-1}+\tau _{j}+1$ by assumption. Next, observe that since $a_{0} = 0\leq a_{r-1}$ ,

$$ \begin{align*} \big| [a_{r-1},\infty) \cap [a_{r-1},a_{r-1}+\tau_r-1] \big| = \big| [a_0,\infty) \cap [a_{r-1},a_{r-1}+\tau_r-1] \big|. \end{align*} $$

Adding $\sum _{1<j<r} \big | [a_{j-1},\infty ) \cap [a_{r-1},a_{r-1}+\tau _r-1] \big |$ to both sides, it follows that

$$ \begin{align*} \sum_{1\leq j<r} \big| [a_{j},\infty) \cap [a_{r-1},a_{r-1}+\tau_r-1] \big| = \sum_{1\leq j<r} \big| [a_{j-1},\infty) \cap [a_{r-1},a_{r-1}+\tau_r-1] \big|. \end{align*} $$

Hence, formula (96) is unchanged upon replacing $[a_j,\infty )$ with $[a_{j-1},\infty )$ and is thus equal to

$$ \begin{align*} \sum_{1\leq j<r\leq m} \big|[a_{j-1},a_{j-1}+\tau_j]\cap [a_{r-1},a_{r-1}+\tau_r-1]\big| = d((0,{\mathbf a}),\tau).\\[-46pt] \end{align*} $$

Proof of Theorem 5.1.1.

Consider a summand $t^{|{\mathbf a}|} q^{h_I(\alpha _{{\mathbf a}\tau })} N_{\beta _{{\mathbf a}\tau }/(\alpha _{{\mathbf a}\tau }+\varepsilon _I)}$ on the right-hand side of identity (91) for $I\subseteq [N-1]$ , ${\mathbf a}\in {\mathbb N}^{m-1}$ , $\tau \in {\mathbb N}^m$ . It vanishes unless $I=J_{\uparrow }$ for some $J\subseteq [m-1]$ since $N_{\beta /(\alpha +\varepsilon _I)}=0$ when $(\alpha +\varepsilon _I)_i>\beta _i$ for some index i. For $I=J_{\uparrow }$ , we can use Lemma 5.3.7 to replace this summand with $t^{|{\mathbf a}|} q^{d((0,{\mathbf a}),\tau ) + h_{I}(\alpha _{{\mathbf a}\tau }) - h^{\prime }_J({\mathbf a},\tau )} N_{((0,{\mathbf a}) + (1^{m})+\tau ) / (({\mathbf a},0)+\varepsilon _J)}$ .

It now suffices to prove that, for $\alpha =\alpha _{{\mathbf a}\tau }$ ,

(97) $$ \begin{align} h_I(\alpha) = h^{\prime}_J({\mathbf a},\tau)+ h_J({\mathbf a}) \,. \end{align} $$

We recall that $N=m_{\uparrow }$ and note that $[N]\setminus I =([N]\setminus [m]_{\uparrow } )\sqcup ([m]_{\uparrow }\setminus I) =([N]\setminus [m]_{\uparrow }) \sqcup ([m]\setminus J)_{\uparrow }$ . Hence, $h_I(\alpha )=\left | \{(x<y): x\in I, y\in [N]\setminus I,\alpha _y=\alpha _x+1\} \right | =\left |S_1\right |+\left |S_2\right |$ for

$$ \begin{align*} S_1 & = \{(x<y): x\in J_{\uparrow},\, y \in [N]\setminus [m]_{\uparrow},\, \alpha_y=\alpha_x+1\}\, ,\\ S_2 & = \{(x<y): x\in J_{\uparrow},\, y\in ([m]\setminus J)_{\uparrow},\, \alpha_y=\alpha_x+1\}\,. \end{align*} $$

Since $\alpha _{m_{\uparrow }}=0$ implies $(x<m_{\uparrow })\not \in S_2$ for all $x<m_{\uparrow }$ , we use that $a_u=\alpha _{u_{\uparrow }}$ for every $u\in [m-1]$ to see that

(98) $$ \begin{align} h_J({\mathbf a})= \big|S_2\big| = \big| \{(j<r): j\in J,\, r\in [m-1]\setminus J,\, a_r=a_j+1\} \big|\,. \end{align} $$

Furthermore, $\{(j<r):j\in J, r\in [m],a_{r-1}+1\leq a_j+1\leq a_{r-1}+\tau _r\}$ and $S_1$ are equinumerous, as we can see by letting a pair $(j<r)$ in the first set correspond to the pair $(j_{\uparrow }<y)$ in $S_{1}$ , where y is the unique row index in the range $(r-1)_{\uparrow }<y<r_{\uparrow }$ such that $\alpha _{y} = \alpha _{j_{\uparrow }} +1 = a_j+1$ , as illustrated in Figure 3.

6.1 Overview

By Theorems 4.4.1 and 5.1.1, the extended delta conjecture is equivalent to

(99) $$ \begin{align} {\mathbf H}^{m}_q &\left( \frac{\prod _{i+1<j\leq m} (1 - q\, t\, x_i/x_j)}{\prod _{i< j\leq m} (1 - t\, x_i/x_j)} x_1\cdots x_{m} h_{N-m}(x_1,\ldots,x_{m}) \overline{e_l(x_2,\ldots,x_{m})} \right)_{\mathrm{pol}}\notag\\ &\qquad\qquad\qquad\qquad= \sum_{\substack{J \subseteq [m-1]\\ |J|=l}} \ \sum_{\substack{(0,{\mathbf a}),\tau\in \mathbb N^{m} \\ |\tau|=N-m}} t^{|{\mathbf a}|} q^{d((0,{\mathbf a}),\tau)+h_J({\mathbf a})} \; \left(\omega N_{\beta/\alpha}\right)(x_1,\ldots,x_{m};q) \,, \end{align} $$

where $\beta = (0,{\mathbf a})+(1^{m})+\tau $ , $\alpha =({\mathbf a},0)+\varepsilon _J$ and $\left (\omega N_{\beta /\alpha }\right )(x_1,\ldots ,x_{m};q)$ is $\omega N_{\beta /\alpha }(X;q)$ evaluated in m variables.

Although this is an identity in only m variables, it does amount to the extended delta conjecture by Remarks 4.4.2 and 5.2.2: Both $\omega ( h_l[B]e_{m-l-1}[B-1] e_{N-l})$ and $\omega N_{\beta /\alpha }(X;q)$ for the $\alpha ,\beta $ arising in equation (99) are linear combinations of Schur functions $s_{\lambda }$ with $\ell (\lambda )\leq m$ .

By Proposition 6.2.2 (below, proven in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2]), the functions $\omega N_{\beta /\alpha }$ on the right-hand side of equation (99) are the polynomial parts of the ‘LLT series’ introduced in [Reference Grojnowski and Haiman12], making each side of equation (99) the polynomial part of an infinite series of $\operatorname {\mathrm {GL}}_m$ characters. We then prove equation (99) as a consequence of a stronger identity between these infinite series.

Hereafter, we use x to abbreviate the alphabet $x_1,\ldots ,x_m$ .

6.2 LLT series

We will work with the (twisted) nonsymmetric Hall–Littlewood polynomials as in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2]. For a $\operatorname {\mathrm {GL}} _{m}$ weight $\lambda \in {\mathbb Z} ^{m}$ and $\sigma \in S_m$ , the twisted nonsymmetric Hall–Littlewood polynomial $E^{\sigma }_{\lambda }(x;q)$ is an element of ${\mathbb Z}[q^{\pm 1}][x_1^{\pm 1}, \dots , x_m^{\pm 1}]$ defined using an action of the Hecke algebra on this ring; we refer the reader to [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, §4.3] for the precise definition, citing properties as needed. We also have their variants

(100) $$ \begin{align} F^{\sigma}_{\lambda}(x;q) = \overline{E^{\sigma w_0}_{-\lambda}(x;q)}\,, \end{align} $$

recalling that $\overline {f(x_1,\ldots ,x_m;q)}=f(x_1^{-1},\ldots ,x_m^{-1};q^{-1})$ .

For any weights $\alpha ,\beta \in {\mathbb Z} ^{m}$ and a permutation $\sigma \in S_{m}$ , the LLT series ${\mathcal L}^{\sigma } _{\beta /\alpha }(x;q) ={\mathcal L}^{\sigma } _{\beta /\alpha }(x_{1},\ldots ,x_{m};q)$ is defined in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, §4.4] by

(101) $$ \begin{align} \langle \chi_{\lambda} \rangle {\mathcal L}^{\sigma^{-1}}_{\beta/\alpha}(x;q^{-1}) = \langle E^{\sigma}_{\beta} \rangle \,\chi_{\lambda} \cdot E^{\sigma}_{\alpha}\,. \end{align} $$

Alternatively, [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, Proposition 4.4.2] gives the following expression in terms of the Hall–Littlewood symmetrization operator in equation (38):

(102) $$ \begin{align} {\mathcal L} ^{\sigma }_{\beta /\alpha }(x;q) = {\mathbf H}^{m}_q(w_{0}(F^{\sigma ^{-1} }_{\beta }(x;q) \overline{E^{\sigma ^{-1}}_{\alpha }(x;q)}))\,, \end{align} $$

where $w_0$ denotes the permutation of maximum length here and after. We will only need the LLT series for $\sigma =w_0$ and $\sigma = id$ , although most of what follows can be generalized to any $\sigma $ .

In addition to the above formulas, we have the following combinatorial expressions for the polynomial truncations of LLT series as tableau generating functions with q weights that count triples. As usual, a semistandard tableau on a tuple of skew row shapes $\nu =\beta /\alpha $ is a map $T \colon \nu \to [m]$ which is weakly increasing on rows. Let $\operatorname {\mathrm {SSYT}}(\nu )$ denote the set of these, and define $x^{\operatorname {\mathrm {wt}}(T)}=\prod _{b\in \nu }x_{T(b)}$ .

Proposition 6.2.1 [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, Remark 4.5.5 and Corollary 4.5.7].

If $\alpha _i \leq \beta _i$ for all i, then

(103) $$ \begin{align} {\mathcal L}^{w_0}_{\beta/\alpha}(x;q)_{\operatorname{\mathrm{pol}}} = \sum_{T \in \operatorname{\mathrm{SSYT}}(\beta/\alpha)} q^{h^{\prime}_{w_0}(T)} x^{\operatorname{\mathrm{wt}}(T)} \,, \end{align} $$

where $h^{\prime }_{w_0}(T)$ is the number of $w_0$ -triples $(u,v,w)$ of $\beta /\alpha $ such that $T(u) \leq T(v) \leq T(w)$ .

Proposition 6.2.2 [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, Proposition 4.5.2].

For any $\alpha , \beta \in {\mathbb Z}^m$ ,

(104) $$ \begin{align} {\mathcal L}^{w_0}_{\beta/\alpha}(x;q)_{\operatorname{\mathrm{pol}}} = \left(\omega N_{\beta/\alpha}\right)(x;q) \,. \end{align} $$

6.3 Extended delta theorem

We now give several lemmas on nonsymmetric Hall–Littlewood polynomials, then conclude by using the Cauchy formula for these polynomials to prove Theorem 6.3.6, below, yielding the stronger series identity that implies equation (99).

Lemma 6.3.1. For ${\mathbf a}\in \mathbb N^{m-1}$ and $w_0\in S_m$ and $\tilde w_0\in S_{m-1}$ the permutations of maximum length, we have

(105) $$ \begin{align} E^{w_0}_{({\mathbf a},0)}(x_1,\ldots,x_{m};q) & = E_{{\mathbf a}}^{\tilde w_0}(x_1,\ldots,x_{m-1};q) \end{align} $$

(106) $$ \begin{align} F^{w_0}_{(0,{\mathbf a})}(x_1,\ldots,x_{m};q) & = F^{\tilde w_0}_{{\mathbf a}}(x_2,\ldots,x_{m};q)\,. \end{align} $$

Inverting all variables and specializing $\sigma = w_0$ in [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, Lemma 4.5.1] yields the following lemma.

Lemma 6.3.2. For $l\leq m$ , ${\mathbf a} \in {\mathbb Z}^m$ , we have

(107) $$ \begin{align} \overline{e_l(x)}\,\overline{E_{\mathbf a}^{w_0}(x;q)} =\sum_{I\subseteq [m]:|I|=l} q^{h_{I}({\mathbf a})} \overline{E^{w_0}_{{\mathbf a} + \varepsilon _{I}}(x;q)}\,, \end{align} $$

where $ h_I({\mathbf a}) = \left | \{( i<j) \mid a_j=a_i+1,i\in I, j \notin I\} \right |$ , as defined in equation (82).

Lemma 6.3.3. For every $\lambda \in {\mathbb Z} ^{m}$ and $\sigma \in S_{m}$ , we have

(108) $$ \begin{align} F^{\sigma }_{\lambda }(x;q) = w_{0} E^{w_{0}\sigma }_{w_{0} \lambda }(x;q^{-1}). \end{align} $$

Proof. The desired identity follows from

(109) $$ \begin{align} w_{0}E^{\sigma }_{\lambda }(x_{1}^{-1},\ldots,x_{m}^{-1};q) = E^{w_{0}\sigma w_{0}}_{-w_{0} \lambda }(x;q) \end{align} $$

by applying $w_{0}$ to both sides; substituting $\sigma \mapsto \sigma w_{0}$ , $\lambda \mapsto -\lambda $ and $q\mapsto q^{-1}$ and using the definition of  $F^{\sigma }_{\lambda }$ .

To prove equation (109), we use the characterization of $E^{\sigma }_{\lambda }(x;q)$ by the recurrence [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, (77)] and initial condition $E^{\sigma }_{\lambda } = x^{\lambda }$ for $\lambda $ dominant. The change of variables $x^{\mu }\mapsto x^{-w_{0}(\mu )}$ replaces the Hecke algebra operator $T_{i} = T_{s_{i}}$ in the recurrence with $T_{w_{0}s_{i}w_{0}}$ , giving a modified recurrence satisfied by the left-hand side of (109). It is straightforward to verify that the right-hand side of equation (109) satisfies the same modified recurrence. Since both sides reduce to $x^{-w_{0}(\lambda )}$ for $\lambda $ dominant, equation (109) holds.

Lemma 6.3.4. Given $\alpha ,\beta \in {\mathbb Z} ^{m}$ and a symmetric Laurent polynomial $f(x_{1},\ldots ,x_{m})$ , we have, for any $\sigma \in S_{m}$ ,

(110) $$ \begin{align} \langle E^{w_{0}\sigma w_{0}}_{w_{0}\beta }(x; q^{-1}) \rangle\, f(x)\cdot E^{w_{0}\sigma w_{0}}_{w_{0}\alpha }(x; q^{-1}) = \langle F^{\sigma }_{-\alpha }(x; q) \rangle\, f(x)\cdot F^{\sigma }_{-\beta }(x; q). \end{align} $$

Proof. In fact, we will show that

(111) $$ \begin{align} \langle E^{w_{0}\sigma w_{0}}_{w_{0}\beta }(x; q^{-1}) \rangle\, f(x)\cdot E^{w_{0}\sigma w_{0}}_{w_{0}\alpha }(x; q^{-1}) = \langle F^{\sigma }_{-\alpha }(x; q) \rangle\, w_{0}(f(x)) \cdot F^{\sigma }_{-\beta }(x; q), \end{align} $$

even if we do not assume that $f(x)$ is symmetric. By Lemma 6.3.3, the right-hand side of equation (111) is equal to

(112) $$ \begin{align} \langle E^{w_{0}\sigma }_{-w_{0}\alpha }(x;q^{-1}) \rangle \, f(x)\cdot E^{w_{0}\sigma }_{-w_{0}\beta }(x;q^{-1}). \end{align} $$

By [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, Proposition 4.3.2], the functions $E^{\sigma }_{\lambda }(x;q)$ and $E^{\sigma w_{0}}_{-\lambda }(x;q)$ are dual bases with respect to to the inner product $\langle - , - \rangle _{q}$ defined there. Moreover, it is immediate from the construction of the inner product that multiplication by any $f(x)$ is self-adjoint. This gives

(113) $$ \begin{align} \langle f(x) E^{w_{0}\sigma w_{0}}_{w_{0}\alpha }(x;q^{-1}),\, E^{w_{0}\sigma }_{-w_{0}\beta }(x;q^{-1}) \rangle_{q^{-1}} = \langle E^{w_{0}\sigma w_{0}}_{w_{0}\alpha }(x;q^{-1}),\, f(x) E^{w_{0}\sigma }_{-w_{0}\beta }(x;q^{-1}) \rangle_{q^{-1}}, \end{align} $$

in which the left-hand side is equal to the left-hand side of equation (111), and the right-hand side is equal to equation (112).

Lemma 6.3.5. For $w_0$ the maximum length permutation in $S_m$ and $\eta \in \mathbb N^m$ , we have

(114) $$ \begin{align} h_l(x) F_{\eta}^{w_0}(x;q) = \sum_{\substack{\tau\in\mathbb N^m\\ |\tau|=l}} q^{d(\eta,\tau)} F_{\eta+\tau}^{w_0}(x;q)\,, \end{align} $$

recalling from equation (81) that $d(\eta ,\tau ) = \sum _{j < r} \big | [\eta _{j},\eta _{j}+\tau _j] \cap [\eta _{r},\eta _{r}+\tau _r-1] \big |$ .

Proof. Set $\alpha = -\eta -\tau $ and $\beta = -\eta $ . By equation (101) and Lemma 6.3.4 (with $\sigma =w_{0}$ ), we have

(115) $$ \begin{align} \langle h_{l}(x) \rangle\, {\mathcal L} ^{w_{0}}_{w_{0}(\beta /\alpha )}(x;q)_{\mathrm{pol}} = \langle E_{w_0\beta }^{w_0}(x;q^{-1}) \rangle h_l(x) E_{w_0 \alpha}^{w_0}(x;q^{-1}) = \langle F_{- \alpha}^{w_0}(x;q) \rangle h_l(x) {F_{- \beta }^{w_0}(x;q)}. \end{align} $$

By specializing all but one variable in equation (103) to zero, Proposition 6.2.1 implies that the coefficient of $h_l$ in ${\mathcal L}^{w_0}_{w_0(\beta /\alpha )}(x;q)_{\operatorname {\mathrm {pol}}}$ is $q^{h^{\prime }_{w_0}(T)}$ for T the semistandard tableau of shape $w_0(\beta /\alpha )$ filled with a single letter, where $h^{\prime }_{w_0}(T)$ is the number of $w_0$ -triples of $w_0(\beta /\alpha )=w_0(-\eta /(-\eta -\tau ))$ . By equation (84), this number is $d(\eta ,\tau )$ .

Theorem 6.3.6. For $0\leq l<m\leq N$ and $w_0\in S_{m}$ the maximum length permutation, we have

$$ \begin{align*} & \frac{\prod_{i+1<j\le m}(1-qtx_i/x_j)} {\prod_{i < j\le m} (1-tx_i/x_j)} x_1 \cdots x_{m} h_{N-m}(x_1,\ldots,x_{m}) \overline{e_l(x_2,\ldots,x_{m})} \\[1ex] &\ =\!\!\!\! \sum_{\substack{(0,{\mathbf a}), \tau \in\mathbb N^{m}\\ I\subseteq [m-1]\\ |\tau|=N-m, |I|=l}} t^{|{\mathbf a}|} q^{d((0,{\mathbf a}),\tau)+h_I({\mathbf a})}\; w_0 \bigl( F^{w_0}_{(0,{\mathbf a})+\tau+(1^{m})}(x_1,\ldots,x_{m};q) \overline{E^{w_0}_{({\mathbf a},0)+\varepsilon_I}(x_1,\ldots,x_{m};q)}\bigr). \end{align*} $$

Proof. Our starting point is the Cauchy formula [Reference Blasiak, Haiman, Morse, Pun and Seelinger2, Theorem 5.1.1] for the twisted nonsymmetric Hall–Littlewood polynomials associated to any $\tilde \sigma \in S_{m-1}$ :

(116) $$ \begin{align} \frac{\prod _{i<j< m} (1 - q\, t\, x_{i} \, y_{j})}{\prod _{i\leq j < m} (1 - t\, x_{i}\, y_{j})} = \sum _{{\mathbf a}\in\mathbb N^{m-1}} t^{|{\mathbf a} |}\, E^{\tilde \sigma }_{{\mathbf a} }(x_{1},\ldots,x_{m-1};q^{-1}) \, F^{\tilde\sigma }_{{\mathbf a} }(y_{1},\ldots,y_{m-1};q)\,. \end{align} $$

Take $\tilde \sigma = \tilde w_0$ the maximum length permutation in $S_{m-1}$ , replace $x_i$ by $x_i^{-1}$ and then let $y_j=x_{j+1}$ to get

(117) $$ \begin{align} \frac{\prod _{i+1<j\leq m}(1 - q\, t\, x_{j}/x_{i})}{\prod _{i<j\leq m}(1 - t\, x_{j}/x_{i})} = \sum_{{\mathbf a}\in{\mathbb N}^{m-1}} t^{|{\mathbf a} |} F^{\tilde w_0}_{ {\mathbf a}}(x_2,\ldots,x_{m};q) \overline{E^{\tilde w_0}_{{\mathbf a}}(x_1,\ldots,x_{m-1};q)}\,. \end{align} $$

By equation (106) and the definition of $F^{\sigma }$ ,

$$\begin{align*}(x_1\cdots x_{m})F^{\tilde w_0}_{{\mathbf a}}(x_2,\ldots,x_{m};q)=(x_1\cdots x_{m})F^{w_0}_{(0,{\mathbf a})}(x_1,\ldots,x_{m};q)= F^{w_0}_{ (0,{\mathbf a})+(1^{m})}(x_1,\ldots,x_{m};q)\end{align*}$$

for $w_0\in S_{m}$ . Hence,

$$ \begin{align*} &\frac{\prod _{i+1<j\leq m}(1 - q\, t\, x_{j}/x_{i})}{\prod _{i<j\leq m}(1 - t\, x_{j}/x_{i})} (x_1\cdots x_{m}) \notag\\ &\qquad\qquad\qquad\qquad = \sum_{{\mathbf a}\in{\mathbb N}^{m-1}} t^{|{\mathbf a} |} F^{w_0}_{ (0,{\mathbf a})+(1^{m})}(x_1,\ldots,x_{m};q) \overline{E^{\tilde w_0}_{{\mathbf a}}(x_1,\ldots,x_{m-1};q)}\,. \end{align*} $$

Multiplying by $h_{N-m}(x_1,\ldots ,x_{m})$ with the help of Lemma 6.3.5 yields

$$ \begin{align*} &\frac{\prod _{i+1<j\le m}(1 - q\, t\, x_{j}/x_{i})}{\prod _{i<j\le m}(1 - t\, x_{j}/x_{i})} (x_1\cdots x_{m}) h_{N-m}(x_1,\ldots,x_{m}) \notag\\ &\qquad\qquad\qquad\qquad= \sum_{\substack{(0,{\mathbf a}), \tau\in{\mathbb N}^{m}\\|\tau|=N-m}} t^{|{\mathbf a} |} q^{d((0,{\mathbf a}),\tau)} F^{w_0}_{\eta +\tau}(x_1,\ldots,x_{m};q) \overline{E^{\tilde w_0}_{{\mathbf a}}(x_1,\ldots,x_{m-1};q)}\,, \end{align*} $$

where $\eta =(1^{m})+(0,{\mathbf a})$ and we have used that $d(\eta ,\tau )=d((0,{\mathbf a}),\tau )$ by equation (81). Now, multiply by $\overline { e_l(x_1,\ldots ,x_{m-1})}$ and apply equation (107) to get

(118) $$ \begin{align} &\frac{\prod _{i+1<j\le m}(1 - q\, t\, x_{j}/x_i)}{\prod _{i<j\le m}(1 - t\, x_{j}/x_{i})} (x_1\cdots x_{m}) \overline{ e_l(x_1,\ldots,x_{m-1})} h_{N-m}(x_1,\ldots,x_{m}) \notag\\ &\qquad\qquad= \sum_{\substack{(0,{\mathbf a}),\tau\,\in\mathbb N^{m}\\ |\tau|=N-m}} \, \sum_{|I|=l} t^{|{\mathbf a} |} q^{d((0,{\mathbf a}),\tau)+h_I({\mathbf a})} F^{w_0}_{\eta +\tau}(x_1,\ldots,x_{m};q) \overline{E^{\tilde w_0}_{{\mathbf a}+\varepsilon_I}(x_1,\ldots,x_{m-1};q)}\,, \end{align} $$

where $I\subseteq [m-1]$ . The result then follows by using equation (105) on the right-hand side and applying $w_0\in S_{m}$ to both sides, noting that $w_0(\overline { e_l(x_2,\ldots ,x_{m})})= \overline { e_l(x_1,\ldots ,x_{m-1})}$ .