Overview

  • Why do coprime degrees imply absolute irreducibility of f(x)−g(y)?
  • When is a sum of three nonconstant univariate polynomials irreducible?
  • What is known about the classification of reducible pairs f(x)−g(y)?

Coprime degrees

Theorem

Let f,g∈K[t]f,g\in K[t] be nonconstant, of degrees m,nm,n. If gcd⁡(m,n)=1\gcd(m,n)=1, then f(x)−g(y)f(x)-g(y) is absolutely irreducible. The field may have any characteristic.

Work over K‾(x)\overline K(x) with the valuation v∞(A/B)=deg⁡B−deg⁡Av_\infty(A/B)=\deg B-\deg A. As a polynomial in yy, g(y)−f(x)g(y)-f(x) has constant coefficient of valuation −m-m, leading coefficient of valuation zero, and all intermediate nonzero coefficients of valuation zero. Its lower Newton polygon is one segment from (0,−m)(0,-m) to (n,0)(n,0). Since its slope is m/nm/n in lowest terms, the degree in yy of every nonconstant factor is divisible by nn. The polynomial is therefore irreducible over K‾(x)\overline K(x). Its leading coefficient is constant, so Gauss’s lemma gives absolute irreducibility in two variables.

For example, x3+x−y2−1x^3+x-y^2-1 is absolutely irreducible over every field. When the degrees have a common divisor, this argument is inconclusive: x2−y2x^2-y^2 factors, whereas x2−y2−1x^2-y^2-1 is absolutely irreducible in characteristic different from two.

References 1

A degree criterion

The same proof applies to

F(x,y)=cyn+a1(x)yn−1+⋯+an(x),c∈K×.F(x,y)=cy^n+a_1(x)y^{n-1}+\cdots+a_n(x),\qquad c\in K^\times.

Put m=deg⁡an>0m=\deg a_n>0. If

deg⁡ai≤imn(1≤i<n),gcd⁡(m,n)=1,\deg a_i\le\frac{im}{n}\quad(1\le i<n),\qquad \gcd(m,n)=1,

then FF is absolutely irreducible. The inequalities place every intermediate valuation point on or above the segment joining (0,−m)(0,-m) and (n,0)(n,0).

Example

The polynomial y3+xy2+x3y+x5+1y^3+xy^2+x^3y+x^5+1 satisfies the inequalities with (m,n)=(5,3)(m,n)=(5,3): 1≤5/31\le5/3 and 3≤10/33\le10/3. It is absolutely irreducible in every characteristic.

References 1

Sums in three or more variables

Theorem (Tverberg)

Let KK have characteristic zero, let r≥3r\ge3, and let each fi∈K[xi]f_i\in K[x_i] be nonconstant. Then f1(x1)+⋯+fr(xr)f_1(x_1)+\cdots+f_r(x_r) is absolutely irreducible.

No coprimality condition on the degrees is required. For instance, x4+y4+z4x^4+y^4+z^4 is absolutely irreducible over Q\mathbb Q. The characteristic assumption cannot be dropped: in characteristic pp, xp+yp+zp=(x+y+z)px^p+y^p+z^p=(x+y+z)^p.

Tverberg also studied the positive-characteristic exceptions for three variables. Singh and Khanduja extended this work to any number of variables at least three. Their result concerns additive-polynomial obstructions.

References 3

Critical values

For f,g∈C[t]f,g\in\mathbb C[t], the roots of disc⁡t(f(t)+λ)\operatorname{disc}_t(f(t)+\lambda) are the negatives of the critical values of ff. They record where the roots merge as the value of the polynomial changes.

A criterion of Davenport–Lewis–Schinzel, stated as Theorem A by Brindza–Pintér, is the following. For f,g∈Z[t]f,g\in\mathbb Z[t], if deg⁡f=n>1\deg f=n>1, deg⁡g=m>1\deg g=m>1, and at least ⌊n/2⌋\lfloor n/2\rfloor distinct roots of D(λ)=disc⁡(f+λ)D(\lambda)=\operatorname{disc}(f+\lambda) are not roots of E(λ)=disc⁡(g+λ)E(\lambda)=\operatorname{disc}(g+\lambda), then f(x)−g(y)f(x)-g(y) is irreducible over C\mathbb C. Brindza–Pintér apply the criterion to products of consecutive linear factors.

This uses the positions of branch values, rather than only the degrees. The associated monodromy actions explain why two polynomials with equal degrees can behave quite differently.

References 2

Composition and reducible pairs

A common left composition factor gives a direct factorization. If f=h∘uf=h\circ u, g=h∘vg=h\circ v, and deg⁡h>1\deg h>1, then u(x)−v(y)u(x)-v(y) divides f(x)−g(y)f(x)-g(y), because U−VU-V divides h(U)−h(V)h(U)-h(V). Both resulting factors are nonconstant.

There are also exceptional pairs without a common left factor. Cassou-Noguès and Couveignes give explicit families in degrees 7,11,13,15,21,317,11,13,15,21,31, linked to different permutation actions of the same monodromy group.

Claimed in a 2026 preprint. Behajaina–König–Neftin’s Theorem 1.1 classifies all reducible pairs over C\mathbb C: they arise from a common left factor, the listed exceptional pairs, or the Chebyshev pair (C4,−C4)(C_4,-C_4), with C4(t)=t4−4t2+2C_4(t)=t^4-4t^2+2, by the compositions specified in the theorem.

Here Cn(z+z−1)=zn+z−nC_n(z+z^{-1})=z^n+z^{-n}. In terms of the convention Tn(cos⁡θ)=cos⁡(nθ)T_n(\cos\theta)=\cos(n\theta) used in polynomial decomposition, one has Cn(x)=2Tn(x/2)C_n(x)=2T_n(x/2). The preprint writes TnT_n for our CnC_n.

Example

C4(x)+C4(y)=(x2+y2−2−2 xy)(x2+y2−2+2 xy).C_4(x)+C_4(y)=(x^2+y^2-2-\sqrt2\,xy)(x^2+y^2-2+\sqrt2\,xy).

Multiplication proves this identity directly, independently of the claimed classification.

References 2

Connections and evidence

Claimed · preprint

A complete proposed classification of reducible f(X) − g(Y)

The 2026 DLS preprint claims an if-and-only-if classification over C\mathbb C, including decomposable polynomials: common outer factors, the exact six exceptional families, or the signed quartic Chebyshev pair.

Scope. Let f,g∈C[X]f,g\in\mathbb C[X] have degree greater than one. The classification is Theorem 1.1 of arXiv:2603.27728v1 (29 March 2026), recorded as a preprint claim.

A complete proposed classification of reducible f(X) − g(Y)The 2026 DLS preprint claims an if-and-only-if classification over \(\mathbb C\), including decomposable polynomials: common outer factors, the exact six exceptional families, or the signed quartic Chebyshev pair. Connection 1: Common nonlinear outer factor is an input to OR. There exist nonconstant \(u,v\) and \(h\) of degree at least two with \(f=h\circ u\) and \(g=h\circ v\). Preprint claim. Connection 2: Exact exceptional pair families is an input to OR. There are nonconstant \(u,v\), affine \(\mu\), and an exact pair \((h_1,h_2)\) from Cassou–Noguès–Couveignes §5 with \(f=\mu\circ h_1\circ u\), \(g=\mu\circ h_2\circ v\). Preprint claim. Connection 3: Signed quartic Chebyshev pair is an input to OR. There are nonconstant \(u,v\) and affine \(\mu\) with \(f=\mu\circ T_4\circ u\), \(g=\mu\circ(-T_4)\circ v\), where \(T_4=X^4-4X^2+2\). Preprint claim. Connection 4: OR is equivalent to Reducible separated polynomial. The preprint asserts that the union of the three displayed cases is necessary and sufficient for reducibility over the complex numbers. Preprint claim. Connection 5: Reducible separated polynomial is equivalent to Reducible fiber product of covers. Reducibility of the separated polynomial is equivalent to reducibility of the fiber product of the two polynomial maps to the projective line. Connection 6: Reducible fiber product of covers is an input to Monodromy and composition factors. The proof translates the fiber product into monodromy actions and studies kernels along polynomial decompositions. Connection 7: Monodromy and composition factors is an input to OR. The preprint combines its solvable-case analysis with the established exceptional pairs to rule out additional minimal cases. Preprint claim.Common nonlinear outer factor — related articleCommon nonlinear outerfactorExact exceptional pair families — related articleExact exceptional pairfamiliesSigned quartic Chebyshev pair — related articleSigned quartic ChebyshevpairORORReducible separated polynomial — related articleReducible separatedpolynomialReducible fiber product of covers — related articleReducible fiber product ofcoversMonodromy and composition factors — related articleMonodromy andcomposition factorsConnection 1: There exist nonconstant \(u,v\) and \(h\) of degree at least two with \(f=h\circ u\) and \(g=h\circ v\).Case 1 [1]Connection 2: There are nonconstant \(u,v\), affine \(\mu\), and an exact pair \((h_1,h_2)\) from Cassou–Noguès–Couveignes §5 with \(f=\mu\circ h_1\circ u\), \(g=\mu\circ h_2\circ v\).Case 2 [2]Connection 3: There are nonconstant \(u,v\) and affine \(\mu\) with \(f=\mu\circ T_4\circ u\), \(g=\mu\circ(-T_4)\circ v\), where \(T_4=X^4-4X^2+2\).Case 3 [3]Connection 4: The preprint asserts that the union of the three displayed cases is necessary and sufficient for reducibility over the complex numbers.Claimed exhaustive iff[4]Connection 5: Reducibility of the separated polynomial is equivalent to reducibility of the fiber product of the two polynomial maps to the projective line.Curve interpretation [5]Connection 6: The proof translates the fiber product into monodromy actions and studies kernels along polynomial decompositions.Galois analysis [6]Connection 7: The preprint combines its solvable-case analysis with the established exceptional pairs to rule out additional minimal cases.Exhaustiveness argument[7]
Linked nodes open articles; numbered connections open the evidence below.Open full-size diagram

deduction or information flow equivalence preprint claimOR alternatives

Preprint claim, exact scope. Behajaina–König–Neftin, Theorem 1.1, states that f(X)−g(Y)f(X)-g(Y) is reducible over C\mathbb C exactly when at least one of the following occurs. All inner polynomials u,vu,v are nonconstant; μ(X)=aX+b\mu(X)=aX+b has a≠0a\ne0.

  1. f=h∘uf=h\circ u and g=h∘vg=h\circ v, with deg⁡h≥2\deg h\ge2.
  2. f=μ∘h1∘uf=\mu\circ h_1\circ u and g=μ∘h2∘vg=\mu\circ h_2\circ v, for an exact exceptional pair (h1,h2)(h_1,h_2) in Cassou–Noguès–Couveignes, §5.
  3. f=μ∘T4∘uf=\mu\circ T_4\circ u and g=μ∘(−T4)∘vg=\mu\circ(-T_4)\circ v, with T4=X4−4X2+2T_4=X^4-4X^2+2.

Case 2 refers to the coefficient formulas, parameter families, and coefficient conjugations in the following source locations; the degrees alone are not a criterion.

DegreeExact exceptional family
7§5.1, p. 310
11§5.2, p. 310
13§5.3, p. 311
15§5.4, pp. 311–312
21§5.5, pp. 312–313
31§5.6, pp. 313–315

The normalization satisfies Tm(z+z−1)=zm+z−mT_m(z+z^{-1})=z^m+z^{-m}. Case 3 is visible directly:

T4(X)+T4(Y)=(X2+Y2−2+2XY)(X2+Y2−2−2XY).T_4(X)+T_4(Y)=(X^2+Y^2-2+\sqrt2XY)(X^2+Y^2-2-\sqrt2XY).

The claimed advance is exhaustiveness for arbitrary decomposable pairs. It does not by itself classify reducible arithmetic fibers f(X)−af(X)-a, whose Hilbert–Siegel analysis is a separate, more restricted result.

Inspect all 7 connections and exact references
Evidence for each connection
ConnectionStatement and source
1Common nonlinear outer factor → ORConstruction / input · preprint

There exist nonconstant u,vu,v and hh of degree at least two with f=h∘uf=h\circ u and g=h∘vg=h\circ v.

2Exact exceptional pair families → ORConstruction / input · preprint

There are nonconstant u,vu,v, affine μ\mu, and an exact pair (h1,h2)(h_1,h_2) from Cassou–Noguès–Couveignes §5 with f=μ∘h1∘uf=\mu\circ h_1\circ u, g=μ∘h2∘vg=\mu\circ h_2\circ v.

3Signed quartic Chebyshev pair → ORConstruction / input · preprint

There are nonconstant u,vu,v and affine μ\mu with f=μ∘T4∘uf=\mu\circ T_4\circ u, g=μ∘(−T4)∘vg=\mu\circ(-T_4)\circ v, where T4=X4−4X2+2T_4=X^4-4X^2+2.

4OR ↔ Reducible separated polynomialEquivalence · preprint

The preprint asserts that the union of the three displayed cases is necessary and sufficient for reducibility over the complex numbers.

5Reducible separated polynomial ↔ Reducible fiber product of coversEquivalence

Reducibility of the separated polynomial is equivalent to reducibility of the fiber product of the two polynomial maps to the projective line.

6Reducible fiber product of covers → Monodromy and composition factorsConstruction / input

The proof translates the fiber product into monodromy actions and studies kernels along polynomial decompositions.

7Monodromy and composition factors → ORConstruction / input · preprint

The preprint combines its solvable-case analysis with the established exceptional pairs to rule out additional minimal cases.

Sources and scope checked .

Questions

Related topics

References

  1. On the generalized difference polynomials

    Panaitopol, Laurenţiu and Ştefănescu, Doru. Pacific Journal of Mathematics, 143(2), 341–348, 1990.

    Read the source
  2. Polynomials with Special Regard to Reducibility

    Schinzel, Andrzej. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 77, 2000.

    Read the source
  3. On the irreducibility of polynomials f(x)+g(y)+h(z)

    Tverberg, Helge. The Quarterly Journal of Mathematics, 17(1), 364–366, 1966.

    Read the source
  4. An Extension of the Irreducibility Criteria of Ehrenfeucht and Tverberg

    Singh, Amrit Pal and Khanduja, Sudesh K. Communications in Algebra, 32(2), 579–588, 2004.

    Read the source
  5. Equations of the form f(x)=g(y)

    Davenport, Harold and Lewis, Donald J. and Schinzel, Andrzej. The Quarterly Journal of Mathematics, 12(1), 304–312, 1961.

    Read the source
  6. On the irreducibility of some polynomials in two variables

    Brindza, Béla and Pintér, Ákos. Acta Arithmetica, 82(3), 303–307, 1997.

    Read the source
  7. Factorisations explicites de g(y)−h(z)

    Cassou-Noguès, Pierrette and Couveignes, Jean-Marc. Acta Arithmetica, 87(4), 291–317, 1999.

    Read the source
  8. The Davenport–Lewis–Schinzel problem on the reducibility of f(X)−g(Y)

    Behajaina, Angelot and König, Joachim and Neftin, Danny. arXiv, 2026.

    Read the source