Overview
- When is a product of distinct linear integer factors, minus one, irreducible?
- What is the bound in Pólya’s small-value criterion?
- Why do 2n+1 prime or unit values prove irreducibility in degree n?
Schur’s theorem
Theorem · the minus-one case of Schur's problem
For distinct integers , with , the polynomial
is irreducible over .
Proof
A nontrivial factorization gives monic of positive degrees with . At each , the integers multiply to , so . The polynomial has degree less than and at least distinct roots. It must vanish identically, contradicting the monicity of both factors.
Schur posed this problem in 1908. Westlund and Flügel gave the solution in 1909, including the plus-one case below.
References 2
- schur1908problem226The original problem, rather than an attribution of the later solution.Historical citation verification
- gyoryhajdutijdeman2011 · §1, p. 416The minus-one theorem and attribution of the 1909 solution.Source
The plus-one case
Theorem
For distinct integers , with , the polynomial is irreducible over , except for integer translates of
Proof
If with monic integral factors of positive degree, then , so . The polynomial has degree less than and vanishes at all ; hence . Thus , where , and has distinct integer roots.
Let be the least root. One of vanishes at ; the other has distinct integer roots . Its value at has absolute value two, giving
Therefore . For , the two roots differ by two. For , the positive differences are , so the opposite factor is . Subtracting two gives the other factor . These are exactly the two displayed cases, and their factorizations prove reducibility.
References 1
- gyoryhajdutijdeman2011 · §1, p. 416 in the published article; p. 2 in the author manuscriptThe classical exception list and attribution to Westlund and Flügel; an elementary proof is given here.Source
Pólya’s criterion
Theorem · Pólya's criterion
Let have degree , and put . If there are distinct integers such that
then is irreducible over .
Proof
If with positive-degree integral factors, choose the larger degree , so . At every selected integer, , because the other integral factor is nonzero. Choose of those arguments and order them as . Their integer spacing gives . Writing , Lagrange interpolation gives
Consequently , contradicting the strict bound. Gauss's lemma justifies the integral factorization even when is not monic.
Example
For , the ten values at are all . Since , Pólya proves irreducibility without expanding the polynomial. Nonzero values are essential: an integer zero would itself give a rational linear factor.
References 2
- polya1919The classical small-value irreducibility criterion.Source
- gyoryhajdutijdeman2011 · §1, p. 416Confirms the ceiling in N and the strict factorial threshold; the displayed interpolation proof is supplied here.Source
A prime-value criterion
Theorem · prime and unit values
Let be primitive of degree . If is either or a prime at distinct integers , then is irreducible over .
Proof
For a positive-degree integral factorization , every selected argument satisfies , , , or . Those four equations have at most distinct solutions in total, a contradiction.
Example
At , the values of are , all prime. Thus the criterion proves irreducibility. It says nothing about primality at all later arguments; at the value is .
References 1
- ConradIrredQ · Theorem 5.1The finite prime-or-unit-value criterion and its elementary counting proof.Source
Limitations
Remark
A single prime value is insufficient: takes the prime value at . Conversely, is irreducible because its discriminant is , yet every integer value is even and at least . The preceding criterion does not apply.
A single prime value can suffice when extra information controls the factors: Cohn's criterion restricts the coefficients to base digits, while root bounds force nonconstant factors to have large absolute values at a chosen integer. For more general small-value criteria, Levit, Tverberg, and Győry–Hajdu–Tijdeman develop sharper bounds and extensions. The number and sizes of the values are essential hypotheses in these results.
References 4
- ConradIrredQ · §5, p. 5The irreducible polynomial with no prime or unit evaluations.Source
- levit1968Further criteria based on low absolute values.Source
- tverberg1973smallvaluesRefinements of the small-value method.Source
- gyoryhajdutijdeman2011Extensions involving Schur-type and Pólya-type families.Source
Questions
Must an irreducible integer polynomial take a prime or unit value?
Scope. Primitive polynomials in Z[x], with integer arguments and without changing variables
No. The polynomial is primitive and has discriminant , so it is irreducible over . For every integer , the product is nonnegative and even; hence is even and at least four. Thus the prime-value criterion is not necessary for irreducibility.
References 1
- ConradIrredQ · §5, p. 5Elementary counterexample, proved here. The Claimed label records that the cited source is unpublished exposition.Source
Related topics
Foundations: polynomials, fields, and Galois groups
Gauss’s lemma allows integer evaluations to constrain rational factors.
Contrasts withRoot bounds and prime-value criteria
One-value criteria require additional coefficient or root bounds.
Applies toCapelli’s theorem and polynomial composition
Root-field criteria can also apply to compositions arising from Schur-type constructions.
Contrasts withPolynomial factorization algorithms
Evaluation criteria can prove irreducibility without computing a factorization.
Linked from 2 articles
References
- Problem 226
Schur, Issai. Archiv der Mathematik und Physik, 3, 13, 367, 1908.
Historical citation verification - Irreducibility criteria of Schur-type and Pólya-type
Győry, Kálmán and Hajdu, Lajos and Tijdeman, Robert. Monatshefte für Mathematik, 163(4), 415–443, 2011.
Read the source - Verschiedene Bemerkungen zur Zahlentheorie
Pólya, George. Jahresbericht der Deutschen Mathematiker-Vereinigung, 28, 31–40, 1919.
Read the source - Irreducibility tests in Q[T]
Conrad, Keith. Author-hosted expository note.
Read the source - Irreducibility of polynomials with low absolute values
Levit, R. J. Transactions of the American Mathematical Society, 132(2), 297–305, 1968.
Read the source - On the irreducibility of polynomials taking small values
Tverberg, Helge. Mathematica Scandinavica, 32, 5–21, 1973.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.