Math 2.0

Number theory Diophantine equations Theorem

Mason–Stothers theorem

Builds on Polynomial ringFormal derivativeIrreducible polynomialField

Statement

Let KK be a field and let a,b,c∈K[t]a, b, c \in K[t] be polynomials in the polynomial ring with a+b=ca + b = c. Assume that aa, bb, cc are pairwise coprime and that not all of the formal derivatives a′a', b′b', c′c' are zero. For a nonzero polynomial ff, let rad⁡(f)\operatorname{rad}(f) be the product of the distinct monic irreducible factors of ff. Then max⁡{deg⁡a,deg⁡b,deg⁡c}≤deg⁡rad⁡(abc)−1.\max\set{\deg a, \deg b, \deg c} \le \deg \operatorname{rad}(abc) - 1.

Remarks

When KK is algebraically closed, deg⁡rad⁡(abc)\deg \operatorname{rad}(abc) is the number of distinct roots of abcabc. If KK has characteristic 00, the hypothesis on derivatives just says that aa, bb, cc are not all constant. A short proof, due to Noah Snyder, studies the Wronskian ab′−a′bab' - a'b: it is nonzero, it is divisible by abc/rad⁡(abc)abc/\operatorname{rad}(abc), and its degree is less than deg⁡a+deg⁡b\deg a + \deg b. Example: over ℚ\Q, take a=t2a = t^2, b=2t+1b = 2t + 1 and c=(t+1)2c = (t + 1)^2; then rad⁡(abc)=t(2t+1)(t+1)\operatorname{rad}(abc) = t(2t + 1)(t + 1) has degree 33, and the bound 2≤3−12 \le 3 - 1 is sharp. The derivative hypothesis is necessary: over a field of characteristic p>0p > 0, take a=tpa = t^p, b=1b = 1, c=(t+1)pc = (t + 1)^p; then a′=b′=c′=0a' = b' = c' = 0, the radical has degree 22, and deg⁡c=p>1\deg c = p > 1. A consequence: for n≥3n \ge 3 there are no pairwise coprime polynomials x,y,zx, y, z over ℂ\C, not all constant, with xn+yn=znx^n + y^n = z^n.

Going deeper

For a student

The theorem is the polynomial form of the abc conjecture, with the degree playing the role of the logarithm of the size and the radical counting distinct prime factors. In contrast with the integer case, it has a short and complete proof by differentiation. It gives quick proofs of Fermat's Last Theorem for polynomials and of related results on equations such as x2−y3=x^2 - y^3 = a polynomial.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Field concept
  2. Formal derivative concept
  3. Irreducible polynomial concept
  4. Polynomial ring concept
  5. Mason–Stothers theorem statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Mason%E2%80%93Stothers_theorem
About this page
TagZWPWF6NJC3
URIm2://ZWPWF6NJC3
Kindstatement, theorem
WritingW0 stub
MSC11C08, 12D05
StatusThis copy of the site has no build data. Run m2 status ZWPWF6NJC3.
AboutPolynomial ring
UsesPolynomial ring, Formal derivative, Irreducible polynomial, Field
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by