Generalizing Schur’s Theorem to Multiple Polynomials

Kosma Kasprzak

Jagiellonian University
Kraków, Poland

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 1/9

Outline

1 Preliminaries

2 Sketch of proof
Field-theoretical steps
Relating minimal polynomials

3 Applications

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 2/9

 Preliminaries

Original Theorem

Theorem (Schur)
For any non-constant polynomial P ∈ Z[x] there are infinitely many primes
p that divide some value of P at an integer point.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 3/9

 Preliminaries

Original Theorem

Theorem (Schur)
For any non-constant polynomial P ∈ Z[x] there are infinitely many primes
p that divide some value of P at an integer point.

Proof sketch
Assume otherwise, and let A be product of all the primes that divide some
value of P. Then for every natural n we have

P(nAP(0)2 )|P(0),

so the polynomial is constant.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 3/9

 Preliminaries

Original Theorem

Theorem (Schur)
For any non-constant polynomial P ∈ Z[x] there are infinitely many primes
p that divide some value of P at an integer point.

Example (Cyclotomic polynomials)

It is not difficult to show that if p|Φn (a) for prime p, where Φn is the n-th
cyclotomic polynomial, then p ≡ 1 (mod n) or p|n. Now Schur’s Theorem
implies that there are inifinitely primes congruent to 1 mod n.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 3/9

 Preliminaries

General version

Theorem
For any k and polynomials P1 , . . . , Pk ∈ Z[x] there exist infinitely many
primes p that divide some element of Pi (Z) for all i.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 4/9

 Preliminaries

General version

Theorem
For any k and polynomials P1 , . . . , Pk ∈ Z[x] there exist infinitely many
primes p that divide some element of Pi (Z) for all i.

Definition
We say that a prime p divides a rational number a/b in reduced terms, if
it divides a but not b.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 4/9

 Preliminaries

General version

Theorem
For any k and polynomials P1 , . . . , Pk ∈ Z[x] there exist infinitely many
primes p that divide some element of Pi (Z) for all i.

Definition
We say that a prime p divides a rational number a/b in reduced terms, if
it divides a but not b.

Theorem
For P1 , P2 ∈ Q[x] there exist infinitely many primes p that divide some
element of Pi (Q) for all i.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 4/9

 Sketch of proof Field-theoretical steps

First steps

We pick any irreducible factors f , g of P1 , P2 , and let α, β be any roots of

f , g . It suffices to show the theorem for f , g .

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 5/9

 Sketch of proof Field-theoretical steps

First steps

We pick any irreducible factors f , g of P1 , P2 , and let α, β be any roots of

f , g . It suffices to show the theorem for f , g .
We now want to use the following theorem:

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 5/9

 Sketch of proof Field-theoretical steps

First steps

We pick any irreducible factors f , g of P1 , P2 , and let α, β be any roots of

f , g . It suffices to show the theorem for f , g .
We now want to use the following theorem:

Theorem (Primitive element theorem)

Any seperable field extension of finite degree is simple.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 5/9

 Sketch of proof Field-theoretical steps

First steps

We pick any irreducible factors f , g of P1 , P2 , and let α, β be any roots of

f , g . It suffices to show the theorem for f , g .
We now want to use the following theorem:

Theorem (Primitive element theorem)

Any seperable field extension of finite degree is simple.

In particular, the extension Q(α, β) over Q is generated by a single

element, so Q(α, β) = Q(γ) for some γ ∈ C.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 5/9

 Sketch of proof Field-theoretical steps

Primitive element theorem

Consider γ = α + tβ for t ∈ Q. Assume that Q(α, β) ̸= Q(α + tβ).

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 6/9

 Sketch of proof Field-theoretical steps

Primitive element theorem

Consider γ = α + tβ for t ∈ Q. Assume that Q(α, β) ̸= Q(α + tβ). Then

one can show, that there exists a nontrivial automorphism σ of Q(α, β)
fixing Q(α + tβ).

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 6/9

 Sketch of proof Field-theoretical steps

Primitive element theorem

Consider γ = α + tβ for t ∈ Q. Assume that Q(α, β) ̸= Q(α + tβ). Then

one can show, that there exists a nontrivial automorphism σ of Q(α, β)
fixing Q(α + tβ).Then α + tβ = σ(α) + tσ(β), so
t = (σ(α) − α)/(β − σ(β)).

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 6/9

 Sketch of proof Field-theoretical steps

Primitive element theorem

Consider γ = α + tβ for t ∈ Q. Assume that Q(α, β) ̸= Q(α + tβ). Then

one can show, that there exists a nontrivial automorphism σ of Q(α, β)
fixing Q(α + tβ).Then α + tβ = σ(α) + tσ(β), so
t = (σ(α) − α)/(β − σ(β)). But σ can send α and β only to other roots
of f and g , so there are only finitely many such t. Thus for infinitely many
t we have Q(α, β) = Q(α + tβ).

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 6/9

 Sketch of proof Relating minimal polynomials

Now, if H is the minimal polynomial of γ = α + tβ, we have

Since α is in Q(γ), there exists some

polynomial P ∈ Q[x] for which
P(γ) = α. Then f (P(γ)) = 0, so H
divides f ◦ P. Let the quotient be
A/a for some polynomial A ∈ Z[x]
and integer a.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 7/9

 Sketch of proof Relating minimal polynomials

Now, if H is the minimal polynomial of γ = α + tβ, we have

Since α is in Q(γ), there exists some

polynomial P ∈ Q[x] for which
P(γ) = α. Then f (P(γ)) = 0, so H
divides f ◦ P. Let the quotient be
A/a for some polynomial A ∈ Z[x]
and integer a.
Now, if p ∤ a divides some H(q) for
rational q, it divides
H(q)A(q) = af (P(q)), and so it
divides the value of f at P(q) ∈ Q.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 7/9

 Sketch of proof Relating minimal polynomials

Now, if H is the minimal polynomial of γ = α + tβ, we have

Since α is in Q(γ), there exists some
polynomial P ∈ Q[x] for which
P(γ) = α. Then f (P(γ)) = 0, so H
divides f ◦ P. Let the quotient be
A/a for some polynomial A ∈ Z[x]
and integer a.
Now, if p ∤ a divides some H(q) for
rational q, it divides
H(q)A(q) = af (P(q)), and so it
divides the value of f at P(q) ∈ Q.
Since β is in Q(γ), there exists some
polynomial Q ∈ Q[x] for which
Q(γ) = β. Then g (Q(γ)) = 0, so H
divides g ◦ Q. Let the quotient be
B/b for some polynomial B ∈ Z[x]
and integer b.
Now, if p ∤ b divides some H(q) for
rational q, it divides
H(q)B(q) = bf (Q(q)), and so it
divides the value of g at Q(q) ∈ Q.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 7/9

 Sketch of proof Relating minimal polynomials

Now, if H is the minimal polynomial of γ = α + tβ, we have

Since α is in Q(γ), there exists some
polynomial P ∈ Q[x] for which
P(γ) = α. Then f (P(γ)) = 0, so H
divides f ◦ P. Let the quotient be
A/a for some polynomial A ∈ Z[x]
and integer a.
Now, if p ∤ a divides some H(q) for
rational q, it divides
H(q)A(q) = af (P(q)), and so it
divides the value of f at P(q) ∈ Q.
Since β is in Q(γ), there exists some
polynomial Q ∈ Q[x] for which
Q(γ) = β. Then g (Q(γ)) = 0, so H
divides g ◦ Q. Let the quotient be
B/b for some polynomial B ∈ Z[x]
and integer b.
Now, if p ∤ b divides some H(q) for
rational q, it divides
H(q)B(q) = bf (Q(q)), and so it
divides the value of g at Q(q) ∈ Q.

Hence, if prime p ∤ ab divides some value of H, it divides some value of f

and g . By the original Schur’s Theorem there are infinitely many such
primes.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 7/9

 Applications

Applications

Powers modulo p
Using the theorem for polynomials x n − i, where 1 ⩽ i ⩽ n, we get that
for any natural n there are infinetly many primes p such that each number
between 1 and n is an n-th power modulo p.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 8/9

 Applications

Applications

Powers modulo p
Using the theorem for polynomials x n − i, where 1 ⩽ i ⩽ n, we get that
for any natural n there are infinetly many primes p such that each number
between 1 and n is an n-th power modulo p.

Cyclotomic polynomials
For any polynomial P and number n, we can apply the theorem to P and
Φn . We get infinitely many prime numbers congruent to 1 modulo n
dividing some value of P.

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 8/9

 Applications

Thanks for your attention!

Kosma Kasprzak (UJ) Generalizing Schur’s Theorem 15.12.2022 9/9