Irreducibility conjecture for the resultant factor of a generic form
Let be a generic homogeneous form, and let denote the factor of the resultant appearing in Theorem. Irreducibility conjecture. The polynomial 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
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 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 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
put , , and set
With , the universal resultant identity is
Indeed, for and ,
and evaluating at the roots of gives (1). For separable , this shows that the extracted exponent is , and the residual factor has degree .
Suppose first that and . Consider the normalized homogeneous specialization
Writing and gives
This polynomial has Galois group over : the cover
is connected, its critical points satisfy
and their critical values are pairwise distinct. Thus its finite branch monodromies are transpositions generating a transitive group, which must be .
The ordered root differences , , are distinct. Coincidences sharing a first or last index force equal roots; reversed pairs would give ; coincidences involving four distinct indices are ruled out by applying a transposition. In the remaining three-index case, a relation
and its image under the transposition imply
again impossible.
Hence acts transitively on all roots
of the residual factor. That factor is irreducible over . Its nonzero constant leading coefficient in makes it primitive, so Gauss's lemma gives irreducibility in
For fixed , 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 lies outside this subset, a generic normalized form has an absolutely irreducible residual factor for every .
However, the original conjecture does not assume . For and , the residual factor is a real homogeneous binary form of degree
Every such binary form factors over into linear and quadratic factors, so it is always reducible. Explicitly, take
Formula (1) gives
whose residual factor is reducible.
Therefore the unrestricted conjecture is false, whereas the corrected hypothesis gives generic absolute irreducibility in every degree .