Introduction
Enumerative geometry of Nakajima quiver varieties relates quantum cohomology and quantum K K K -theory to integrable systems [Nak94 , MO19 , KPSZ21 , K23 ]. For the cotangent bundle to a complete flag variety,
X n = T ∗ F l ( C n ) , n ≥ 2 , X_n=T^*\mathop{\mathrm{Fl}}(\mathbb C^n),\qquad n\geq2, X n = T ∗ Fl ( C n ) , n ≥ 2 ,
the K K K -theoretic vertex, with its scalar character factor, is an eigenfunction of the trigonometric Ruijsenaars–Schneider (tRS) Hamiltonians in the Kähler parameters [K21 , Din21 ]. Its cohomological limit solves the trigonometric Calogero–Moser (tCM) equations, which also describe the quantum differential module of the Springer resolution [BMO11 ]. The recent work [K26 ] establishes compatibility of the complete-flag tRS eigenvalue problem with Frobenius action at roots of unity: partial shifts cancel in Newton–Adams combinations of the Hamiltonians, leaving the operators obtained by Frobenius action. Here we use the cohomological tCM spectral problem to construct polynomial approximations to the vertex and study their arithmetic properties.
A K K K -theoretic precedent is provided by [K21 ] (Proposition 2.11), where a discrete specialization of framing characters truncates a normalized complete-flag vertex to a Macdonald polynomial. These polynomials occur in the correspondence between A A A -type quiver varieties and ADHM moduli spaces. In the cohomological setting, polynomial solutions arise by specializing the coupling to negative integers. Choosing these integers to approach a fixed rational coupling p p p -adically produces a family of exact tCM eigenfunctions at varying couplings and polynomial solutions of the fixed system modulo p s p^s p s . After multiplication by a monomial, these terminating cohomological vertices are symmetric Jack polynomials [Mac95 , NS13 ], the differential counterparts of the symmetric Macdonald polynomials in [K21 ]. We use these polynomial specializations to construct arithmetic approximations of the quasimap vertex. The spectral problem identifies the terminating vertices with Jack polynomials; our main arithmetic result compares them with the master-polynomial approximations.
A different arithmetic construction was introduced by Smirnov and Varchenko [SV23 ]. They express a Grassmannian vertex as a period integral of a master function, a product of rational powers of differences of auxiliary variables and Kähler parameters. Such period representations are familiar from mirror symmetry [Hori03 ]. The construction here uses the 3 d 3d 3 d mirror description of the vertex. To obtain arithmetic approximations, they replace the rational exponents by nonnegative integers approaching them p p p -adically. The integrand becomes a master polynomial. Extracting a prescribed coefficient in its auxiliary variables replaces the period integral and gives a polynomial in the Kähler parameters. These polynomials satisfy Dwork congruences and reconstruct the vertex by an infinite product. We extend this construction to complete flags and prove a sharp prime-power comparison with the regular negative-parameter staircase Jack family, uniformly in rank. The two families have the same coefficientwise limit and satisfy the same full commuting equations modulo p s p^s p s . Their difference has a degree-dependent valuation bound and explicit nonzero leading residues at every p p p -power scale. These formulas describe the arithmetic of the Jack coefficients in the monomial symmetric basis and distinguish the two canonical approximation procedures.
Integrability and Polynomial Truncation
Write Q = ( Q 1 , … , Q n − 1 ) Q=(Q_1,\ldots,Q_{n-1}) Q = ( Q 1 , … , Q n − 1 ) for the Kähler parameters (Novikov variables). The vertex is a generating series of equivariant quasimap invariants of X n X_n X n ; its coefficient in multidegree d \boldsymbol d d records the corresponding curve class. Quasimaps are maps from a parametrized rational curve with finitely many base points allowed. We take the vertex with trivial insertion at the identity fixed point and normalize the source-rotation weight to one. The cotangent weight is denoted by κ \kappa κ . After forming the complete localization sum in each degree, we specialize the additive framing weights to zero. We prove that this specialization is regular and write
V n ( Q ; κ ) , V n ( 0 ; κ ) = 1 , V_n(Q;\kappa),\qquad V_n(0;\kappa)=1, V n ( Q ; κ ) , V n ( 0 ; κ ) = 1 ,
for the resulting cohomological vertex. Each coefficient is a polynomial in κ \kappa κ over Q \mathbb Q Q . The tCM equation constructs this series recursively by formal perturbation theory around the free Hamiltonian. At any fixed Kähler degree, only finitely many perturbative terms contribute. Specializing the coupling to a negative integer then gives the terminating polynomials used below; the expansion is given in § 3.2 .
Let Q i = z i / z i + 1 Q_i=z_i/z_{i+1} Q i = z i / z i + 1 , D i = z i ∂ z i D_i=z_i\partial_{z_i} D i = z i ∂ z i , and set
H n , κ = 1 2 ∑ i D i 2 − κ ( κ − 1 ) ∑ i < j z i z j ( z i − z j ) 2 , J n , κ = ∏ i < j ( 1 − z i / z j ) κ . \begin{equation}
H_{n,\kappa}=\frac12\sum_iD_i^2
-\kappa(\kappa-1)\sum_{i<j}\frac{z_iz_j}{(z_i-z_j)^2},
\qquad
J_{n,\kappa}=\prod_{i<j}(1-z_i/z_j)^\kappa. \tag*{(1.1)}
\end{equation} H n , κ = 2 1 i ∑ D i 2 − κ ( κ − 1 ) i < j ∑ ( z i − z j ) 2 z i z j , J n , κ = i < j ∏ ( 1 − z i / z j ) κ . (1.1)
All expressions are expanded in the chamber Q = 0 Q=0 Q = 0 . The differential tRS limit gives n n n commuting operators I n , k ( κ ) \mathsf I_{n,k}(\kappa) I n , k ( κ ) of order k k k , with principal symbols e k ( ξ 1 , … , ξ n ) e_k(\xi_1,\ldots,\xi_n) e k ( ξ 1 , … , ξ n ) , where e k e_k e k is the elementary symmetric polynomial of degree k k k . The first is total momentum; on functions of the ratios Q i Q_i Q i , the second is − H n , κ -H_{n,\kappa} − H n , κ . In vertex gauge we put
B k ( 0 ) ( κ ) = J n , κ − 1 I n , k ( κ ) J n , κ . \mathsf B_k^{(0)}(\kappa)
=J_{n,\kappa}^{-1}\mathsf I_{n,k}(\kappa)J_{n,\kappa}. B k ( 0 ) ( κ ) = J n , κ − 1 I n , k ( κ ) J n , κ .
The vertex-gauge equation L n , κ V = 0 \mathcal L_{n,\kappa}V=0 L n , κ V = 0 , where L n , κ = J n , κ − 1 H n , κ J n , κ \mathcal L_{n,\kappa}=J_{n,\kappa}^{-1}H_{n,\kappa}J_{n,\kappa} L n , κ = J n , κ − 1 H n , κ J n , κ , has a unique normalized formal solution in characteristic zero. We shall identify it with both the geometric vertex and the triangular chamber period. We write P λ ( α ) P_\lambda^{(\alpha)} P λ ( α ) for the monic Jack polynomial with parameter α = 1 / κ \alpha=1/\kappa α = 1/ κ , and set G n ( z ) = ∏ i = 1 n z i i − 1 G_n(z)=\prod_{i=1}^n z_i^{i-1} G n ( z ) = ∏ i = 1 n z i i − 1 .
Theorem 1.1 (Theorem 3.5 and Propositions 3.7 , 3.8 , 3.10 , pt:joint-comparison ). For every m ∈ Z ≥ 0 m\in\mathbb Z_{\geq0} m ∈ Z ≥ 0 , F m ( n ) ( Q ) : = V n ( Q ; − m ) ∈ Z [ Q 1 , … , Q n − 1 ] , F m ( n ) ( 0 ) = 1. F_m^{(n)}(Q):=V_n(Q;-m)\in\mathbb Z[Q_1,\ldots,Q_{n-1}],
\qquad F_m^{(n)}(0)=1. F m ( n ) ( Q ) := V n ( Q ; − m ) ∈ Z [ Q 1 , … , Q n − 1 ] , F m ( n ) ( 0 ) = 1. Their coefficients are nonnegative integers. For m ≥ 1 m\geq1 m ≥ 1 , G n m F m ( n ) = P m δ ( − 1 / m ) G_n^mF_m^{(n)}=P_{m\delta}^{(-1/m)} G n m F m ( n ) = P m δ ( − 1/ m ) , where δ = ( n − 1 , … , 1 , 0 ) \delta=(n-1,\ldots,1,0) δ = ( n − 1 , … , 1 , 0 ) . These polynomials satisfy the exact equations B k ( 0 ) ( − m ) F m ( n ) = 0 , 1 ≤ k ≤ n . \mathsf B_k^{(0)}(-m)F_m^{(n)}=0,\qquad 1\leq k\leq n. B k ( 0 ) ( − m ) F m ( n ) = 0 , 1 ≤ k ≤ n . Fix ω = r / d \omega=r/d ω = r / d in lowest terms, 0 < ω ≤ 1 2 0<\omega\leq\tfrac12 0 < ω ≤ 2 1 , and an odd prime p p p . Put P s = p s , A s = ω ( P s − 1 ) , T ~ s ( n ) = F A s ( n ) . P_s=p^s,\qquad A_s=\omega(P_s-1),\qquad
\widetilde T_s^{(n)}=F_{A_s}^{(n)}. P s = p s , A s = ω ( P s − 1 ) , T s ( n ) = F A s ( n ) . Then T ~ s ( n ) \widetilde T_s^{(n)} T s ( n ) converges coefficientwise p p p -adically to V n ( Q ; ω ) V_n(Q;\omega) V n ( Q ; ω ) and B k ( 0 ) ( ω ) T ~ s ( n ) ≡ 0 ( m o d p s ) , 1 ≤ k ≤ n . \mathsf B_k^{(0)}(\omega)\widetilde T_s^{(n)}
\equiv0\pmod{p^s},\qquad 1\leq k\leq n. B k ( 0 ) ( ω ) T s ( n ) ≡ 0 ( mod p s ) , 1 ≤ k ≤ n .
Equivalently, the vertex is the coefficientwise p p p -adic limit
V n ( Q ; ω ) = lim s → ∞ G n ( z ) − A s P A s δ ( − 1 / A s ) ( z ) . V_n(Q;\omega)
=\lim_{s\to\infty}G_n(z)^{-A_s}
P_{A_s\delta}^{(-1/A_s)}(z). V n ( Q ; ω ) = s → ∞ lim G n ( z ) − A s P A s δ ( − 1/ A s ) ( z ) .
Both the partition and the Jack polynomial parameter vary with s s s ; the normalization makes their limit a series in the fixed Kähler variables. The exact spectral equations at coupling − A s -A_s − A s and the constant coefficient one uniquely determine this polynomial family in characteristic zero. The specialization differs from the framing specialization in [K21 ]; the common principle is to obtain polynomial eigenfunctions from an enumerative series. For n = 2 n=2 n = 2 this is the termination of 2 F 1 ( − m , − m ; 1 ; Q ) {}_2F_1(-m,-m;1;Q) 2 F 1 ( − m , − m ; 1 ; Q ) . In higher rank polynomiality follows from the triangular constant term and bounded external flows.
Comparison of the Two Families
The master-polynomial family is constructed from a triangular array with i i i auxiliary variables in row i i i , for 1 ≤ i < n 1\leq i<n 1 ≤ i < n , and the external variables z 1 , … , z n z_1,\ldots,z_n z 1 , … , z n in the final row. The master function multiplies a factor x ω − 1 x^{\omega-1} x ω − 1 for each auxiliary variable x x x , a factor ( x − y ) 2 ω (x-y)^{2\omega} ( x − y ) 2 ω for each pair in the same row, and a factor ( x − y ) − ω (x-y)^{-\omega} ( x − y ) − ω for each pair in consecutive rows. A normalized integral over interlacing contours represents the vertex.
Following [SV23 ], we replace these exponents by nonnegative integers depending on p s p^s p s and approaching the original exponents p p p -adically. The resulting master polynomial has integral coefficients. Extracting a prescribed coefficient in its auxiliary variables and removing an external monomial gives T s ( n ) T_s^{(n)} T s ( n ) , normalized by T s ( n ) ( 0 ) = 1 T_s^{(n)}(0)=1 T s ( n ) ( 0 ) = 1 and T 0 ( n ) = 1 T_0^{(n)}=1 T 0 ( n ) = 1 . Definition 2.4 specifies the exponents and coefficient extraction. The two constructions approximate the same vertex, but their polynomials need not coincide. Define their difference by
Δ s ( n ) = T ~ s ( n ) − T s ( n ) . \Delta_s^{(n)}=\widetilde T_s^{(n)}-T_s^{(n)}. Δ s ( n ) = T s ( n ) − T s ( n ) .
For a rational number c ≠ 0 c\ne0 c = 0 , let v p ( c ) v_p(c) v p ( c ) be the exponent of p p p in c c c and set ∣ c ∣ p = p − v p ( c ) |c|_p=p^{-v_p(c)} ∣ c ∣ p = p − v p ( c ) , with ∣ 0 ∣ p = 0 |0|_p=0 ∣0 ∣ p = 0 and v p ( 0 ) = + ∞ v_p(0)=+\infty v p ( 0 ) = + ∞ . The field Q p \mathbb Q_p Q p is the completion of Q \mathbb Q Q for this norm, and Z p = { c ∈ Q p : ∣ c ∣ p ≤ 1 } \mathbb Z_p=\{c\in\mathbb Q_p:|c|_p\leq1\} Z p = { c ∈ Q p : ∣ c ∣ p ≤ 1 } is its ring of integers. On Z p [ [ Q ] ] \mathbb Z_p[[Q]] Z p [[ Q ]] the coefficient norm is ∥ ∑ c e Q e ∥ p = sup e ∣ c e ∣ p \|\sum c_{\boldsymbol e}Q^{\boldsymbol e}\|_p
=\sup_{\boldsymbol e}|c_{\boldsymbol e}|_p ∥ ∑ c e Q e ∥ p = sup e ∣ c e ∣ p . A congruence modulo p s p^s p s means divisibility of every coefficient. Coefficientwise convergence is weaker than convergence in this norm.
Theorem 1.2 (Theorems 4.2 and 4.6 ). Under the arithmetic hypotheses above, both families converge coefficientwise to V n ( Q ; ω ) V_n(Q;\omega) V n ( Q ; ω ) and satisfy its full commuting tCM equations modulo p s p^s p s . Let n ≥ 3 n\geq3 n ≥ 3 , s ≥ 1 s\geq1 s ≥ 1 , and put a 0 = ω ( p − 1 ) a_0=\omega(p-1) a 0 = ω ( p − 1 ) . For every 1 ≤ i ≤ n − 2 1\leq i\leq n-2 1 ≤ i ≤ n − 2 and 0 ≤ ℓ < s 0\leq\ell<s 0 ≤ ℓ < s , [ Q i p ℓ Q i + 1 p ℓ ] Δ s ( n ) ≡ p s − ℓ a 0 2 ( m o d p s − ℓ + 1 ) .
[Q_i^{p^\ell}Q_{i+1}^{p^\ell}]\Delta_s^{(n)}
\equiv p^{s-\ell}a_0^2\pmod{p^{s-\ell+1}}.
[ Q i p ℓ Q i + 1 p ℓ ] Δ s ( n ) ≡ p s − ℓ a 0 2 ( mod p s − ℓ + 1 ) . In particular, ∥ T ~ s ( n ) − T s ( n ) ∥ p = p − 1
\|\widetilde T_s^{(n)}-T_s^{(n)}\|_p=p^{-1}
∥ T s ( n ) − T s ( n ) ∥ p = p − 1 at every level, although every fixed coefficient of the difference tends to zero.
The full degree-dependent estimate is given in Theorem 4.2 . The displayed residues attain this estimate at every p p p -power scale and occur on every consecutive three-particle subflag.
The comparison follows from the constant-term formulas for the two families. For a fixed Kähler degree, the constant-term conditions bound the binomial indices that can contribute. Frobenius divisibility of the resulting binomial coefficients yields the degree-dependent valuation bound. Coefficients supported on three consecutive particles attain this bound, establishing its sharpness in every rank. Since the proof requires no division by orbit sizes, it also applies to admissible primes p ≤ n p\leq n p ≤ n .
Multiplication by G n A s G_n^{A_s} G n A s gives a congruence in the ring of symmetric polynomials. Set m = A s m=A_s m = A s , T s = G n m T s ( n ) \mathcal T_s=G_n^mT_s^{(n)} T s = G n m T s ( n ) , and δ = ( n − 1 , … , 1 , 0 ) \delta=(n-1,\ldots,1,0) δ = ( n − 1 , … , 1 , 0 ) . Then
P m δ ( − 1 / m ) − T s ∈ p Z [ z 1 , … , z n ] S n . P_{m\delta}^{(-1/m)}-\mathcal T_s
\in p\mathbb Z[z_1,\ldots,z_n]^{S_n}. P m δ ( − 1/ m ) − T s ∈ p Z [ z 1 , … , z n ] S n .
Both polynomials are monic with the same permutahedral Newton polytope. Formula (1.2) computes the coefficient difference obtained by transferring p ℓ p^\ell p ℓ units from one part of m δ m\delta m δ to the part two positions later. The resulting partition is a three-row squeeze of the staircase; see Corollary 4.8 . These formulas give explicit coefficient congruences comparing the regular negative-parameter staircase Jack family with its master-polynomial approximants.
The weighted Gauss norm gives a quantitative comparison between coefficientwise and norm convergence. For 0 < ϱ ≤ 1 0<\varrho\leq1 0 < ϱ ≤ 1 , let ∥ ⋅ ∥ p , ϱ \|\cdot\|_{p,\varrho} ∥ ⋅ ∥ p , ϱ denote the Gauss norm in which the coefficient of Q e Q^{\boldsymbol e} Q e is weighted by ϱ ∣ e ∣ \varrho^{|\boldsymbol e|} ϱ ∣ e ∣ . We prove
∥ Δ s ( n ) ∥ p , ϱ = max 0 ≤ ℓ < s p − ( s − ℓ ) ϱ 2 p ℓ . \|\Delta_s^{(n)}\|_{p,\varrho}
=\max_{0\leq\ell<s}p^{-(s-\ell)}\varrho^{2p^\ell}. ∥ Δ s ( n ) ∥ p , ϱ = 0 ≤ ℓ < s max p − ( s − ℓ ) ϱ 2 p ℓ .
For every fixed ϱ < 1 \varrho<1 ϱ < 1 this is O ϱ ( p − s ) O_\varrho(p^{-s}) O ϱ ( p − s ) ; at radius one it remains p − 1 p^{-1} p − 1 (Corollary 4.9 ). Thus the discrepancy converges uniformly on every smaller closed polydisc, while its coefficient norm stays fixed. For either family, the distance to the vertex itself is
∥ T s ( n ) − V n ∥ p = ∥ T ~ s ( n ) − V n ∥ p = 1. \begin{equation}
\|T_s^{(n)}-V_n\|_p
=\|\widetilde T_s^{(n)}-V_n\|_p=1. \tag*{(1.4)}
\end{equation} ∥ T s ( n ) − V n ∥ p = ∥ T s ( n ) − V n ∥ p = 1. (1.4)
This follows from a simple-root restriction and Lucas congruences; see Corollary 4.7 . The ratios T s ( n ) ( Q ) / T s − 1 ( n ) ( Q p ) T_s^{(n)}(Q)/T_{s-1}^{(n)}(Q^p) T s ( n ) ( Q ) / T s − 1 ( n ) ( Q p ) , called Frobenius quotients, converge in coefficient norm. Here Q p = ( Q 1 p , … , Q n − 1 p ) Q^p=(Q_1^p,\ldots,Q_{n-1}^p) Q p = ( Q 1 p , … , Q n − 1 p ) .
Dwork Congruences and the Commuting Equations
Smirnov and Varchenko [SV23 ] proved Grassmannian Dwork congruences and anticipated extensions to partial flags. Their scalar ghost argument already uses alternation and a Vandermonde expansion. We verify the row-degree bounds and chamber normalization for the complete-flag dimension vector 1 , … , n − 1 1,\ldots,n-1 1 , … , n − 1 . Kartik and Smirnov [KaS25 ] construct a related q q q -deformation in the Grassmannian case.
Theorem 1.3 (Theorems 2.8 , 5.5 , 5.7 , and 5.12 ). Under the arithmetic hypotheses above, for every n ≥ 2 n\geq2 n ≥ 2 , the polynomials T s ( n ) ∈ Z [ Q ] T_s^{(n)}\in\mathbb Z[Q] T s ( n ) ∈ Z [ Q ] have constant coefficient one and converge coefficientwise to V n ( Q ; ω ) V_n(Q;\omega) V n ( Q ; ω ) . For s ≥ 1 s\geq1 s ≥ 1 , T s + 1 ( n ) ( Q ) T s − 1 ( n ) ( Q p ) ≡ T s ( n ) ( Q ) T s ( n ) ( Q p ) ( m o d p s ) .
T_{s+1}^{(n)}(Q)T_{s-1}^{(n)}(Q^p)
\equiv T_s^{(n)}(Q)T_s^{(n)}(Q^p)\pmod{p^s}.
T s + 1 ( n ) ( Q ) T s − 1 ( n ) ( Q p ) ≡ T s ( n ) ( Q ) T s ( n ) ( Q p ) ( mod p s ) . For every m ≥ 1 m\geq1 m ≥ 1 , V n ( Q ; ω ) ≡ ∏ j ≥ 0 T m ( n ) ( Q p j ) T m − 1 ( n ) ( Q p j + 1 ) ( m o d p m ) .
V_n(Q;\omega)\equiv
\prod_{j\geq0}
\frac{T_m^{(n)}(Q^{p^j})}{T_{m-1}^{(n)}(Q^{p^{j+1}})}
\pmod{p^m}.
V n ( Q ; ω ) ≡ ∏ j ≥ 0 T m − 1 ( n ) ( Q p j + 1 ) T m ( n ) ( Q p j ) ( mod p m ) . The product is taken in the ( Q 1 , … , Q n − 1 ) (Q_1,\ldots,Q_{n-1}) ( Q 1 , … , Q n − 1 ) -adic topology. Moreover, for 1 ≤ k ≤ n 1\leq k\leq n 1 ≤ k ≤ n , B k ( 0 ) ( ω ) V n = 0 , B k ( 0 ) ( ω ) T s ( n ) ≡ 0 ( m o d p s ) .
\mathsf B_k^{(0)}(\omega)V_n=0,\qquad
\mathsf B_k^{(0)}(\omega)T_s^{(n)}\equiv0\pmod{p^s}.
B k ( 0 ) ( ω ) V n = 0 , B k ( 0 ) ( ω ) T s ( n ) ≡ 0 ( mod p s ) . All statements hold without a restriction on rank relative to p p p .
The commuting system has two roles in the construction. It constructs the exact-coupling polynomials in Theorem 1.1 and identifies the geometric vertex with the triangular period. Its integral coefficients also permit the transfer of differential equations to arithmetic approximants. The latter step is formulated as a general principle. Write T s = T s ( n ) T_s=T_s^{(n)} T s = T s ( n ) and V = V n ( Q ; ω ) V=V_n(Q;\omega) V = V n ( Q ; ω ) ; the ratio T s / V T_s/V T s / V is a formal series because V ( 0 ) = 1 V(0)=1 V ( 0 ) = 1 . Under the Dwork congruences,
θ α ( T s / V ) ∈ p s Z p [ [ Q ] ] , α ≠ 0. \theta^\alpha(T_s/V)\in p^s\mathbb Z_p[[Q]],\qquad \alpha\ne0. θ α ( T s / V ) ∈ p s Z p [[ Q ]] , α = 0.
Here θ i = Q i ∂ Q i \theta_i=Q_i\partial_{Q_i} θ i = Q i ∂ Q i is the Euler derivative in the i i i th Kähler variable, and θ α = ∏ i θ i α i \theta^\alpha=\prod_i\theta_i^{\alpha_i} θ α = ∏ i θ i α i for a multi-index α = ( α 1 , … , α n − 1 ) \alpha=(\alpha_1,\ldots,\alpha_{n-1}) α = ( α 1 , … , α n − 1 ) of nonnegative integers. Equivalently, every positive-order Euler derivative of T s / V T_s/V T s / V vanishes modulo p s p^s p s . It follows that every integral finite-order differential annihilator of V V V annihilates T s T_s T s modulo p s p^s p s (Lemma 5.11 ). The full commuting congruences therefore follow from this principle and the integral tCM operators. The Dwork congruences proved here concern T s ( n ) T_s^{(n)} T s ( n ) ; no Dwork congruence for the exact-coupling Jack family is asserted. The comparison theorem provides information not determined by these equations. The joint equations, Dwork congruences, and normalization do not uniquely determine the approximants, since they admit Frobenius modifications; see Remark (?) .
At ω = 1 / 2 \omega=1/2 ω = 1/2 , the symmetry of the physical coupling κ ( κ − 1 ) \kappa(\kappa-1) κ ( κ − 1 ) gives joint congruences modulo p 2 s p^{2s} p 2 s for the exact-coupling eigenfunctions in their natural Schrödinger gauge; see (3.30) .
Two- and Three-Particle Examples
For n = 2 n=2 n = 2 , the vertex is the Gauss hypergeometric series V 2 ( Q ; ω ) = 2 F 1 ( ω , ω ; 1 ; Q ) V_2(Q;\omega)={}_2F_1(\omega,\omega;1;Q) V 2 ( Q ; ω ) = 2 F 1 ( ω , ω ; 1 ; Q ) . The two polynomial families coincide:
T s ( 2 ) ( Q ) = T ~ s ( 2 ) ( Q ) = ∑ d = 0 A s ( A s d ) 2 Q d . T_s^{(2)}(Q)=\widetilde T_s^{(2)}(Q)
=\sum_{d=0}^{A_s}\binom{A_s}{d}^{\!2}Q^d. T s ( 2 ) ( Q ) = T s ( 2 ) ( Q ) = d = 0 ∑ A s ( d A s ) 2 Q d .
For ω = 1 / 2 \omega=1/2 ω = 1/2 and p = 3 p=3 p = 3 , one has T 1 ( 2 ) = 1 + Q T_1^{(2)}=1+Q T 1 ( 2 ) = 1 + Q , and the product formula reads V 2 ( Q ; 1 / 2 ) ≡ ∏ j ≥ 0 ( 1 + Q 3 j ) ( m o d 3 ) V_2(Q;1/2)\equiv\prod_{j\geq0}(1+Q^{3^j})\pmod3 V 2 ( Q ; 1/2 ) ≡ ∏ j ≥ 0 ( 1 + Q 3 j ) ( mod 3 ) . This is the projective-line example of [SV23 ]. The two constructions first differ for n = 3 n=3 n = 3 .
For n = 3 n=3 n = 3 , ω = 1 / 2 \omega=1/2 ω = 1/2 , and p = 3 p=3 p = 3 , the first level is
T 1 ( 3 ) = ( 1 + Q 1 + Q 1 Q 2 ) ( 1 + Q 2 + Q 1 Q 2 ) , T ~ 1 ( 3 ) = T 1 ( 3 ) + 3 Q 1 Q 2 . \begin{align*}
T_1^{(3)}&=(1+Q_1+Q_1Q_2)(1+Q_2+Q_1Q_2),\\
\widetilde T_1^{(3)}&=T_1^{(3)}+3Q_1Q_2.
\end{align*} T 1 ( 3 ) T 1 ( 3 ) = ( 1 + Q 1 + Q 1 Q 2 ) ( 1 + Q 2 + Q 1 Q 2 ) , = T 1 ( 3 ) + 3 Q 1 Q 2 .
At the next level, the families differ modulo 9 9 9 :
[ Q 1 3 Q 2 3 ] Δ 2 ( 3 ) = 136704 ≡ 3 ( m o d 9 ) . [Q_1^3Q_2^3]\Delta_2^{(3)}=136704\equiv3\pmod9. [ Q 1 3 Q 2 3 ] Δ 2 ( 3 ) = 136704 ≡ 3 ( mod 9 ) .
This coefficient occurs on every consecutive three-particle subflag in higher rank.
Formula (1.6) determines the normalized quasimap coefficients modulo p m p^m p m from two finite polynomials. Coefficients of total degree at most D D D require only K K K factors with p K > D p^K>D p K > D . For example, at p = 3 p=3 p = 3 and precision 9 9 9 ,
V 3 ( Q ; 1 / 2 ) ≡ T 2 ( 3 ) ( Q ) T 2 ( 3 ) ( Q 3 ) T 1 ( 3 ) ( Q 3 ) ( m o d 9 Z 3 [ [ Q ] ] + ( Q 1 , Q 2 ) 9 ) . V_3(Q;1/2)\equiv
\frac{T_2^{(3)}(Q)T_2^{(3)}(Q^3)}{T_1^{(3)}(Q^3)}
\pmod{9\mathbb Z_3[[Q]]+(Q_1,Q_2)^9}. V 3 ( Q ; 1/2 ) ≡ T 1 ( 3 ) ( Q 3 ) T 2 ( 3 ) ( Q ) T 2 ( 3 ) ( Q 3 ) ( mod 9 Z 3 [[ Q ]] + ( Q 1 , Q 2 ) 9 ) .
The coefficients considered here are zero-framing specializations of equivariant quasimap invariants. The variables remain formal; no numerical p p p -adic convergence of V n V_n V n is required.
Structure of the Paper
§ 2 defines the triangular period and the master-polynomial family. § 3 develops the commuting tCM equations, explains their perturbative solution, and constructs the exact-coupling polynomials. § 4 proves the sharp comparison. The Dwork and transfer arguments follow in § 5 , and § 6 records the explicit calculations. Appendix § 7 derives the localization formula and the cohomological normalization. Appendix § 8 gives the kernel identities in the integral chamber normalization used here.
Acknowledgements
I thank Alexander Varchenko for discussions of Dwork congruences and the initial complete-flag calculations. I also thank Andrey Smirnov for useful discussions of vertex functions and their arithmetic properties. I acknowledge support from the Beijing Natural Science Foundation (BJNSF) under grant IS26008.
I used ChatGPT 6.1 iteratively in order to check the calculations for complete flag varieties and higher Dwork congruences, polish the proofs, and refine the statements.
Triangular Master Polynomials and Chamber Periods
We use the triangular quiver of dimension vector 1 , … , n − 1 1,\ldots,n-1 1 , … , n − 1 to construct a chamber period and the master-polynomial family. § 3 identifies the period with the zero-framing quasimap vertex and constructs the exact-coupling polynomial approximations from the tCM equations. The localization convention is recorded in Appendix § 7 .
The period construction follows [SV23 ] (§3). Its mirror symmetry interpretation replaces an enumerative generating function by an integral of an explicit multivalued density. Period representations are standard in mirror symmetry [Hori03 ]; here the relevant construction is supplied by 3 d 3d 3 d mirror symmetry and verified by the normalized tCM equation. The quiver determines the factors of the density, and a choice of interlacing contours determines its expansion in the Kähler variables.
Let n ≥ 2 n\geq2 n ≥ 2 and N = ( n 2 ) N=\binom n2 N = ( 2 n ) . Write the internal variables as x = ( x i , a ) 1 ≤ a ≤ i ≤ n − 1 x=(x_{i,a})_{1\leq a\leq i\leq n-1} x = ( x i , a ) 1 ≤ a ≤ i ≤ n − 1 and set x n , a = z a x_{n,a}=z_a x n , a = z a , 1 ≤ a ≤ n 1\leq a\leq n 1 ≤ a ≤ n , for the final row. Define
M ( x ) = ∏ i = 1 n − 1 ∏ a = 1 i x i , a , Δ ( x ) = ∏ i = 1 n − 1 ∏ 1 ≤ a < b ≤ i ( x i , b − x i , a ) , E ( x , z ) = ∏ i = 1 n − 1 ∏ a = 1 i ∏ b = 1 i + 1 ( x i , a − x i + 1 , b ) , G n ( z ) = ∏ a = 1 n z a a − 1 , c n = ( n + 1 3 ) . \begin{align}
M(x)&=\prod_{i=1}^{n-1}\prod_{a=1}^i x_{i,a},
&\Delta(x)&=\prod_{i=1}^{n-1}\prod_{1\leq a<b\leq i}
(x_{i,b}-x_{i,a}), \tag*{(2.1)}\\
E(x,z)&=\prod_{i=1}^{n-1}\prod_{a=1}^i\prod_{b=1}^{i+1}
(x_{i,a}-x_{i+1,b}),
&G_n(z)&=\prod_{a=1}^n z_a^{a-1},
\qquad c_n=\binom{n+1}{3}. \tag*{(2.2)}
\end{align} M ( x ) E ( x , z ) = i = 1 ∏ n − 1 a = 1 ∏ i x i , a , = i = 1 ∏ n − 1 a = 1 ∏ i b = 1 ∏ i + 1 ( x i , a − x i + 1 , b ) , Δ ( x ) G n ( z ) = i = 1 ∏ n − 1 1 ≤ a < b ≤ i ∏ ( x i , b − x i , a ) , = a = 1 ∏ n z a a − 1 , c n = ( 3 n + 1 ) . (2.1) (2.2)
We use d i , a = a \mathbf d_{i,a}=a d i , a = a and the all-ones vector 1 \mathbf1 1 of length N N N . The coefficient of ∏ i , a x i , a ν i , a \prod_{i,a}x_{i,a}^{\nu_{i,a}} ∏ i , a x i , a ν i , a in F F F is denoted by [ x ν ] F [x^{\boldsymbol\nu}]F [ x ν ] F ; for a polynomial this coefficient vanishes if a component of ν \boldsymbol\nu ν is negative. The chamber coordinates are
Q j = z j / z j + 1 , 1 ≤ j ≤ n − 1. \begin{equation}
Q_j=z_j/z_{j+1},\qquad 1\leq j\leq n-1. \tag*{(2.3)}
\end{equation} Q j = z j / z j + 1 , 1 ≤ j ≤ n − 1. (2.3)
Choose distinct positive radii for the internal variables and the z a z_a z a , satisfying
∣ x i + 1 , a ∣ < ∣ x i , a ∣ < ∣ x i + 1 , a + 1 ∣ ( 1 ≤ a ≤ i ≤ n − 1 ) . \begin{equation}
|x_{i+1,a}|<|x_{i,a}|<|x_{i+1,a+1}|
\qquad(1\leq a\leq i\leq n-1). \tag*{(2.4)}
\end{equation} ∣ x i + 1 , a ∣ < ∣ x i , a ∣ < ∣ x i + 1 , a + 1 ∣ ( 1 ≤ a ≤ i ≤ n − 1 ) . (2.4)
These inequalities admit such choices and imply ∣ z 1 ∣ < ⋯ < ∣ z n ∣ |z_1|<\cdots<|z_n| ∣ z 1 ∣ < ⋯ < ∣ z n ∣ . For variables in adjacent rows we denote the ratio of smaller to larger radius by ρ i , a , b \rho_{i,a,b} ρ i , a , b :
ρ i , a , b = { x i + 1 , b / x i , a , b ≤ a , x i , a / x i + 1 , b , b > a . \begin{equation}
\rho_{i,a,b}=
\begin{cases}
x_{i+1,b}/x_{i,a},& b\leq a,\\
x_{i,a}/x_{i+1,b},& b>a.
\end{cases} \tag*{(2.5)}
\end{equation} ρ i , a , b = { x i + 1 , b / x i , a , x i , a / x i + 1 , b , b ≤ a , b > a . (2.5)
The adjacent-row ratios and the same-row ratios x i , a / x i , b x_{i,a}/x_{i,b} x i , a / x i , b , a < b a<b a < b , all have absolute value less than one on this torus.
Definition 2.1. For ω ∈ Q \omega\in\mathbb Q ω ∈ Q , define the normalized chamber period by
V n ( Q ; ω ) = C T x [ ∏ i = 1 n − 1 ∏ a < b ( 1 − x i , a / x i , b ) 2 ω ∏ i = 1 n − 1 ∏ a = 1 i ∏ b = 1 i + 1 ( 1 − ρ i , a , b ) − ω ] . \begin{equation}
\mathcal V_n(Q;\omega)=\mathop{\mathrm{CT}}_x
\left[
\prod_{i=1}^{n-1}\prod_{a<b}
(1-x_{i,a}/x_{i,b})^{2\omega}
\prod_{i=1}^{n-1}\prod_{a=1}^i\prod_{b=1}^{i+1}
(1-\rho_{i,a,b})^{-\omega}
\right]. \tag*{(2.6)}
\end{equation} V n ( Q ; ω ) = CT x [ i = 1 ∏ n − 1 a < b ∏ ( 1 − x i , a / x i , b ) 2 ω i = 1 ∏ n − 1 a = 1 ∏ i b = 1 ∏ i + 1 ( 1 − ρ i , a , b ) − ω ] . (2.6) We expand each factor by the binomial theorem in the indicated ratio. The notation C T x F = [ x 0 ] F \mathop{\mathrm{CT}}_xF=[x^{\mathbf0}]F CT x F = [ x 0 ] F extracts the coefficient of ∏ i , a x i , a 0 \prod_{i,a}x_{i,a}^0 ∏ i , a x i , a 0 from this Laurent expansion and retains the external variables z a z_a z a .
For n = 2 n=2 n = 2 , the chamber is ∣ z 1 ∣ < ∣ x ∣ < ∣ z 2 ∣ |z_1|<|x|<|z_2| ∣ z 1 ∣ < ∣ x ∣ < ∣ z 2 ∣ and
C T x ( 1 − z 1 / x ) λ ( 1 − x / z 2 ) μ = ∑ k ≥ 0 ( λ k ) ( μ k ) Q 1 k . \mathop{\mathrm{CT}}_x(1-z_1/x)^\lambda(1-x/z_2)^\mu
=\sum_{k\geq0}\binom\lambda k\binom\mu k Q_1^k. CT x ( 1 − z 1 / x ) λ ( 1 − x / z 2 ) μ = k ≥ 0 ∑ ( k λ ) ( k μ ) Q 1 k .
The equality of the two indices is conservation of flow at x x x . The same interpretation controls the triangular period.
Lemma 2.2. For arbitrary rational exponents in the binomial factors of (2.6) , the prescribed constant term belongs to 1 + ( Q 1 , … , Q n − 1 ) Q [ [ Q 1 , … , Q n − 1 ] ] 1+(Q_1,\ldots,Q_{n-1})\mathbb Q[[Q_1,\ldots,Q_{n-1}]] 1 + ( Q 1 , … , Q n − 1 ) Q [[ Q 1 , … , Q n − 1 ]] . Each coefficient receives finitely many contributions from the binomial expansion.
Proof. Assign a graph vertex to every internal and external variable, and an edge to every binomial factor. We orient each edge from smaller to larger radius. The binomial indices are nonnegative integer flows on the edges; the exponent at a vertex is outgoing minus incoming flow. Constant-term extraction is therefore conservation of flow at the internal vertices. The ordering of radii makes the graph acyclic.
Let μ a \mu_a μ a be the exponent of z a z_a z a in a surviving monomial. The sum of all vertex exponents vanishes, giving ∑ a μ a = 0 \sum_a\mu_a=0 ∑ a μ a = 0 and
z 1 μ 1 ⋯ z n μ n = ∏ j = 1 n − 1 Q j e j , e j = ∑ a = 1 j μ a . z_1^{\mu_1}\cdots z_n^{\mu_n}
=\prod_{j=1}^{n-1}Q_j^{e_j},
\qquad e_j=\sum_{a=1}^j\mu_a. z 1 μ 1 ⋯ z n μ n = j = 1 ∏ n − 1 Q j e j , e j = a = 1 ∑ j μ a . Consider a cut between consecutive radii in the gap from ∣ z j ∣ |z_j| ∣ z j ∣ to ∣ z j + 1 ∣ |z_{j+1}| ∣ z j + 1 ∣ . Flow conservation at internal vertices identifies the sum of its crossing flows with e j e_j e j . Since all crossing edges have the same orientation, e j ≥ 0 e_j\geq0 e j ≥ 0 .
Every internal radius is between ∣ z 1 ∣ |z_1| ∣ z 1 ∣ and ∣ z n ∣ |z_n| ∣ z n ∣ . Consequently each edge crosses a cut in one of the external gaps, and its flow is bounded by the corresponding e j e_j e j , hence by max j e j \max_j e_j max j e j . The graph has finitely many edges, so a fixed multidegree receives finitely many contributions. In degree zero all flows vanish, and the product of the binomial constant terms is one. ◻
The argument extends the chamber expansion of [SV23 ] (Proposition 3.1 and the proof of Theorem 4.4) to complete flags. It also separates the integrality of the period from the additional hypotheses needed for the polynomial approximants.
Proposition 2.3. Every coefficient of V n ( Q ; ω ) \mathcal V_n(Q;\omega) V n ( Q ; ω ) is a polynomial in ω \omega ω over Q \mathbb Q Q . For every prime p p p and rational ω ∈ Z p \omega\in\mathbb Z_p ω ∈ Z p , V n ( Q ; ω ) ∈ Z p [ [ Q 1 , … , Q n − 1 ] ] . \mathcal V_n(Q;\omega)\in\mathbb Z_p[[Q_1,\ldots,Q_{n-1}]]. V n ( Q ; ω ) ∈ Z p [[ Q 1 , … , Q n − 1 ]] . In particular, if ω = r / d \omega=r/d ω = r / d in lowest terms with d > 0 d>0 d > 0 , then V n ( Q ; r / d ) ∈ Z [ 1 / d ] [ [ Q 1 , … , Q n − 1 ] ] . \mathcal V_n(Q;r/d)\in\mathbb Z[1/d][[Q_1,\ldots,Q_{n-1}]]. V n ( Q ; r / d ) ∈ Z [ 1/ d ] [[ Q 1 , … , Q n − 1 ]] .
Proof. Lemma 2.2 expresses each coefficient as a finite sum of products of binomial polynomials in 2 ω 2\omega 2 ω and − ω -\omega − ω . This proves polynomial dependence on ω \omega ω . If ω ∈ Z p \omega\in\mathbb Z_p ω ∈ Z p , both upper arguments belong to Z p \mathbb Z_p Z p and all their binomial coefficients are p p p -integral. Indeed, for fixed k k k , the polynomial ( α k ) \binom{\alpha}{k} ( k α ) is continuous on Z p \mathbb Z_p Z p and takes integer values on the dense subset Z ≥ 0 \mathbb Z_{\geq0} Z ≥ 0 . The finite sum is therefore integral. Applying this to every prime not dividing d d d proves the last assertion. ◻
The constant-term formula is equivalent to a contour integral of the multivalued density
M ω ( x , z ) = M ( x ) ω − 1 Δ ( x ) 2 ω E ( x , z ) − ω . \begin{equation}
\mathcal M_\omega(x,z)=
M(x)^{\omega-1}\Delta(x)^{2\omega}E(x,z)^{-\omega}. \tag*{(2.7)}
\end{equation} M ω ( x , z ) = M ( x ) ω − 1 Δ ( x ) 2 ω E ( x , z ) − ω . (2.7)
Factor each difference by the variable of larger radius and use the branches specified by the binomial expansions. The c n c_n c n negative adjacent-row factors contribute a constant phase. With ( − t ) − ω = e − π i ω t − ω (-t)^{-\omega}=e^{-\pi\mathrm i\omega}t^{-\omega} ( − t ) − ω = e − π i ω t − ω , the normalized differential form becomes
\begin{equation}
e^{\pi\mathrm i\omega c_n}G_n(z)^\omega
\mathcal M_\omega(x,z)\bigwedge_{i,a}dx_{i,a}
=\left[\text{the product in \eqref{ar:period-CT}}\right]
\bigwedge_{i,a}\frac{dx_{i,a}}{x_{i,a}}. \tag*{(2.8)}
\end{equation}
The wedge products have the same ordering. In contour notation,
V n ( Q ; ω ) = e π i ω c n G n ( z ) ω ( 2 π i ) N ∮ Γ ( z ) M ( x ) ω − 1 Δ ( x ) 2 ω E ( x , z ) − ω ⋀ i , a d x i , a . \begin{equation}
\mathcal V_n(Q;\omega)
=\frac{e^{\pi\mathrm i\omega c_n}G_n(z)^\omega}
{(2\pi\mathrm i)^N}
\oint_{\Gamma(z)}
M(x)^{\omega-1}\Delta(x)^{2\omega}E(x,z)^{-\omega}
\bigwedge_{i,a}dx_{i,a}. \tag*{(2.9)}
\end{equation} V n ( Q ; ω ) = ( 2 π i ) N e π i ω c n G n ( z ) ω ∮ Γ ( z ) M ( x ) ω − 1 Δ ( x ) 2 ω E ( x , z ) − ω i , a ⋀ d x i , a . (2.9)
Here Γ ( z ) \Gamma(z) Γ ( z ) is the product of positively oriented circles with the radii in (2.4) ; branches are fixed by (2.8) . The normalized integrand is single-valued on this torus. Integrating its chamber expansion extracts precisely the internal constant term. In particular, (2.7) is a density for the measure ⋀ d x i , a \bigwedge dx_{i,a} ⋀ d x i , a ; its expression as a constant term already accounts for the logarithmic measure.
For the master-polynomial construction we impose
ω = r / d , ( r , d ) = 1 , 0 < ω ≤ 1 2 , p odd . \begin{equation}
\omega=r/d,\qquad (r,d)=1,\qquad 0<\omega\leq\tfrac12,
\qquad p\text{ odd}. \tag*{(2.10)}
\end{equation} ω = r / d , ( r , d ) = 1 , 0 < ω ≤ 2 1 , p odd . (2.10)
For s ≥ 0 s\geq0 s ≥ 0 put
P s = p s , A s = ω ( P s − 1 ) , β s = ( 1 − ω ) ( P s − 1 ) , γ s = 1 + ( 1 − 2 ω ) ( P s − 1 ) = P s − 2 A s . \begin{equation}
\begin{gathered}
P_s=p^s,\qquad A_s=\omega(P_s-1),\qquad
\beta_s=(1-\omega)(P_s-1),\\
\gamma_s=1+(1-2\omega)(P_s-1)=P_s-2A_s.
\end{gathered} \tag*{(2.11)}
\end{equation} P s = p s , A s = ω ( P s − 1 ) , β s = ( 1 − ω ) ( P s − 1 ) , γ s = 1 + ( 1 − 2 ω ) ( P s − 1 ) = P s − 2 A s . (2.11)
The exponents are nonnegative integers, with γ s \gamma_s γ s odd. The master polynomial is
Φ s ( x , z ) = M ( x ) β s Δ ( x ) γ s E ( x , z ) A s . \begin{equation}
\Phi_s(x,z)=M(x)^{\beta_s}\Delta(x)^{\gamma_s}E(x,z)^{A_s}. \tag*{(2.12)}
\end{equation} Φ s ( x , z ) = M ( x ) β s Δ ( x ) γ s E ( x , z ) A s . (2.12)
At s = 0 s=0 s = 0 , we have β 0 = A 0 = 0 \beta_0=A_0=0 β 0 = A 0 = 0 and γ 0 = 1 \gamma_0=1 γ 0 = 1 . Thus Φ 0 = Δ \Phi_0=\Delta Φ 0 = Δ , the product of the rowwise Vandermonde factors. The group S = ∏ i = 1 n − 1 S i \mathfrak S=\prod_{i=1}^{n-1}S_i S = ∏ i = 1 n − 1 S i acts by permutations within each internal row: S i S_i S i is the symmetric group on x i , 1 , … , x i , i x_{i,1},\ldots,x_{i,i} x i , 1 , … , x i , i , and all external variables z a z_a z a are fixed. The odd exponent γ s \gamma_s γ s makes Φ s \Phi_s Φ s alternating under this action.
Definition 2.4. Set
U s ( z ) = [ x P s d − 1 ] Φ s ( x , z ) , T s ( n ) ( Q ) = ( − 1 ) A s c n G n ( z ) − A s U s ( z ) . \begin{equation}
U_s(z)=[x^{P_s\mathbf d-\mathbf1}]\Phi_s(x,z),\qquad
T_s^{(n)}(Q)=(-1)^{A_sc_n}G_n(z)^{-A_s}U_s(z). \tag*{(2.13)}
\end{equation} U s ( z ) = [ x P s d − 1 ] Φ s ( x , z ) , T s ( n ) ( Q ) = ( − 1 ) A s c n G n ( z ) − A s U s ( z ) . (2.13) The coefficient extracted in (2.13) is that of ∏ i , a x i , a a p s − 1 \prod_{i,a}x_{i,a}^{ap^s-1} ∏ i , a x i , a a p s − 1 in Φ s \Phi_s Φ s ; it is a polynomial in the external variables z a z_a z a . The sign and monomial factors normalize its constant coefficient. The following proposition shows that the resulting expression is an integral polynomial in Q Q Q with constant coefficient one.
Proposition 2.5. One has T s ( n ) ∈ Z [ Q 1 , … , Q n − 1 ] T_s^{(n)}\in\mathbb Z[Q_1,\ldots,Q_{n-1}] T s ( n ) ∈ Z [ Q 1 , … , Q n − 1 ] and T s ( n ) ( 0 ) = 1 T_s^{(n)}(0)=1 T s ( n ) ( 0 ) = 1 , including T 0 ( n ) = 1 T_0^{(n)}=1 T 0 ( n ) = 1 . More explicitly, T s ( n ) = C T x [ ∏ i = 1 n − 1 ∏ a < b ( 1 − x i , a / x i , b ) γ s ∏ i = 1 n − 1 ∏ a = 1 i ∏ b = 1 i + 1 ( 1 − ρ i , a , b ) A s ] .
T_s^{(n)}=\mathop{\mathrm{CT}}_x
\left[
\prod_{i=1}^{n-1}\prod_{a<b}
(1-x_{i,a}/x_{i,b})^{\gamma_s}
\prod_{i=1}^{n-1}\prod_{a=1}^i\prod_{b=1}^{i+1}
(1-\rho_{i,a,b})^{A_s}
\right].
T s ( n ) = CT x [ ∏ i = 1 n − 1 ∏ a < b ( 1 − x i , a / x i , b ) γ s ∏ i = 1 n − 1 ∏ a = 1 i ∏ b = 1 i + 1 ( 1 − ρ i , a , b ) A s ] .
Proof. We factor the differences in (2.12) by their larger-radius variables. The variable x i , a x_{i,a} x i , a has a − 1 a-1 a − 1 smaller variables in its own row and 2 a − 1 2a-1 2 a − 1 in the adjacent rows, interpreting the absent first row as empty. Its monomial exponent is therefore
β s + ( a − 1 ) γ s + ( 2 a − 1 ) A s = a P s − 1. \beta_s+(a-1)\gamma_s+(2a-1)A_s=aP_s-1. β s + ( a − 1 ) γ s + ( 2 a − 1 ) A s = a P s − 1. The exponent of z a z_a z a is ( a − 1 ) A s (a-1)A_s ( a − 1 ) A s . The sign is determined by the adjacent-row factors whose first variable has smaller radius. Their number is
∑ i = 1 n − 1 ∑ a = 1 i ( i + 1 − a ) = ∑ i = 1 n − 1 i ( i + 1 ) 2 = c n . \sum_{i=1}^{n-1}\sum_{a=1}^i(i+1-a)
=\sum_{i=1}^{n-1}\frac{i(i+1)}2=c_n. i = 1 ∑ n − 1 a = 1 ∑ i ( i + 1 − a ) = i = 1 ∑ n − 1 2 i ( i + 1 ) = c n . Hence the monomial and its sign are
( − 1 ) A s c n G n ( z ) A s x P s d − 1 . \begin{equation}
(-1)^{A_sc_n}G_n(z)^{A_s}x^{P_s\mathbf d-\mathbf1}. \tag*{(2.15)}
\end{equation} ( − 1 ) A s c n G n ( z ) A s x P s d − 1 . (2.15) Dividing by this monomial converts the selected coefficient into the constant term (2.14) . Its nonnegative integer powers give a finite expansion over Z \mathbb Z Z . Lemma 2.2 then shows that the result is a polynomial in Q Q Q and has constant coefficient one. ◻
Lemma 2.6. For P = p s P=p^s P = p s , a variable on row i i i has degree at most deg x i , a Φ s ≤ i P + A s − 1 < ( i + 1 ) P − 1. \deg_{x_{i,a}}\Phi_s\leq iP+A_s-1<(i+1)P-1. deg x i , a Φ s ≤ i P + A s − 1 < ( i + 1 ) P − 1. A coefficient [ x P u − 1 ] Φ s [x^{P\boldsymbol u-\mathbf1}]\Phi_s [ x P u − 1 ] Φ s can be nonzero only when u = τ ( d ) \boldsymbol u=\tau(\mathbf d) u = τ ( d ) for a rowwise permutation τ ∈ S \tau\in\mathfrak S τ ∈ S . Its value is then sgn ( τ ) U s ( z ) \operatorname{sgn}(\tau)U_s(z) sgn ( τ ) U s ( z ) .
Proof. A variable on row i i i occurs in i − 1 i-1 i − 1 same-row differences and 2 i 2i 2 i adjacent-row differences. Thus its degree is bounded by β s + ( i − 1 ) γ s + 2 i A s = i P + A s − 1 \beta_s+(i-1)\gamma_s+2iA_s=iP+A_s-1 β s + ( i − 1 ) γ s + 2 i A s = i P + A s − 1 . Since A s < P A_s<P A s < P , an exponent P u i , a − 1 Pu_{i,a}-1 P u i , a − 1 must have 1 ≤ u i , a ≤ i 1\leq u_{i,a}\leq i 1 ≤ u i , a ≤ i . Alternation makes the coefficient zero if two entries in a row agree. The remaining entries are a permutation of 1 , … , i 1,\ldots,i 1 , … , i , with the asserted sign. ◻
Example 2.7. For n = 2 n=2 n = 2 , the coefficient extraction is straightforward:
T s ( 2 ) ( Q ; ω ) = ∑ k = 0 A s ( A s k ) 2 Q k . T_s^{(2)}(Q;\omega)=\sum_{k=0}^{A_s}\binom{A_s}{k}^{\!2}Q^k. T s ( 2 ) ( Q ; ω ) = k = 0 ∑ A s ( k A s ) 2 Q k . After removing the monomial factor in x 1 , 1 x_{1,1} x 1 , 1 , we extract the coefficient of x 1 , 1 A s x_{1,1}^{A_s} x 1 , 1 A s in ( x 1 , 1 − z 1 ) A s ( x 1 , 1 − z 2 ) A s (x_{1,1}-z_1)^{A_s}(x_{1,1}-z_2)^{A_s} ( x 1 , 1 − z 1 ) A s ( x 1 , 1 − z 2 ) A s and use the normalization of (2.13) . The limiting period is
V 2 = 2 F 1 ( ω , ω ; 1 ; Q ) . \mathcal V_2={}_2F_1(\omega,\omega;1;Q). V 2 = 2 F 1 ( ω , ω ; 1 ; Q ) . This is the projective-line example of [SV23 ] (Example 2.2).
Lemma 2.2 also controls the passage to the p p p -adic limit. In each fixed Kähler degree the binomial indices remain bounded, so we can take the limit in their finite sum.
Theorem 2.8. Under (2.10) , lim s → ∞ [ Q e ] T s ( n ) ( Q ) = [ Q e ] V n ( Q ; ω ) in Q p \lim_{s\to\infty}[Q^{\boldsymbol e}]T_s^{(n)}(Q)
=[Q^{\boldsymbol e}]\mathcal V_n(Q;\omega)
\quad\text{in }\mathbb Q_p lim s → ∞ [ Q e ] T s ( n ) ( Q ) = [ Q e ] V n ( Q ; ω ) in Q p for every e ∈ Z ≥ 0 n − 1 \boldsymbol e\in\mathbb Z_{\geq0}^{n-1} e ∈ Z ≥ 0 n − 1 . In particular, V n ∈ Z p [ [ Q 1 , … , Q n − 1 ] ] \mathcal V_n\in\mathbb Z_p[[Q_1,\ldots,Q_{n-1}]] V n ∈ Z p [[ Q 1 , … , Q n − 1 ]] .
Proof. By Lemma 2.2 , all binomial indices in multidegree e \boldsymbol e e are at most max j e j \max_j e_j max j e j . The coefficient in (2.14) is therefore a finite sum of products of binomial polynomials in A s A_s A s and γ s \gamma_s γ s , with an indexing set independent of s s s . An index exceeding a nonnegative integer upper argument contributes zero. The limits A s → − ω A_s\to-\omega A s → − ω and γ s → 2 ω \gamma_s\to2\omega γ s → 2 ω in Q p \mathbb Q_p Q p give (2.6) by continuity of these rational polynomials. The approximating coefficients belong to Z \mathbb Z Z , and the closedness of Z p \mathbb Z_p Z p in Q p \mathbb Q_p Q p proves that their limits are integral. ◻
The polynomials T s ( n ) T_s^{(n)} T s ( n ) therefore approximate the period p p p -adically in every fixed Kähler degree. Theorem 3.5 identifies this period with the quasimap partition function, so the same construction proves its p p p -integrality. Increasing s s s improves each fixed-degree coefficient; the polynomials T s ( n ) T_s^{(n)} T s ( n ) need not be Taylor truncations of the period. Theorem 2.8 is the complete-flag counterpart of [SV23 ] (Theorem 4.4).
Integrability and Exact Polynomial Approximations
The tCM system gives a second construction of polynomial approximations to the vertex. Formal perturbation theory around the free Hamiltonian constructs the normalized Schrödinger wavefunction. Passing to vertex gauge gives a series whose coefficients depend polynomially on the coupling. At negative integer coupling the vertex series terminates to an integral polynomial. Choosing these integers to approach ω \omega ω in Q p \mathbb Q_p Q p produces exact eigenfunctions at varying couplings and congruences for the fixed system at ω \omega ω .
As in [K21 ] (Proposition 2.11), we obtain polynomial eigenfunctions by specializing parameters of an enumerative series. Here we specialize the cohomological coupling at zero additive framing. We prove termination and its arithmetic consequences directly from the normalized chamber solution.
Put
Q i = z i z i + 1 , q i j = z i z j = Q i ⋯ Q j − 1 , u i j = q i j 1 − q i j ( i < j ) . \begin{equation}
Q_i=\frac{z_i}{z_{i+1}},\qquad
q_{ij}=\frac{z_i}{z_j}=Q_i\cdots Q_{j-1},\qquad
u_{ij}=\frac{q_{ij}}{1-q_{ij}}\quad(i<j). \tag*{(3.1)}
\end{equation} Q i = z i + 1 z i , q ij = z j z i = Q i ⋯ Q j − 1 , u ij = 1 − q ij q ij ( i < j ) . (3.1)
For D i = z i ∂ z i D_i=z_i\partial_{z_i} D i = z i ∂ z i and θ i = Q i ∂ Q i \theta_i=Q_i\partial_{Q_i} θ i = Q i ∂ Q i , with θ 0 = θ n = 0 \theta_0=\theta_n=0 θ 0 = θ n = 0 ,
D i = θ i − θ i − 1 , H 0 : = 1 2 ∑ i D i 2 = ∑ i = 1 n − 1 θ i 2 − ∑ i = 1 n − 2 θ i θ i + 1 \begin{equation}
D_i=\theta_i-\theta_{i-1},\qquad
H_0:=\frac12\sum_iD_i^2
=\sum_{i=1}^{n-1}\theta_i^2
-\sum_{i=1}^{n-2}\theta_i\theta_{i+1} \tag*{(3.2)}
\end{equation} D i = θ i − θ i − 1 , H 0 := 2 1 i ∑ D i 2 = i = 1 ∑ n − 1 θ i 2 − i = 1 ∑ n − 2 θ i θ i + 1 (3.2)
on ratio functions. In particular, ∑ i D i = 0 \sum_iD_i=0 ∑ i D i = 0 on these functions. For a coupling κ \kappa κ , use the Hamiltonian normalization [C71 , S71 , M75 ]
H n , κ = H 0 − g κ U n , g κ = κ ( κ − 1 ) , U n = ∑ i < j q i j ( 1 − q i j ) 2 , J n , κ = ∏ i < j ( 1 − q i j ) κ . \begin{equation}
\begin{gathered}
H_{n,\kappa}=H_0-g_\kappa U_n,\qquad
g_\kappa=\kappa(\kappa-1),\qquad
U_n=\sum_{i<j}\frac{q_{ij}}{(1-q_{ij})^2},\\
J_{n,\kappa}=\prod_{i<j}(1-q_{ij})^\kappa.
\end{gathered} \tag*{(3.3)}
\end{equation} H n , κ = H 0 − g κ U n , g κ = κ ( κ − 1 ) , U n = i < j ∑ ( 1 − q ij ) 2 q ij , J n , κ = i < j ∏ ( 1 − q ij ) κ . (3.3)
Every factor is expanded at Q = 0 Q=0 Q = 0 with constant coefficient one. We abbreviate J n , ω = J n J_{n,\omega}=J_n J n , ω = J n .
Proposition 3.1. The vertex-gauge Hamiltonian is L n , κ : = J n , κ − 1 H n , κ J n , κ = H 0 − κ ∑ i < j u i j ( D i − D j ) − κ 2 ∑ i < j ( j − i ) u i j .
\mathcal L_{n,\kappa}:=J_{n,\kappa}^{-1}H_{n,\kappa}J_{n,\kappa}
=H_0-\kappa\sum_{i<j}u_{ij}(D_i-D_j)
-\kappa^2\sum_{i<j}(j-i)u_{ij}.
L n , κ := J n , κ − 1 H n , κ J n , κ = H 0 − κ ∑ i < j u ij ( D i − D j ) − κ 2 ∑ i < j ( j − i ) u ij .
Proof. Let α i j = e i − e j \alpha_{ij}=e_i-e_j α ij = e i − e j . The logarithmic gradient of the gauge is − κ ∑ i < j α i j u i j -\kappa\sum_{i<j}\alpha_{ij}u_{ij} − κ ∑ i < j α ij u ij . Its divergence gives − κ ∑ i < j q i j / ( 1 − q i j ) 2 -\kappa\sum_{i<j}q_{ij}/(1-q_{ij})^2 − κ ∑ i < j q ij / ( 1 − q ij ) 2 in the conjugated kinetic term. The remaining multiplication term is
For i < j < k i<j<k i < j < k , the relation q i k = q i j q j k q_{ik}=q_{ij}q_{jk} q ik = q ij q j k gives
u i j u i k − u i j u j k + u i k u j k = − u i k . u_{ij}u_{ik}-u_{ij}u_{jk}+u_{ik}u_{jk}=-u_{ik}. u ij u ik − u ij u j k + u ik u j k = − u ik . Grouping cross terms by triples therefore yields
1 2 ∣ ∑ i < j α i j u i j ∣ 2 = ∑ i < j u i j 2 − ∑ i < j ( j − i − 1 ) u i j . \frac12\left|\sum_{i<j}\alpha_{ij}u_{ij}\right|^2
=\sum_{i<j}u_{ij}^2-\sum_{i<j}(j-i-1)u_{ij}. 2 1 i < j ∑ α ij u ij 2 = i < j ∑ u ij 2 − i < j ∑ ( j − i − 1 ) u ij . Substitution proves the formula. ◻
Proof. For d ≥ 0 \boldsymbol d\geq0 d ≥ 0 , put d 0 = d n = 0 d_0=d_n=0 d 0 = d n = 0 . The diagonal coefficient in degree d \boldsymbol d d is
It is a positive integer for d ≠ 0 \boldsymbol d\ne0 d = 0 . All other operator coefficients have positive chamber degree. Starting from the constant coefficient one, the equation thus determines every coefficient by induction on total degree. The only divisions are by E ( d ) \mathcal E(\boldsymbol d) E ( d ) , so each coefficient is polynomial in κ \kappa κ over Q \mathbb Q Q . ◻
For n = 2 n=2 n = 2 , with Q = z 1 / z 2 Q=z_1/z_2 Q = z 1 / z 2 and θ = Q ∂ Q \theta=Q\partial_Q θ = Q ∂ Q ,
( 1 − Q ) L 2 , κ = θ 2 − Q ( θ + κ ) 2 . \begin{equation}
(1-Q)\mathcal L_{2,\kappa}
=\theta^2-Q(\theta+\kappa)^2. \tag*{(3.7)}
\end{equation} ( 1 − Q ) L 2 , κ = θ 2 − Q ( θ + κ ) 2 . (3.7)
Consequently
F 2 , κ ( Q ) = 2 F 1 ( κ , κ ; 1 ; Q ) , H 2 , κ ( ( 1 − Q ) κ F 2 , κ ) = 0. \begin{equation}
F_{2,\kappa}(Q)={}_2F_1(\kappa,\kappa;1;Q),\qquad
H_{2,\kappa}\bigl((1-Q)^\kappa F_{2,\kappa}\bigr)=0. \tag*{(3.8)}
\end{equation} F 2 , κ ( Q ) = 2 F 1 ( κ , κ ; 1 ; Q ) , H 2 , κ ( ( 1 − Q ) κ F 2 , κ ) = 0. (3.8)
This is the two-particle equation of [SV23 ] (Example 2.2). The chamber solution in higher rank belongs to the type-A A A Calogero–Moser hypergeometric framework; see [HR15 ] for the commuting operators and their recursive kernels.
The normalized chamber solution can be constructed by perturbing the free Hamiltonian H 0 H_0 H 0 in the physical coupling g κ = κ ( κ − 1 ) g_\kappa=\kappa(\kappa-1) g κ = κ ( κ − 1 ) . On the ideal m = ( Q 1 , … , Q n − 1 ) Q [ [ Q ] ] \mathfrak m=(Q_1,\ldots,Q_{n-1})\mathbb Q[[Q]] m = ( Q 1 , … , Q n − 1 ) Q [[ Q ]] , the operator H 0 H_0 H 0 is invertible: its eigenvalue on Q d Q^{\boldsymbol d} Q d is the positive integer E ( d ) \mathcal E(\boldsymbol d) E ( d ) of (3.6) . Since U n U_n U n has no constant term, the operator
K n : Q [ [ Q ] ] ⟶ m , f ⟼ H 0 − 1 ( U n f ) \mathsf K_n:\mathbb Q[[Q]]\longrightarrow\mathfrak m,
\qquad f\longmapsto H_0^{-1}(U_nf) K n : Q [[ Q ]] ⟶ m , f ⟼ H 0 − 1 ( U n f )
raises total Kähler degree. The normalized Schrödinger equation H n , κ ψ κ = 0 H_{n,\kappa}\psi_\kappa=0 H n , κ ψ κ = 0 is therefore equivalent to
ψ κ = 1 + g κ K n ψ κ = ∑ j ≥ 0 g κ j K n j 1. \begin{equation}
\psi_\kappa
=1+g_\kappa\mathsf K_n\psi_\kappa
=\sum_{j\geq0}g_\kappa^j\mathsf K_n^j1. \tag*{(3.9)}
\end{equation} ψ κ = 1 + g κ K n ψ κ = j ≥ 0 ∑ g κ j K n j 1. (3.9)
Only j ≤ ∣ d ∣ j\leq|\boldsymbol d| j ≤ ∣ d ∣ contributes to the coefficient of Q d Q^{\boldsymbol d} Q d . Thus this is an exact identity in the m \mathfrak m m -adic topology for every characteristic-zero coupling; it requires no analytic smallness assumption on g κ g_\kappa g κ .
Theorem 3.5 identifies the vertex-gauge solution as
V n ( Q ; κ ) = J n , κ − 1 ψ κ . V_n(Q;\kappa)=J_{n,\kappa}^{-1}\psi_\kappa. V n ( Q ; κ ) = J n , κ − 1 ψ κ .
Specializing κ = − m \kappa=-m κ = − m recovers F m ( n ) F_m^{(n)} F m ( n ) . Proposition 3.7 proves that its Kähler series terminates, and the full commuting equations follow from the same vertex identification. Perturbation theory therefore provides a recursive construction of the polynomial family; the constant-term formula proves its integrality and finite support.
For two particles the first terms are
ψ κ ( Q ) = 1 + g κ Q + g κ ( g κ + 2 ) 4 Q 2 + O ( Q 3 ) . \psi_\kappa(Q)
=1+g_\kappa Q+\frac{g_\kappa(g_\kappa+2)}4Q^2+O(Q^3). ψ κ ( Q ) = 1 + g κ Q + 4 g κ ( g κ + 2 ) Q 2 + O ( Q 3 ) .
At κ = − 1 \kappa=-1 κ = − 1 , one has g κ = 2 g_\kappa=2 g κ = 2 and ψ − 1 = ( 1 + Q ) / ( 1 − Q ) \psi_{-1}=(1+Q)/(1-Q) ψ − 1 = ( 1 + Q ) / ( 1 − Q ) ; returning to vertex gauge gives F 1 ( 2 ) = 1 + Q F_1^{(2)}=1+Q F 1 ( 2 ) = 1 + Q . The expansion also shows that ψ κ = ψ 1 − κ \psi_\kappa=\psi_{1-\kappa} ψ κ = ψ 1 − κ , because it depends only on g κ g_\kappa g κ . Consequently,
V n ( Q ; κ ) = J n , 1 − 2 κ V n ( Q ; 1 − κ ) . \begin{equation}
V_n(Q;\kappa)=J_{n,1-2\kappa}V_n(Q;1-\kappa). \tag*{(3.10)}
\end{equation} V n ( Q ; κ ) = J n , 1 − 2 κ V n ( Q ; 1 − κ ) . (3.10)
This symmetry explains the higher precision at half coupling in (3.30) . The perturbative recursion is over Q \mathbb Q Q ; the constant-term construction supplies the integral coefficients required for the arithmetic congruences.
The Full Commuting System
The higher equations follow from the differential limit of the Kähler-variable tRS system. A generating determinant describes the full family: its elementary coefficients are the commuting Hamiltonians. At zero coupling it reduces to ∏ i ( u − D i ) \prod_i(u-D_i) ∏ i ( u − D i ) , so its leading differential terms are the elementary symmetric polynomials in the momenta. The κ \kappa κ -dependent shifts below come from centering the tRS operators before taking their differential limit. Let Δ + ( z ) = ∏ i < j ( z j − z i ) \Delta_+(z)=\prod_{i<j}(z_j-z_i) Δ + ( z ) = ∏ i < j ( z j − z i ) and define
S n ( u ; κ ) = Δ + ( z ) − 1 det [ z i j − 1 ( u − D i − κ ( j − i ) ) ] i , j = 1 n = ∑ k = 0 n ( − 1 ) k u n − k B k ( 0 ) ( κ ) , B 0 ( 0 ) = 1. \begin{equation}
\begin{aligned}
\mathscr S_n(u;\kappa)
&=\Delta_+(z)^{-1}
\det\left[z_i^{j-1}\bigl(u-D_i-\kappa(j-i)\bigr)\right]_{i,j=1}^n
\\
&=\sum_{k=0}^n(-1)^ku^{n-k}\mathsf B_k^{(0)}(\kappa),
\qquad \mathsf B_0^{(0)}=1.
\end{aligned} \tag*{(3.11)}
\end{equation} S n ( u ; κ ) = Δ + ( z ) − 1 det [ z i j − 1 ( u − D i − κ ( j − i ) ) ] i , j = 1 n = k = 0 ∑ n ( − 1 ) k u n − k B k ( 0 ) ( κ ) , B 0 ( 0 ) = 1. (3.11)
The determinant is ordered with coefficients preceding derivatives; factors from distinct rows commute. It is the chamber normalization of the Sekiguchi determinant [NS13 ]. Set
I n , k ( κ ) = J n , κ B k ( 0 ) ( κ ) J n , κ − 1 . \mathsf I_{n,k}(\kappa)
=J_{n,\kappa}\mathsf B_k^{(0)}(\kappa)J_{n,\kappa}^{-1}. I n , k ( κ ) = J n , κ B k ( 0 ) ( κ ) J n , κ − 1 .
We suppress n n n and κ \kappa κ when they are fixed.
Proposition 3.4. The operators B k ( 0 ) ( κ ) \mathsf B_k^{(0)}(\kappa) B k ( 0 ) ( κ ) commute and have principal symbols e k ( ξ 1 , … , ξ n ) e_k(\xi_1,\ldots,\xi_n) e k ( ξ 1 , … , ξ n ) . They are algebraically independent in the full n n n -variable differential operator algebra. For generic additive framing a a a , the vertex in the conventions of Appendix § 7 satisfies B k ( 0 ) ( κ ) ( z − a V n ( Q ; a , κ ) ) = e k ( − a ) z − a V n ( Q ; a , κ ) , I n , k ( κ ) ψ a = e k ( − a ) ψ a , ψ a = z − a J n , κ V n ( Q ; a , κ ) . \begin{aligned}
\mathsf B_k^{(0)}(\kappa)
\bigl(z^{-a}V_n(Q;a,\kappa)\bigr)
&=e_k(-a)z^{-a}V_n(Q;a,\kappa),\\
\mathsf I_{n,k}(\kappa)\psi_a&=e_k(-a)\psi_a,
\qquad \psi_a=z^{-a}J_{n,\kappa}V_n(Q;a,\kappa).\notag
\end{aligned} B k ( 0 ) ( κ ) ( z − a V n ( Q ; a , κ ) ) I n , k ( κ ) ψ a = e k ( − a ) z − a V n ( Q ; a , κ ) , = e k ( − a ) ψ a , ψ a = z − a J n , κ V n ( Q ; a , κ ) . These equations specialize regularly to a = 0 a=0 a = 0 .
Proof. Use the centered commuting tRS family A r , η \mathsf A_{r,\eta} A r , η from (7.8) , with q = e η q=e^\eta q = e η and h = e η κ h=e^{\eta\kappa} h = e η κ . Expansion by a subset of rows gives
∑ r = 0 n ( − 1 ) r e − η u r A r , η = Δ + ( z ) − 1 det [ z i j − 1 ( 1 − e η ( D i + κ ( j − i ) − u ) ) ] i , j = 1 n . \begin{equation}
\sum_{r=0}^n(-1)^re^{-\eta ur}\mathsf A_{r,\eta}
=\Delta_+(z)^{-1}
\det\left[z_i^{j-1}
\left(1-e^{\eta(D_i+\kappa(j-i)-u)}\right)\right]_{i,j=1}^n. \tag*{(3.13)}
\end{equation} r = 0 ∑ n ( − 1 ) r e − η u r A r , η = Δ + ( z ) − 1 det [ z i j − 1 ( 1 − e η ( D i + κ ( j − i ) − u ) ) ] i , j = 1 n . (3.13) Indeed, the alternant for the chosen rows factors into the corresponding tRS subset coefficient; the centering removes its chamber character. Each matrix entry is divisible by η \eta η . Dividing by η n \eta^n η n and taking the constant coefficient in η \eta η gives (3.11) . The left sides commute for different u u u , so their regular limits commute. The top differential part is ∏ i ( u − D i ) \prod_i(u-D_i) ∏ i ( u − D i ) , giving the principal symbols and algebraic independence.
Proposition A.4 gives the eigenvalue of the left side on z − a V ^ n K z^{-a}\widehat V_n^K z − a V n K as
∑ r = 0 n ( − 1 ) r e − η u r e r ( e − η a ) = ∏ i ( 1 − e − η ( u + a i ) ) . \sum_{r=0}^n(-1)^re^{-\eta ur}e_r(e^{-\eta a})
=\prod_i\left(1-e^{-\eta(u+a_i)}\right). r = 0 ∑ n ( − 1 ) r e − η u r e r ( e − η a ) = i ∏ ( 1 − e − η ( u + a i ) ) . Its quotient by η n \eta^n η n tends to ∏ i ( u + a i ) \prod_i(u+a_i) ∏ i ( u + a i ) . The coefficientwise cohomological limit of Proposition A.2 proves the first equation. Conjugation proves the second, and Proposition A.5 permits a = 0 a=0 a = 0 . ◻
The first two operators are
B 1 ( 0 ) = ∑ i D i , B 2 ( 0 ) = 1 2 ( ∑ i D i ) 2 − L n , κ , I n , 2 = 1 2 ( ∑ i D i ) 2 − H n , κ . \begin{equation}
\begin{gathered}
\mathsf B_1^{(0)}=\sum_iD_i,\qquad
\mathsf B_2^{(0)}=\frac12\left(\sum_iD_i\right)^2
-\mathcal L_{n,\kappa},\\
\mathsf I_{n,2}=\frac12\left(\sum_iD_i\right)^2-H_{n,\kappa}.
\end{gathered} \tag*{(3.14)}
\end{equation} B 1 ( 0 ) = i ∑ D i , B 2 ( 0 ) = 2 1 ( i ∑ D i ) 2 − L n , κ , I n , 2 = 2 1 ( i ∑ D i ) 2 − H n , κ . (3.14)
Thus H n , κ ψ a = 1 2 ∑ i a i 2 ψ a H_{n,\kappa}\psi_a=\frac12\sum_i a_i^2\psi_a H n , κ ψ a = 2 1 ∑ i a i 2 ψ a . The reciprocal spectral characters in Appendix § 7 account for the signs e k ( − a ) e_k(-a) e k ( − a ) .
For comparison with the type-A A A hypergeometric framework, put ρ i = ( n + 1 − 2 i ) / 2 \rho_i=(n+1-2i)/2 ρ i = ( n + 1 − 2 i ) /2 and
δ n ( z ) = ∏ i < j z j − z i z i z j = z − ρ ∏ i < j ( 1 − q i j ) . \delta_n(z)=\prod_{i<j}\frac{z_j-z_i}{\sqrt{z_iz_j}}
=z^{-\rho}\prod_{i<j}(1-q_{ij}). δ n ( z ) = i < j ∏ z i z j z j − z i = z − ρ i < j ∏ ( 1 − q ij ) .
Removing the Weyl-denominator gauge from ψ a \psi_a ψ a gives
δ n − κ ψ a = z κ ρ − a V n ( Q ; a , κ ) . \delta_n^{-\kappa}\psi_a
=z^{\kappa\rho-a}V_n(Q;a,\kappa). δ n − κ ψ a = z κ ρ − a V n ( Q ; a , κ ) .
This is the normalized Harish-Chandra chamber series with spectral parameter − a -a − a in the chamber used here; see [HR15 ] for its relation to Heckman–Opdam hypergeometric functions. The negative-integral-coupling constructions of [FV09 ] supply the Baker–Akhiezer background. We use the zero-spectral specialization and prove its polynomiality and integral arithmetic directly.
Theorem 3.5. For every n ≥ 2 n\geq2 n ≥ 2 , V n ( Q ; κ ) = V n ( Q ; κ ) = F n , κ ( Q ) in Q [ κ ] [ [ Q ] ] . V_n(Q;\kappa)=\mathcal V_n(Q;\kappa)=F_{n,\kappa}(Q)
\quad\text{in }\mathbb Q[\kappa][[Q]]. V n ( Q ; κ ) = V n ( Q ; κ ) = F n , κ ( Q ) in Q [ κ ] [[ Q ]] . In particular, every coupling specialization in characteristic zero is defined, and B k ( 0 ) ( κ ) V n ( Q ; κ ) = 0 , 1 ≤ k ≤ n . \mathsf B_k^{(0)}(\kappa)V_n(Q;\kappa)=0,\qquad 1\leq k\leq n. B k ( 0 ) ( κ ) V n ( Q ; κ ) = 0 , 1 ≤ k ≤ n .
Proof. The zero-framing vertex satisfies the quadratic equation by Proposition A.6 . The adjacent-rank kernel identity proves the same equation for the master period in Proposition B.4 . Both have constant coefficient one, so Proposition 3.2 identifies them. Their coefficients are polynomials in the coupling by Proposition 2.3 and Proposition A.5 , and the joint equations follow from Proposition 3.4 . ◻
Integral Dependence on the Coupling
We need an integral form of the operators to move the exact equations between congruent couplings.
Lemma 3.6. Put D n ( Q ) = ∏ i < j ( 1 − q i j ) \mathscr D_n(Q)=\prod_{i<j}(1-q_{ij}) D n ( Q ) = ∏ i < j ( 1 − q ij ) . For τ ∈ S n \tau\in S_n τ ∈ S n , let h a ( τ ) = ∑ i = 1 a τ ( i ) − a ( a + 1 ) 2 , 1 ≤ a < n . h_a(\tau)=\sum_{i=1}^a\tau(i)-\frac{a(a+1)}2,
\qquad 1\leq a<n. h a ( τ ) = ∑ i = 1 a τ ( i ) − 2 a ( a + 1 ) , 1 ≤ a < n . Then D n ( Q ) B k ( 0 ) ( κ ) = ∑ τ ∈ S n sgn ( τ ) Q h ( τ ) e k ( D i + κ ( τ ( i ) − i ) : 1 ≤ i ≤ n ) .
\mathscr D_n(Q)\mathsf B_k^{(0)}(\kappa)
=\sum_{\tau\in S_n}\operatorname{sgn}(\tau)Q^{h(\tau)}
e_k\bigl(D_i+\kappa(\tau(i)-i):1\leq i\leq n\bigr).
D n ( Q ) B k ( 0 ) ( κ ) = ∑ τ ∈ S n sgn ( τ ) Q h ( τ ) e k ( D i + κ ( τ ( i ) − i ) : 1 ≤ i ≤ n ) . Consequently the normal-ordered coefficients belong to Z [ κ ] [ [ Q ] ] \mathbb Z[\kappa][[Q]] Z [ κ ] [[ Q ]] . For λ , ω ∈ Z p \lambda,\omega\in\mathbb Z_p λ , ω ∈ Z p with λ ≡ ω ( m o d p s ) \lambda\equiv\omega\pmod{p^s} λ ≡ ω ( mod p s ) , B k ( 0 ) ( λ ) ≡ B k ( 0 ) ( ω ) ( m o d p s ) . \mathsf B_k^{(0)}(\lambda)
\equiv\mathsf B_k^{(0)}(\omega)\pmod{p^s}. B k ( 0 ) ( λ ) ≡ B k ( 0 ) ( ω ) ( mod p s ) .
Proof. Expand (3.11) by permutations, with derivatives to the right. Dividing the alternant monomial by its chamber leading monomial gives ∏ i z i τ ( i ) − i = Q h ( τ ) \prod_i z_i^{\tau(i)-i}=Q^{h(\tau)} ∏ i z i τ ( i ) − i = Q h ( τ ) . Every h a ( τ ) h_a(\tau) h a ( τ ) is nonnegative because the smallest sum of a a a distinct integers from 1 , … , n 1,\ldots,n 1 , … , n is a ( a + 1 ) / 2 a(a+1)/2 a ( a + 1 ) /2 . The remaining Vandermonde factor is D n \mathscr D_n D n , an integral unit with constant coefficient one. This proves the formula and polynomial dependence on κ \kappa κ . Specialization at congruent couplings proves the last assertion. ◻
In Schrödinger gauge, the same operators admit an expansion over matchings. If v i j = q i j / ( 1 − q i j ) 2 v_{ij}=q_{ij}/(1-q_{ij})^2 v ij = q ij / ( 1 − q ij ) 2 , then
Here a matching consists of disjoint unordered pairs, and V ( m ) V(\mathfrak m) V ( m ) is their set of endpoints. Each matching and subset occurs once. The formula is the matching expression of [HR15 ]; its equality with (3.11) is proved in Proposition B.6 . It shows that the Schrödinger operators have integral chamber coefficients polynomial in the physical coupling g κ g_\kappa g κ .
Polynomial Solutions at Negative Integer Coupling
We construct a second family of integral polynomial approximations by specializing the coupling in the normalized vertex. Equivalently, we specialize the perturbative solution (3.9) and return to vertex gauge. Using the chamber ratios of § 2 , put
C n ( Q ; m , γ ) = C T x [ ∏ i = 1 n − 1 ∏ a < b ( 1 − x i , a / x i , b ) γ ∏ i = 1 n − 1 ∏ a = 1 i ∏ b = 1 i + 1 ( 1 − ρ i , a , b ) m ] . \begin{equation}
C_n(Q;m,\gamma)=\mathop{\mathrm{CT}}_x\left[
\prod_{i=1}^{n-1}\prod_{a<b}
(1-x_{i,a}/x_{i,b})^\gamma
\prod_{i=1}^{n-1}\prod_{a=1}^i\prod_{b=1}^{i+1}
(1-\rho_{i,a,b})^m\right]. \tag*{(3.17)}
\end{equation} C n ( Q ; m , γ ) = CT x [ i = 1 ∏ n − 1 a < b ∏ ( 1 − x i , a / x i , b ) γ i = 1 ∏ n − 1 a = 1 ∏ i b = 1 ∏ i + 1 ( 1 − ρ i , a , b ) m ] . (3.17)
Lemma 2.2 makes every fixed-degree coefficient a finite sum. Theorem 3.5 identifies
V n ( Q ; κ ) = C n ( Q ; − κ , 2 κ ) . V_n(Q;\kappa)=C_n(Q;-\kappa,2\kappa). V n ( Q ; κ ) = C n ( Q ; − κ , 2 κ ) .
For m ∈ Z ≥ 0 m\in\mathbb Z_{\geq0} m ∈ Z ≥ 0 , define the exact-coupling solution
F m ( n ) ( Q ) = V n ( Q ; − m ) = C n ( Q ; m , − 2 m ) . \begin{equation}
F_m^{(n)}(Q)=V_n(Q;-m)=C_n(Q;m,-2m). \tag*{(3.18)}
\end{equation} F m ( n ) ( Q ) = V n ( Q ; − m ) = C n ( Q ; m , − 2 m ) . (3.18)
The normalized tCM equation fixes this specialization uniquely.
Proposition 3.7. For every integer m ≥ 0 m\geq0 m ≥ 0 , F m ( n ) ∈ Z [ Q 1 , … , Q n − 1 ] F_m^{(n)}\in\mathbb Z[Q_1,\ldots,Q_{n-1}] F m ( n ) ∈ Z [ Q 1 , … , Q n − 1 ] and F m ( n ) ( 0 ) = 1 F_m^{(n)}(0)=1 F m ( n ) ( 0 ) = 1 . For admissible ω , p \omega,p ω , p and A s = ω ( p s − 1 ) A_s=\omega(p^s-1) A s = ω ( p s − 1 ) , F A s ( n ) ⟶ V n ( Q ; ω ) coefficientwise in Q p . F_{A_s}^{(n)}\longrightarrow V_n(Q;\omega)
\quad\text{coefficientwise in }\mathbb Q_p. F A s ( n ) ⟶ V n ( Q ; ω ) coefficientwise in Q p .
Proof. For m ≥ 1 m\geq1 m ≥ 1 , expand
( 1 − t ) − 2 m = ∑ k ≥ 0 ( 2 m + k − 1 k ) t k . (1-t)^{-2m}=\sum_{k\geq0}\binom{2m+k-1}{k}t^k. ( 1 − t ) − 2 m = k ≥ 0 ∑ ( k 2 m + k − 1 ) t k . These same-row coefficients are integers, and the adjacent-row factors have nonnegative integer exponent m m m . Lemma 2.2 bounds all expansion indices contributing to a fixed Kähler degree, so its coefficient is a finite sum of integers and has nonnegative degree.
Each external variable belongs to n − 1 n-1 n − 1 adjacent-row factors, whose indices are at most m m m . If its exponent is μ a \mu_a μ a , then ∣ μ a ∣ ≤ ( n − 1 ) m |\mu_a|\leq(n-1)m ∣ μ a ∣ ≤ ( n − 1 ) m . The Kähler exponents satisfy 0 ≤ e j = ∑ a ≤ j μ a ≤ j ( n − 1 ) m 0\leq e_j=\sum_{a\leq j}\mu_a\leq j(n-1)m 0 ≤ e j = ∑ a ≤ j μ a ≤ j ( n − 1 ) m . Hence only finitely many degrees occur. In degree zero every flow vanishes, giving constant coefficient one. The case m = 0 m=0 m = 0 is immediate.
At fixed degree, the period coefficient is polynomial in the coupling over Q \mathbb Q Q , because the flow bounds are independent of that coupling. Since − A s = ω ( 1 − p s ) → ω -A_s=\omega(1-p^s)\to\omega − A s = ω ( 1 − p s ) → ω in Q p \mathbb Q_p Q p , these polynomials give the asserted limit. ◻
The two-particle case is F m ( 2 ) ( Q ) = ∑ j = 0 m ( m j ) 2 Q j F_m^{(2)}(Q)=\sum_{j=0}^m\binom mj^2Q^j F m ( 2 ) ( Q ) = ∑ j = 0 m ( j m ) 2 Q j . In higher rank (3.18) provides both a finite polynomial and its exact joint equations. The arithmetic use of this construction is to let the coupling vary through the sequence − A s -A_s − A s .
The terminating vertices have a symmetric-polynomial realization. We use finite-variable monic Jack polynomials in the convention α = 1 / κ \alpha=1/\kappa α = 1/ κ of [Mac95 , NS13 ]. We write m μ m_\mu m μ for the sum of distinct monomials with exponent partition μ \mu μ .
Proposition 3.8. Let n ≥ 2 n\geq2 n ≥ 2 , m ≥ 1 m\geq1 m ≥ 1 , and δ = ( n − 1 , n − 2 , … , 0 ) \delta=(n-1,n-2,\ldots,0) δ = ( n − 1 , n − 2 , … , 0 ) . The Jack polynomial P m δ ( α ) ( z 1 , … , z n ) P_{m\delta}^{(\alpha)}(z_1,\ldots,z_n) P m δ ( α ) ( z 1 , … , z n ) is regular at α = − 1 / m \alpha=-1/m α = − 1/ m , and G n ( z ) m F m ( n ) ( z 1 / z 2 , … , z n − 1 / z n ) = P m δ ( − 1 / m ) ( z 1 , … , z n ) .
G_n(z)^m F_m^{(n)}(z_1/z_2,\ldots,z_{n-1}/z_n)
=P_{m\delta}^{(-1/m)}(z_1,\ldots,z_n).
G n ( z ) m F m ( n ) ( z 1 / z 2 , … , z n − 1 / z n ) = P m δ ( − 1/ m ) ( z 1 , … , z n ) .
Proof. Since D i G n κ = κ ( i − 1 ) G n κ D_iG_n^\kappa=\kappa(i-1)G_n^\kappa D i G n κ = κ ( i − 1 ) G n κ , conjugation of (3.11) gives
S n s y m ( u ; κ ) : = G n − κ S n ( u ; κ ) G n κ = Δ + ( z ) − 1 det [ z i j − 1 ( u − D i − κ ( j − 1 ) ) ] i , j = 1 n . \begin{equation}
\mathscr S_n^{\mathrm{sym}}(u;\kappa)
:=G_n^{-\kappa}\mathscr S_n(u;\kappa)G_n^\kappa
=\Delta_+(z)^{-1}
\det\left[z_i^{j-1}(u-D_i-\kappa(j-1))\right]_{i,j=1}^n. \tag*{(3.20)}
\end{equation} S n sym ( u ; κ ) := G n − κ S n ( u ; κ ) G n κ = Δ + ( z ) − 1 det [ z i j − 1 ( u − D i − κ ( j − 1 )) ] i , j = 1 n . (3.20) This is the Sekiguchi family on symmetric polynomials. Its eigenvalue on P μ ( 1 / κ ) P_\mu^{(1/\kappa)} P μ ( 1/ κ ) is
∏ i = 1 n ( u − μ i − κ ( n − i ) ) ; \prod_{i=1}^n\bigl(u-\mu_i-\kappa(n-i)\bigr); i = 1 ∏ n ( u − μ i − κ ( n − i ) ) ; see [NS13 ] (equations (13) and (16)), after reversing columns and making the affine change of spectral variable u ↦ u / κ − ( n − 1 ) u\mapsto u/\kappa-(n-1) u ↦ u / κ − ( n − 1 ) , with an overall factor κ n \kappa^n κ n .
We first justify specialization at the negative parameter. Write K 1 ( κ ) , K 2 ( κ ) K_1(\kappa),K_2(\kappa) K 1 ( κ ) , K 2 ( κ ) for the first two elementary coefficients of (3.20) . The quadratic operator K 1 ( κ ) 2 / 2 − K 2 ( κ ) K_1(\kappa)^2/2-K_2(\kappa) K 1 ( κ ) 2 /2 − K 2 ( κ ) is triangular on monomial symmetric polynomials, with diagonal
q μ ( κ ) = 1 2 ∑ i = 1 n ( μ i + κ ( n − i ) ) 2 . q_\mu(\kappa)
=\frac12\sum_{i=1}^n\bigl(\mu_i+\kappa(n-i)\bigr)^2. q μ ( κ ) = 2 1 i = 1 ∑ n ( μ i + κ ( n − i ) ) 2 . Put λ = m δ \lambda=m\delta λ = m δ . On the finite dominance ideal spanned by m μ m_\mu m μ with μ ≤ λ \mu\leq\lambda μ ≤ λ and ℓ ( μ ) ≤ n \ell(\mu)\leq n ℓ ( μ ) ≤ n , all operator coefficients are polynomial in κ \kappa κ . At κ = − m \kappa=-m κ = − m ,
q λ ( − m ) = 0 , q μ ( − m ) = 1 2 ∑ i = 1 n ( μ i − λ i ) 2 > 0 ( μ ≠ λ ) . q_\lambda(-m)=0,\qquad
q_\mu(-m)=\frac12\sum_{i=1}^n(\mu_i-\lambda_i)^2>0
\quad(\mu\ne\lambda). q λ ( − m ) = 0 , q μ ( − m ) = 2 1 i = 1 ∑ n ( μ i − λ i ) 2 > 0 ( μ = λ ) . Thus every denominator q λ − q μ q_\lambda-q_\mu q λ − q μ in the monic triangular eigenvector recursion is nonzero at − m -m − m . For generic κ \kappa κ that eigenvector is P λ ( 1 / κ ) P_\lambda^{(1/\kappa)} P λ ( 1/ κ ) , so its coefficients are regular there. The full commuting eigenvalue equations specialize as well. Their common generating eigenvalue is u n u^n u n .
It remains to check the chamber normalization. Set γ = ( 0 , m , … , ( n − 1 ) m ) \gamma=(0,m,\ldots,(n-1)m) γ = ( 0 , m , … , ( n − 1 ) m ) , so G n m = z γ G_n^m=z^\gamma G n m = z γ . Monicity gives coefficient one at z γ z^\gamma z γ , since γ \gamma γ is a permutation of λ \lambda λ . For every monomial z β z^\beta z β occurring in the Jack polynomial, the decreasing rearrangement μ = β + \mu=\beta^+ μ = β + satisfies μ ≤ λ \mu\leq\lambda μ ≤ λ . Consequently, for 1 ≤ j < n 1\leq j<n 1 ≤ j < n ,
∑ i = 1 j β i ≥ ∣ λ ∣ − ∑ i = 1 n − j μ i ≥ ∣ λ ∣ − ∑ i = 1 n − j λ i = m j ( j − 1 ) 2 = ∑ i = 1 j γ i . \sum_{i=1}^j\beta_i
\geq |\lambda|-\sum_{i=1}^{n-j}\mu_i
\geq |\lambda|-\sum_{i=1}^{n-j}\lambda_i
=\frac{mj(j-1)}2
=\sum_{i=1}^j\gamma_i. i = 1 ∑ j β i ≥ ∣ λ ∣ − i = 1 ∑ n − j μ i ≥ ∣ λ ∣ − i = 1 ∑ n − j λ i = 2 mj ( j − 1 ) = i = 1 ∑ j γ i . Since ∣ β ∣ = ∣ γ ∣ |\beta|=|\gamma| ∣ β ∣ = ∣ γ ∣ , the quotient z β − γ z^{\beta-\gamma} z β − γ is Q e Q^{\boldsymbol e} Q e with e j = ∑ i = 1 j ( β i − γ i ) ≥ 0 e_j=\sum_{i=1}^j(\beta_i-\gamma_i)\geq0 e j = ∑ i = 1 j ( β i − γ i ) ≥ 0 . Hence G n − m P λ ( − 1 / m ) G_n^{-m}P_\lambda^{(-1/m)} G n − m P λ ( − 1/ m ) is a polynomial in Q Q Q with constant coefficient one. By (3.20) , it satisfies the joint vertex-gauge equations at κ = − m \kappa=-m κ = − m , and therefore the quadratic equation. Proposition 3.2 identifies it with F m ( n ) F_m^{(n)} F m ( n ) . ◻
The same period presentation proves positivity and determines the common Newton polytope of the two symmetric polynomial families.
Proposition 3.10. For every m ≥ 0 m\geq0 m ≥ 0 , F m ( n ) ∈ Z ≥ 0 [ Q 1 , … , Q n − 1 ] . F_m^{(n)}\in\mathbb Z_{\geq0}[Q_1,\ldots,Q_{n-1}]. F m ( n ) ∈ Z ≥ 0 [ Q 1 , … , Q n − 1 ] . For m ≥ 1 m\geq1 m ≥ 1 , the Jack polynomial in (3.19) has nonnegative integer monomial coefficients. At an arithmetic level, put m = A s m=A_s m = A s and define T s ( z ) = G n ( z ) m T s ( n ) ( Q ) = ( − 1 ) m c n U s ( z ) .
\mathcal T_s(z)=G_n(z)^mT_s^{(n)}(Q)
=(-1)^{mc_n}U_s(z).
T s ( z ) = G n ( z ) m T s ( n ) ( Q ) = ( − 1 ) m c n U s ( z ) . Then T s \mathcal T_s T s is a symmetric integral homogeneous polynomial of degree m ( n 2 ) m\binom n2 m ( 2 n ) . Both T s \mathcal T_s T s and P m δ ( − 1 / m ) P_{m\delta}^{(-1/m)} P m δ ( − 1/ m ) have leading monomial symmetric function m m δ m_{m\delta} m m δ with coefficient one, and their Newton polytope is conv { τ ( m δ ) : τ ∈ S n } . \operatorname{conv}\{\tau(m\delta):\tau\in S_n\}. conv { τ ( m δ ) : τ ∈ S n } . Consequently, for 1 ≤ j < n 1\leq j<n 1 ≤ j < n , deg Q j F m ( n ) = m j ( n − j ) , deg Q j T s ( n ) = m j ( n − j ) .
\deg_{Q_j}F_m^{(n)}=m j(n-j),\qquad
\deg_{Q_j}T_s^{(n)}=m j(n-j).
deg Q j F m ( n ) = mj ( n − j ) , deg Q j T s ( n ) = mj ( n − j ) .
Proof. In the constant term for F m ( n ) F_m^{(n)} F m ( n ) , the same-row factors ( 1 − t ) − 2 m (1-t)^{-2m} ( 1 − t ) − 2 m have nonnegative integer coefficients. An adjacent-row factor contributes ( − 1 ) k e ( m k e ) (-1)^{k_e}\binom m{k_e} ( − 1 ) k e ( k e m ) . For a surviving flow, weight the exponent-conservation equation at a vertex on row r r r by r r r . Internal conservation and ∑ a μ a = 0 \sum_a\mu_a=0 ∑ a μ a = 0 for the external exponents give
∑ e joining adjacent rows ε e k e = 0 , ε e ∈ { 1 , − 1 } . \sum_{e\text{ joining adjacent rows}}\varepsilon_e k_e=0,
\qquad \varepsilon_e\in\{1,-1\}. e joining adjacent rows ∑ ε e k e = 0 , ε e ∈ { 1 , − 1 } . Same-row edges contribute zero to this weighted sum. Reducing modulo two shows that ∑ e k e \sum_e k_e ∑ e k e is even. Thus every surviving contribution has nonnegative sign. Finiteness of the sum in each degree proves positivity; F 0 = 1 F_0=1 F 0 = 1 . Multiplication by G n m G_n^m G n m preserves coefficients, so Proposition 3.8 gives Jack positivity.
The master polynomial is invariant under permutation of the external variables. Hence U s U_s U s , and therefore T s \mathcal T_s T s , is symmetric. Since T s ( n ) T_s^{(n)} T s ( n ) depends only on ratios, (3.21) makes its homogeneous degree m ( n 2 ) m\binom n2 m ( 2 n ) . Both homogeneous polynomials have coefficient one at G n m = z γ G_n^m=z^\gamma G n m = z γ , where γ = ( 0 , m , … , ( n − 1 ) m ) \gamma=(0,m,\ldots,(n-1)m) γ = ( 0 , m , … , ( n − 1 ) m ) . Symmetry gives coefficient one at every permutation of m δ m\delta m δ .
For either polynomial, every occurring exponent vector β \beta β satisfies
∑ a = 1 j β a ≥ m j ( j − 1 ) 2 , 1 ≤ j < n , \sum_{a=1}^j\beta_a\geq\frac{mj(j-1)}2,
\qquad 1\leq j<n, a = 1 ∑ j β a ≥ 2 mj ( j − 1 ) , 1 ≤ j < n , because division by G n m G_n^m G n m has nonnegative Kähler degrees. Symmetry gives the same inequality for every subset of j j j coordinates. Taking complements gives the upper subset-sum inequalities for the permutahedron of m δ m\delta m δ . Thus the support is contained in this polytope, and every vertex occurs with coefficient one. This proves the Newton-polytope statement and dominance triangularity. Finally, maximizing
e j = ∑ a = 1 j β a − m j ( j − 1 ) 2 e_j=\sum_{a=1}^j\beta_a-\frac{mj(j-1)}2 e j = a = 1 ∑ j β a − 2 mj ( j − 1 ) over the permutation vertices gives m j ( n − j ) m j(n-j) mj ( n − j ) , proving (3.22) . ◻
Arithmetic Specialization and Joint Congruences
Assume (2.10) , set P = p s P=p^s P = p s and m = A s = ω ( P − 1 ) m=A_s=\omega(P-1) m = A s = ω ( P − 1 ) , and write
T s ( n ) = C n ( Q ; m , P − 2 m ) , T ~ s ( n ) = F A s ( n ) , Δ s ( n ) = T ~ s ( n ) − T s ( n ) . \begin{equation}
T_s^{(n)}=C_n(Q;m,P-2m),\qquad
\widetilde T_s^{(n)}=F_{A_s}^{(n)},\qquad
\Delta_s^{(n)}=\widetilde T_s^{(n)}-T_s^{(n)}. \tag*{(3.23)}
\end{equation} T s ( n ) = C n ( Q ; m , P − 2 m ) , T s ( n ) = F A s ( n ) , Δ s ( n ) = T s ( n ) − T s ( n ) . (3.23)
The first equality is the constant-term form of the master polynomial in § 2 . Thus the two families have the same adjacent-row factors, and their same-row exponents differ by P P P . At ω = 1 / 2 \omega=1/2 ω = 1/2 , the same-row exponent of T s ( n ) T_s^{(n)} T s ( n ) is one. Both constant coefficients are one, so Δ s ( n ) ( 0 ) = 0 \Delta_s^{(n)}(0)=0 Δ s ( n ) ( 0 ) = 0 .
Put
A n = ∑ i < j u i j ( D i − D j ) , B n = ∑ i < j ( j − i ) u i j . \mathcal A_n=\sum_{i<j}u_{ij}(D_i-D_j),\qquad
\mathcal B_n=\sum_{i<j}(j-i)u_{ij}. A n = i < j ∑ u ij ( D i − D j ) , B n = i < j ∑ ( j − i ) u ij .
Then L n , κ = H 0 − κ A n − κ 2 B n \mathcal L_{n,\kappa}=H_0-\kappa\mathcal A_n
-\kappa^2\mathcal B_n L n , κ = H 0 − κ A n − κ 2 B n .
Proposition 3.11. For m ≥ 0 m\geq0 m ≥ 0 and 1 ≤ k ≤ n 1\leq k\leq n 1 ≤ k ≤ n , B k ( 0 ) ( − m ) F m ( n ) = 0.
\mathsf B_k^{(0)}(-m)F_m^{(n)}=0.
B k ( 0 ) ( − m ) F m ( n ) = 0. In particular, L n , − m F m ( n ) = 0 , H n , − m ( J n , − m F m ( n ) ) = 0.
\mathcal L_{n,-m}F_m^{(n)}=0,\qquad
H_{n,-m}(J_{n,-m}F_m^{(n)})=0.
L n , − m F m ( n ) = 0 , H n , − m ( J n , − m F m ( n ) ) = 0. At the arithmetic level m = A s m=A_s m = A s , one has L n , ω F m ( n ) = − ω P [ A n + ( ω − m ) B n ] F m ( n ) ∈ P Z p [ [ Q ] ] ,
\mathcal L_{n,\omega}F_m^{(n)}
=-\omega P\left[\mathcal A_n+(\omega-m)\mathcal B_n\right]F_m^{(n)}
\in P\mathbb Z_p[[Q]],
L n , ω F m ( n ) = − ω P [ A n + ( ω − m ) B n ] F m ( n ) ∈ P Z p [[ Q ]] , and B k ( 0 ) ( ω ) T ~ s ( n ) ≡ 0 ( m o d p s ) , B k ( 0 ) ( ω ) Δ s ( n ) ≡ 0 ( m o d p s ) .
\mathsf B_k^{(0)}(\omega)\widetilde T_s^{(n)}\equiv0\pmod{p^s},
\qquad
\mathsf B_k^{(0)}(\omega)\Delta_s^{(n)}\equiv0\pmod{p^s}.
B k ( 0 ) ( ω ) T s ( n ) ≡ 0 ( mod p s ) , B k ( 0 ) ( ω ) Δ s ( n ) ≡ 0 ( mod p s ) . Equivalently, the operators I n , k ( ω ) \mathsf I_{n,k}(\omega) I n , k ( ω ) annihilate J n T ~ s ( n ) J_n\widetilde T_s^{(n)} J n T s ( n ) and J n Δ s ( n ) J_n\Delta_s^{(n)} J n Δ s ( n ) modulo p s p^s p s .
Proof. Theorem 3.5 and Proposition 3.4 give the exact equations at κ = − m \kappa=-m κ = − m ; specialization is valid because all vertex coefficients are polynomial in the coupling. For λ = − m = ω ( 1 − P ) \lambda=-m=\omega(1-P) λ = − m = ω ( 1 − P ) , Lemma 3.6 gives B k ( 0 ) ( λ ) ≡ B k ( 0 ) ( ω ) ( m o d p s ) \mathsf B_k^{(0)}(\lambda)\equiv
\mathsf B_k^{(0)}(\omega)\pmod{p^s} B k ( 0 ) ( λ ) ≡ B k ( 0 ) ( ω ) ( mod p s ) . Apply this congruence to the integral polynomial F m ( n ) F_m^{(n)} F m ( n ) . Subtracting the equations for T s ( n ) T_s^{(n)} T s ( n ) in Theorem 5.12 gives the equation for the difference.
For the explicit quadratic residual, use
L n , ω − L n , λ = − ( ω − λ ) [ A n + ( ω + λ ) B n ] \mathcal L_{n,\omega}-\mathcal L_{n,\lambda}
=-(\omega-\lambda)
[\mathcal A_n+(\omega+\lambda)\mathcal B_n] L n , ω − L n , λ = − ( ω − λ ) [ A n + ( ω + λ ) B n ] and ω − λ = ω + m = ω P \omega-\lambda=\omega+m=\omega P ω − λ = ω + m = ω P . Its coefficients are integral chamber series. Conjugation by the integral unit J n J_n J n gives the Schrödinger congruences. ◻
In particular,
L n , ω Δ s ( n ) ≡ 0 ( m o d p s ) , H n , ω ( J n Δ s ( n ) ) ≡ 0 ( m o d p s ) . \begin{equation}
\mathcal L_{n,\omega}\Delta_s^{(n)}\equiv0\pmod{p^s},\qquad
H_{n,\omega}(J_n\Delta_s^{(n)})\equiv0\pmod{p^s}. \tag*{(3.28)}
\end{equation} L n , ω Δ s ( n ) ≡ 0 ( mod p s ) , H n , ω ( J n Δ s ( n ) ) ≡ 0 ( mod p s ) . (3.28)
A nonzero difference with zero constant coefficient cannot be an exact normalized-chamber zero-energy solution in characteristic zero. The sharp comparison in § 4 measures the additional classes allowed by reduction modulo p s p^s p s .
The natural Schrödinger gauge gives higher precision at ω = 1 / 2 \omega=1/2 ω = 1/2 . Set ϕ s = J n , λ F m ( n ) \phi_s=J_{n,\lambda}F_m^{(n)} ϕ s = J n , λ F m ( n ) , with λ = − m \lambda=-m λ = − m . It is an integral chamber series and satisfies
H n , ω ϕ s = ( g λ − g ω ) U n ϕ s , g λ − g ω = ω P ( 1 − 2 ω + ω P ) . \begin{align}
H_{n,\omega}\phi_s&=(g_\lambda-g_\omega)U_n\phi_s, \tag*{(3.29)}\\
g_\lambda-g_\omega&=\omega P(1-2\omega+\omega P).
\notag
\end{align} H n , ω ϕ s g λ − g ω = ( g λ − g ω ) U n ϕ s , = ω P ( 1 − 2 ω + ω P ) . (3.29)
At ω = 1 / 2 \omega=1/2 ω = 1/2 , one has g λ − g 1 / 2 = P 2 / 4 g_\lambda-g_{1/2}=P^2/4 g λ − g 1/2 = P 2 /4 . The matching formula (3.16) is polynomial in g κ g_\kappa g κ with integral chamber coefficients. Since ϕ s \phi_s ϕ s is an exact joint eigenfunction at λ \lambda λ , it follows that
I n , k ( 1 / 2 ) ϕ s ≡ 0 ( m o d p 2 s ) , 1 ≤ k ≤ n . \begin{equation}
\mathsf I_{n,k}(1/2)\phi_s\equiv0\pmod{p^{2s}},
\qquad 1\leq k\leq n. \tag*{(3.30)}
\end{equation} I n , k ( 1/2 ) ϕ s ≡ 0 ( mod p 2 s ) , 1 ≤ k ≤ n . (3.30)
This improvement concerns the natural shifted gauge ϕ s \phi_s ϕ s ; the comparison of T s ( n ) T_s^{(n)} T s ( n ) and T ~ s ( n ) \widetilde T_s^{(n)} T s ( n ) uses the common gauge J n J_n J n .
Sharp Comparison of the Polynomial Families
We now compare the master-polynomial approximations with the exact negative-coupling solutions of § 3 . Both constant terms use the same factors linking consecutive rows, raised to the power m = A s m=A_s m = A s . For a pair of variables within one row, however, the exponent is p s − 2 m p^s-2m p s − 2 m in T s ( n ) T_s^{(n)} T s ( n ) and − 2 m -2m − 2 m in T ~ s ( n ) \widetilde T_s^{(n)} T s ( n ) . We first prove that every coefficient of their difference is divisible by p p p . We then bound the expansion indices that can contribute to a fixed Kähler degree; these bounds give higher divisibility in low degrees. Finally, a restriction to three consecutive particles produces explicit nonzero coefficients and proves that the estimates are sharp. Throughout this section we assume (2.10) and put P = p s P=p^s P = p s and m = A s = ω ( P − 1 ) m=A_s=\omega(P-1) m = A s = ω ( P − 1 ) .
Frobenius Action and Vandermonde Support
The Frobenius action on the same-row factors compares the two families modulo p p p . The resulting constant-term calculation is controlled by the permutation support of the master polynomial, so the comparison is valid even when p ≤ n p\leq n p ≤ n .
Write
R n ( x ) = ∏ i = 1 n − 1 ∏ a < b ( 1 − x i , a / x i , b ) , E n ( x , z ) = ∏ i = 1 n − 1 ∏ a = 1 i ∏ b = 1 i + 1 ( 1 − ρ i , a , b ) , \begin{align}
\mathscr R_n(x)&=\prod_{i=1}^{n-1}\prod_{a<b}
(1-x_{i,a}/x_{i,b}),&
\mathscr E_n(x,z)&=\prod_{i=1}^{n-1}\prod_{a=1}^i
\prod_{b=1}^{i+1}(1-\rho_{i,a,b}), \tag*{(4.1)}
\end{align} R n ( x ) = i = 1 ∏ n − 1 a < b ∏ ( 1 − x i , a / x i , b ) , E n ( x , z ) = i = 1 ∏ n − 1 a = 1 ∏ i b = 1 ∏ i + 1 ( 1 − ρ i , a , b ) , (4.1)
and put P s = R n P − 2 m E n m \mathscr P_s=\mathscr R_n^{P-2m}\mathscr E_n^m P s = R n P − 2 m E n m . The two constant terms are
T s ( n ) = C T x P s , T ~ s ( n ) = C T x ( P s R n − P ) . \begin{equation}
T_s^{(n)}=\mathop{\mathrm{CT}}_x\mathscr P_s,\qquad
\widetilde T_s^{(n)}=\mathop{\mathrm{CT}}_x
(\mathscr P_s\mathscr R_n^{-P}). \tag*{(4.2)}
\end{equation} T s ( n ) = CT x P s , T s ( n ) = CT x ( P s R n − P ) . (4.2)
The notation R n ( x P ) \mathscr R_n(x^P) R n ( x P ) means that each internal variable is raised to the P P P th power. Its inverse is expanded in the same smaller-to-larger ratios as the master period.
Proof. Use the vector d i , a = a \mathbf d_{i,a}=a d i , a = a from § 2 . The normalization (2.15) reads
P s = ( − 1 ) m c n G n ( z ) − m x − P d + 1 Φ s ( x , z ) . \begin{equation}
\mathscr P_s=(-1)^{mc_n}G_n(z)^{-m}
x^{-P\mathbf d+\mathbf1}\Phi_s(x,z). \tag*{(4.4)}
\end{equation} P s = ( − 1 ) m c n G n ( z ) − m x − P d + 1 Φ s ( x , z ) . (4.4) In particular, the polynomial Φ s \Phi_s Φ s is alternating in each internal row. Its degree in a variable on row i i i is at most i P + m − 1 < ( i + 1 ) P − 1 iP+m-1<(i+1)P-1 i P + m − 1 < ( i + 1 ) P − 1 . Lemma 2.6 therefore says that
[ x P u − 1 ] Φ s ≠ 0 ⟹ u = τ ( d ) , τ ∈ ∏ i = 1 n − 1 S i . [x^{P\boldsymbol u-\mathbf1}]\Phi_s\ne0
\quad\Longrightarrow\quad
\boldsymbol u=\tau(\mathbf d),\qquad
\tau\in\prod_{i=1}^{n-1}S_i. [ x P u − 1 ] Φ s = 0 ⟹ u = τ ( d ) , τ ∈ i = 1 ∏ n − 1 S i . Every monomial of R n ( x P ) − 1 \mathscr R_n(x^P)^{-1} R n ( x P ) − 1 has the form x P ν x^{P\boldsymbol\nu} x P ν , where, on each row, ν \boldsymbol\nu ν is a nonnegative integral combination of ε a − ε b \varepsilon_a-\varepsilon_b ε a − ε b , a < b a<b a < b ; here ε a \varepsilon_a ε a denotes the a a a th coordinate vector on that row. Thus its initial partial sums are nonnegative. A nonzero contribution to the constant term in (4.3) requires
d − ν = τ ( d ) . \mathbf d-\boldsymbol\nu=\tau(\mathbf d). d − ν = τ ( d ) . For a row of length i i i , this gives, for 1 ≤ k < i 1\leq k<i 1 ≤ k < i ,
0 ≤ ∑ a = 1 k ν i , a = ∑ a = 1 k ( a − τ i ( a ) ) ≤ 0. 0\leq\sum_{a=1}^k\nu_{i,a}
=\sum_{a=1}^k\bigl(a-\tau_i(a)\bigr)\leq0. 0 ≤ a = 1 ∑ k ν i , a = a = 1 ∑ k ( a − τ i ( a ) ) ≤ 0. The last inequality holds because 1 + ⋯ + k 1+\cdots+k 1 + ⋯ + k is the smallest sum of k k k distinct elements of { 1 , … , i } \{1,\ldots,i\} { 1 , … , i } . Every partial sum vanishes, hence ν = 0 \boldsymbol\nu=0 ν = 0 and τ = i d \tau=\mathrm{id} τ = id . Only the constant monomial of R n ( x P ) − 1 \mathscr R_n(x^P)^{-1} R n ( x P ) − 1 contributes, proving the identity over Z \mathbb Z Z . All coefficient extractions are finite by the acyclic-flow argument of Lemma 2.2 . ◻
Since P = p s P=p^s P = p s , the Frobenius action gives R n ( x ) P ≡ R n ( x P ) ( m o d p ) \mathscr R_n(x)^P\equiv\mathscr R_n(x^P)\pmod p R n ( x ) P ≡ R n ( x P ) ( mod p ) . Both factors have constant coefficient one in the chamber expansion, so their inverses obey the same congruence. The lemma therefore proves divisibility of every discrepancy coefficient by p p p . We next determine its dependence on the Kähler degree.
Degree-Dependent Congruences
For a Kähler multidegree e = ( e 1 , … , e n − 1 ) ∈ Z ≥ 0 n − 1 \boldsymbol e=(e_1,\ldots,e_{n-1})\in\mathbb Z_{\geq0}^{n-1} e = ( e 1 , … , e n − 1 ) ∈ Z ≥ 0 n − 1 , set
B ( e ) = max 1 ≤ j ≤ n − 2 min ( e j , e j + 1 ) . \begin{equation}
B(\boldsymbol e)=\max_{1\leq j\leq n-2}\min(e_j,e_{j+1}). \tag*{(4.5)}
\end{equation} B ( e ) = 1 ≤ j ≤ n − 2 max min ( e j , e j + 1 ) . (4.5)
This quantity bounds the flow on every same-row edge in an appropriate interlacing chamber. For n = 3 n=3 n = 3 it reduces to min ( e 1 , e 2 ) \min(e_1,e_2) min ( e 1 , e 2 ) . We use v p ( 0 ) = + ∞ v_p(0)=+\infty v p ( 0 ) = + ∞ .
Theorem 4.2. Assume (2.10) , n ≥ 3 n\geq3 n ≥ 3 , and s ≥ 1 s\geq1 s ≥ 1 . Then Δ s ( n ) ∈ p Z [ Q 1 , … , Q n − 1 ] .
\Delta_s^{(n)}\in p\mathbb Z[Q_1,\ldots,Q_{n-1}].
Δ s ( n ) ∈ p Z [ Q 1 , … , Q n − 1 ] . If B ( e ) = 0 B(\boldsymbol e)=0 B ( e ) = 0 , then [ Q e ] Δ s ( n ) = 0 [Q^{\boldsymbol e}]\Delta_s^{(n)}=0 [ Q e ] Δ s ( n ) = 0 . If B ( e ) > 0 B(\boldsymbol e)>0 B ( e ) > 0 , then v p ( [ Q e ] Δ s ( n ) ) ≥ max { 1 , s − ⌊ log p B ( e ) ⌋ } .
v_p\bigl([Q^{\boldsymbol e}]\Delta_s^{(n)}\bigr)
\geq\max\left\{1,\ s-\lfloor\log_pB(\boldsymbol e)\rfloor\right\}.
v p ( [ Q e ] Δ s ( n ) ) ≥ max { 1 , s − ⌊ log p B ( e )⌋ } . In particular, the coefficients with B ( e ) < p B(\boldsymbol e)<p B ( e ) < p agree modulo p s p^s p s , and every fixed coefficient of Δ s ( n ) \Delta_s^{(n)} Δ s ( n ) tends to zero p p p -adically.
Proof. Polynomiality follows from Proposition 3.7 and Proposition 2.5 . By (4.2) , the Frobenius congruence for the inverse of R n P \mathscr R_n^P R n P , and Lemma 4.1 ,
T ~ s ( n ) ≡ C T x [ P s R n ( x P ) − 1 ] = T s ( n ) ( m o d p ) . \widetilde T_s^{(n)}
\equiv\mathop{\mathrm{CT}}_x[\mathscr P_s\mathscr R_n(x^P)^{-1}]
=T_s^{(n)}\pmod p. T s ( n ) ≡ CT x [ P s R n ( x P ) − 1 ] = T s ( n ) ( mod p ) . This proves (4.6) in every rank.
For the degree estimate, write
Δ s ( n ) = C T x [ E n m R n − 2 m ( 1 − R n P ) ] . \begin{equation}
\Delta_s^{(n)}=\mathop{\mathrm{CT}}_x\left[
\mathscr E_n^m\mathscr R_n^{-2m}(1-\mathscr R_n^P)\right]. \tag*{(4.8)}
\end{equation} Δ s ( n ) = CT x [ E n m R n − 2 m ( 1 − R n P ) ] . (4.8) Choose the interlacing radii more specifically so that
∣ z a + n − i − 1 ∣ < ∣ x i , a ∣ < ∣ z a + n − i ∣ . |z_{a+n-i-1}|<|x_{i,a}|<|z_{a+n-i}|. ∣ z a + n − i − 1 ∣ < ∣ x i , a ∣ < ∣ z a + n − i ∣. These inequalities are compatible with (2.4) : for example, take log ∣ z j ∣ = j \log|z_j|=j log ∣ z j ∣ = j and log ∣ x i , a ∣ = a + n − i − ϵ ( n − i ) \log|x_{i,a}|=a+n-i-\epsilon(n-i) log ∣ x i , a ∣ = a + n − i − ϵ ( n − i ) , where 0 < ϵ < 1 / n 0<\epsilon<1/n 0 < ϵ < 1/ n . The binomial ratios in the master period are unchanged by this refinement of the chamber.
A same-row edge joining x i , a x_{i,a} x i , a to x i , b x_{i,b} x i , b , a < b a<b a < b , crosses a cut in every external gap with index a + n − i − 1 , … , b + n − i − 1 a+n-i-1,\ldots,b+n-i-1 a + n − i − 1 , … , b + n − i − 1 . Flow conservation bounds its total index by
min a + n − i − 1 ≤ j ≤ b + n − i − 1 e j ≤ B ( e ) . \min_{a+n-i-1\leq j\leq b+n-i-1}e_j
\leq B(\boldsymbol e). a + n − i − 1 ≤ j ≤ b + n − i − 1 min e j ≤ B ( e ) . Indeed, the interval contains two adjacent gap indices, and the sum of all flows across a cut in gap j j j is e j e_j e j .
Expand 1 − R n P 1-\mathscr R_n^P 1 − R n P as a sum indexed by the same-row edges. Each nonconstant term contains at least one binomial factor ( P k ) \binom Pk ( k P ) with k > 0 k>0 k > 0 . Its index contributes to the total flow on that edge, so k ≤ B ( e ) k\leq B(\boldsymbol e) k ≤ B ( e ) . If B ( e ) = 0 B(\boldsymbol e)=0 B ( e ) = 0 , no such term can contribute, proving the vanishing assertion. If 1 ≤ B ( e ) < P 1\leq B(\boldsymbol e)<P 1 ≤ B ( e ) < P , use
v p ( P k ) = s − v p ( k ) , 1 ≤ k < P . \begin{equation}
v_p\binom Pk=s-v_p(k),\qquad 1\leq k<P. \tag*{(4.9)}
\end{equation} v p ( k P ) = s − v p ( k ) , 1 ≤ k < P . (4.9) To verify the identity, write ( P k ) = ( P / k ) ( P − 1 k − 1 ) \binom Pk=(P/k)\binom{P-1}{k-1} ( k P ) = ( P / k ) ( k − 1 P − 1 ) . The second factor is a p p p -adic unit, since ( 1 + X ) P − 1 ≡ ∑ j = 0 P − 1 ( − X ) j ( m o d p ) (1+X)^{P-1}\equiv\sum_{j=0}^{P-1}(-X)^j\pmod p ( 1 + X ) P − 1 ≡ ∑ j = 0 P − 1 ( − X ) j ( mod p ) . Thus every contributing term is divisible by p s − ⌊ log p B ( e ) ⌋ p^{s-\lfloor\log_pB(\boldsymbol e)\rfloor} p s − ⌊ l o g p B ( e )⌋ ; all remaining binomial coefficients are integral. If B ( e ) ≥ P B(\boldsymbol e)\geq P B ( e ) ≥ P , the global congruence supplies the bound 1 1 1 . Together these prove (4.7) . At each fixed multidegree the bound tends to infinity with s s s . ◻
Dividing by p p p gives an integral solution of the full commuting congruences at one lower precision. Thus the discrepancy gives joint tCM solutions in every complete flag.
Corollary 4.3. For every n ≥ 3 n\geq3 n ≥ 3 , the polynomial E s ( n ) = Δ s ( n ) / p E_s^{(n)}=\Delta_s^{(n)}/p E s ( n ) = Δ s ( n ) / p is integral. For 1 ≤ k ≤ n 1\leq k\leq n 1 ≤ k ≤ n , B k ( 0 ) ( ω ) E s ( n ) ≡ 0 ( m o d p s − 1 ) , I n , k ( ω ) ( J n , ω E s ( n ) ) ≡ 0 ( m o d p s − 1 ) . \mathsf B_k^{(0)}(\omega)E_s^{(n)}\equiv0\pmod{p^{s-1}},\qquad
\mathsf I_{n,k}(\omega)(J_{n,\omega}E_s^{(n)})
\equiv0\pmod{p^{s-1}}. B k ( 0 ) ( ω ) E s ( n ) ≡ 0 ( mod p s − 1 ) , I n , k ( ω ) ( J n , ω E s ( n ) ) ≡ 0 ( mod p s − 1 ) . In particular, L n , ω E s ( n ) ≡ 0 \mathcal L_{n,\omega}E_s^{(n)}\equiv0 L n , ω E s ( n ) ≡ 0 and H n , ω ( J n , ω E s ( n ) ) ≡ 0 ( m o d p s − 1 ) H_{n,\omega}(J_{n,\omega}E_s^{(n)})\equiv0\pmod{p^{s-1}} H n , ω ( J n , ω E s ( n ) ) ≡ 0 ( mod p s − 1 ) .
Proof. Divide (3.27) by p p p , using (4.6) , and conjugate by J n , ω J_{n,\omega} J n , ω . ◻
Consecutive Subflags and Sharpness
[scale=.86,every node/.style={font=\small}]
\draw[gray] (0,0)--(6,0);
\foreach \x/\lab in {0/{z_j},3/{z_{j+1}},6/{z_{j+2}}}
{\fill (\x,0) circle (2pt);\node[below] at (\x,0) {$\lab$};}
\draw[dashed,gray] (2.5,-.2)--(2.5,1.9);
\draw[dashed,gray] (3.5,-.2)--(3.5,1.9);
\node[above] at (2.5,1.9) {$e_j$};
\node[above] at (3.5,1.9) {$e_{j+1}$};
\fill (1.8,1.15) circle (2pt);
\fill (5,1.15) circle (2pt);
\node[above] at (1.8,1.15) {$x_{r,a}$};
\node[above] at (5,1.15) {$x_{r,b}$};
\draw[->,thick] (1.8,1.15)--node[below] {$h$}(5,1.15);Figure 1. A same-row flow crosses cuts in two adjacent external gaps. Conservation gives h ≤ min ( e j , e j + 1 ) h\leq\min(e_j,e_{j+1}) h ≤ min ( e j , e j + 1 ) . The refined interlacing chamber in the proof of Theorem 4.2 ensures that every same-row edge crosses such a pair of cuts.
We prove that the coefficient bound is attained at every p p p -power scale. Restricting to two consecutive Kähler variables reduces the constant term to a three-particle triangle; its extreme flow gives the required nonzero coefficient.
Lemma 4.4. For n ≥ 3 n\geq3 n ≥ 3 , 1 ≤ i ≤ n − 2 1\leq i\leq n-2 1 ≤ i ≤ n − 2 , and rational m , γ m,\gamma m , γ , one has C n ( Q ; m , γ ) ∣ Q i = X , Q i + 1 = Y , Q j = 0 ( j ≠ i , i + 1 ) = C 3 ( ( X , Y ) ; m , γ ) .
\left.C_n(Q;m,\gamma)\right|_{Q_i=X,\ Q_{i+1}=Y,\ Q_j=0\ (j\ne i,i+1)}
=C_3((X,Y);m,\gamma).
C n ( Q ; m , γ ) ∣ Q i = X , Q i + 1 = Y , Q j = 0 ( j = i , i + 1 ) = C 3 (( X , Y ) ; m , γ ) . The substitution is understood coefficientwise in the formal Kähler expansion.
Proof. Choose interlacing radii so that the open interval ( ∣ z i ∣ , ∣ z i + 2 ∣ ) (|z_i|,|z_{i+2}|) ( ∣ z i ∣ , ∣ z i + 2 ∣ ) contains exactly two internal vertices on row n − 1 n-1 n − 1 , one on row n − 2 n-2 n − 2 , and none on the lower rows. Such a choice is possible directly from interlacing. On row n − 1 n-1 n − 1 the two vertices lie in the consecutive gaps on either side of ∣ z i + 1 ∣ |z_{i+1}| ∣ z i + 1 ∣ . On the next row the interval between these two vertices supplies one internal vertex; at each boundary choose the neighboring vertex outside ( ∣ z i ∣ , ∣ z i + 2 ∣ ) (|z_i|,|z_{i+2}|) ( ∣ z i ∣ , ∣ z i + 2 ∣ ) . On the following row all vertices can be chosen outside this interval, and this remains possible on every lower row. Each choice is made in a nonempty open interlacing interval, with distinct radii.
Setting Q j = 0 Q_j=0 Q j = 0 for j ≠ i , i + 1 j\ne i,i+1 j = i , i + 1 retains only flows of degree zero in those gaps. The sum of flows across each such cut is zero, so no edge crossing it carries a positive index. Outside the surviving interval all external exponents are zero; acyclicity and internal conservation then force every remaining flow there to vanish as well. The only active internal vertices are the three just chosen. Together with z i , z i + 1 , z i + 2 z_i,z_{i+1},z_{i+2} z i , z i + 1 , z i + 2 , they have exactly the adjacent-row edges and the single same-row edge of the rank-three master period. All other binomial factors contribute their constant coefficients. Relabeling the three external variables proves (4.10) . ◻
[scale=.85,every node/.style={font=\small}]
\node (z1) at (0,0) {$z_i$};
\node (z2) at (3,0) {$z_{i+1}$};
\node (z3) at (6,0) {$z_{i+2}$};
\node (v) at (1.5,1.35) {$v$};
\node (w) at (4.5,1.35) {$w$};
\node (u) at (2.7,2.6) {$u$};
\foreach \a/\b in {z1/v,v/z2,v/z3,z1/w,z2/w,w/z3,v/u,u/w}
{\draw[->,gray] (\a)--(\b);}
\draw[->,thick] (v)--node[above] {$v/w$}(w);Figure 2. The active triangle after restricting to two consecutive Kähler variables. The vertices v , w v,w v , w lie on row n − 1 n-1 n − 1 and u u u on row n − 2 n-2 n − 2 . All edges outside this triangle have zero flow. The bold edge is the only surviving same-row factor.
For the local calculation, write u = x 1 , 1 u=x_{1,1} u = x 1 , 1 , v = x 2 , 1 v=x_{2,1} v = x 2 , 1 , w = x 2 , 2 w=x_{2,2} w = x 2 , 2 and set z 1 = X z_1=X z 1 = X , z 2 = 1 z_2=1 z 2 = 1 , z 3 = Y − 1 z_3=Y^{-1} z 3 = Y − 1 . The adjacent-row product is
E 3 = ( 1 − v / u ) ( 1 − u / w ) ( 1 − X / v ) ( 1 − v ) ⋅ ( 1 − v Y ) ( 1 − X / w ) ( 1 − 1 / w ) ( 1 − w Y ) . \begin{equation}
\begin{split}
\mathscr E_3={}&(1-v/u)(1-u/w)(1-X/v)(1-v)\\
&\cdot(1-vY)(1-X/w)(1-1/w)(1-wY).
\end{split} \tag*{(4.11)}
\end{equation} E 3 = ( 1 − v / u ) ( 1 − u / w ) ( 1 − X / v ) ( 1 − v ) ⋅ ( 1 − v Y ) ( 1 − X / w ) ( 1 − 1/ w ) ( 1 − w Y ) . (4.11)
Put r = v / w r=v/w r = v / w . The following weights count the flows left after fixing the exponent of this single same-row ratio.
Lemma 4.5. For m , h ∈ Z ≥ 0 m,h\in\mathbb Z_{\geq0} m , h ∈ Z ≥ 0 , put W h ( m ) ( d , e ) = [ X d Y e ] C T u , v , w r h E 3 m . W_h^{(m)}(d,e)=[X^dY^e]\mathop{\mathrm{CT}}_{u,v,w}r^h\mathscr E_3^m. W h ( m ) ( d , e ) = [ X d Y e ] CT u , v , w r h E 3 m . These weights are integers and vanish unless 0 ≤ d , e ≤ 2 m 0\leq d,e\leq2m 0 ≤ d , e ≤ 2 m and 0 ≤ h ≤ min ( d , e , m ) 0\leq h\leq\min(d,e,m) 0 ≤ h ≤ min ( d , e , m ) . Moreover, W h ( m ) ( h , h ) = ( m h ) 2 .
W_h^{(m)}(h,h)=\binom mh^2.
W h ( m ) ( h , h ) = ( h m ) 2 .
Proof. Assign indices a , b , c , ℓ , j , f , g , k a,b,c,\ell,j,f,g,k a , b , c , ℓ , j , f , g , k to the eight factors of (4.11) , in their displayed order. Each index lies between 0 0 0 and m m m . Conservation of the exponents of u , v , w u,v,w u , v , w gives
b = a , c = a + ℓ + j + h , k = a + f + g + h . b=a,\qquad c=a+\ell+j+h,\qquad k=a+f+g+h. b = a , c = a + ℓ + j + h , k = a + f + g + h . The external degrees are
d = c + f = a + ℓ + j + f + h , e = j + k = a + j + f + g + h . d=c+f=a+\ell+j+f+h,\qquad
e=j+k=a+j+f+g+h. d = c + f = a + ℓ + j + f + h , e = j + k = a + j + f + g + h . These identities prove the support bounds. If d = e = h d=e=h d = e = h , all indices except c = k = h c=k=h c = k = h vanish. Their signs cancel and their binomial weights multiply to ( m h ) 2 \binom mh^2 ( h m ) 2 , proving (4.12) . More generally, the sum of all eight indices is even under the conservation laws, so every surviving edge weight has positive sign. ◻
We can now compute the sharp coefficients in every rank. Coefficients supported on two consecutive Kähler variables are understood to have all other degrees zero.
Theorem 4.6. Assume (2.10) , n ≥ 3 n\geq3 n ≥ 3 , s ≥ 1 s\geq1 s ≥ 1 , and put a 0 = ω ( p − 1 ) ∈ { 1 , … , ( p − 1 ) / 2 } a_0=\omega(p-1)\in\{1,\ldots,(p-1)/2\} a 0 = ω ( p − 1 ) ∈ { 1 , … , ( p − 1 ) /2 } . For 1 ≤ i ≤ n − 2 1\leq i\leq n-2 1 ≤ i ≤ n − 2 and 0 ≤ ℓ ≤ s − 1 0\leq\ell\leq s-1 0 ≤ ℓ ≤ s − 1 , [ Q i p ℓ Q i + 1 p ℓ ] Δ s ( n ) ≡ p s − ℓ a 0 2 ( m o d p s − ℓ + 1 ) .
[Q_i^{p^\ell}Q_{i+1}^{p^\ell}]\Delta_s^{(n)}
\equiv p^{s-\ell}a_0^2\pmod{p^{s-\ell+1}}.
[ Q i p ℓ Q i + 1 p ℓ ] Δ s ( n ) ≡ p s − ℓ a 0 2 ( mod p s − ℓ + 1 ) . The coefficient has valuation exactly s − ℓ s-\ell s − ℓ , and ∥ T ~ s ( n ) − T s ( n ) ∥ p = p − 1 ( n ≥ 3 , s ≥ 1 ) .
\|\widetilde T_s^{(n)}-T_s^{(n)}\|_p=p^{-1}
\qquad(n\geq3,\ s\geq1).
∥ T s ( n ) − T s ( n ) ∥ p = p − 1 ( n ≥ 3 , s ≥ 1 ) . In particular, T ~ s ( n ) ≢ T s ( n ) ( m o d p s ) \widetilde T_s^{(n)}\not\equiv T_s^{(n)}\pmod{p^s} T s ( n ) ≡ T s ( n ) ( mod p s ) for every n ≥ 3 n\geq3 n ≥ 3 and s ≥ 2 s\geq2 s ≥ 2 .
Proof. Put d ℓ = p ℓ d_\ell=p^\ell d ℓ = p ℓ , an integer Kähler degree. Lemma 4.4 , applied to both same-row exponents, gives
[ Q i d ℓ Q i + 1 d ℓ ] Δ s ( n ) = [ X d ℓ Y d ℓ ] Δ s ( 3 ) . \begin{equation}
[Q_i^{d_\ell}Q_{i+1}^{d_\ell}]\Delta_s^{(n)}
=[X^{d_\ell}Y^{d_\ell}]\Delta_s^{(3)}. \tag*{(4.15)}
\end{equation} [ Q i d ℓ Q i + 1 d ℓ ] Δ s ( n ) = [ X d ℓ Y d ℓ ] Δ s ( 3 ) . (4.15) For the right-hand side, expand the single same-row factor as
c h = [ r h ] ( 1 − r ) − 2 m [ 1 − ( 1 − r ) P ] , c 0 = 0. c_h=[r^h](1-r)^{-2m}\left[1-(1-r)^P\right],\qquad c_0=0. c h = [ r h ] ( 1 − r ) − 2 m [ 1 − ( 1 − r ) P ] , c 0 = 0. Then Lemma 4.5 gives
[ X d ℓ Y d ℓ ] Δ s ( 3 ) = ∑ h = 1 d ℓ c h W h ( m ) ( d ℓ , d ℓ ) . \begin{equation}
[X^{d_\ell}Y^{d_\ell}]\Delta_s^{(3)}
=\sum_{h=1}^{d_\ell}c_hW_h^{(m)}(d_\ell,d_\ell). \tag*{(4.16)}
\end{equation} [ X d ℓ Y d ℓ ] Δ s ( 3 ) = h = 1 ∑ d ℓ c h W h ( m ) ( d ℓ , d ℓ ) . (4.16) Since m = a 0 ( 1 + p + ⋯ + p s − 1 ) m=a_0(1+p+\cdots+p^{s-1}) m = a 0 ( 1 + p + ⋯ + p s − 1 ) and a 0 ≥ 1 a_0\geq1 a 0 ≥ 1 , we have d ℓ ≤ m < P d_\ell\leq m<P d ℓ ≤ m < P .
If ℓ = 0 \ell=0 ℓ = 0 , then d ℓ = 1 d_\ell=1 d ℓ = 1 , c 1 = P c_1=P c 1 = P , and W 1 ( m ) ( 1 , 1 ) = m 2 W_1^{(m)}(1,1)=m^2 W 1 ( m ) ( 1 , 1 ) = m 2 . The coefficient is therefore P m 2 Pm^2 P m 2 , which proves (4.13) because m ≡ a 0 ( m o d p ) m\equiv a_0\pmod p m ≡ a 0 ( mod p ) . For ℓ ≥ 1 \ell\geq1 ℓ ≥ 1 , every 1 ≤ k < d ℓ = p ℓ 1\leq k<d_\ell=p^\ell 1 ≤ k < d ℓ = p ℓ has v p ( k ) ≤ ℓ − 1 v_p(k)\leq\ell-1 v p ( k ) ≤ ℓ − 1 . Equation (4.9) therefore gives c h ≡ 0 ( m o d p s − ℓ + 1 ) c_h\equiv0\pmod{p^{s-\ell+1}} c h ≡ 0 ( mod p s − ℓ + 1 ) for h < d ℓ h<d_\ell h < d ℓ . In c d ℓ c_{d_\ell} c d ℓ , all terms with binomial index k < d ℓ k<d_\ell k < d ℓ vanish at the same precision. The remaining term has positive sign because d ℓ d_\ell d ℓ is odd, so
c d ℓ ≡ ( P d ℓ ) = p s − ℓ ( P − 1 d ℓ − 1 ) ≡ p s − ℓ ( m o d p s − ℓ + 1 ) . c_{d_\ell}\equiv\binom P{d_\ell}
=p^{s-\ell}\binom{P-1}{d_\ell-1}
\equiv p^{s-\ell}\pmod{p^{s-\ell+1}}. c d ℓ ≡ ( d ℓ P ) = p s − ℓ ( d ℓ − 1 P − 1 ) ≡ p s − ℓ ( mod p s − ℓ + 1 ) . Here ( P − 1 d ℓ − 1 ) ≡ ( − 1 ) d ℓ − 1 = 1 ( m o d p ) \binom{P-1}{d_\ell-1}\equiv(-1)^{d_\ell-1}=1\pmod p ( d ℓ − 1 P − 1 ) ≡ ( − 1 ) d ℓ − 1 = 1 ( mod p ) . Using (4.12) in (4.16) , we obtain
[ X d ℓ Y d ℓ ] Δ s ( 3 ) ≡ p s − ℓ ( m d ℓ ) 2 ( m o d p s − ℓ + 1 ) . [X^{d_\ell}Y^{d_\ell}]\Delta_s^{(3)}
\equiv p^{s-\ell}\binom m{d_\ell}^2\pmod{p^{s-\ell+1}}. [ X d ℓ Y d ℓ ] Δ s ( 3 ) ≡ p s − ℓ ( d ℓ m ) 2 ( mod p s − ℓ + 1 ) . The base-p p p digits of m m m are all a 0 a_0 a 0 . Equivalently,
( 1 + X ) m ≡ ∏ j = 0 s − 1 ( 1 + X p j ) a 0 ( m o d p ) . (1+X)^m\equiv\prod_{j=0}^{s-1}(1+X^{p^j})^{a_0}\pmod p. ( 1 + X ) m ≡ j = 0 ∏ s − 1 ( 1 + X p j ) a 0 ( mod p ) . The factors with j < ℓ j<\ell j < ℓ have total degree a 0 ( d ℓ − 1 ) / ( p − 1 ) ≤ ( d ℓ − 1 ) / 2 < d ℓ a_0(d_\ell-1)/(p-1)\leq(d_\ell-1)/2<d_\ell a 0 ( d ℓ − 1 ) / ( p − 1 ) ≤ ( d ℓ − 1 ) /2 < d ℓ . Those with j > ℓ j>\ell j > ℓ have no nonconstant term of degree at most d ℓ d_\ell d ℓ . Thus the coefficient of X d ℓ X^{d_\ell} X d ℓ is a 0 a_0 a 0 , and ( m d ℓ ) ≡ a 0 ( m o d p ) \binom m{d_\ell}\equiv a_0\pmod p ( d ℓ m ) ≡ a 0 ( mod p ) . This proves (4.13) for every i i i and n n n .
Theorem 4.2 gives the norm bound ∥ Δ s ( n ) ∥ p ≤ p − 1 \|\Delta_s^{(n)}\|_p\leq p^{-1} ∥ Δ s ( n ) ∥ p ≤ p − 1 . Taking ℓ = s − 1 \ell=s-1 ℓ = s − 1 in (4.13) gives a coefficient of valuation exactly one, proving equality in (4.14) . For s ≥ 2 s\geq2 s ≥ 2 , this coefficient also excludes divisibility by p s p^s p s . ◻
Thus every complete flag of rank at least three exhibits the same distinction between the two modes of approximation. The coefficients converge to the same characteristic-zero partition function at every fixed degree, but the difference retains norm p − 1 p^{-1} p − 1 . The sharp coefficients lie on every consecutive three-particle subflag. The higher-precision Dwork congruences proved in this paper concern the original family T s ( n ) T_s^{(n)} T s ( n ) ; the comparison does not assert these congruences for T ~ s ( n ) \widetilde T_s^{(n)} T s ( n ) .
Corollary 4.7. For every admissible ω , p \omega,p ω , p , every n ≥ 2 n\geq2 n ≥ 2 and s ≥ 1 s\geq1 s ≥ 1 , ∥ T s ( n ) − V n ( Q ; ω ) ∥ p = ∥ T ~ s ( n ) − V n ( Q ; ω ) ∥ p = 1. \|T_s^{(n)}-V_n(Q;\omega)\|_p
=\|\widetilde T_s^{(n)}-V_n(Q;\omega)\|_p=1. ∥ T s ( n ) − V n ( Q ; ω ) ∥ p = ∥ T s ( n ) − V n ( Q ; ω ) ∥ p = 1. Thus neither family converges to the vertex in coefficient norm.
Proof. Restricting the normalized quadratic equation to a simple-root axis gives the two-particle equation. Characteristic-zero uniqueness therefore identifies the restrictions of V n V_n V n and F m ( n ) F_m^{(n)} F m ( n ) with V 2 V_2 V 2 and F m ( 2 ) F_m^{(2)} F m ( 2 ) , respectively. For n ≥ 3 n\geq3 n ≥ 3 , Theorem 4.2 gives the same axis restriction for T s ( n ) T_s^{(n)} T s ( n ) as for T ~ s ( n ) \widetilde T_s^{(n)} T s ( n ) ; for n = 2 n=2 n = 2 they coincide directly. With P = p s P=p^s P = p s and m = A s < P m=A_s<P m = A s < P , both polynomial restrictions have degree m m m , whereas
[ Q i P ] V n = ( − ω P ) 2 ≡ a 0 2 ( m o d p ) , a 0 = ω ( p − 1 ) ≠ 0 ( m o d p ) . [Q_i^P]V_n=\binom{-\omega}{P}^{\!2}\equiv a_0^2\pmod p,
\qquad a_0=\omega(p-1)\ne0\pmod p. [ Q i P ] V n = ( P − ω ) 2 ≡ a 0 2 ( mod p ) , a 0 = ω ( p − 1 ) = 0 ( mod p ) . Indeed − ω = a 0 ( 1 + p + p 2 + ⋯ ) -\omega=a_0(1+p+p^2+\cdots) − ω = a 0 ( 1 + p + p 2 + ⋯ ) in Z p \mathbb Z_p Z p . For every t > s t>s t > s , the base-p p p digits of A t A_t A t equal a 0 a_0 a 0 , so Lucas congruences give ( A t p s ) ≡ a 0 ( m o d p ) \binom{A_t}{p^s}\equiv a_0\pmod p ( p s A t ) ≡ a 0 ( mod p ) . Taking the coefficientwise limit proves the displayed congruence. Each difference has integral coefficients, and its coefficient at Q i P Q_i^P Q i P is a unit. Its norm is consequently exactly one. ◻
We next express the comparison in the monomial symmetric basis. This avoids specializing a full Jack basis at a negative rational parameter.
Corollary 4.8. Assume (2.10) and n ≥ 3 n\geq3 n ≥ 3 , put m = A s m=A_s m = A s and λ = m δ \lambda=m\delta λ = m δ , and use T s \mathcal T_s T s from (3.21) . Write m μ m_\mu m μ for the sum of the distinct monomials in the permutation orbit of z μ z^\mu z μ , and expand P λ ( − 1 / m ) − T s = ∑ μ ≤ λ c s ( μ ) m μ .
P_\lambda^{(-1/m)}-\mathcal T_s
=\sum_{\mu\leq\lambda}c_s(\mu)m_\mu.
P λ ( − 1/ m ) − T s = ∑ μ ≤ λ c s ( μ ) m μ . Here the sum is over partitions of ∣ λ ∣ |\lambda| ∣ λ ∣ of length at most n n n , ordered by dominance, and c s ( μ ) ∈ Z c_s(\mu)\in\mathbb Z c s ( μ ) ∈ Z . For such a partition, padded by zeros to length n n n , put σ j ( μ ) = ∑ a = n − j + 1 n μ a − m j ( j − 1 ) 2 , b m ( μ ) = max 1 ≤ j ≤ n − 2 min { σ j ( μ ) , σ j + 1 ( μ ) } . \sigma_j(\mu)
=\sum_{a=n-j+1}^n\mu_a-\frac{mj(j-1)}2,
\qquad
b_m(\mu)=\max_{1\leq j\leq n-2}
\min\{\sigma_j(\mu),\sigma_{j+1}(\mu)\}. σ j ( μ ) = ∑ a = n − j + 1 n μ a − 2 mj ( j − 1 ) , b m ( μ ) = max 1 ≤ j ≤ n − 2 min { σ j ( μ ) , σ j + 1 ( μ )} . If b m ( μ ) = 0 b_m(\mu)=0 b m ( μ ) = 0 , then c s ( μ ) = 0 c_s(\mu)=0 c s ( μ ) = 0 . Otherwise, v p ( c s ( μ ) ) ≥ max { 1 , s − ⌊ log p b m ( μ ) ⌋ } .
v_p(c_s(\mu))\geq
\max\{1,\ s-\lfloor\log_pb_m(\mu)\rfloor\}.
v p ( c s ( μ )) ≥ max { 1 , s − ⌊ log p b m ( μ )⌋} . More explicitly, for 1 ≤ k ≤ n − 2 1\leq k\leq n-2 1 ≤ k ≤ n − 2 and 0 ≤ ℓ ≤ s − 1 0\leq\ell\leq s-1 0 ≤ ℓ ≤ s − 1 , c s ( λ − p ℓ ε k + p ℓ ε k + 2 ) ≡ p s − ℓ a 0 2 ( m o d p s − ℓ + 1 ) , a 0 = ω ( p − 1 ) .
c_s\bigl(\lambda-p^\ell\varepsilon_k+p^\ell\varepsilon_{k+2}\bigr)
\equiv p^{s-\ell}a_0^2\pmod{p^{s-\ell+1}},
\qquad a_0=\omega(p-1).
c s ( λ − p ℓ ε k + p ℓ ε k + 2 ) ≡ p s − ℓ a 0 2 ( mod p s − ℓ + 1 ) , a 0 = ω ( p − 1 ) . Consequently, for every n ≥ 3 n\geq3 n ≥ 3 and s ≥ 1 s\geq1 s ≥ 1 , P A s δ ( − 1 / A s ) ≡ T s ( m o d p ) , P A s δ ( − 1 / A s ) ≢ T s ( m o d p 2 ) . P_{A_s\delta}^{(-1/A_s)}\equiv\mathcal T_s\pmod p,
\qquad
P_{A_s\delta}^{(-1/A_s)}\not\equiv\mathcal T_s\pmod{p^2}. P A s δ ( − 1/ A s ) ≡ T s ( mod p ) , P A s δ ( − 1/ A s ) ≡ T s ( mod p 2 ) .
Proof. The dependence of Φ s ( x , z ) \Phi_s(x,z) Φ s ( x , z ) on the external variables is through E ( x , z ) m E(x,z)^m E ( x , z ) m . Proposition 3.10 gives the symmetry, integrality and common permutahedral Newton polytope of the two sides in (4.17) .
To identify their coefficients, choose the increasing exponent vector β = ( μ n , … , μ 1 ) \beta=(\mu_n,\ldots,\mu_1) β = ( μ n , … , μ 1 ) in the orbit of μ \mu μ . Dividing z β z^\beta z β by G n m G_n^m G n m gives the chamber monomial Q σ ( μ ) Q^{\boldsymbol\sigma(\mu)} Q σ ( μ ) . Symmetry and (3.19) consequently give
c s ( μ ) = [ Q σ ( μ ) ] Δ s ( n ) . c_s(\mu)
=[Q^{\boldsymbol\sigma(\mu)}]\Delta_s^{(n)}. c s ( μ ) = [ Q σ ( μ ) ] Δ s ( n ) . Dominance makes every σ j ( μ ) \sigma_j(\mu) σ j ( μ ) nonnegative. Theorem 4.2 proves the vanishing assertion and (4.18) .
For (4.19) , put d ℓ = p ℓ d_\ell=p^\ell d ℓ = p ℓ . The inequality d ℓ ≤ m d_\ell\leq m d ℓ ≤ m shows that μ = λ − d ℓ ε k + d ℓ ε k + 2 \mu=\lambda-d_\ell\varepsilon_k+d_\ell\varepsilon_{k+2} μ = λ − d ℓ ε k + d ℓ ε k + 2 is still a partition. Reversing its entries gives
β = ( 0 , m , … , ( n − 1 ) m ) + d ℓ ε i − d ℓ ε i + 2 , i = n − k − 1. \beta=(0,m,\ldots,(n-1)m)
+d_\ell\varepsilon_i-d_\ell\varepsilon_{i+2},
\qquad i=n-k-1. β = ( 0 , m , … , ( n − 1 ) m ) + d ℓ ε i − d ℓ ε i + 2 , i = n − k − 1. Thus σ i ( μ ) = σ i + 1 ( μ ) = d ℓ \sigma_i(\mu)=\sigma_{i+1}(\mu)=d_\ell σ i ( μ ) = σ i + 1 ( μ ) = d ℓ , and all its other chamber degrees vanish. Theorem 4.6 gives the stated residue. Taking ℓ = s − 1 \ell=s-1 ℓ = s − 1 yields valuation exactly one, proving the last assertion. Since m μ m_\mu m μ sums distinct monomials, this argument introduces no orbit-size or factorial denominator. ◻
The degree estimate also determines the discrepancy in weighted coefficient norms, which measure convergence on closed polydiscs of different radii.
Corollary 4.9. Assume (2.10) , n ≥ 3 n\geq3 n ≥ 3 , and s ≥ 1 s\geq1 s ≥ 1 . For a real number 0 < ϱ ≤ 1 0<\varrho\leq1 0 < ϱ ≤ 1 , define ∥ ∑ e c e Q e ∥ p , ϱ = sup e ∣ c e ∣ p ϱ ∣ e ∣ , ∣ e ∣ = e 1 + ⋯ + e n − 1 . \left\|\sum_{\boldsymbol e}c_{\boldsymbol e}Q^{\boldsymbol e}
\right\|_{p,\varrho}
=\sup_{\boldsymbol e}|c_{\boldsymbol e}|_p
\varrho^{|\boldsymbol e|},
\qquad |\boldsymbol e|=e_1+\cdots+e_{n-1}. ∥ ∑ e c e Q e ∥ p , ϱ = sup e ∣ c e ∣ p ϱ ∣ e ∣ , ∣ e ∣ = e 1 + ⋯ + e n − 1 . Then ∥ Δ s ( n ) ∥ p , ϱ = max 0 ≤ ℓ ≤ s − 1 p − ( s − ℓ ) ϱ 2 p ℓ .
\|\Delta_s^{(n)}\|_{p,\varrho}
=\max_{0\leq\ell\leq s-1}
p^{-(s-\ell)}\varrho^{2p^\ell}.
∥ Δ s ( n ) ∥ p , ϱ = max 0 ≤ ℓ ≤ s − 1 p − ( s − ℓ ) ϱ 2 p ℓ . At ϱ = 1 \varrho=1 ϱ = 1 this is p − 1 p^{-1} p − 1 . For 0 < ϱ < 1 0<\varrho<1 0 < ϱ < 1 , put C ϱ = max ℓ ≥ 0 p ℓ ϱ 2 p ℓ < ∞ . C_{\varrho}=\max_{\ell\geq0}p^\ell\varrho^{2p^\ell}<\infty. C ϱ = max ℓ ≥ 0 p ℓ ϱ 2 p ℓ < ∞. For every s s s one has ∥ Δ s ( n ) ∥ p , ϱ ≤ C ϱ p − s \|\Delta_s^{(n)}\|_{p,\varrho}\leq C_{\varrho}p^{-s} ∥ Δ s ( n ) ∥ p , ϱ ≤ C ϱ p − s , and equality holds for all sufficiently large s s s . In particular, the discrepancy converges to zero in every such weighted norm, with rate O ϱ ( p − s ) O_{\varrho}(p^{-s}) O ϱ ( p − s ) .
Proof. Let c e = [ Q e ] Δ s ( n ) c_{\boldsymbol e}=[Q^{\boldsymbol e}]\Delta_s^{(n)} c e = [ Q e ] Δ s ( n ) . If B ( e ) = 0 B(\boldsymbol e)=0 B ( e ) = 0 , Theorem 4.2 gives c e = 0 c_{\boldsymbol e}=0 c e = 0 . Otherwise set
ℓ = min { s − 1 , ⌊ log p B ( e ) ⌋ } . \ell=\min\{s-1,\lfloor\log_p B(\boldsymbol e)\rfloor\}. ℓ = min { s − 1 , ⌊ log p B ( e )⌋} . The same theorem gives v p ( c e ) ≥ s − ℓ v_p(c_{\boldsymbol e})\geq s-\ell v p ( c e ) ≥ s − ℓ . Since some adjacent degrees are both at least B ( e ) B(\boldsymbol e) B ( e ) , ∣ e ∣ ≥ 2 B ( e ) ≥ 2 p ℓ |\boldsymbol e|\geq2B(\boldsymbol e)\geq2p^\ell ∣ e ∣ ≥ 2 B ( e ) ≥ 2 p ℓ . Consequently
∣ c e ∣ p ϱ ∣ e ∣ ≤ p − ( s − ℓ ) ϱ 2 p ℓ , |c_{\boldsymbol e}|_p\varrho^{|\boldsymbol e|}
\leq p^{-(s-\ell)}\varrho^{2p^\ell}, ∣ c e ∣ p ϱ ∣ e ∣ ≤ p − ( s − ℓ ) ϱ 2 p ℓ , which proves the upper bound in (4.20) . For every 0 ≤ ℓ ≤ s − 1 0\leq\ell\leq s-1 0 ≤ ℓ ≤ s − 1 , Theorem 4.6 provides a coefficient with precisely two adjacent degrees p ℓ , p ℓ p^\ell,p^\ell p ℓ , p ℓ and valuation s − ℓ s-\ell s − ℓ . Its weighted absolute value attains the corresponding term of the maximum, proving equality.
If ϱ < 1 \varrho<1 ϱ < 1 , the sequence p ℓ ϱ 2 p ℓ p^\ell\varrho^{2p^\ell} p ℓ ϱ 2 p ℓ tends to zero. Its positive maximum is therefore finite and attained at a finite index. Once this index lies below s s s , formula (4.20) equals C ϱ p − s C_{\varrho}p^{-s} C ϱ p − s , proving the remaining assertions. ◻
Dwork Congruences and Differential Equations
We prove the Dwork congruences for the master-polynomial family, then use their Frobenius quotients to reconstruct the vertex by an infinite product. A differential consequence of these congruences transfers the full commuting tCM equations from the vertex to its polynomial approximations.
Alternating Ghosts
The master polynomials have two structures adapted to the Frobenius action: their exponents grow with powers of p p p , and they are alternating in each internal row. We shall use these properties to prove the Dwork congruences for T s ( n ) T_s^{(n)} T s ( n ) . Subtracting products obtained from lower levels by Frobenius substitution defines the ghost polynomial K s K_s K s . Its coefficients are divisible by p s − 1 p^{s-1} p s − 1 . Degree bounds and alternation then determine all coefficients relevant to extraction from a single choice of exponents in each row. The polynomial identity for K s K_s K s consequently becomes a recurrence for T s ( n ) T_s^{(n)} T s ( n ) alone.
We follow the ghost method originating in Mellit’s approach to Dwork congruences, developed for Laurent-polynomial constant terms in [MV16 ] (§2) and for hypergeometric master polynomials in [VZ24 ] (§2). Its alternating form appears in [SV23 ] (§§5.2–5.3). For the general relation between Frobenius and p p p -adic differential equations we refer to [Ked10 ].
Let σ \sigma σ denote the substitution ( x , z ) ↦ ( x p , z p ) (x,z)\mapsto(x^p,z^p) ( x , z ) ↦ ( x p , z p ) on integral polynomials, acting trivially on coefficients. Its action on Kähler series is Q ↦ Q p Q\mapsto Q^p Q ↦ Q p . The elementary ghost terms associated with an integral polynomial f f f are
R j ( f ) = f p j − σ ( f p j − 1 ) ∈ p j Z [ x , z ] , j ≥ 1. R_j(f)=f^{p^j}-\sigma\bigl(f^{p^{j-1}}\bigr)
\in p^j\mathbb Z[x,z],\qquad j\geq1. R j ( f ) = f p j − σ ( f p j − 1 ) ∈ p j Z [ x , z ] , j ≥ 1.
For j = 1 j=1 j = 1 this is f p ≡ σ ( f ) ( m o d p ) f^p\equiv\sigma(f)\pmod p f p ≡ σ ( f ) ( mod p ) . Raising congruent polynomials to successive p p p th powers gives the higher divisibility. The ghost terms therefore measure the error in replacing ordinary powers by Frobenius substitution at each p p p -adic precision.
For the master polynomials, the level-s s s exponents contain the sum 1 + p + ⋯ + p s − 1 1+p+\cdots+p^{s-1} 1 + p + ⋯ + p s − 1 . We separate its successive powers of p p p by the following factorization and recursion.
Put
f = M β 1 Δ γ 1 − 1 E A 1 , B 0 = 1 , B s = f 1 + p + ⋯ + p s − 1 ( s ≥ 1 ) . \begin{equation}
f=M^{\beta_1}\Delta^{\gamma_1-1}E^{A_1},\qquad
\mathcal B_0=1,\qquad
\mathcal B_s=f^{1+p+\cdots+p^{s-1}}\quad(s\geq1). \tag*{(5.1)}
\end{equation} f = M β 1 Δ γ 1 − 1 E A 1 , B 0 = 1 , B s = f 1 + p + ⋯ + p s − 1 ( s ≥ 1 ) . (5.1)
Recall that S = ∏ i = 1 n − 1 S i \mathfrak S=\prod_{i=1}^{n-1}S_i S = ∏ i = 1 n − 1 S i permutes the variables independently in each internal row and fixes the external variables. For τ = ( τ 1 , … , τ n − 1 ) \tau=(\tau_1,\ldots,\tau_{n-1}) τ = ( τ 1 , … , τ n − 1 ) , put sgn ( τ ) = ∏ i sgn ( τ i ) \operatorname{sgn}(\tau)=\prod_i\operatorname{sgn}(\tau_i) sgn ( τ ) = ∏ i sgn ( τ i ) . A polynomial is invariant if every row permutation leaves it unchanged, and alternating if each permutation multiplies it by its sign. We have Φ s = Δ B s \Phi_s=\Delta\mathcal B_s Φ s = Δ B s . The polynomials f f f and B s \mathcal B_s B s are invariant, while Δ \Delta Δ is alternating.
Lemma 5.1. Define K s K_s K s , s ≥ 1 s\geq1 s ≥ 1 , recursively by K s = Φ s − ∑ j = 1 s − 1 K j σ j ( B s − j ) .
K_s=\Phi_s-\sum_{j=1}^{s-1}K_j\sigma^j(\mathcal B_{s-j}).
K s = Φ s − ∑ j = 1 s − 1 K j σ j ( B s − j ) . Then K s K_s K s is alternating under S \mathfrak S S and K s ∈ p s − 1 Z [ x , z ] . K_s\in p^{s-1}\mathbb Z[x,z]. K s ∈ p s − 1 Z [ x , z ] . For every variable in row i i i , deg x i , a K s ≤ D i , s , D i , s = ( i + ω ) ( p s − 1 ) + i − 1 < ( i + 1 ) p s − 1.
\deg_{x_{i,a}}K_s\leq D_{i,s},\qquad
D_{i,s}=(i+\omega)(p^s-1)+i-1<(i+1)p^s-1.
deg x i , a K s ≤ D i , s , D i , s = ( i + ω ) ( p s − 1 ) + i − 1 < ( i + 1 ) p s − 1. The same bound holds for Φ s \Phi_s Φ s .
Proof. Write K s = Δ ℓ s K_s=\Delta\ell_s K s = Δ ℓ s , which is possible inductively from the recursion. Dividing the polynomial identity by its common factor Δ \Delta Δ gives
B s = ∑ j = 1 s ℓ j σ j ( B s − j ) . \mathcal B_s=\sum_{j=1}^s\ell_j\sigma^j(\mathcal B_{s-j}). B s = j = 1 ∑ s ℓ j σ j ( B s − j ) . Induction shows that ℓ s \ell_s ℓ s is symmetric, so K s K_s K s is alternating. Using B s + 1 = B s f p s \mathcal B_{s+1}=\mathcal B_sf^{p^s} B s + 1 = B s f p s , we subtract the recursions at consecutive levels and obtain
ℓ s + 1 = ∑ j = 1 s ℓ j σ j ( B s − j ) ( f p s − σ j ( f p s − j ) ) . \begin{equation}
\ell_{s+1}=
\sum_{j=1}^s\ell_j\sigma^j(\mathcal B_{s-j})
\left(f^{p^s}-\sigma^j(f^{p^{s-j}})\right). \tag*{(5.4)}
\end{equation} ℓ s + 1 = j = 1 ∑ s ℓ j σ j ( B s − j ) ( f p s − σ j ( f p s − j ) ) . (5.4) For integral polynomials u ≡ v ( m o d p ) u\equiv v\pmod p u ≡ v ( mod p ) , induction using the binomial theorem gives u p k ≡ v p k ( m o d p k + 1 ) u^{p^k}\equiv v^{p^k}\pmod{p^{k+1}} u p k ≡ v p k ( mod p k + 1 ) . Applying this to f p j ≡ σ j ( f ) ( m o d p ) f^{p^j}\equiv\sigma^j(f)\pmod p f p j ≡ σ j ( f ) ( mod p ) yields
f p s − σ j ( f p s − j ) ∈ p s − j + 1 Z [ x , z ] . f^{p^s}-\sigma^j(f^{p^{s-j}})\in p^{s-j+1}\mathbb Z[x,z]. f p s − σ j ( f p s − j ) ∈ p s − j + 1 Z [ x , z ] . Since ℓ 1 = f \ell_1=f ℓ 1 = f , induction in (5.4) proves ℓ s ∈ p s − 1 Z [ x , z ] \ell_s\in p^{s-1}\mathbb Z[x,z] ℓ s ∈ p s − 1 Z [ x , z ] and the required divisibility of K s K_s K s . We have used the factorization by Δ \Delta Δ only in polynomial identities, without dividing a congruence by it.
To estimate the degrees, observe that a variable in row i i i occurs in i − 1 i-1 i − 1 same-row factors and 2 i 2i 2 i adjacent-row or framing factors. Hence
deg x i , a Φ s ≤ β s + ( i − 1 ) γ s + 2 i A s = D i , s , deg x i , a B s ≤ ( i + ω ) ( p s − 1 ) . \deg_{x_{i,a}}\Phi_s
\leq\beta_s+(i-1)\gamma_s+2iA_s=D_{i,s},
\qquad
\deg_{x_{i,a}}\mathcal B_s\leq(i+\omega)(p^s-1). deg x i , a Φ s ≤ β s + ( i − 1 ) γ s + 2 i A s = D i , s , deg x i , a B s ≤ ( i + ω ) ( p s − 1 ) . Each product in (5.2) has degree bounded by
D i , j + p j ( i + ω ) ( p s − j − 1 ) = D i , s , D_{i,j}+p^j(i+\omega)(p^{s-j}-1)=D_{i,s}, D i , j + p j ( i + ω ) ( p s − j − 1 ) = D i , s , and induction gives the bound for K s K_s K s . The strict inequality follows from ( i + 1 ) p s − 1 − D i , s = ( 1 − ω ) p s + ω > 0 (i+1)p^s-1-D_{i,s}=(1-\omega)p^s+\omega>0 ( i + 1 ) p s − 1 − D i , s = ( 1 − ω ) p s + ω > 0 . ◻
The degree estimate determines which coefficients can contribute to the Frobenius recursion. An exponent congruent to − 1 -1 − 1 modulo p s p^s p s in row i i i must be one of p s − 1 , … , i p s − 1 p^s-1,\ldots,ip^s-1 p s − 1 , … , i p s − 1 . Alternation excludes repetitions, so the remaining choices are permutations of these exponents.
Lemma. For F s = Φ s F_s=\Phi_s F s = Φ s or F s = K s F_s=K_s F s = K s , a coefficient [ x p s u − 1 ] F s [x^{p^s\boldsymbol u-\mathbf1}]F_s [ x p s u − 1 ] F s with u ∈ Z N \boldsymbol u\in\mathbb Z^N u ∈ Z N can be nonzero only when u = τ ( d ) \boldsymbol u=\tau(\mathbf d) u = τ ( d ) for τ ∈ S \tau\in\mathfrak S τ ∈ S . In that case [ x p s τ ( d ) − 1 ] F s = sgn ( τ ) [ x p s d − 1 ] F s . [x^{p^s\tau(\mathbf d)-\mathbf1}]F_s
=\operatorname{sgn}(\tau)
[x^{p^s\mathbf d-\mathbf1}]F_s. [ x p s τ ( d ) − 1 ] F s = sgn ( τ ) [ x p s d − 1 ] F s .
Proof. By nonnegativity and (5.3) , 1 ≤ u i , a ≤ i 1\leq u_{i,a}\leq i 1 ≤ u i , a ≤ i . If two entries of row i i i coincide, their transposition fixes the monomial and changes the sign of its coefficient. This coefficient vanishes over Z \mathbb Z Z . The entries are therefore distinct and form a permutation of 1 , … , i 1,\ldots,i 1 , … , i . Alternation gives the corresponding sign. ◻
Consider K j σ j ( B s − j ) K_j\sigma^j(\mathcal B_{s-j}) K j σ j ( B s − j ) . Since the exponents of the second factor are divisible by p j p^j p j , only the coefficients of K j K_j K j in Lemma (?) can contribute to our extraction. Summing these coefficients with their permutation signs reproduces the Vandermonde factor in the lower-level coefficient U s − j U_{s-j} U s − j . The resulting recurrence involves only the Kähler variables.
Proposition. There are polynomials H s ∈ Z [ Q 1 , … , Q n − 1 ] H_s\in\mathbb Z[Q_1,\ldots,Q_{n-1}] H s ∈ Z [ Q 1 , … , Q n − 1 ] , s ≥ 1 s\geq1 s ≥ 1 , such that T s ( n ) = ∑ j = 1 s H j σ j ( T s − j ( n ) ) , H s ∈ p s − 1 Z [ Q 1 , … , Q n − 1 ] .
T_s^{(n)}=\sum_{j=1}^s H_j\sigma^j(T_{s-j}^{(n)}),
\qquad H_s\in p^{s-1}\mathbb Z[Q_1,\ldots,Q_{n-1}].
T s ( n ) = ∑ j = 1 s H j σ j ( T s − j ( n ) ) , H s ∈ p s − 1 Z [ Q 1 , … , Q n − 1 ] .
Proof. Let Γ j ( z ) = [ x p j d − 1 ] K j ( x , z ) \Gamma_j(z)=[x^{p^j\mathbf d-\mathbf1}]K_j(x,z) Γ j ( z ) = [ x p j d − 1 ] K j ( x , z ) . Expanding the Vandermonde determinant gives
Δ ( x ) = ∑ τ ∈ S sgn ( τ ) x τ ( d ) − 1 . \begin{equation}
\Delta(x)=\sum_{\tau\in\mathfrak S}
\operatorname{sgn}(\tau)x^{\tau(\mathbf d)-\mathbf1}. \tag*{(5.6)}
\end{equation} Δ ( x ) = τ ∈ S ∑ sgn ( τ ) x τ ( d ) − 1 . (5.6) It follows that, for every l ≥ 0 l\geq0 l ≥ 0 ,
We extract x p s d − 1 x^{p^s\mathbf d-\mathbf1} x p s d − 1 from K j σ j ( B s − j ) K_j\sigma^j(\mathcal B_{s-j}) K j σ j ( B s − j ) . The contributing exponents satisfy α + p j β = p s d − 1 \alpha+p^j\beta=p^s\mathbf d-\mathbf1 α + p j β = p s d − 1 , so α = p j u − 1 \alpha=p^j\boldsymbol u-\mathbf1 α = p j u − 1 for an integral vector u \boldsymbol u u . Lemma (?) gives u = τ ( d ) \boldsymbol u=\tau(\mathbf d) u = τ ( d ) and coefficient sgn ( τ ) Γ j \operatorname{sgn}(\tau)\Gamma_j sgn ( τ ) Γ j . The exponent in the second factor is β = p s − j d − τ ( d ) \beta=p^{s-j}\mathbf d-\tau(\mathbf d) β = p s − j d − τ ( d ) . Summing over τ \tau τ and using (5.7) , we find
[ x p s d − 1 ] K j σ j ( B s − j ) = Γ j ( z ) U s − j ( z p j ) . [x^{p^s\mathbf d-\mathbf1}]
K_j\sigma^j(\mathcal B_{s-j})
=\Gamma_j(z)U_{s-j}(z^{p^j}). [ x p s d − 1 ] K j σ j ( B s − j ) = Γ j ( z ) U s − j ( z p j ) . The identity also holds for j = s j=s j = s , since B 0 = 1 \mathcal B_0=1 B 0 = 1 and U 0 = 1 U_0=1 U 0 = 1 . Therefore
U s = ∑ j = 1 s Γ j σ j ( U s − j ) . U_s=\sum_{j=1}^s\Gamma_j\sigma^j(U_{s-j}). U s = j = 1 ∑ s Γ j σ j ( U s − j ) . In Z [ z 1 ± 1 , … , z n ± 1 ] \mathbb Z[z_1^{\pm1},\ldots,z_n^{\pm1}] Z [ z 1 ± 1 , … , z n ± 1 ] , set
H j = ( − 1 ) A j c n G n − A j Γ j . H_j=(-1)^{A_jc_n}G_n^{-A_j}\Gamma_j. H j = ( − 1 ) A j c n G n − A j Γ j . The identities A s = A j + p j A s − j A_s=A_j+p^jA_{s-j} A s = A j + p j A s − j and G n ( z p j ) = G n ( z ) p j G_n(z^{p^j})=G_n(z)^{p^j} G n ( z p j ) = G n ( z ) p j match the monomial normalizations. Since p p p is odd, the signs satisfy ( − 1 ) A s c n = ( − 1 ) A j c n ( − 1 ) A s − j c n (-1)^{A_sc_n}=(-1)^{A_jc_n}(-1)^{A_{s-j}c_n} ( − 1 ) A s c n = ( − 1 ) A j c n ( − 1 ) A s − j c n as well. Normalizing the recurrence for U s U_s U s thus gives (5.5) . This recurrence and polynomiality of T s ( n ) T_s^{(n)} T s ( n ) imply inductively that H s H_s H s is a polynomial in Q Q Q . Its Laurent coefficients are divisible by p s − 1 p^{s-1} p s − 1 by Lemma 5.1 . Distinct Q Q Q -monomials give distinct z z z -Laurent monomials, proving the same divisibility in Z [ Q ] \mathbb Z[Q] Z [ Q ] . ◻
The recurrence no longer contains internal variables. Its divisibility property gives congruences between successive Frobenius quotients by the following formal argument, applicable to any series with constant coefficient one.
Proof. For s = 1 s=1 s = 1 we use F 2 = H 1 σ ( F 1 ) + H 2 F_2=H_1\sigma(F_1)+H_2 F 2 = H 1 σ ( F 1 ) + H 2 and F 1 = H 1 F_1=H_1 F 1 = H 1 . Suppose the assertion holds for all indices smaller than s s s . Dividing the ghost recurrences by their Frobenius-shifted denominators gives
R s + 1 = ∑ j = 1 s + 1 H j σ j ( F s + 1 − j ) σ ( F s ) , R s = ∑ j = 1 s H j σ j ( F s − j ) σ ( F s − 1 ) . \mathcal R_{s+1}=
\sum_{j=1}^{s+1}H_j
\frac{\sigma^j(F_{s+1-j})}{\sigma(F_s)},\qquad
\mathcal R_s=
\sum_{j=1}^{s}H_j
\frac{\sigma^j(F_{s-j})}{\sigma(F_{s-1})}. R s + 1 = j = 1 ∑ s + 1 H j σ ( F s ) σ j ( F s + 1 − j ) , R s = j = 1 ∑ s H j σ ( F s − 1 ) σ j ( F s − j ) . The terms with j = 1 j=1 j = 1 coincide, and the last term of the first sum belongs to p s R p^sR p s R . For 2 ≤ j ≤ s 2\leq j\leq s 2 ≤ j ≤ s we use the telescoping identities
F s σ j − 1 ( F s − j + 1 ) = ∏ i = 0 j − 2 σ i ( R s − i ) , F s − 1 σ j − 1 ( F s − j ) = ∏ i = 0 j − 2 σ i ( R s − i − 1 ) . \frac{F_s}{\sigma^{j-1}(F_{s-j+1})}
=\prod_{i=0}^{j-2}\sigma^i(\mathcal R_{s-i}),\qquad
\frac{F_{s-1}}{\sigma^{j-1}(F_{s-j})}
=\prod_{i=0}^{j-2}\sigma^i(\mathcal R_{s-i-1}). σ j − 1 ( F s − j + 1 ) F s = i = 0 ∏ j − 2 σ i ( R s − i ) , σ j − 1 ( F s − j ) F s − 1 = i = 0 ∏ j − 2 σ i ( R s − i − 1 ) . The induction hypothesis identifies these products modulo p s − j + 1 p^{s-j+1} p s − j + 1 . Their factors are units, so we may invert and apply σ \sigma σ . Multiplication by H j ∈ p j − 1 R H_j\in p^{j-1}R H j ∈ p j − 1 R then places the difference of the corresponding summands in p s R p^sR p s R , proving (5.8) . ◻
For the master-polynomial recurrence, the condition T s ( n ) ( 0 ) = 1 T_s^{(n)}(0)=1 T s ( n ) ( 0 ) = 1 makes all these denominators invertible. We can therefore clear them and express the ratio congruence as a polynomial identity modulo p s p^s p s .
Theorem 5.5. Under (2.10) , the polynomials T s ( n ) T_s^{(n)} T s ( n ) satisfy, for every s ≥ 1 s\geq1 s ≥ 1 , T s + 1 ( n ) ( Q ) T s − 1 ( n ) ( Q p ) − T s ( n ) ( Q ) T s ( n ) ( Q p ) ∈ p s Z [ Q 1 , … , Q n − 1 ] .
T_{s+1}^{(n)}(Q)T_{s-1}^{(n)}(Q^p)
-T_s^{(n)}(Q)T_s^{(n)}(Q^p)
\in p^s\mathbb Z[Q_1,\ldots,Q_{n-1}].
T s + 1 ( n ) ( Q ) T s − 1 ( n ) ( Q p ) − T s ( n ) ( Q ) T s ( n ) ( Q p ) ∈ p s Z [ Q 1 , … , Q n − 1 ] . Equivalently, their successive formal Frobenius ratios are congruent modulo p s p^s p s as in (5.8) .
Proof. The recurrence of Proposition (?) satisfies Lemma (?) ; its denominators are units by Proposition 2.5 . Cross multiplication gives the congruence in Z p [ [ Q ] ] \mathbb Z_p[[Q]] Z p [[ Q ]] . Since the left-hand side is an integral polynomial, its coefficients are divisible by p s p^s p s in Z [ Q ] \mathbb Z[Q] Z [ Q ] as claimed. ◻
Infinite Products for the Vertex
The Frobenius-quotient construction follows Dwork’s approach to period congruences [D69 ].
The Dwork congruences reconstruct the partition function as an infinite product. They give a limit of the ratios T s ( n ) ( Q ) / T s − 1 ( n ) ( Q p ) T_s^{(n)}(Q)/T_{s-1}^{(n)}(Q^p) T s ( n ) ( Q ) / T s − 1 ( n ) ( Q p ) , which we identify with V n ( Q ) / V n ( Q p ) \mathcal V_n(Q)/\mathcal V_n(Q^p) V n ( Q ) / V n ( Q p ) . Iterating this identity reconstructs the period from its Frobenius quotient. Modulo p m p^m p m , all factors involve the same pair T m ( n ) T_m^{(n)} T m ( n ) and T m − 1 ( n ) T_{m-1}^{(n)} T m − 1 ( n ) . Their nonconstant terms have increasing order under Q ↦ Q p Q\mapsto Q^p Q ↦ Q p , so the product exists as a formal series.
Theorem 5.7. Under (2.10) , for every integer m ≥ 1 m\geq1 m ≥ 1 , V n ( Q ; ω ) ≡ ∏ i = 0 ∞ T m ( n ) ( Q p i ) T m − 1 ( n ) ( Q p i + 1 ) ( m o d p m ) .
\mathcal V_n(Q;\omega)\equiv
\prod_{i=0}^{\infty}
\frac{T_m^{(n)}(Q^{p^i})}
{T_{m-1}^{(n)}(Q^{p^{i+1}})}
\pmod{p^m}.
V n ( Q ; ω ) ≡ ∏ i = 0 ∞ T m − 1 ( n ) ( Q p i + 1 ) T m ( n ) ( Q p i ) ( mod p m ) . The product is taken in the I I I -adic topology for I = ( Q 1 , … , Q n − 1 ) I=(Q_1,\ldots,Q_{n-1}) I = ( Q 1 , … , Q n − 1 ) . Retaining its first K K K factors gives an error in p m Z p [ [ Q ] ] + I p K .
p^m\mathbb Z_p[[Q]]+I^{p^K}.
p m Z p [[ Q ]] + I p K . In particular, coefficients of total degree at most D D D require only K K K factors with p K > D p^K>D p K > D .
Proof. Write T s = T s ( n ) T_s=T_s^{(n)} T s = T s ( n ) , V = V n \mathcal V=\mathcal V_n V = V n , and R = Z p [ [ Q ] ] R=\mathbb Z_p[[Q]] R = Z p [[ Q ]] , and put R s = T s / σ ( T s − 1 ) \mathcal R_s=T_s/\sigma(T_{s-1}) R s = T s / σ ( T s − 1 ) . By Theorem 5.5 , these ratios form a uniformly p p p -adically Cauchy sequence. The completeness of R R R gives a limit R \mathcal R R , and telescoping the consecutive congruences yields
R − R m ∈ p m R . \begin{equation}
\mathcal R-\mathcal R_m\in p^mR. \tag*{(5.12)}
\end{equation} R − R m ∈ p m R . (5.12) For a series with constant coefficient one, every coefficient of its inverse is a polynomial in finitely many coefficients of the series. Formal inversion is therefore continuous in the coefficientwise p p p -adic topology. Applying Theorem 2.8 , we obtain R = V / σ ( V ) \mathcal R=\mathcal V/\sigma(\mathcal V) R = V / σ ( V ) .
The finite products satisfy
∏ i = 0 K − 1 σ i ( R ) = V σ K ( V ) . \prod_{i=0}^{K-1}\sigma^i(\mathcal R)
=\frac{\mathcal V}{\sigma^K(\mathcal V)}. i = 0 ∏ K − 1 σ i ( R ) = σ K ( V ) V . Since V ∈ 1 + I \mathcal V\in1+I V ∈ 1 + I , the denominator belongs to 1 + I p K 1+I^{p^K} 1 + I p K . Equation (5.12) allows us to replace each factor by σ i ( R m ) \sigma^i(\mathcal R_m) σ i ( R m ) modulo p m R p^mR p m R , giving (5.11) . Moreover, σ i ( R m ) ∈ 1 + I p i \sigma^i(\mathcal R_m)\in1+I^{p^i} σ i ( R m ) ∈ 1 + I p i , so the products converge I I I -adically. Taking this limit proves (5.10) . ◻
The same calculation applies before taking the period limit. Stopping the telescoping product at a finite level leaves a lower-level polynomial as its last factor.
Modulo p p p , the identity T 0 ( n ) = 1 T_0^{(n)}=1 T 0 ( n ) = 1 removes the denominator factors. We obtain product formulas involving only Frobenius substitutions in T 1 ( n ) T_1^{(n)} T 1 ( n ) .
Corollary 5.9. One has V n ( Q ; ω ) ≡ ∏ i = 0 ∞ T 1 ( n ) ( Q p i ) ( m o d p ) , T s ( n ) ≡ ∏ i = 0 s − 1 T 1 ( n ) ( Q p i ) ( m o d p ) . \mathcal V_n(Q;\omega)\equiv
\prod_{i=0}^{\infty}T_1^{(n)}(Q^{p^i})\pmod p,
\qquad
T_s^{(n)}\equiv\prod_{i=0}^{s-1}T_1^{(n)}(Q^{p^i})\pmod p. V n ( Q ; ω ) ≡ ∏ i = 0 ∞ T 1 ( n ) ( Q p i ) ( mod p ) , T s ( n ) ≡ ∏ i = 0 s − 1 T 1 ( n ) ( Q p i ) ( mod p ) .
Proof. Set m = 1 m=1 m = 1 in Theorem 5.7 and (5.13) , respectively. ◻
Over F p \mathbb F_p F p , Frobenius substitution agrees with taking the p p p th power of a series. Thus the product relation also gives an algebraic equation for the reduced period.
Corollary 5.10. The reduced period satisfies T 1 ( n ) ( Q ) V n ( Q ; ω ) p − 1 = 1 in F p [ [ Q 1 , … , Q n − 1 ] ] . T_1^{(n)}(Q)\mathcal V_n(Q;\omega)^{p-1}=1
\quad\text{in }\mathbb F_p[[Q_1,\ldots,Q_{n-1}]]. T 1 ( n ) ( Q ) V n ( Q ; ω ) p − 1 = 1 in F p [[ Q 1 , … , Q n − 1 ]] . It is the unique solution of this equation with constant coefficient one.
Proof. The product formula gives V n ( Q ) = T 1 ( n ) ( Q ) V n ( Q p ) \mathcal V_n(Q)=T_1^{(n)}(Q)\mathcal V_n(Q^p) V n ( Q ) = T 1 ( n ) ( Q ) V n ( Q p ) modulo p p p . Using V n ( Q p ) = V n ( Q ) p \mathcal V_n(Q^p)=\mathcal V_n(Q)^p V n ( Q p ) = V n ( Q ) p in characteristic p p p and dividing by the unit V n \mathcal V_n V n , we obtain the equation. At ( Q , Y ) = ( 0 , 1 ) (Q,Y)=(0,1) ( Q , Y ) = ( 0 , 1 ) the derivative of T 1 ( n ) Y p − 1 − 1 T_1^{(n)}Y^{p-1}-1 T 1 ( n ) Y p − 1 − 1 with respect to Y Y Y is p − 1 ≠ 0 p-1\ne0 p − 1 = 0 ; the coefficient recursion therefore gives uniqueness. ◻
Theorem 3.5 identifies V n = V n \mathcal V_n=V_n V n = V n in all these formulas.
The Full Commuting Congruences
The Dwork congruences and the integral determinant coefficients give a short proof of the finite-level equations. We first isolate the differential consequence of the congruences; it applies to every integral differential annihilator, without a commutativity assumption. The integral operators of § 3 then give the joint tCM congruences without a restriction on differential order.
Lemma 5.11. Let R = Z p [ [ Q 1 , … , Q m ] ] R=\mathbb Z_p[[Q_1,\ldots,Q_m]] R = Z p [[ Q 1 , … , Q m ]] , let σ f ( Q ) = f ( Q p ) \sigma f(Q)=f(Q^p) σ f ( Q ) = f ( Q p ) , and put θ i = Q i ∂ Q i \theta_i=Q_i\partial_{Q_i} θ i = Q i ∂ Q i . Suppose T s ∈ 1 + ( Q 1 , … , Q m ) R T_s\in1+(Q_1,\ldots,Q_m)R T s ∈ 1 + ( Q 1 , … , Q m ) R , s ≥ 0 s\geq0 s ≥ 0 , satisfy T 0 = 1 T_0=1 T 0 = 1 , converge coefficientwise p p p -adically to V V V , and obey T s + 1 σ ( T s − 1 ) ≡ T s σ ( T s ) ( m o d p s ) , s ≥ 1. T_{s+1}\sigma(T_{s-1})\equiv T_s\sigma(T_s)\pmod{p^s},
\qquad s\geq1. T s + 1 σ ( T s − 1 ) ≡ T s σ ( T s ) ( mod p s ) , s ≥ 1. For E s = T s / V E_s=T_s/V E s = T s / V and every nonzero multi-index α \alpha α , θ α E s ∈ p s R .
\theta^\alpha E_s\in p^sR.
θ α E s ∈ p s R . If L = ∑ α a α ( Q ) θ α L=\sum_\alpha a_\alpha(Q)\theta^\alpha L = ∑ α a α ( Q ) θ α is any finite-order differential operator with a α ∈ R a_\alpha\in R a α ∈ R , then L T s ≡ E s L V ( m o d p s ) .
LT_s\equiv E_sLV\pmod{p^s}.
L T s ≡ E s L V ( mod p s ) . In particular, L V = 0 LV=0 L V = 0 implies L T s ≡ 0 ( m o d p s ) LT_s\equiv0\pmod{p^s} L T s ≡ 0 ( mod p s ) .
Proof. Set R s = T s / σ ( T s − 1 ) \mathcal R_s=T_s/\sigma(T_{s-1}) R s = T s / σ ( T s − 1 ) for s ≥ 1 s\geq1 s ≥ 1 . The Dwork congruences give R s + 1 − R s ∈ p s R \mathcal R_{s+1}-\mathcal R_s\in p^sR R s + 1 − R s ∈ p s R , so completeness gives a limit R \mathcal R R with R s − R ∈ p s R \mathcal R_s-\mathcal R\in p^sR R s − R ∈ p s R . Coefficientwise convergence of T s T_s T s , and continuity of formal inversion for series with constant coefficient one, identify R = V / σ ( V ) \mathcal R=V/\sigma(V) R = V / σ ( V ) . Hence
E s − σ ( E s − 1 ) = σ ( T s − 1 ) V ( R s − V σ ( V ) ) ∈ p s R . E_s-\sigma(E_{s-1})
=\frac{\sigma(T_{s-1})}{V}
\left(\mathcal R_s-\frac{V}{\sigma(V)}\right)
\in p^sR. E s − σ ( E s − 1 ) = V σ ( T s − 1 ) ( R s − σ ( V ) V ) ∈ p s R . Every Euler derivative preserves p s R p^sR p s R . Since θ α σ = p ∣ α ∣ σ θ α \theta^\alpha\sigma=p^{|\alpha|}\sigma\theta^\alpha θ α σ = p ∣ α ∣ σ θ α , induction on s s s , starting with the integral series E 0 = 1 / V E_0=1/V E 0 = 1/ V , proves (5.14) . In Leibniz’s rule for L ( E s V ) L(E_sV) L ( E s V ) , every term except E s L V E_sLV E s L V differentiates E s E_s E s at least once. All these terms are divisible by p s p^s p s , proving (5.15) . No integer or differential-order factor is inverted. ◻
Theorem 5.12. Assume (2.10) . For every n ≥ 2 n\geq2 n ≥ 2 , s ≥ 1 s\geq1 s ≥ 1 , and 1 ≤ k ≤ n 1\leq k\leq n 1 ≤ k ≤ n , I n , k ( J n T s ( n ) ) ≡ 0 ( m o d p s ) , B k ( 0 ) T s ( n ) ≡ 0 ( m o d p s ) in Z p [ [ Q ] ] .
\mathsf I_{n,k}(J_nT_s^{(n)})\equiv0\pmod{p^s},\qquad
\mathsf B_k^{(0)}T_s^{(n)}\equiv0\pmod{p^s}
\quad\text{in }\mathbb Z_p[[Q]].
I n , k ( J n T s ( n ) ) ≡ 0 ( mod p s ) , B k ( 0 ) T s ( n ) ≡ 0 ( mod p s ) in Z p [[ Q ]] . Equivalently, the generating determinant satisfies S n ( u ) T s ( n ) ≡ u n T s ( n ) ( m o d p s ) .
\mathscr S_n(u)T_s^{(n)}\equiv u^nT_s^{(n)}\pmod{p^s}.
S n ( u ) T s ( n ) ≡ u n T s ( n ) ( mod p s ) . The center equation is exact, and no restriction p > n p>n p > n is needed.
Proof. Theorems 5.5 , 2.8 , and 3.5 place T s = T s ( n ) T_s=T_s^{(n)} T s = T s ( n ) and V = V n V=V_n V = V n under the hypotheses of Lemma 5.11 . The coefficients of B k ( 0 ) \mathsf B_k^{(0)} B k ( 0 ) are integral by Lemma 3.6 , and B k ( 0 ) V n = 0 \mathsf B_k^{(0)}V_n=0 B k ( 0 ) V n = 0 by Proposition 3.4 . On ratio series, D i = θ i − θ i − 1 D_i=\theta_i-\theta_{i-1} D i = θ i − θ i − 1 , so the transfer lemma gives B k ( 0 ) T s ( n ) ≡ 0 ( m o d p s ) \mathsf B_k^{(0)}T_s^{(n)}\equiv0\pmod{p^s} B k ( 0 ) T s ( n ) ≡ 0 ( mod p s ) . Conjugation by the integral unit J n J_n J n proves the Schrödinger congruence, and (3.11) gives (5.17) . The center equation is exact because J n T s ( n ) J_nT_s^{(n)} J n T s ( n ) depends only on ratios. ◻
Every polynomial with Z p \mathbb Z_p Z p coefficients and zero constant term in the commuting operators I n , k \mathsf I_{n,k} I n , k satisfies the same congruence on J n T s ( n ) J_nT_s^{(n)} J n T s ( n ) . This includes the integral Newton power-sum Hamiltonians: Newton’s recursion uses integer coefficients and multiplication by k k k , with no division by k k k . For k = 2 k=2 k = 2 , the relation I n , 2 = 1 2 ( ∑ i D i ) 2 − H n , ω \mathsf I_{n,2}=\frac12(\sum_iD_i)^2-H_{n,\omega} I n , 2 = 2 1 ( ∑ i D i ) 2 − H n , ω recovers the quadratic congruence H n , ω ( J n T s ( n ) ) ≡ 0 ( m o d p s ) H_{n,\omega}(J_nT_s^{(n)})\equiv0\pmod{p^s} H n , ω ( J n T s ( n ) ) ≡ 0 ( mod p s ) .
Two- and Three-Particle Calculations
Let us consider the examples with n = 2 n=2 n = 2 and n = 3 n=3 n = 3 explicitly.
The Two-Particle Case
For X 2 = T ∗ P 1 X_2=T^*\mathbb P^1 X 2 = T ∗ P 1 , write Q = z 1 / z 2 Q=z_1/z_2 Q = z 1 / z 2 and θ = Q ∂ Q \theta=Q\partial_Q θ = Q ∂ Q . At the negative integer coupling − m -m − m , the Gauss series of (3.7) terminates:
F m ( 2 ) ( Q ) = C T u [ ( 1 − Q / u ) m ( 1 − u ) m ] = ∑ d = 0 m ( m d ) 2 Q d . \begin{equation}
F_m^{(2)}(Q)
=\mathop{\mathrm{CT}}_u[(1-Q/u)^m(1-u)^m]
=\sum_{d=0}^{m}\binom md^2Q^d. \tag*{(6.1)}
\end{equation} F m ( 2 ) ( Q ) = CT u [( 1 − Q / u ) m ( 1 − u ) m ] = d = 0 ∑ m ( d m ) 2 Q d . (6.1)
The constant term requires equal binomial indices, and their recurrence gives the exact equation
[ θ 2 − Q ( θ − m ) 2 ] F m ( 2 ) = 0. [\theta^2-Q(\theta-m)^2]F_m^{(2)}=0. [ θ 2 − Q ( θ − m ) 2 ] F m ( 2 ) = 0.
Thus T ~ s ( 2 ) = T s ( 2 ) \widetilde T_s^{(2)}=T_s^{(2)} T s ( 2 ) = T s ( 2 ) and Δ s ( 2 ) = 0 \Delta_s^{(2)}=0 Δ s ( 2 ) = 0 .
Under (2.10) , put P = p s P=p^s P = p s and m = ω ( P − 1 ) m=\omega(P-1) m = ω ( P − 1 ) . Comparing the two quadratic operators gives the complete residual at the arithmetic coupling:
[ θ 2 − Q ( θ + ω ) 2 ] T s ( 2 ) = − ω P Q ( 2 θ + ω − m ) T s ( 2 ) ≡ 0 ( m o d p s ) . \begin{equation}
[\theta^2-Q(\theta+\omega)^2]T_s^{(2)}
=-\omega P Q(2\theta+\omega-m)T_s^{(2)}
\equiv0\pmod{p^s}. \tag*{(6.2)}
\end{equation} [ θ 2 − Q ( θ + ω ) 2 ] T s ( 2 ) = − ω P Q ( 2 θ + ω − m ) T s ( 2 ) ≡ 0 ( mod p s ) . (6.2)
This identity involves no division by degree eigenvalues modulo p p p . On ratio functions, the center integral is zero and the second integral is − H 2 , ω -H_{2,\omega} − H 2 , ω , so this also gives the full commuting congruence in two particles.
For ω = 1 / 2 \omega=1/2 ω = 1/2 , p = 3 p=3 p = 3 , the first levels are
T 1 ( 2 ) = 1 + Q , T 2 ( 2 ) = 1 + 16 Q + 36 Q 2 + 16 Q 3 + Q 4 . \begin{equation}
T_1^{(2)}=1+Q,\qquad
T_2^{(2)}=1+16Q+36Q^2+16Q^3+Q^4. \tag*{(6.3)}
\end{equation} T 1 ( 2 ) = 1 + Q , T 2 ( 2 ) = 1 + 16 Q + 36 Q 2 + 16 Q 3 + Q 4 . (6.3)
The first residual is 3 Q ( 1 − 3 Q ) / 4 3Q(1-3Q)/4 3 Q ( 1 − 3 Q ) /4 , and
T 2 ( 2 ) ≡ ( 1 + Q ) ( 1 + Q 3 ) = T 1 ( 2 ) ( Q ) T 1 ( 2 ) ( Q 3 ) ( m o d 3 ) . T_2^{(2)}\equiv(1+Q)(1+Q^3)
=T_1^{(2)}(Q)T_1^{(2)}(Q^3)\pmod3. T 2 ( 2 ) ≡ ( 1 + Q ) ( 1 + Q 3 ) = T 1 ( 2 ) ( Q ) T 1 ( 2 ) ( Q 3 ) ( mod 3 ) .
Consequently V 2 ( Q ; 1 / 2 ) ≡ ∏ j ≥ 0 ( 1 + Q 3 j ) ( m o d 3 ) V_2(Q;1/2)\equiv\prod_{j\geq0}(1+Q^{3^j})\pmod3 V 2 ( Q ; 1/2 ) ≡ ∏ j ≥ 0 ( 1 + Q 3 j ) ( mod 3 ) , the instance of the product formula already obtained in [SV23 ]. The stronger residual in the shifted Schrödinger gauge is visible at the same level:
ϕ 1 = 1 + Q 1 − Q , H 2 , 1 / 2 ϕ 1 = 9 4 Q ( 1 + Q ) ( 1 − Q ) 3 ≡ 0 ( m o d 9 ) . \begin{equation}
\phi_1=\frac{1+Q}{1-Q},\qquad
H_{2,1/2}\phi_1=\frac94\frac{Q(1+Q)}{(1-Q)^3}
\equiv0\pmod9. \tag*{(6.4)}
\end{equation} ϕ 1 = 1 − Q 1 + Q , H 2 , 1/2 ϕ 1 = 4 9 ( 1 − Q ) 3 Q ( 1 + Q ) ≡ 0 ( mod 9 ) . (6.4)
This is (3.30) for two particles.
The First Three-Particle Polynomial
Write u = x 1 , 1 u=x_{1,1} u = x 1 , 1 , v = x 2 , 1 v=x_{2,1} v = x 2 , 1 , w = x 2 , 2 w=x_{2,2} w = x 2 , 2 and put
E = ( u − v ) ( u − w ) ∏ j = 1 3 ( v − z j ) ( w − z j ) , G = z 2 z 3 2 , Q 1 = z 1 / z 2 , Q 2 = z 2 / z 3 . \begin{equation}
E=(u-v)(u-w)\prod_{j=1}^3(v-z_j)(w-z_j),\qquad
G=z_2z_3^2,\qquad Q_1=z_1/z_2,\quad Q_2=z_2/z_3. \tag*{(6.5)}
\end{equation} E = ( u − v ) ( u − w ) j = 1 ∏ 3 ( v − z j ) ( w − z j ) , G = z 2 z 3 2 , Q 1 = z 1 / z 2 , Q 2 = z 2 / z 3 . (6.5)
In the chamber ∣ z 1 ∣ < ∣ v ∣ < ∣ u ∣ < ∣ z 2 ∣ < ∣ w ∣ < ∣ z 3 ∣ |z_1|<|v|<|u|<|z_2|<|w|<|z_3| ∣ z 1 ∣ < ∣ v ∣ < ∣ u ∣ < ∣ z 2 ∣ < ∣ w ∣ < ∣ z 3 ∣ , factor E = u v w 3 G E E=uvw^3G\mathscr E E = uv w 3 G E , where
E = ( 1 − v / u ) ( 1 − u / w ) ( 1 − z 1 / v ) ( 1 − v / z 2 ) ⋅ ( 1 − v / z 3 ) ( 1 − z 1 / w ) ( 1 − z 2 / w ) ( 1 − w / z 3 ) . \begin{equation}
\begin{split}
\mathscr E={}&(1-v/u)(1-u/w)(1-z_1/v)(1-v/z_2)\\
&\cdot(1-v/z_3)(1-z_1/w)(1-z_2/w)(1-w/z_3).
\end{split} \tag*{(6.6)}
\end{equation} E = ( 1 − v / u ) ( 1 − u / w ) ( 1 − z 1 / v ) ( 1 − v / z 2 ) ⋅ ( 1 − v / z 3 ) ( 1 − z 1 / w ) ( 1 − z 2 / w ) ( 1 − w / z 3 ) . (6.6)
The period and its half-coupling approximants are
V 3 ( Q ; ω ) = C T u , v , w ( 1 − v / w ) 2 ω E − ω , T s ( 3 ) = C T u , v , w ( 1 − v / w ) E m , m = ( p s − 1 ) / 2. \begin{align}
V_3(Q;\omega)&=\mathop{\mathrm{CT}}_{u,v,w}
(1-v/w)^{2\omega}\mathscr E^{-\omega}, \tag*{(6.7)}\\
T_s^{(3)}&=\mathop{\mathrm{CT}}_{u,v,w}(1-v/w)\mathscr E^m,
\qquad m=(p^s-1)/2. \tag*{(6.8)}
\end{align} V 3 ( Q ; ω ) T s ( 3 ) = CT u , v , w ( 1 − v / w ) 2 ω E − ω , = CT u , v , w ( 1 − v / w ) E m , m = ( p s − 1 ) /2. (6.7) (6.8)
Equivalently,
For p = 3 p=3 p = 3 , s = 1 s=1 s = 1 , we have m = 1 m=1 m = 1 . If F ( t ) = ∏ j ( t − z j ) F(t)=\prod_j(t-z_j) F ( t ) = ∏ j ( t − z j ) , extraction in (6.9) gives [ v w 4 ] ( v 2 − w 2 ) F ( v ) F ( w ) = e 1 ( z ) e 2 ( z ) [vw^4](v^2-w^2)F(v)F(w)=e_1(z)e_2(z) [ v w 4 ] ( v 2 − w 2 ) F ( v ) F ( w ) = e 1 ( z ) e 2 ( z ) . Therefore
T 1 ( 3 ) = ( 1 + Q 1 + Q 1 Q 2 ) ( 1 + Q 2 + Q 1 Q 2 ) = 1 + Q 1 + Q 2 + 3 Q 1 Q 2 + Q 1 2 Q 2 + Q 1 Q 2 2 + Q 1 2 Q 2 2 . \begin{equation}
\begin{split}
T_1^{(3)}&=(1+Q_1+Q_1Q_2)(1+Q_2+Q_1Q_2)\\
&=1+Q_1+Q_2+3Q_1Q_2+Q_1^2Q_2+Q_1Q_2^2+Q_1^2Q_2^2.
\end{split} \tag*{(6.10)}
\end{equation} T 1 ( 3 ) = ( 1 + Q 1 + Q 1 Q 2 ) ( 1 + Q 2 + Q 1 Q 2 ) = 1 + Q 1 + Q 2 + 3 Q 1 Q 2 + Q 1 2 Q 2 + Q 1 Q 2 2 + Q 1 2 Q 2 2 . (6.10)
The product formula modulo 3 3 3 becomes
V 3 ( Q ; 1 / 2 ) ≡ ∏ j ≥ 0 ( 1 + Q 1 3 j + ( Q 1 Q 2 ) 3 j ) ( 1 + Q 2 3 j + ( Q 1 Q 2 ) 3 j ) ( m o d 3 ) . \begin{equation}
V_3(Q;1/2)\equiv\prod_{j\geq0}
(1+Q_1^{3^j}+(Q_1Q_2)^{3^j})
(1+Q_2^{3^j}+(Q_1Q_2)^{3^j})\pmod3. \tag*{(6.11)}
\end{equation} V 3 ( Q ; 1/2 ) ≡ j ≥ 0 ∏ ( 1 + Q 1 3 j + ( Q 1 Q 2 ) 3 j ) ( 1 + Q 2 3 j + ( Q 1 Q 2 ) 3 j ) ( mod 3 ) . (6.11)
The Energy Recurrence and Framing-Pole Cancellation
Set θ i = Q i ∂ Q i \theta_i=Q_i\partial_{Q_i} θ i = Q i ∂ Q i and write V 3 = ∑ d , e ≥ 0 c d , e Q 1 d Q 2 e V_3=\sum_{d,e\geq0}c_{d,e}Q_1^dQ_2^e V 3 = ∑ d , e ≥ 0 c d , e Q 1 d Q 2 e , with c 0 , 0 = 1 c_{0,0}=1 c 0 , 0 = 1 . The quadratic equation in vertex gauge is equivalent to
( d 2 − d e + e 2 ) c d , e = ω ∑ k = 1 d ( 2 ( d − k ) − e + ω ) c d − k , e + ω ∑ k = 1 e ( 2 ( e − k ) − d + ω ) c d , e − k + ω ∑ k = 1 min ( d , e ) ( d + e − 2 k + 2 ω ) c d − k , e − k . \begin{equation}
\begin{split}
(d^2-de+e^2)c_{d,e}={}&
\omega\sum_{k=1}^{d}(2(d-k)-e+\omega)c_{d-k,e}\\
&+\omega\sum_{k=1}^{e}(2(e-k)-d+\omega)c_{d,e-k}\\
&+\omega\sum_{k=1}^{\min(d,e)}
(d+e-2k+2\omega)c_{d-k,e-k}.
\end{split} \tag*{(6.12)}
\end{equation} ( d 2 − d e + e 2 ) c d , e = ω k = 1 ∑ d ( 2 ( d − k ) − e + ω ) c d − k , e + ω k = 1 ∑ e ( 2 ( e − k ) − d + ω ) c d , e − k + ω k = 1 ∑ m i n ( d , e ) ( d + e − 2 k + 2 ω ) c d − k , e − k . (6.12)
In particular, c d , 0 = c 0 , d = ( ( ω ) d / d ! ) 2 c_{d,0}=c_{0,d}=((\omega)_d/d!)^2 c d , 0 = c 0 , d = (( ω ) d / d ! ) 2 and c 1 , 1 = 2 ω 2 ( ω 2 − ω + 1 ) c_{1,1}=2\omega^2(\omega^2-\omega+1) c 1 , 1 = 2 ω 2 ( ω 2 − ω + 1 ) . At half coupling this gives
V 3 ( Q ; 1 / 2 ) = 1 + 1 4 ( Q 1 + Q 2 ) + 9 64 ( Q 1 2 + Q 2 2 ) + 3 8 Q 1 Q 2 + 25 256 ( Q 1 3 + Q 2 3 ) + 31 256 ( Q 1 2 Q 2 + Q 1 Q 2 2 ) + O ( ( Q 1 , Q 2 ) 4 ) . \begin{equation}
\begin{split}
V_3(Q;1/2)={}&1+\frac14(Q_1+Q_2)
+\frac9{64}(Q_1^2+Q_2^2)+\frac38Q_1Q_2\\
&+\frac{25}{256}(Q_1^3+Q_2^3)
+\frac{31}{256}(Q_1^2Q_2+Q_1Q_2^2)
+O\bigl((Q_1,Q_2)^4\bigr).
\end{split} \tag*{(6.13)}
\end{equation} V 3 ( Q ; 1/2 ) = 1 + 4 1 ( Q 1 + Q 2 ) + 64 9 ( Q 1 2 + Q 2 2 ) + 8 3 Q 1 Q 2 + 256 25 ( Q 1 3 + Q 2 3 ) + 256 31 ( Q 1 2 Q 2 + Q 1 Q 2 2 ) + O ( ( Q 1 , Q 2 ) 4 ) . (6.13)
The recurrence is an exact characteristic-zero calculation. The integral operator identities, rather than division by d 2 − d e + e 2 d^2-de+e^2 d 2 − d e + e 2 modulo p p p , prove the finite-level congruences.
The localization formula gives the first mixed coefficient directly and exhibits the cancellation of framing poles. Keep ( a 1 , a 2 , a 3 ) = ( 0 , δ , ξ ) (a_1,a_2,a_3)=(0,\delta,\xi) ( a 1 , a 2 , a 3 ) = ( 0 , δ , ξ ) until the degree sum is formed. In degree ( 1 , 1 ) (1,1) ( 1 , 1 ) the two row-two splits give
A ( δ , ξ ) = ω ω + δ 1 + δ ω + ξ 1 + ξ 1 + δ − ω δ , B ( δ , ξ ) = ω 2 ω + ξ − δ 1 + ξ − δ ω + δ − 1 δ . \begin{align}
A(\delta,\xi)&=
\omega\frac{\omega+\delta}{1+\delta}
\frac{\omega+\xi}{1+\xi}
\frac{1+\delta-\omega}{\delta},\notag\\
B(\delta,\xi)&=
\omega^2\frac{\omega+\xi-\delta}{1+\xi-\delta}
\frac{\omega+\delta-1}{\delta}. \tag*{(6.14)}
\end{align} A ( δ , ξ ) B ( δ , ξ ) = ω 1 + δ ω + δ 1 + ξ ω + ξ δ 1 + δ − ω , = ω 2 1 + ξ − δ ω + ξ − δ δ ω + δ − 1 . (6.14)
Their residues at δ = 0 \delta=0 δ = 0 cancel. On the slice ξ = 0 \xi=0 ξ = 0 , the complete sum is
A ( δ , 0 ) + B ( δ , 0 ) = 2 ω 2 ω 2 − ω + 1 − δ 2 1 − δ 2 ⟶ 2 ω 2 ( ω 2 − ω + 1 ) . \begin{equation}
A(\delta,0)+B(\delta,0)
=2\omega^2\frac{\omega^2-\omega+1-\delta^2}{1-\delta^2}
\longrightarrow2\omega^2(\omega^2-\omega+1). \tag*{(6.15)}
\end{equation} A ( δ , 0 ) + B ( δ , 0 ) = 2 ω 2 1 − δ 2 ω 2 − ω + 1 − δ 2 ⟶ 2 ω 2 ( ω 2 − ω + 1 ) . (6.15)
For ω = 1 / 2 \omega=1/2 ω = 1/2 this is 3 / 8 3/8 3/8 . Proposition A.5 proves regularity of the simultaneous framing specialization in every degree; the example shows why the summands must be combined first.
The Discrepancy at the First Arithmetic Levels
Put x = Q 1 x=Q_1 x = Q 1 , y = Q 2 y=Q_2 y = Q 2 , and abbreviate C m , γ = C 3 ( ( x , y ) ; m , γ ) C_{m,\gamma}=C_3((x,y);m,\gamma) C m , γ = C 3 (( x , y ) ; m , γ ) . At half coupling define
B m = C m , 1 , F m = F m ( 3 ) = C m , − 2 m , D m = F m − B m . B_m=C_{m,1},\qquad F_m=F_m^{(3)}=C_{m,-2m},\qquad
D_m=F_m-B_m. B m = C m , 1 , F m = F m ( 3 ) = C m , − 2 m , D m = F m − B m .
Thus D m = Δ s ( 3 ) D_m=\Delta_s^{(3)} D m = Δ s ( 3 ) when m = ( p s − 1 ) / 2 m=(p^s-1)/2 m = ( p s − 1 ) /2 . The first mixed coefficient already distinguishes the families:
[ x y ] C m , γ = 2 m 4 + ( 2 − γ ) m 2 , [ x y ] Δ s ( 3 ) = p s m 2 . \begin{equation}
[xy]C_{m,\gamma}=2m^4+(2-\gamma)m^2,\qquad
[xy]\Delta_s^{(3)}=p^sm^2. \tag*{(6.16)}
\end{equation} [ x y ] C m , γ = 2 m 4 + ( 2 − γ ) m 2 , [ x y ] Δ s ( 3 ) = p s m 2 . (6.16)
For m = 1 m=1 m = 1 , B 1 B_1 B 1 is (6.10) and
F 1 = B 1 + 3 x y , D 1 = 3 x y , L 3 , − 1 D 1 = D 1 . \begin{equation}
F_1=B_1+3xy,\qquad D_1=3xy,\qquad
\mathcal L_{3,-1}D_1=D_1. \tag*{(6.17)}
\end{equation} F 1 = B 1 + 3 x y , D 1 = 3 x y , L 3 , − 1 D 1 = D 1 . (6.17)
The symmetric polynomial associated with this terminating vertex is
G 3 ( z ) F 1 = m ( 2 , 1 , 0 ) ( z ) + 6 m ( 1 , 1 , 1 ) ( z ) = P ( 2 , 1 , 0 ) ( − 1 ) ( z ) . G_3(z)F_1=m_{(2,1,0)}(z)+6m_{(1,1,1)}(z)
=P_{(2,1,0)}^{(-1)}(z). G 3 ( z ) F 1 = m ( 2 , 1 , 0 ) ( z ) + 6 m ( 1 , 1 , 1 ) ( z ) = P ( 2 , 1 , 0 ) ( − 1 ) ( z ) .
Here m λ m_\lambda m λ is the sum of the distinct monomials obtained by permuting the exponents of z λ z^\lambda z λ . This is the first three-particle instance of (3.19) . For m = 2 m=2 m = 2 , corresponding to p = 5 p=5 p = 5 , s = 1 s=1 s = 1 , the full difference is
D 2 = 20 x y B 1 + 30 x 2 y 2 . \begin{equation}
D_2=20xyB_1+30x^2y^2. \tag*{(6.18)}
\end{equation} D 2 = 20 x y B 1 + 30 x 2 y 2 . (6.18)
At the next 3 3 3 -adic level, P = 9 P=9 P = 9 and m = 4 m=4 m = 4 . Use the weights of Lemma 4.5 , with r = v / w r=v/w r = v / w . Direct expansion of the finite edge product gives
W 1 ( 4 ) ( 3 , 3 ) = 12160 , W 2 ( 4 ) ( 3 , 3 ) = 704 , W 3 ( 4 ) ( 3 , 3 ) = 16. W_1^{(4)}(3,3)=12160,\qquad
W_2^{(4)}(3,3)=704,\qquad
W_3^{(4)}(3,3)=16. W 1 ( 4 ) ( 3 , 3 ) = 12160 , W 2 ( 4 ) ( 3 , 3 ) = 704 , W 3 ( 4 ) ( 3 , 3 ) = 16.
Since ( 1 − r ) − 8 − ( 1 − r ) = 9 r + 36 r 2 + 120 r 3 + ⋯ (1-r)^{-8}-(1-r)=9r+36r^2+120r^3+\cdots ( 1 − r ) − 8 − ( 1 − r ) = 9 r + 36 r 2 + 120 r 3 + ⋯ ,
[ x 3 y 3 ] D 4 = 9 ⋅ 12160 + 36 ⋅ 704 + 120 ⋅ 16 = 136704 ≡ 3 ( m o d 9 ) . \begin{equation}
[x^3y^3]D_4
=9\cdot12160+36\cdot704+120\cdot16
=136704\equiv3\pmod9. \tag*{(6.19)}
\end{equation} [ x 3 y 3 ] D 4 = 9 ⋅ 12160 + 36 ⋅ 704 + 120 ⋅ 16 = 136704 ≡ 3 ( mod 9 ) . (6.19)
The complete polynomial satisfies
D 4 ≡ 3 ( x y ) 3 B 1 ( m o d 9 ) . \begin{equation}
D_4\equiv3(xy)^3B_1\pmod9. \tag*{(6.20)}
\end{equation} D 4 ≡ 3 ( x y ) 3 B 1 ( mod 9 ) . (6.20)
For a direct derivation, only same-row indices h ≤ 4 h\leq4 h ≤ 4 can contribute by Lemma 4.5 . Reducing their coefficients modulo 9 9 9 gives
D 4 / 3 ≡ C T u , v , w r 3 ( 1 − r ) E 3 4 ( m o d 3 ) . D_4/3\equiv\mathop{\mathrm{CT}}_{u,v,w}r^3(1-r)\mathscr E_3^4\pmod3. D 4 /3 ≡ CT u , v , w r 3 ( 1 − r ) E 3 4 ( mod 3 ) .
Put C = ( 1 − r ) E 3 \mathscr C=(1-r)\mathscr E_3 C = ( 1 − r ) E 3 . Lemma 2.6 , applied at p = 3 p=3 p = 3 , s = 1 s=1 s = 1 , says that the part of C \mathscr C C whose internal exponents are all divisible by 3 3 3 is B 1 ( x , y ) ( 1 − r 3 ) B_1(x,y)(1-r^3) B 1 ( x , y ) ( 1 − r 3 ) . Since E 3 4 ≡ E 3 σ ( E 3 ) ( m o d 3 ) \mathscr E_3^4\equiv\mathscr E_3\sigma(\mathscr E_3)
\pmod3 E 3 4 ≡ E 3 σ ( E 3 ) ( mod 3 ) , the preceding constant term becomes
C T u , v , w [ C σ ( r E 3 ) ] = B 1 ( x , y ) ( x y ) 3 . \mathop{\mathrm{CT}}_{u,v,w}\bigl[\mathscr C\,\sigma(r\mathscr E_3)\bigr]
=B_1(x,y)(xy)^3. CT u , v , w [ C σ ( r E 3 ) ] = B 1 ( x , y ) ( x y ) 3 .
Indeed, dividing the selected internal exponents by 3 3 3 leaves C T u , v , w r ( 1 − r ) E 3 \mathop{\mathrm{CT}}_{u,v,w}r(1-r)\mathscr E_3 CT u , v , w r ( 1 − r ) E 3 , with external variables replaced by x 3 , y 3 x^3,y^3 x 3 , y 3 . Before this replacement the constant term is x y xy x y : the index-one contribution is x y xy x y , and the index-two contribution vanishes. This proves (6.20) .
In particular, D 4 D_4 D 4 is a nonzero joint kernel class modulo 9 9 9 , while D 4 / 3 ≡ ( x y ) 3 B 1 ( m o d 3 ) D_4/3\equiv(xy)^3B_1\pmod3 D 4 /3 ≡ ( x y ) 3 B 1 ( mod 3 ) . The factor ( x y ) 3 (xy)^3 ( x y ) 3 is annihilated by the Euler derivatives modulo 3 3 3 , as in Remark 3.3 .
The coefficient 136704 136704 136704 realizes the sharp bound of Theorem 4.6 at the first higher 3 3 3 -adic level. By (4.15) , the same coefficient occurs on every consecutive three-particle subflag in higher rank.
A Four-Particle Symmetric Example
Consider the four-particle case with p = 3 p=3 p = 3 , s = 1 s=1 s = 1 and ω = 1 / 2 \omega=1/2 ω = 1/2 , so m = 1 m=1 m = 1 . The corresponding Jack polynomial is indexed by the staircase partition δ = ( 3 , 2 , 1 , 0 ) \delta=(3,2,1,0) δ = ( 3 , 2 , 1 , 0 ) . The two homogeneous polynomials have the monomial symmetric expansions
P 3210 ( − 1 ) = m 3210 + 6 m 3111 + 6 m 2220 + 36 m 2211 , T 1 = m 3210 + 3 m 3111 + 3 m 2220 + 9 m 2211 . \begin{align*}
P_{3210}^{(-1)}
&=m_{3210}+6m_{3111}+6m_{2220}+36m_{2211},\\
\mathcal T_1
&=m_{3210}+3m_{3111}+3m_{2220}+9m_{2211}.
\end{align*} P 3210 ( − 1 ) T 1 = m 3210 + 6 m 3111 + 6 m 2220 + 36 m 2211 , = m 3210 + 3 m 3111 + 3 m 2220 + 9 m 2211 .
Here partitions are written without commas, and the e j e_j e j below are elementary symmetric polynomials in z 1 , … , z 4 z_1,\ldots,z_4 z 1 , … , z 4 . The master-polynomial extraction gives
T 1 = e 2 ( e 1 e 3 + e 4 ) . \mathcal T_1=e_2(e_1e_3+e_4). T 1 = e 2 ( e 1 e 3 + e 4 ) .
Indeed, extraction in the first two internal rows gives e 1 ( w ) e 2 ( w ) e_1(w)e_2(w) e 1 ( w ) e 2 ( w ) in the three variables w w w of row three. Multiplication by Δ 3 ( w ) \Delta_3(w) Δ 3 ( w ) gives the sum of alternants with exponent sets ( 0 , 2 , 4 ) (0,2,4) ( 0 , 2 , 4 ) and ( 1 , 2 , 3 ) (1,2,3) ( 1 , 2 , 3 ) . The last-row extraction contributes e 1 e 2 e 3 e_1e_2e_3 e 1 e 2 e 3 and e 2 e 4 e_2e_4 e 2 e 4 , respectively. The Jack coefficients follow from the quadratic spectral recursion on the four partitions dominated by 3210 3210 3210 . Consequently
P 3210 ( − 1 ) − T 1 = 3 m 3111 + 3 m 2220 + 27 m 2211 . \begin{equation}
P_{3210}^{(-1)}-\mathcal T_1
=3m_{3111}+3m_{2220}+27m_{2211}. \tag*{(6.21)}
\end{equation} P 3210 ( − 1 ) − T 1 = 3 m 3111 + 3 m 2220 + 27 m 2211 . (6.21)
The partitions 3111 3111 3111 and 2220 2220 2220 are the two three-row squeezes in (4.19) . The coefficients of these terms have 3 3 3 -adic valuation one and attain the sharp bound. The coefficient of m 2211 m_{2211} m 2211 has valuation three. This example also illustrates the comparison when p ≤ n p\leq n p ≤ n , with no division by a symmetric-group orbit size.
Localization, the tRS Limit, and Zero Framing
We derive the scalar vertex equation from the Kähler-variable eigenfunction theorem of [K21 ] (Theorem 2.10), using the normalization of [Din21 ] (§2.6, Definition 4 and Propositions 1–2). The calculation fixes the degree variables, the framing characters, and the scalar character accompanying the bare vertex. A recursion over the local ring at zero framing then proves cancellation of the framing poles in each complete degree sum. Throughout this appendix, limits in the formal parameter η \eta η are coefficientwise in the Kähler variables.
Localization and Degree Normalization
Choose the identity coordinate flag, set the source weight to ϵ = 1 \epsilon=1 ϵ = 1 , and write a 1 , … , a n a_1,\ldots,a_n a 1 , … , a n for the additive framing weights and ω = ℏ / ϵ \omega=\hbar/\epsilon ω = ℏ/ ϵ for the cotangent weight. For m ∈ Z m\in\mathbb Z m ∈ Z , put
( b ) m = { ∏ j = 0 m − 1 ( b + j ) , m ≥ 0 , ∏ j = 1 − m ( b − j ) − 1 , m < 0 , R ( b , c ; m ) = ( b ) m ( c ) m . (b)_m=\begin{cases}
\prod_{j=0}^{m-1}(b+j),&m\geq0,\\
\displaystyle\prod_{j=1}^{-m}(b-j)^{-1},&m<0,
\end{cases}
\qquad R(b,c;m)=\frac{(b)_m}{(c)_m}. ( b ) m = ⎩ ⎨ ⎧ ∏ j = 0 m − 1 ( b + j ) , j = 1 ∏ − m ( b − j ) − 1 , m ≥ 0 , m < 0 , R ( b , c ; m ) = ( c ) m ( b ) m .
Exceptional arguments are substituted into the rational ratio, not into the two Pochhammer symbols separately.
For nonnegative arrays ( d i , a ) 1 ≤ a ≤ i < n (d_{i,a})_{1\leq a\leq i<n} ( d i , a ) 1 ≤ a ≤ i < n , set d n , b = 0 d_{n,b}=0 d n , b = 0 and d i = ∑ a = 1 i d i , a d_i=\sum_{a=1}^i d_{i,a} d i = ∑ a = 1 i d i , a . The localization formula in this convention is
V n ( Q ; a , ω ) = ∑ ( d i , a ) ≥ 0 ∏ i = 1 n − 1 Q i d i ∏ i = 1 n − 1 ∏ a , b = 1 i R ( 1 − a a + a b , ω − a a + a b ; d i , a − d i , b ) ⋅ ∏ i = 1 n − 1 ∏ a = 1 i ∏ b = 1 i + 1 R ( ω + a b − a a , 1 + a b − a a ; d i , a − d i + 1 , b ) . \begin{align}
V_n(Q;a,\omega)
={}&\sum_{(d_{i,a})\geq0}\prod_{i=1}^{n-1}Q_i^{d_i}
\prod_{i=1}^{n-1}\prod_{a,b=1}^{i}
R(1-a_a+a_b,\omega-a_a+a_b;d_{i,a}-d_{i,b})\notag\\
&\quad\cdot\prod_{i=1}^{n-1}\prod_{a=1}^{i}\prod_{b=1}^{i+1}
R(\omega+a_b-a_a,1+a_b-a_a;d_{i,a}-d_{i+1,b}). \tag*{(7.1)}
\end{align} V n ( Q ; a , ω ) = ( d i , a ) ≥ 0 ∑ i = 1 ∏ n − 1 Q i d i i = 1 ∏ n − 1 a , b = 1 ∏ i R ( 1 − a a + a b , ω − a a + a b ; d i , a − d i , b ) ⋅ i = 1 ∏ n − 1 a = 1 ∏ i b = 1 ∏ i + 1 R ( ω + a b − a a , 1 + a b − a a ; d i , a − d i + 1 , b ) . (7.1)
Each degree coefficient is a finite sum of rational functions. The same-index edge ratios enforce d i , a ≥ d i + 1 , a d_{i,a}\geq d_{i+1,a} d i , a ≥ d i + 1 , a ; this inequality must not be imposed on arbitrary pairs of distinct indices. In particular, a negative degree difference does not by itself make a localization term vanish.
The specialization under consideration is
V n ( Q ; ω ) = V n ( Q ; a , ω ) ∣ a = 0 , V n ( 0 ; ω ) = 1. \begin{equation}
V_n(Q;\omega)=\left.V_n(Q;a,\omega)\right|_{a=0},
\qquad V_n(0;\omega)=1. \tag*{(7.2)}
\end{equation} V n ( Q ; ω ) = V n ( Q ; a , ω ) ∣ a = 0 , V n ( 0 ; ω ) = 1. (7.2)
It is taken after summing all terms in each degree. Its existence will follow from Proposition A.5 .
For the multiplicative formula, write h h h for the cotangent character and α j \alpha_j α j for the framing characters, and set
( u ; q ) m = { ∏ j = 0 m − 1 ( 1 − u q j ) , m ≥ 0 , ∏ j = 1 − m ( 1 − u q − j ) − 1 , m < 0 , B q ( u ; m ) = ( h u ; q ) m ( q u ; q ) m . (u;q)_m=\begin{cases}
\prod_{j=0}^{m-1}(1-uq^j),&m\geq0,\\
\displaystyle\prod_{j=1}^{-m}(1-uq^{-j})^{-1},&m<0,
\end{cases}
\qquad B_q(u;m)=\frac{(hu;q)_m}{(qu;q)_m}. ( u ; q ) m = ⎩ ⎨ ⎧ ∏ j = 0 m − 1 ( 1 − u q j ) , j = 1 ∏ − m ( 1 − u q − j ) − 1 , m ≥ 0 , m < 0 , B q ( u ; m ) = ( q u ; q ) m ( h u ; q ) m .
The same rational-ratio convention applies at exceptional weights. Let z i r a w z_i^{\rm raw} z i raw be the degree variables of the bare vertex in [KZ21 ] (Theorem 3.1), and put
Z i = q 2 h z i r a w , 1 ≤ i < n . \begin{equation}
Z_i=\frac{q^2}{h}z_i^{\rm raw},\qquad 1\leq i<n. \tag*{(7.3)}
\end{equation} Z i = h q 2 z i raw , 1 ≤ i < n . (7.3)
Its identity component becomes
V n K ( Z ; α , h , q ) = ∑ ( d i , a ) ≥ 0 ∏ i = 1 n − 1 Z i d i ∏ i = 1 n − 1 ∏ a , b = 1 i B q ( α b / α a ; d i , a − d i , b ) − 1 ⋅ ∏ i = 1 n − 1 ∏ a = 1 i ∏ b = 1 i + 1 B q ( α b / α a ; d i , a − d i + 1 , b ) . \begin{align}
\mathbf V_n^K(Z;\alpha,h,q)
={}&\sum_{(d_{i,a})\geq0}\prod_{i=1}^{n-1}Z_i^{d_i}
\prod_{i=1}^{n-1}\prod_{a,b=1}^{i}
B_q(\alpha_b/\alpha_a;d_{i,a}-d_{i,b})^{-1}\notag\\
&\quad\cdot\prod_{i=1}^{n-1}\prod_{a=1}^{i}\prod_{b=1}^{i+1}
B_q(\alpha_b/\alpha_a;d_{i,a}-d_{i+1,b}). \tag*{(7.4)}
\end{align} V n K ( Z ; α , h , q ) = ( d i , a ) ≥ 0 ∑ i = 1 ∏ n − 1 Z i d i i = 1 ∏ n − 1 a , b = 1 ∏ i B q ( α b / α a ; d i , a − d i , b ) − 1 ⋅ i = 1 ∏ n − 1 a = 1 ∏ i b = 1 ∏ i + 1 B q ( α b / α a ; d i , a − d i + 1 , b ) . (7.4)
Arrays outside the degree chamber of the cited formula violate a same-index inequality and have a zero edge ratio at generic framing. Thus summing over all nonnegative arrays gives the same series.
Here is the degree-dependent scalar in (7.3) . The brace factor of the cited formula satisfies
{ x } m = B q ( x − 1 ; m ) ( − q 1 / 2 h − 1 / 2 ) m . \{x\}_m=B_q(x^{-1};m)(-q^{1/2}h^{-1/2})^m. { x } m = B q ( x − 1 ; m ) ( − q 1/2 h − 1/2 ) m .
The inverse root factors have total brace exponent zero. The edge and framing factors have total exponent
∑ i = 1 n − 1 ( ( i + 1 ) d i − i d i + 1 ) = 2 ∑ i = 1 n − 1 d i = N ( d ) , d n = 0. \sum_{i=1}^{n-1}\bigl((i+1)d_i-id_{i+1}\bigr)
=2\sum_{i=1}^{n-1}d_i=N(d),\qquad d_n=0. i = 1 ∑ n − 1 ( ( i + 1 ) d i − i d i + 1 ) = 2 i = 1 ∑ n − 1 d i = N ( d ) , d n = 0.
The extra factor q N ( d ) / 2 q^{N(d)/2} q N ( d ) /2 in that formula therefore gives
q N ( d ) / 2 ( − q 1 / 2 h − 1 / 2 ) N ( d ) = ( q 2 / h ) ∑ i d i , q^{N(d)/2}(-q^{1/2}h^{-1/2})^{N(d)}
=(q^2/h)^{\sum_i d_i}, q N ( d ) /2 ( − q 1/2 h − 1/2 ) N ( d ) = ( q 2 / h ) ∑ i d i ,
which proves the stated rescaling.
The Cohomological Localization Limit
Lemma A.1. For m ∈ Z m\in\mathbb Z m ∈ Z and generic U , V , ϵ U,V,\epsilon U , V , ϵ with ϵ ≠ 0 \epsilon\ne0 ϵ = 0 , the ratio below is regular at η = 0 \eta=0 η = 0 , and ( e η U ; e η ϵ ) m ( e η V ; e η ϵ ) m ∣ η = 0 = ( U / ϵ ) m ( V / ϵ ) m .
\left.
\frac{(e^{\eta U};e^{\eta\epsilon})_m}
{(e^{\eta V};e^{\eta\epsilon})_m}
\right|_{\eta=0}
=\frac{(U/\epsilon)_m}{(V/\epsilon)_m}.
( e η V ; e η ϵ ) m ( e η U ; e η ϵ ) m η = 0 = ( V / ϵ ) m ( U / ϵ ) m .
Proof. For m ≥ 0 m\geq0 m ≥ 0 , cancel η \eta η in each factor ( 1 − e η ( U + j ϵ ) ) / ( 1 − e η ( V + j ϵ ) ) (1-e^{\eta(U+j\epsilon)})/(1-e^{\eta(V+j\epsilon)}) ( 1 − e η ( U + j ϵ ) ) / ( 1 − e η ( V + j ϵ ) ) . For m = − b < 0 m=-b<0 m = − b < 0 , use instead
∏ j = 1 b 1 − e η ( V − j ϵ ) 1 − e η ( U − j ϵ ) . \prod_{j=1}^b
\frac{1-e^{\eta(V-j\epsilon)}}{1-e^{\eta(U-j\epsilon)}}. j = 1 ∏ b 1 − e η ( U − j ϵ ) 1 − e η ( V − j ϵ ) . Their constant terms are, respectively, ( U + j ϵ ) / ( V + j ϵ ) (U+j\epsilon)/(V+j\epsilon) ( U + j ϵ ) / ( V + j ϵ ) and ( V − j ϵ ) / ( U − j ϵ ) (V-j\epsilon)/(U-j\epsilon) ( V − j ϵ ) / ( U − j ϵ ) , giving the assertion in both cases. ◻
Proposition A.2. Set q = e η ϵ , h = e η H , α j = e η A j , ω = H / ϵ , a j = A j / ϵ , Z i = Q i . q=e^{\eta\epsilon},\qquad h=e^{\eta H},\qquad
\alpha_j=e^{\eta A_j},\qquad
\omega=H/\epsilon,\qquad a_j=A_j/\epsilon,\qquad Z_i=Q_i. q = e η ϵ , h = e η H , α j = e η A j , ω = H / ϵ , a j = A j / ϵ , Z i = Q i . For generic additive weights, each coefficient of (?) is regular at η = 0 \eta=0 η = 0 , and V n K ( Q ; e η A , e η H , e η ϵ ) ∣ η = 0 = V n ( Q ; a , ω ) .
\left.\mathbf V_n^K(Q;e^{\eta A},e^{\eta H},e^{\eta\epsilon})
\right|_{\eta=0}=V_n(Q;a,\omega).
V n K ( Q ; e η A , e η H , e η ϵ ) η = 0 = V n ( Q ; a , ω ) .
Proof. Lemma A.1 sends an edge ratio of degree m m m to R ( ω + a b − a a , 1 + a b − a a ; m ) R(\omega+a_b-a_a,1+a_b-a_a;m) R ( ω + a b − a a , 1 + a b − a a ; m ) and an inverse root ratio to its reciprocal, precisely as in (7.1) . The rational products also evaluate the same-index zero factors, which remain zero. There are finitely many arrays with fixed row sums, so the limit passes through the complete degree sum. ◻
The eigenfunction normalization below uses Z i = ( q / h ) Q i Z_i=(q/h)Q_i Z i = ( q / h ) Q i . Since q / h → 1 q/h\to1 q / h → 1 , this change has the same cohomological limit.
Centered tRS Operators and the Spectral Dictionary
From now on put q = e η q=e^\eta q = e η , t = h = e η ω t=h=e^{\eta\omega} t = h = e η ω , c = ( n − 1 ) / 2 c=(n-1)/2 c = ( n − 1 ) /2 , and ρ i = ( n + 1 − 2 i ) / 2 \rho_i=(n+1-2i)/2 ρ i = ( n + 1 − 2 i ) /2 . The commuting tRS operators are
T r , η = t r ( r − 1 ) / 2 ∑ ∣ I ∣ = r ∏ i ∈ I , j ∉ I t z i − z j z i − z j e η D I , D I = ∑ i ∈ I D i . \begin{equation}
\mathsf T_{r,\eta}=t^{r(r-1)/2}
\sum_{|I|=r}\prod_{i\in I,\,j\notin I}
\frac{tz_i-z_j}{z_i-z_j}\,e^{\eta D_I},
\qquad D_I=\sum_{i\in I}D_i. \tag*{(7.7)}
\end{equation} T r , η = t r ( r − 1 ) /2 ∣ I ∣ = r ∑ i ∈ I , j ∈ / I ∏ z i − z j t z i − z j e η D I , D I = i ∈ I ∑ D i . (7.7)
Their centered form is
A r , η = t − r c z − ω ρ T r , η z ω ρ = ∑ ∣ I ∣ = r a I ( η , Q ) e η D I , \begin{equation}
\mathsf A_{r,\eta}
=t^{-rc}z^{-\omega\rho}\mathsf T_{r,\eta}z^{\omega\rho}
=\sum_{|I|=r}a_I(\eta,Q)e^{\eta D_I}, \tag*{(7.8)}
\end{equation} A r , η = t − r c z − ω ρ T r , η z ω ρ = ∣ I ∣ = r ∑ a I ( η , Q ) e η D I , (7.8)
where
a I = ∏ i < j i ∈ I , j ∉ I 1 − t q i j 1 − q i j ∏ i < j i ∉ I , j ∈ I 1 − t − 1 q i j 1 − q i j . \begin{equation}
a_I=
\prod_{\substack{i<j\\i\in I,\ j\notin I}}
\frac{1-tq_{ij}}{1-q_{ij}}
\prod_{\substack{i<j\\i\notin I,\ j\in I}}
\frac{1-t^{-1}q_{ij}}{1-q_{ij}}. \tag*{(7.9)}
\end{equation} a I = i < j i ∈ I , j ∈ / I ∏ 1 − q ij 1 − t q ij i < j i ∈ / I , j ∈ I ∏ 1 − q ij 1 − t − 1 q ij . (7.9)
Indeed, the chamber constant in the coefficient of T r , η \mathsf T_{r,\eta} T r , η is t ∑ i ∈ I ( i − 1 ) t^{\sum_{i\in I}(i-1)} t ∑ i ∈ I ( i − 1 ) ; conjugation and centering cancel it. Thus a I ( η , 0 ) = 1 a_I(\eta,0)=1 a I ( η , 0 ) = 1 .
Proposition A.3. The first centered operator has expansion A 1 , η = n + η ∑ i D i + η 2 L n , ω + O ( η 3 ) .
\mathsf A_{1,\eta}
=n+\eta\sum_iD_i+\eta^2\mathcal L_{n,\omega}+O(\eta^3).
A 1 , η = n + η ∑ i D i + η 2 L n , ω + O ( η 3 ) . The first-order term vanishes on series in Q Q Q .
Proof. Write u i j = q i j / ( 1 − q i j ) u_{ij}=q_{ij}/(1-q_{ij}) u ij = q ij / ( 1 − q ij ) and a { i } = 1 + η b i + η 2 c i + O ( η 3 ) a_{\{i\}}=1+\eta b_i+\eta^2c_i+O(\eta^3) a { i } = 1 + η b i + η 2 c i + O ( η 3 ) . Formula (7.9) gives
b i = − ω ∑ j > i u i j + ω ∑ j < i u j i , ∑ i b i = 0 , b_i=-\omega\sum_{j>i}u_{ij}
+\omega\sum_{j<i}u_{ji},\qquad \sum_i b_i=0, b i = − ω j > i ∑ u ij + ω j < i ∑ u j i , i ∑ b i = 0 , and
∑ i c i = − ω 2 ∑ i < j u i j + ω 2 ∑ i < j < k ( u i j u i k − u i j u j k + u i k u j k ) . \sum_i c_i=-\omega^2\sum_{i<j}u_{ij}
+\omega^2\sum_{i<j<k}
(u_{ij}u_{ik}-u_{ij}u_{jk}+u_{ik}u_{jk}). i ∑ c i = − ω 2 i < j ∑ u ij + ω 2 i < j < k ∑ ( u ij u ik − u ij u j k + u ik u j k ) . Since q i k = q i j q j k q_{ik}=q_{ij}q_{jk} q ik = q ij q j k , the expression in parentheses is − u i k -u_{ik} − u ik . Hence ∑ i c i = − ω 2 ∑ i < j ( j − i ) u i j \sum_i c_i=-\omega^2\sum_{i<j}(j-i)u_{ij} ∑ i c i = − ω 2 ∑ i < j ( j − i ) u ij . Expanding the shifts gives (3.4) ; also ∑ i D i = 0 \sum_iD_i=0 ∑ i D i = 0 on ratio series. ◻
We now specify the input from the Kähler eigenfunction theorem. The variables u i , ℏ u_i,\hbar u i , ℏ of [Din21 ] are our α i , h \alpha_i,h α i , h , and its homogeneous variables ζ i \zeta_i ζ i obey ζ i / ζ i + 1 = ( h / q ) Z i \zeta_i/\zeta_{i+1}=(h/q)Z_i ζ i / ζ i + 1 = ( h / q ) Z i . Identifying ζ i = z i \zeta_i=z_i ζ i = z i gives the parameter correspondence
Q i = q z i r a w , Z i = q h Q i = q 2 h z i r a w , V ^ n K ( Q ; a ) = V n K ( ( q / h ) Q ; α , h , q ) , α i = e η a i . \begin{equation}
Q_i=qz_i^{\rm raw},\qquad
Z_i=\frac qh Q_i=\frac{q^2}{h}z_i^{\rm raw},\qquad
\widehat V_n^K(Q;a)=
\mathbf V_n^K\bigl((q/h)Q;\alpha,h,q\bigr),
\quad \alpha_i=e^{\eta a_i}. \tag*{(7.11)}
\end{equation} Q i = q z i raw , Z i = h q Q i = h q 2 z i raw , V n K ( Q ; a ) = V n K ( ( q / h ) Q ; α , h , q ) , α i = e η a i . (7.11)
Its constant coefficient is one.
Put R I = ∏ i ∈ I , j ∉ I ( h z i − z j ) / ( z i − z j ) \mathcal R_I=\prod_{i\in I,j\notin I}(hz_i-z_j)/(z_i-z_j) R I = ∏ i ∈ I , j ∈ / I ( h z i − z j ) / ( z i − z j ) . In the notation of [Din21 ] (Definition 4),
D r D i n = h r ( r + 1 ) / 2 − r n ∑ ∣ I ∣ = r R I e η D I = h − r ( n − 1 ) T r , η . \mathsf D_r^{\rm Din}
=h^{r(r+1)/2-rn}\sum_{|I|=r}\mathcal R_Ie^{\eta D_I}
=h^{-r(n-1)}\mathsf T_{r,\eta}. D r Din = h r ( r + 1 ) /2 − r n ∣ I ∣ = r ∑ R I e η D I = h − r ( n − 1 ) T r , η .
The normalizing factor C η \mathcal C_\eta C η in Proposition 1 of that reference has shift ratios
p i C η C η = h n − i α i − 1 , p i = e η D i , \frac{p_i\mathcal C_\eta}{\mathcal C_\eta}
=h^{n-i}\alpha_i^{-1},\qquad p_i=e^{\eta D_i}, C η p i C η = h n − i α i − 1 , p i = e η D i ,
and its Proposition 2 gives
D r D i n ( C η V ^ n K ) = e r ( α − 1 ) C η V ^ n K . \mathsf D_r^{\rm Din}
(\mathcal C_\eta\widehat V_n^K)
=e_r(\alpha^{-1})\mathcal C_\eta\widehat V_n^K. D r Din ( C η V n K ) = e r ( α − 1 ) C η V n K .
Thus the spectral characters are the reciprocals of the framing characters in localization. Kähler-independent factors of C η \mathcal C_\eta C η do not affect this equation.
For comparison with the raw family, one may use
Γ η ( z ; a ) = ∏ i θ ( h i − 1 z i ; q ) θ ( α i − 1 z i ; q ) , p i Γ η Γ η = α i − 1 h 1 − i , \begin{equation}
\Gamma_\eta(z;a)=\prod_i
\frac{\theta(h^{i-1}z_i;q)}{\theta(\alpha_i^{-1}z_i;q)},
\qquad
\frac{p_i\Gamma_\eta}{\Gamma_\eta}
=\alpha_i^{-1}h^{1-i}, \tag*{(7.12)}
\end{equation} Γ η ( z ; a ) = i ∏ θ ( α i − 1 z i ; q ) θ ( h i − 1 z i ; q ) , Γ η p i Γ η = α i − 1 h 1 − i , (7.12)
where θ ( q x ; q ) = − x − 1 θ ( x ; q ) \theta(qx;q)=-x^{-1}\theta(x;q) θ ( q x ; q ) = − x − 1 θ ( x ; q ) . These shift ratios are also realized by the formal character
Conjugation depends only on shift ratios, so no asymptotics of a theta function are needed.
Proof. For ∣ I ∣ = r |I|=r ∣ I ∣ = r , conjugation of D r D i n \mathsf D_r^{\rm Din} D r Din by C η \mathcal C_\eta C η gives the coefficient
h r ( r + 1 ) / 2 − r n α I − 1 h ∑ i ∈ I ( n − i ) R I = α I − 1 h r ( r − 1 ) / 2 + ∑ i ∈ I ( 1 − i ) R I = α I − 1 a I . h^{r(r+1)/2-rn}\alpha_I^{-1}
h^{\sum_{i\in I}(n-i)}\mathcal R_I
=\alpha_I^{-1}
h^{r(r-1)/2+\sum_{i\in I}(1-i)}\mathcal R_I
=\alpha_I^{-1}a_I. h r ( r + 1 ) /2 − r n α I − 1 h ∑ i ∈ I ( n − i ) R I = α I − 1 h r ( r − 1 ) /2 + ∑ i ∈ I ( 1 − i ) R I = α I − 1 a I . The last equality follows by factoring each cross pair according to its order. Consequently
C η − 1 D r D i n C η = Γ η − 1 T r , η Γ η = ∑ ∣ I ∣ = r α I − 1 a I e η D I . \begin{equation}
\mathcal C_\eta^{-1}\mathsf D_r^{\rm Din}\mathcal C_\eta
=\Gamma_\eta^{-1}\mathsf T_{r,\eta}\Gamma_\eta
=\sum_{|I|=r}\alpha_I^{-1}a_Ie^{\eta D_I}. \tag*{(7.16)}
\end{equation} C η − 1 D r Din C η = Γ η − 1 T r , η Γ η = ∣ I ∣ = r ∑ α I − 1 a I e η D I . (7.16) This proves (7.15) from the cited eigenfunction theorem. A shift in r r r variables multiplies the center factor of (7.13) by h − r c h^{-rc} h − r c , so Γ η − 1 T r , η Γ η = z a A r , η z − a \Gamma_\eta^{-1}\mathsf T_{r,\eta}\Gamma_\eta
=z^a\mathsf A_{r,\eta}z^{-a} Γ η − 1 T r , η Γ η = z a A r , η z − a , proving (7.14) . ◻
For n = 2 n=2 n = 2 , the normalized K K K -theoretic vertex is
V ^ 2 K ( Q ; a ) = 2 ϕ 1 ( h , h α 2 / α 1 ; q α 2 / α 1 ; q ; ( q / h ) Q ) . \widehat V_2^K(Q;a)={}_2\phi_1
\left(h,h\alpha_2/\alpha_1;
q\alpha_2/\alpha_1;q;(q/h)Q\right). V 2 K ( Q ; a ) = 2 ϕ 1 ( h , h α 2 / α 1 ; q α 2 / α 1 ; q ; ( q / h ) Q ) .
Its coefficient ratio gives the two reciprocal framing weights in (7.15) .
The Local-Ring Argument at Zero Framing
On series in Q Q Q define
N η ( a ) = η − 2 [ ∑ i e − η a i a { i } ( η , Q ) e η D i − ∑ i e − η a i ] . \begin{equation}
\mathsf N_\eta(a)=\eta^{-2}
\left[\sum_i e^{-\eta a_i}a_{\{i\}}(\eta,Q)e^{\eta D_i}
-\sum_i e^{-\eta a_i}\right]. \tag*{(7.17)}
\end{equation} N η ( a ) = η − 2 [ i ∑ e − η a i a { i } ( η , Q ) e η D i − i ∑ e − η a i ] . (7.17)
The order-zero term in brackets vanishes. The order-one term is ∑ i D i \sum_iD_i ∑ i D i , hence also vanishes on ratio series; the divided operator is therefore regular at η = 0 \eta=0 η = 0 . The expansion above gives
N η ( a ) ∣ η = 0 = L n , ω , a : = L n , ω − ∑ i a i D i + ω ∑ i < j q i j 1 − q i j ( a i − a j ) . \begin{equation}
\left.\mathsf N_\eta(a)\right|_{\eta=0}
=\mathcal L_{n,\omega,a}
:=\mathcal L_{n,\omega}-\sum_i a_iD_i
+\omega\sum_{i<j}\frac{q_{ij}}{1-q_{ij}}(a_i-a_j). \tag*{(7.18)}
\end{equation} N η ( a ) ∣ η = 0 = L n , ω , a := L n , ω − i ∑ a i D i + ω i < j ∑ 1 − q ij q ij ( a i − a j ) . (7.18)
Propositions A.4 and A.2 then imply, for generic framing,
L n , ω , a V n ( Q ; a , ω ) = 0 , L n , ω ( z − a V n ( Q ; a , ω ) ) = 1 2 ∑ i a i 2 z − a V n ( Q ; a , ω ) . \begin{align}
\mathcal L_{n,\omega,a}V_n(Q;a,\omega)&=0, \tag*{(7.19)}\\
\mathcal L_{n,\omega}(z^{-a}V_n(Q;a,\omega))
&=\frac12\sum_i a_i^2\,z^{-a}V_n(Q;a,\omega).\notag
\end{align} L n , ω , a V n ( Q ; a , ω ) L n , ω ( z − a V n ( Q ; a , ω )) = 0 , = 2 1 i ∑ a i 2 z − a V n ( Q ; a , ω ) . (7.19)
The corresponding Schrödinger function is z − a J n V n ( Q ; a , ω ) z^{-a}J_nV_n(Q;a,\omega) z − a J n V n ( Q ; a , ω ) .
Proposition A.5. Every coefficient of V n ( Q ; a , ω ) V_n(Q;a,\omega) V n ( Q ; a , ω ) is regular at a = 0 a=0 a = 0 . More precisely, each coefficient of V ^ n K ( Q ; a ) \widehat V_n^K(Q;a) V n K ( Q ; a ) lies in R [ [ η ] ] R[[\eta]] R [[ η ]] , where R = Q ( ω ) [ a 1 , … , a n ] ( a 1 , … , a n ) . R=\mathbb Q(\omega)[a_1,\ldots,a_n]_{(a_1,\ldots,a_n)}. R = Q ( ω ) [ a 1 , … , a n ] ( a 1 , … , a n ) . The cohomological and zero-framing specializations commute: V ^ n K ( Q ; a ) ∣ η = 0 , a = 0 = V n ( Q ; a , ω ) ∣ a = 0 = V ^ n K ( Q ; 0 ) ∣ η = 0 .
\left.\widehat V_n^K(Q;a)\right|_{\eta=0,\ a=0}
=\left.V_n(Q;a,\omega)\right|_{a=0}
=\left.\widehat V_n^K(Q;0)\right|_{\eta=0}.
V n K ( Q ; a ) η = 0 , a = 0 = V n ( Q ; a , ω ) ∣ a = 0 = V n K ( Q ; 0 ) η = 0 . Moreover [ Q d ] V n ( Q ; ω ) ∈ Q [ ω ] [Q^{\boldsymbol d}]V_n(Q;\omega)\in\mathbb Q[\omega] [ Q d ] V n ( Q ; ω ) ∈ Q [ ω ] .
Proof. Construct a normalized solution of N η ( a ) W = 0 \mathsf N_\eta(a)W=0 N η ( a ) W = 0 over R [ [ η ] ] R[[\eta]] R [[ η ]] . Put d 0 = d n = 0 d_0=d_n=0 d 0 = d n = 0 and ν i = d i − d i − 1 \nu_i=d_i-d_{i-1} ν i = d i − d i − 1 . Since a I ( η , 0 ) = 1 a_I(\eta,0)=1 a I ( η , 0 ) = 1 , the diagonal coefficient in degree d \boldsymbol d d is
E d ( a , η ) = ∑ i e − η a i ( e η ν i − 1 ) η 2 = 1 2 ∑ i ν i 2 − ∑ i a i ν i + O ( η ) . \begin{equation}
E_{\boldsymbol d}(a,\eta)
=\frac{\sum_i e^{-\eta a_i}(e^{\eta\nu_i}-1)}{\eta^2}
=\frac12\sum_i\nu_i^2-\sum_i a_i\nu_i+O(\eta). \tag*{(7.21)}
\end{equation} E d ( a , η ) = η 2 ∑ i e − η a i ( e η ν i − 1 ) = 2 1 i ∑ ν i 2 − i ∑ a i ν i + O ( η ) . (7.21) Here ∑ i ν i = 0 \sum_i\nu_i=0 ∑ i ν i = 0 . For d ≠ 0 \boldsymbol d\ne0 d = 0 , its constant term at η = a = 0 \eta=a=0 η = a = 0 is the positive integer E ( d ) \mathcal E(\boldsymbol d) E ( d ) of (3.6) . Thus E d E_{\boldsymbol d} E d is a unit in R [ [ η ] ] R[[\eta]] R [[ η ]] . All off-diagonal terms involve smaller total Kähler degree. Starting with w 0 = 1 w_{\boldsymbol0}=1 w 0 = 1 , division by these units therefore constructs a unique W = ∑ d w d Q d W=\sum_{\boldsymbol d}w_{\boldsymbol d}Q^{\boldsymbol d} W = ∑ d w d Q d with w d ∈ R [ [ η ] ] w_{\boldsymbol d}\in R[[\eta]] w d ∈ R [[ η ]] . The degree-zero equation is identically zero.
Over K = Q ( ω , a 1 , … , a n ) K=\mathbb Q(\omega,a_1,\ldots,a_n) K = Q ( ω , a 1 , … , a n ) , the same recursion gives uniqueness in K ( ( η ) ) [ [ Q ] ] K((\eta))[[Q]] K (( η )) [[ Q ]] . Proposition A.4 places the generic localization vertex in this equation, and Proposition A.2 gives its coefficientwise expansion at η = 0 \eta=0 η = 0 . It must therefore equal W W W . In particular, the complete degree sums, although their summands may have framing poles, belong to R [ [ η ] ] R[[\eta]] R [[ η ]] .
The cohomological limit identifies W ∣ η = 0 W|_{\eta=0} W ∣ η = 0 with V n ( Q ; a , ω ) V_n(Q;a,\omega) V n ( Q ; a , ω ) . Evaluation at η = 0 \eta=0 η = 0 and evaluation at a = 0 a=0 a = 0 commute on R [ [ η ] ] R[[\eta]] R [[ η ]] , proving (7.20) .
Finally let R 0 = Q [ a 1 , … , a n ] ( a 1 , … , a n ) R_0=\mathbb Q[a_1,\ldots,a_n]_{(a_1,\ldots,a_n)} R 0 = Q [ a 1 , … , a n ] ( a 1 , … , a n ) . The coefficients of N η ( a ) \mathsf N_\eta(a) N η ( a ) are polynomial in ω \omega ω over R 0 R_0 R 0 , whereas the diagonal E d ( a , η ) E_{\boldsymbol d}(a,\eta) E d ( a , η ) is independent of ω \omega ω and has its inverse in R 0 [ [ η ] ] R_0[[\eta]] R 0 [[ η ]] . The recursion consequently gives w d ∈ ( R 0 [ ω ] ) [ [ η ] ] w_{\boldsymbol d}\in(R_0[\omega])[[\eta]] w d ∈ ( R 0 [ ω ]) [[ η ]] . Evaluating at η = a = 0 \eta=a=0 η = a = 0 proves the last assertion and permits every characteristic-zero specialization of the coupling. ◻
Proposition A.6. The normalized scalar vertex (7.2) exists in Q [ ω ] [ [ Q ] ] \mathbb Q[\omega][[Q]] Q [ ω ] [[ Q ]] and satisfies V n ( Q ; ω ) = F n , ω ( Q ) .
V_n(Q;\omega)=F_{n,\omega}(Q).
V n ( Q ; ω ) = F n , ω ( Q ) . In particular, L n , ω V n = 0 \mathcal L_{n,\omega}V_n=0 L n , ω V n = 0 and H n , ω ( J n V n ) = 0 H_{n,\omega}(J_nV_n)=0 H n , ω ( J n V n ) = 0 .
Proof. Set a = 0 a=0 a = 0 in (7.19) using Proposition A.5 , and apply the normalized formal uniqueness of Proposition 3.2 . Conjugation by J n J_n J n gives the Schrödinger equation. ◻
Adjacent-Rank Kernels and Chamber Constant Terms
This appendix proves the quadratic equation for the master period and identifies the normalization of the commuting matching operators. The matching formula also identifies the physical coupling dependence used in (3.30) .
The Kernel and Its Chamber Expansion
For a row of r r r variables put Δ r ( v ) = ∏ a < b ( v b − v a ) \Delta_r(v)=\prod_{a<b}(v_b-v_a) Δ r ( v ) = ∏ a < b ( v b − v a ) , with Δ 1 = 1 \Delta_1=1 Δ 1 = 1 . For adjacent rows z = ( z 1 , … , z r ) z=(z_1,\ldots,z_r) z = ( z 1 , … , z r ) and y = ( y 1 , … , y r − 1 ) y=(y_1,\ldots,y_{r-1}) y = ( y 1 , … , y r − 1 ) , define, up to a constant branch factor,
K r ( z , y ) = Δ r ( z ) κ Δ r − 1 ( y ) κ ∏ a = 1 r ∏ b = 1 r − 1 ( z a − y b ) − κ ∏ b = 1 r − 1 y b κ . \begin{equation}
\mathscr K_r(z,y)
=\Delta_r(z)^\kappa\Delta_{r-1}(y)^\kappa
\prod_{a=1}^r\prod_{b=1}^{r-1}(z_a-y_b)^{-\kappa}
\prod_{b=1}^{r-1}y_b^\kappa. \tag*{(8.1)}
\end{equation} K r ( z , y ) = Δ r ( z ) κ Δ r − 1 ( y ) κ a = 1 ∏ r b = 1 ∏ r − 1 ( z a − y b ) − κ b = 1 ∏ r − 1 y b κ . (8.1)
We always use the interlacing chamber ∣ z 1 ∣ < ∣ y 1 ∣ < ∣ z 2 ∣ < ⋯ < ∣ y r − 1 ∣ < ∣ z r ∣ |z_1|<|y_1|<|z_2|<\cdots<|y_{r-1}|<|z_r| ∣ z 1 ∣ < ∣ y 1 ∣ < ∣ z 2 ∣ < ⋯ < ∣ y r − 1 ∣ < ∣ z r ∣ . Factoring the differences cancels every monomial power. We choose the constant phase so that the remaining product of binomial series has leading coefficient one.
Lemma B.1. Choose a total ordering of all internal and external radii compatible with (2.4) , and write the variables as v 1 , … , v L v_1,\ldots,v_L v 1 , … , v L , where L = n ( n + 1 ) / 2 L=n(n+1)/2 L = n ( n + 1 ) /2 , v 1 = z 1 v_1=z_1 v 1 = z 1 and v L = z n v_L=z_n v L = z n . Put w j = v j / v j + 1 w_j=v_j/v_{j+1} w j = v j / v j + 1 . The normalized kernels and the prescribed expansions of their logarithmic derivatives belong to A K = K [ [ w 1 , … , w L − 1 ] ] \mathscr A_K=K[[w_1,\ldots,w_{L-1}]] A K = K [[ w 1 , … , w L − 1 ]] . Internal constant-term extraction defines a map C T x : A K → K [ [ Q ] ] \mathop{\mathrm{CT}}_x:\mathscr A_K\to K[[Q]] CT x : A K → K [[ Q ]] with C T x D r , a f = 0 , D i C T x f = C T x D i f . \mathop{\mathrm{CT}}_x D_{r,a}f=0,\qquad
D_i\mathop{\mathrm{CT}}_x f=\mathop{\mathrm{CT}}_xD_if. CT x D r , a f = 0 , D i CT x f = CT x D i f . It commutes with multiplication by external chamber series. For κ ∈ Z p \kappa\in\mathbb Z_p κ ∈ Z p the kernels are integral units; the same assertions hold over Z p \mathbb Z_p Z p .
Proof. Every smaller-to-larger ratio is a nonconstant monomial in the w j w_j w j . The normalized kernels are products of binomial series in these monomials, and their logarithmic derivatives are rational series of the same kind. For a monomial w e w^{\boldsymbol e} w e , zero exponent of an internal variable says that its two adjacent w w w exponents agree. Thus [ Q d ] C T x [Q^{\boldsymbol d}]\mathop{\mathrm{CT}}_x [ Q d ] CT x selects the unique exponent vector that equals d j d_j d j throughout the gap from z j z_j z j to z j + 1 z_{j+1} z j + 1 . This proves well-definedness and the derivative identities. External multiplication preserves internal exponents. Integrality follows from ( α j ) ∈ Z p \binom\alpha j\in\mathbb Z_p ( j α ) ∈ Z p for α ∈ Z p \alpha\in\mathbb Z_p α ∈ Z p . ◻
The Quadratic Kernel Identity
Lemma B.2. For r ≥ 2 r\geq2 r ≥ 2 , ( H r , κ z − H r − 1 , κ y ) K r ( z , y ) = 0.
(H_{r,\kappa}^{z}-H_{r-1,\kappa}^{y})\mathscr K_r(z,y)=0.
( H r , κ z − H r − 1 , κ y ) K r ( z , y ) = 0. After division by the kernel, this is a rational identity polynomial in κ \kappa κ .
Proof. This is the adjacent-rank trigonometric specialization of the kernel identity in [Lan06 ]; we give the calculation in the normalization used here. Combine both rows into variables v a v_a v a , with σ a = 1 \sigma_a=1 σ a = 1 on the r r r upper variables and σ a = − 1 \sigma_a=-1 σ a = − 1 on the r − 1 r-1 r − 1 lower variables. Up to a constant,
K r = ∏ a < b ( v a − v b v a v b ) κ σ a σ b . \mathscr K_r=
\prod_{a<b}\left(\frac{v_a-v_b}{\sqrt{v_av_b}}\right)
^{\kappa\sigma_a\sigma_b}. K r = a < b ∏ ( v a v b v a − v b ) κ σ a σ b . The induced monomial powers are zero on upper variables and κ \kappa κ on lower variables, as in (8.1) . Put
R a b = v a + v b v a − v b , V a b = v a v b ( v a − v b ) 2 , ℓ a = κ − 1 D a log K r = 1 2 ∑ b ≠ a σ a σ b R a b . R_{ab}=\frac{v_a+v_b}{v_a-v_b},\qquad
V_{ab}=\frac{v_av_b}{(v_a-v_b)^2},\qquad
\ell_a=\kappa^{-1}D_a\log\mathscr K_r
=\frac12\sum_{b\ne a}\sigma_a\sigma_bR_{ab}. R ab = v a − v b v a + v b , V ab = ( v a − v b ) 2 v a v b , ℓ a = κ − 1 D a log K r = 2 1 b = a ∑ σ a σ b R ab . Then D a ℓ a = − ∑ b ≠ a σ a σ b V a b D_a\ell_a=-\sum_{b\ne a}\sigma_a\sigma_bV_{ab} D a ℓ a = − ∑ b = a σ a σ b V ab . The identities
R a b 2 = 1 + 4 V a b , R a b R a c − R a b R b c + R a c R b c = 1 R_{ab}^2=1+4V_{ab},\qquad
R_{ab}R_{ac}-R_{ab}R_{bc}+R_{ac}R_{bc}=1 R ab 2 = 1 + 4 V ab , R ab R a c − R ab R b c + R a c R b c = 1 give
1 2 ∑ a σ a D a ℓ a = − ∑ a < b σ a = σ b σ a V a b , 1 2 ∑ a σ a ℓ a 2 = ∑ a < b σ a = σ b σ a V a b . \begin{align*}
\frac12\sum_a\sigma_aD_a\ell_a
&=-\sum_{\substack{a<b\\\sigma_a=\sigma_b}}\sigma_aV_{ab},\\
\frac12\sum_a\sigma_a\ell_a^2
&=\sum_{\substack{a<b\\\sigma_a=\sigma_b}}\sigma_aV_{ab}.
\end{align*} 2 1 a ∑ σ a D a ℓ a 2 1 a ∑ σ a ℓ a 2 = − a < b σ a = σ b ∑ σ a V ab , = a < b σ a = σ b ∑ σ a V ab . In the second formula the constant pair contribution is ( r − 1 ) / 4 (r-1)/4 ( r − 1 ) /4 and the triple contribution is − ( r − 1 ) / 4 -(r-1)/4 − ( r − 1 ) /4 ; the latter is the coefficient of X 3 X^3 X 3 in ( 1 + X ) r ( 1 − X ) r − 1 (1+X)^r(1-X)^{r-1} ( 1 + X ) r ( 1 − X ) r − 1 , divided by four. The signed kinetic term is therefore κ ( κ − 1 ) ∑ σ a = σ b σ a V a b \kappa(\kappa-1)\sum_{\sigma_a=\sigma_b}\sigma_aV_{ab} κ ( κ − 1 ) ∑ σ a = σ b σ a V ab , which cancels the signed potential. The divided identity is polynomial in κ \kappa κ , so the calculation also covers κ = 0 \kappa=0 κ = 0 . ◻
Write x ( r ) = ( x r , 1 , … , x r , r ) x^{(r)}=(x_{r,1},\ldots,x_{r,r}) x ( r ) = ( x r , 1 , … , x r , r ) , with x ( n ) = z x^{(n)}=z x ( n ) = z , and put D r , a = x r , a ∂ x r , a D_{r,a}=x_{r,a}\partial_{x_{r,a}} D r , a = x r , a ∂ x r , a , K 1 = 1 \mathscr K_1=1 K 1 = 1 and
F r = ∏ j = 1 r − 1 K j + 1 ( x ( j + 1 ) , x ( j ) ) , F 1 = 1. \mathscr F_r=\prod_{j=1}^{r-1}
\mathscr K_{j+1}(x^{(j+1)},x^{(j)}),\qquad
\mathscr F_1=1. F r = j = 1 ∏ r − 1 K j + 1 ( x ( j + 1 ) , x ( j ) ) , F 1 = 1.
Proposition B.3. The product of kernels satisfies H n , κ z F n = ∑ r = 1 n − 1 ∑ a = 1 r D r , a ( F n b r , a ) ,
H_{n,\kappa}^{z}\mathscr F_n
=\sum_{r=1}^{n-1}\sum_{a=1}^r
D_{r,a}(\mathscr F_n b_{r,a}),
H n , κ z F n = ∑ r = 1 n − 1 ∑ a = 1 r D r , a ( F n b r , a ) , where b r , a = κ 2 ( 1 − ∑ b = 1 r + 1 x r , a x r , a − x r + 1 , b + ∑ b = 1 r − 1 x r , a x r , a − x r − 1 , b ) .
b_{r,a}=\frac\kappa2\left(
1-\sum_{b=1}^{r+1}\frac{x_{r,a}}{x_{r,a}-x_{r+1,b}}
+\sum_{b=1}^{r-1}\frac{x_{r,a}}{x_{r,a}-x_{r-1,b}}
\right).
b r , a = 2 κ ( 1 − ∑ b = 1 r + 1 x r , a − x r + 1 , b x r , a + ∑ b = 1 r − 1 x r , a − x r − 1 , b x r , a ) . The last sum is absent for r = 1 r=1 r = 1 .
Proof. For the kinetic normalization used here,
f H K − K H f = 1 2 ∑ a D a ( f D a K − K D a f ) . fHK-KHf=\frac12\sum_aD_a(fD_aK-KD_af). f H K − K H f = 2 1 a ∑ D a ( f D a K − K D a f ) . Apply this to f = F r − 1 f=\mathscr F_{r-1} f = F r − 1 and K = K r K=\mathscr K_r K = K r , and use Lemma B.2 . The lower-row divergences pass through the next kernel. The new primitive has coefficient 1 2 D r − 1 , a log ( K r / K r − 1 ) \frac12D_{r-1,a}\log(\mathscr K_r/\mathscr K_{r-1}) 2 1 D r − 1 , a log ( K r / K r − 1 ) . The same-row Vandermonde terms cancel in this logarithmic derivative, leaving (8.4) . Induction from H 1 , κ 1 = 0 H_{1,\kappa}1=0 H 1 , κ 1 = 0 proves the formula. ◻
Multiplying the normalized kernels gives
F n = J n , κ ∏ r = 1 n − 1 ∏ a < b ( 1 − x r , a / x r , b ) 2 κ ∏ r = 1 n − 1 ∏ a = 1 r ∏ b = 1 r + 1 ( 1 − ρ r , a , b ) − κ . \begin{equation}
\mathscr F_n
=J_{n,\kappa}
\prod_{r=1}^{n-1}\prod_{a<b}
(1-x_{r,a}/x_{r,b})^{2\kappa}
\prod_{r=1}^{n-1}\prod_{a=1}^r\prod_{b=1}^{r+1}
(1-\rho_{r,a,b})^{-\kappa}. \tag*{(8.5)}
\end{equation} F n = J n , κ r = 1 ∏ n − 1 a < b ∏ ( 1 − x r , a / x r , b ) 2 κ r = 1 ∏ n − 1 a = 1 ∏ r b = 1 ∏ r + 1 ( 1 − ρ r , a , b ) − κ . (8.5)
Indeed, before chamber factorization the product is, up to a constant phase,
Δ n ( z ) κ M κ Δ 2 κ E − κ . \Delta_n(z)^\kappa M^\kappa\Delta^{2\kappa}E^{-\kappa}. Δ n ( z ) κ M κ Δ 2 κ E − κ .
The monomial factors cancel as in the normalized master density. In particular,
C T x F n = J n , κ V n . \begin{equation}
\mathop{\mathrm{CT}}_x\mathscr F_n=J_{n,\kappa}\mathcal V_n. \tag*{(8.6)}
\end{equation} CT x F n = J n , κ V n . (8.6)
Proposition B.4. The master period satisfies H n , κ ( J n , κ V n ) = 0 , L n , κ V n = 0. H_{n,\kappa}(J_{n,\kappa}\mathcal V_n)=0,
\qquad \mathcal L_{n,\kappa}\mathcal V_n=0. H n , κ ( J n , κ V n ) = 0 , L n , κ V n = 0. Hence V n = F n , κ \mathcal V_n=F_{n,\kappa} V n = F n , κ .
Proof. Take the internal constant term in (8.3) . Its right side vanishes by Lemma B.1 ; its left side becomes the Hamiltonian applied to (8.6) . Conjugation gives the vertex-gauge equation. The period has constant coefficient one, so Proposition 3.2 identifies it. ◻
Matching Operators and Spectral Identification
Let M r , k ( κ ) \mathsf M_{r,k}(\kappa) M r , k ( κ ) denote the right side of the matching formula (3.16) , with n n n replaced by r r r . Set M r , 0 = 1 \mathsf M_{r,0}=1 M r , 0 = 1 and M r , k = 0 \mathsf M_{r,k}=0 M r , k = 0 for k > r k>r k > r .
Proposition B.5. The operators M r , k \mathsf M_{r,k} M r , k commute, have chamber constant e k ( D ) e_k(D) e k ( D ) , and have integral chamber coefficients for κ ∈ Z p \kappa\in\mathbb Z_p κ ∈ Z p . Their first two members are M r , 1 = ∑ i D i , M r , 2 = 1 2 ( ∑ i D i ) 2 − H r , κ . \mathsf M_{r,1}=\sum_iD_i,\qquad
\mathsf M_{r,2}=\frac12\left(\sum_iD_i\right)^2-H_{r,\kappa}. M r , 1 = ∑ i D i , M r , 2 = 2 1 ( ∑ i D i ) 2 − H r , κ .
Proof. Use the commuting operators in [HR15 ] (equations (1.10)–(1.12) and (2.7)–(2.8)). Set z i = e 2 t i z_i=e^{2t_i} z i = e 2 t i and λ = κ \lambda=\kappa λ = κ there. The derivative becomes − 2 i D i -2iD_i − 2 i D i , and the pair factor becomes − 4 g κ v i j -4g_\kappa v_{ij} − 4 g κ v ij . Dividing the order-k k k operator by ( − 2 i ) k (-2i)^k ( − 2 i ) k gives the formula used here. A term with ℓ \ell ℓ pairs occurs ( r − k ) ! 2 ℓ ℓ ! ( k − 2 ℓ ) ! (r-k)!2^\ell\ell!(k-2\ell)! ( r − k )! 2 ℓ ℓ ! ( k − 2 ℓ )! times in their permutation sum, canceling the factorial prefactor before reduction modulo p p p . Their commutation identities are rational identities polynomial in κ \kappa κ , so hold at every coupling. Finally v i j = q i j / ( 1 − q i j ) 2 v_{ij}=q_{ij}/(1-q_{ij})^2 v ij = q ij / ( 1 − q ij ) 2 has positive chamber degree and integral coefficients. This proves the chamber constant, the first two formulas and integrality. ◻
The matching family can be identified with the determinant family using generic spectral parameters. This avoids a second derivation of the joint period equations by higher kernel identities.
Proposition B.6. For every r r r and 0 ≤ k ≤ r 0\leq k\leq r 0 ≤ k ≤ r , M r , k ( κ ) = I r , k ( κ ) \mathsf M_{r,k}(\kappa)=\mathsf I_{r,k}(\kappa) M r , k ( κ ) = I r , k ( κ ) .
Proof. For independent framing parameters a i a_i a i , the normalized quadratic solution ψ a = z − a ( 1 + O ( Q ) ) \psi_a=z^{-a}(1+O(Q)) ψ a = z − a ( 1 + O ( Q )) is unique: its positive-degree diagonals E ( e ) − a ⋅ ν ( e ) \mathcal E(\boldsymbol e)-a\cdot\nu(\boldsymbol e) E ( e ) − a ⋅ ν ( e ) are nonzero over Q ( κ , a ) \mathbb Q(\kappa,a) Q ( κ , a ) . Proposition B.5 and commutation with the Hamiltonian therefore give M r , k ψ a = e k ( − a ) ψ a \mathsf M_{r,k}\psi_a=e_k(-a)\psi_a M r , k ψ a = e k ( − a ) ψ a . Proposition 3.4 gives the same action for I r , k \mathsf I_{r,k} I r , k .
Write their difference in normal order as ∑ e ≥ 0 Q e C e ( D ) \sum_{\boldsymbol e\geq0}Q^{\boldsymbol e}C_{\boldsymbol e}(D) ∑ e ≥ 0 Q e C e ( D ) . Its chamber constant is zero. A nonzero coefficient of least total degree would give C e ( − a ) = 0 C_{\boldsymbol e}(-a)=0 C e ( − a ) = 0 on applying the difference to ψ a \psi_a ψ a , contrary to independence of the a i a_i a i . Thus the families agree over Q ( κ ) \mathbb Q(\kappa) Q ( κ ) . Polynomial dependence of each chamber coefficient on κ \kappa κ extends the identity to every characteristic-zero specialization. ◻