Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (p. 1). An integer is -smooth when each of its prime divisors is at most . A polynomial of positive degree admits smoothness when is -smooth for infinitely many integers , and admits polysmoothness when some non-constant makes every irreducible factor of of degree at most . The paper remarks (p. 1) that polysmoothness implies smoothness for every , by looking at the values for large integers .
Theorem 1.3 (p. 3, quoted). "Let be irreducible, and let be a root of lying in its splitting field. Suppose that for some and of degree , one has . Then is divisible by the minimal polynomial of over , and hence admits polysmoothness ."
The paper reads Schinzel's construction (Acta Arith. 13 (1967), Lemma 10) as an instance of this theorem (pp. 3 and 7--8). After its direct proof, it notes that the theorem is also a special case of a proposition Schinzel attributes to Capelli (Proposition 3.1, p. 7).
Proof pointer
P. 7, where the proof takes . Since , the minimal polynomial of divides , and by Gauss's lemma an integral multiple of it of degree divides in ; the degree is because . The cofactor has degree , so every factor has degree at most .
Read depth
Claims checked: the statement was read clause by clause on the printed page and the short proof was followed step by step. Nothing here is independently reviewed.
Dependencies
None within the paper.
Source. J. W. Bober, D. Fretwell, G. Martin and T. D. Wooley, Smooth values of polynomials, J. Aust. Math. Soc. 108 (2020), no. 2, 245--261, doi:10.1017/S1446788718000320; the arXiv version 1 print (arXiv:1710.01970v1, 5 October 2017) is the edition read, and its labels and pages are cited here, as named on the source card.