Irreducibility conjecture for the resultant factor of a generic form

About 8 years old · traced to

Let FF be a generic homogeneous form, and let RF\mathcal{R}_F denote the factor of the resultant appearing in Theorem. Irreducibility conjecture. The polynomial RF\mathcal{R}_F is irreducible. This conjecture would make the resultant criterion for hyperbolicity both necessary and sufficient, yielding a neater version of the theorem. The source notes that irreducibility, or at least square-freeness, holds in the examples considered but does not provide a general proof.

References

Primary source

Papri Dey and Daniel Plaumann, “Testing hyperbolicity of real polynomials”, arXiv:1810.04055 (2018).

Progress summary

Refreshed
Claimed solved

The conjecture has only been checked in examples, but an unverified posted argument claims it is false for binary forms and true generically in higher dimensions.

Dey and Plaumann posed the conjecture in 2018: the resultant factor associated with a generic homogeneous form should be irreducible, making their hyperbolicity criterion necessary as well as sufficient.

Known results

  • Dey and Plaumann, 2018: irreducibility, or at least square-freeness, holds in the examples treated, but no general proof is given.

Posted attempt

An unverified argument claims the unrestricted statement fails for binary forms, giving a reducible residual factor, while for at least three variables it claims generic absolute irreducibility in every degree via a specialization with Galois group SdS_d and a transitivity argument. The attempt has not been independently verified.

Current status (as of August 2026): The original conjecture remains unresolved in the literature; a posted argument claims a counterexample in the binary case and a corrected theorem in higher dimensions, but neither claim is independently verified.

Sources

Solutions 1

CounterexampleThis solution needs a summarySee full solutionHide full solution

The conjecture requires an omitted dimension hypothesis. It is false for binary forms, while in at least three variables the stronger assertion of generic absolute irreducibility holds in every degree.

Write

F(T,x)=∏j=1d(T−rj),F(T,\mathbf x)=\prod_{j=1}^d(T-r_j),

put y=t2y=t_2, u=t1u=t_1, and set

R=F(u+iy,x)+F(u−iy,x)2,I=F(u+iy,x)−F(u−iy,x)2i.R=\frac{F(u+iy,\mathbf x)+F(u-iy,\mathbf x)}2, \qquad I=\frac{F(u+iy,\mathbf x)-F(u-iy,\mathbf x)}{2i}.

With C=(d2)C=\binom d2, the universal resultant identity is

Res⁡u(R,I)=(−1)Cyd∏j<k((rj−rk)2+4y2).(1)\operatorname{Res}_u(R,I) = (-1)^C y^d \prod_{j<k} \left((r_j-r_k)^2+4y^2\right). \tag{1}

Indeed, for A=F(u+iy,x)A=F(u+iy,\mathbf x) and B=F(u−iy,x)B=F(u-iy,\mathbf x),

Res⁡(A,B)=(−2i)dRes⁡(R,I),\operatorname{Res}(A,B)=(-2i)^d\operatorname{Res}(R,I),

and evaluating BB at the roots u=rj−iyu=r_j-iy of AA gives (1). For separable FF, this shows that the extracted exponent is p=dp=d, and the residual factor has degree d(d−1)d(d-1).

Suppose first that n≥2n\ge2 and d≥2d\ge2. Consider the normalized homogeneous specialization

F∗(T,x1,x2)=Td+x1d−1T+x1d−1x2.F_*(T,x_1,x_2) = T^d+x_1^{d-1}T+x_1^{d-1}x_2.

Writing T=x1ZT=x_1Z and s=x2/x1s=x_2/x_1 gives

qs(Z)=Zd+Z+s.q_s(Z)=Z^d+Z+s.

This polynomial has Galois group SdS_d over C(s)\mathbb C(s): the cover

s=−Zd−Zs=-Z^d-Z

is connected, its d−1d-1 critical points satisfy

dZd−1+1=0,dZ^{d-1}+1=0,

and their critical values −(d−1)Z/d-(d-1)Z/d are pairwise distinct. Thus its finite branch monodromies are transpositions generating a transitive group, which must be SdS_d.

The d(d−1)d(d-1) ordered root differences rj−rkr_j-r_k, j≠kj\ne k, are distinct. Coincidences sharing a first or last index force equal roots; reversed pairs would give 2(rj−rk)=02(r_j-r_k)=0; coincidences involving four distinct indices are ruled out by applying a transposition. In the remaining three-index case, a relation

2rj=ri+rk2r_j=r_i+r_k

and its image under the transposition (ij)(ij) imply

3(ri−rj)=0,3(r_i-r_j)=0,

again impossible.

Hence SdS_d acts transitively on all roots

y=i(rj−rk)2y=\frac{i(r_j-r_k)}2

of the residual factor. That factor is irreducible over C(x1,x2)[y]\mathbb C(x_1,x_2)[y]. Its nonzero constant leading coefficient in yy makes it primitive, so Gauss's lemma gives irreducibility in

C[x1,…,xn,y].\mathbb C[x_1,\ldots,x_n,y].

For fixed n,dn,d, reducible homogeneous forms of a given degree form a Zariski-closed subset of projective coefficient space: they are the finite union of the images of projective multiplication maps. Since F∗F_* lies outside this subset, a generic normalized form has an absolutely irreducible residual factor for every n≥2n\ge2.

However, the original conjecture does not assume n≥2n\ge2. For n=1n=1 and d≥3d\ge3, the residual factor is a real homogeneous binary form of degree

d(d−1)>2.d(d-1)>2.

Every such binary form factors over R\mathbb R into linear and quadratic factors, so it is always reducible. Explicitly, take

F(T,x)=T(T−x)(T−3x).F(T,x)=T(T-x)(T-3x).

Formula (1) gives

Res⁡u(R,I)=−y3(x2+4y2)(4x2+4y2)(9x2+4y2),\operatorname{Res}_u(R,I) = -y^3 (x^2+4y^2) (4x^2+4y^2) (9x^2+4y^2),

whose residual factor is reducible.

Therefore the unrestricted conjecture is false, whereas the corrected hypothesis n≥2n\ge2 gives generic absolute irreducibility in every degree d≥2d\ge2.