Overview
- When does Perron’s coefficient inequality prove irreducibility?
- Which root bound makes one prime value sufficient?
- What does Cohn’s theorem say about the digits of a prime?
Perron’s criterion
Theorem · Perron
Let , where and . If
then is irreducible over .
Proof
On , the term strictly dominates the sum of all other terms. Rouché's theorem gives exactly roots inside the unit circle and one outside. If the monic polynomial factored over , one positive-degree monic factor would have all roots strictly inside. Its constant coefficient would be a nonzero integer whose absolute value is the product of numbers smaller than one, an impossibility.
References 2
- perron1907 · Theorem IOriginal source for coefficient-dominance irreducibility.Source
- Prasolov2004 · Theorem 2.2.5A modern presentation of Perron’s criterion.Source
Example
Example ·
Its reciprocal polynomial is
Now , so Perron's criterion proves irreducible. Since the constant term of is nonzero, coefficient reversal preserves factorizations and proves irreducible. The same argument works for for every .
References 1
- perron1907Coefficient-dominance theorem; the reversal and worked family are direct applications.Source
A prime-value criterion
Theorem · prime-value criterion
Let be nonconstant. Suppose an integer satisfies prime and for every complex root of . Then is irreducible over .
In an integral factorization , each positive-degree factor has an integer leading coefficient , so
Both factors would therefore give integer divisors of larger than one in absolute value. A practical sufficient condition is a certified root bound and .
For example, the roots of are , all of absolute value less than . At , the value is , a prime. Every distance is greater than , so the criterion proves irreducibility. Primality can be checked by the primes at most .
References 2
- murty2002primevaluesPrime evaluations together with root or coefficient bounds; the displayed distance criterion is proved in the text.Source
- ConradAllPrimesThe roots of the quartic used in the example.Source
Cohn’s criterion
Cohn's decimal theorem says that if is prime, with , , and , then is irreducible over . Brillhart, Filaseta, and Odlyzko extend the result to arbitrary integer bases , again assuming a nonconstant digit polynomial. The digit restrictions are essential to this statement; a prime value alone does not imply irreducibility.
For instance, is prime, so its decimal digits give the irreducible polynomial . The unrestricted prime-value inference fails for , which takes the prime value at , and is reducible.
References 2
- brillhartfilasetaodlyzko1981 · Theorem 1 (p. 1055) and Corollary 2 (p. 1058)Cohn’s theorem, prime-value root separation, and extension beyond decimal digits.Source
- murty2002primevaluesA further exposition and proof of the arbitrary-base extension.Source
Limitations
The two arguments use integrality in different ways. Perron’s criterion would force a factor to have a nonzero constant coefficient of absolute value less than one. In the prime-value criterion, each nonconstant factor would take an integer value of absolute value greater than one at the chosen point. Both conclusions contradict a factorization in .
Neither argument follows from real-rootedness alone. For example, has only real roots and is reducible.
References 2
- Schinzel2000General reducibility theory and criteria for special forms.Source
- GathenGerhard2013Exact polynomial factorization algorithms.Source
A prime constant term
Let be primitive, with nonzero coefficients and . Suppose is prime. Set
with monic gcd. Then is the cyclotomic part, and is irreducible and nonreciprocal. Thus is irreducible exactly when .
Every root has modulus at least . The prime constant term forces all but one irreducible factor to have constant term ; those factors are cyclotomic. Equality in the triangle inequality identifies their gcd.
For positive coefficients, irreducibility is equivalent to the not all having the same -adic valuation. For example, is irreducible.
References 1
- KoleyReddy2020Criterion · Theorem 3 and Corollary 4, pp. 84–85Primitivity is included explicitly to remove constant-content degeneracies.Source
Questions
Does one prime value prove irreducibility?
Scope. Integer polynomials without additional coefficient or root restrictions
No: takes the prime value at . A distance-to-roots bound, a sufficiently large evaluation, or digit restrictions can turn a prime value into an irreducibility criterion.
References 1
- murty2002primevaluesPrecise additional hypotheses for prime-value arguments.Source
Related topics
Connected diagrams
Browse all diagrams →Reduction modulo primes
Root bounds can prove irreducibility when every prime reduction is reducible.
UsesReciprocal polynomials
Coefficient reversal can put the dominant coefficient in the required position.
Applies toSparse polynomials and factor reversal
Sparse support simplifies root and coefficient-norm estimates.
Contrasts withPolynomial factorization algorithms
A family criterion can give a short proof without general factorization.
Linked from 2 articles
References
- Neue Kriterien für die Irreduzibilität algebraischer Gleichungen
Perron, Oskar. Journal für die reine und angewandte Mathematik, 132, 288–307, 1907.
Read the source - Polynomials
Prasolov, Victor V. Springer, Algorithms and Computation in Mathematics, vol. 11, 2004.
Read the source - Prime numbers and irreducible polynomials
Murty, M. Ram. The American Mathematical Monthly, 109(5), 452–458, 2002.
Read the source - An irreducible that factors modulo all primes
Conrad, Keith. Author-hosted expository note.
Read the source - On an irreducibility theorem of A. Cohn
Brillhart, John and Filaseta, Michael and Odlyzko, Andrew. Canadian Journal of Mathematics, 33(5), 1055–1059, 1981.
Read the source - Polynomials with Special Regard to Reducibility
Schinzel, Andrzej. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 77, 2000.
Read the source - Modern Computer Algebra
von zur Gathen, Joachim and Gerhard, Jürgen. Edition 3. Cambridge University Press, 2013.
Read the source - An irreducibility criterion for polynomials over integers
Koley, Biswajit and Reddy, A. Satyanarayana. Bulletin Mathématique de la Société des Sciences Mathématiques de Roumanie, 63(111)(1), 83–89, 2020.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.