Factorization conjecture for the determinant of the Painlevé coefficient matrix

About 3 years old · traced to

Let ν⩾3\nu\geqslant3, let f~0,f~1,…,f~ν−1\tilde f_0,\tilde f_1,\ldots,\tilde f_{\nu-1} be algebraically independent variables, and let Fν(z)F_\nu(z) be the matrix introduced in the paper. Regard det⁡(Fν(z))\det(F_\nu(z)) as a polynomial in zz over Z[f~0,f~1,…,f~ν−1]\mathbb{Z}[\tilde f_0,\tilde f_1,\ldots,\tilde f_{\nu-1}]. Determinant-factorization conjecture. The polynomial det⁡(Fν(z))\det(F_\nu(z)) is always reducible over Z[f~0,f~1,…,f~ν−1]\mathbb{Z}[\tilde f_0,\tilde f_1,\ldots,\tilde f_{\nu-1}], with the number of factors equal to the number of divisors of ν\nu, including 11 and ν\nu; one factor is a polynomial in zz of degree ν−1\nu-1. The examples and partial calculations support this factorization pattern, but no proof or general resolution is given in the supplied text.

References

Primary source

A. V. Kitaev and A. Vartanian, “Algebroid Solutions of the Degenerate Third Painlevé Equation for Vanishing Formal Monodromy Parameter”, arXiv:2304.05671 (2023).

Progress summary

Refreshed
Claimed solved

A reader-written argument claims a complete factorization in every dimension, but no independent verification has been found.

The conjecture asserts that the determinant factors over the stated integer polynomial ring into exactly as many factors as the number of divisors of ν\nu, including a factor of degree ν−1\nu-1 in zz. The supplied paper gives examples and partial calculations but no general proof.

Posted attempt

An explicit argument claims a complete irreducible factorization for every n≥3n\ge3: evaluate at the roots of Xn−zX^n-z, use two Vandermonde determinants, and group the resulting factors by the order of root ratios. It further claims Galois-orbit arguments prove irreducibility over Z[z,f0,…,fn−1]\mathbb{Z}[z,f_0,\ldots,f_{n-1}] and establish the predicted zz-degrees. This complete-proof claim has not been independently verified.

Current status (as of August 2026): A complete factorization is claimed in an unverified reader-written argument; no published or independently checked proof is recorded.

Sources

Solutions 1

ProofThis solution needs a summarySee full solutionHide full solution

In fact, there is an explicit complete irreducible factorization for every n≥3n\ge3.

Let

g(X)=∑r=0n−1frXr,g(X)=\sum_{r=0}^{n-1}f_rX^r,

and define the source's coefficient matrix Fn=(Fk,r)F_n=(F_{k,r}) by

g(X)k≡∑r=0n−1Fk,rXr(modXn−z),1≤k≤n.g(X)^k\equiv\sum_{r=0}^{n-1}F_{k,r}X^r \pmod{X^n-z}, \qquad 1\le k\le n.

Choose a primitive nnth root of unity ζ\zeta, let tn=zt^n=z, and put tj=ζjtt_j=\zeta^jt. Define

H(X,Y)=g(X)−g(Y)X−Y.H(X,Y)=\frac{g(X)-g(Y)}{X-Y}.

For every divisor d>1d>1 of nn, put

Dd=∏0≤i<j<nord⁡(tj/ti)=dH(ti,tj),D_d= \prod_{\substack{0\le i<j<n\\ \operatorname{ord}(t_j/t_i)=d}} H(t_i,t_j),

and put

D1=∏j=0n−1g(tj)=Res⁡X(Xn−z,g(X)).D_1=\prod_{j=0}^{n-1}g(t_j) =\operatorname{Res}_X(X^n-z,g(X)).

Then

det⁡Fn=∏d∣nDd,\boxed{\det F_n=\prod_{d\mid n}D_d,}

where every DdD_d belongs to Z[z,f0,…,fn−1]\mathbb Z[z,f_0,\ldots,f_{n-1}], is irreducible there, and the factors are pairwise nonassociate. Moreover,

deg⁡zD1=n−1,deg⁡zDd=(n−2)φ(d)2(d>1).\deg_z D_1=n-1,\qquad \deg_zD_d=\frac{(n-2)\varphi(d)}2\quad(d>1).

To prove the factorization, work over

L=Q(z)(t,ζ)L=\mathbb Q(z)(t,\zeta)

and introduce

Vr,j=tjr,Mk,j=g(tj)k.V_{r,j}=t_j^r,\qquad M_{k,j}=g(t_j)^k.

Evaluation at the roots of Xn−zX^n-z gives FnV=MF_nV=M. The two Vandermonde determinants yield

det⁡Fn=(∏jg(tj))∏i<jg(tj)−g(ti)tj−ti,\det F_n =\left(\prod_jg(t_j)\right) \prod_{i<j}\frac{g(t_j)-g(t_i)}{t_j-t_i},

which is the asserted product after grouping unordered pairs by the order of tj/tit_j/t_i.

The splitting-field Galois group is

Gal⁡(L/Q(z))=Cn⋊(Z/nZ)×,\operatorname{Gal}(L/\mathbb Q(z)) =C_n\rtimes(\mathbb Z/n\mathbb Z)^\times,

acting by

tj⟼tuj+a,a∈Z/nZ,u∈(Z/nZ)×.t_j\longmapsto t_{uj+a}, \qquad a\in\mathbb Z/n\mathbb Z,\quad u\in(\mathbb Z/n\mathbb Z)^\times.

It acts transitively on the roots tjt_j, and separately transitively on each set of unordered pairs with fixed ratio order dd. Such a set has

nφ(d)2\frac{n\varphi(d)}2

pairs. The orbit products DdD_d are therefore Galois invariant. Their coefficients belong initially to Z[ζ,t]\mathbb Z[\zeta,t]; invariance under t↦ζtt\mapsto\zeta t leaves only powers of tn=zt^n=z, and invariance under ζ↦ζu\zeta\mapsto\zeta^u then gives coefficients in Z[z]\mathbb Z[z].

The linear factors g(tj)g(t_j) are pairwise nonassociate because their f0f_0-coefficients equal 11, while their f1f_1-coefficients are the distinct tjt_j. Transitivity therefore makes D1D_1 irreducible over Q(z)\mathbb Q(z).

Likewise, each H(ti,tj)H(t_i,t_j) is linear in f1,…,fn−1f_1,\ldots,f_{n-1} and has f1f_1-coefficient 11. For n≥4n\ge4, its next two coefficients are

[f2]H(ti,tj)=ti+tj,[f3]H(ti,tj)=(ti+tj)2−titj.[f_2]H(t_i,t_j)=t_i+t_j, \qquad [f_3]H(t_i,t_j) =(t_i+t_j)^2-t_it_j.

These recover the unordered pair {ti,tj}\{t_i,t_j\}, so all the linear factors are distinct. For n=3n=3, the sum ti+tjt_i+t_j already determines the omitted third root. Thus transitivity of each pair orbit makes every DdD_d irreducible over Q(z)\mathbb Q(z).

Finally, D1D_1 contains f0nf_0^n with coefficient 11, and DdD_d contains

f1nφ(d)/2f_1^{n\varphi(d)/2}

with coefficient 11. Hence all the factors are primitive over the UFD Z[z]\mathbb Z[z], and Gauss's lemma upgrades their irreducibility to

Z[z,f0,…,fn−1].\mathbb Z[z,f_0,\ldots,f_{n-1}].

Distinct divisor orbits give distinct factors, while D1D_1 is distinguished by its dependence on f0f_0.

The zz-degree of D1D_1 is n−1n-1, with leading term

(−1)n−1fn−1nzn−1.(-1)^{n-1}f_{n-1}^nz^{n-1}.

For d>1d>1, each divided-difference factor has nonzero highest tt-degree n−2n-2, and there are nφ(d)/2n\varphi(d)/2 such factors. Since tn=zt^n=z,

deg⁡zDd=(n−2)φ(d)2.\deg_zD_d=\frac{(n-2)\varphi(d)}2.

Therefore det⁡Fn\det F_n has exactly τ(n)\tau(n) irreducible factors for every n≥3n\ge3, including the required factor of zz-degree n−1n-1.