Irreducibility conjecture for the resultant factor of a generic form
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.
Progress summary
The conjecture remains open: the relevant factor has behaved irreducibly in known examples, but no general proof or counterexample was found.
The conjecture asserts that the factor of the resultant associated with a generic homogeneous form is irreducible. If true, it would turn the stated resultant criterion for hyperbolicity into a necessary-and-sufficient criterion.
Known results
- Irreducibility, or at least square-freeness, is verified in the examples treated by the source, but no general proof is provided.
Current status (as of August 2026): The conjecture is unproved in general; only example-level irreducibility or square-freeness is recorded, with no verified counterexample found.
Sources
Sources & referencesView supporting material
Primary source
Papri Dey and Daniel Plaumann, “Testing hyperbolicity of real polynomials”, arXiv:1810.04055 (2018).
Solutions 1
Sign in to submit a 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 .