Mason–Stothers theorem

From testwiki
Jump to navigation Jump to search

Template:Short description The Mason–Stothers theorem, or simply Mason's theorem, is a mathematical theorem about polynomials, analogous to the abc conjecture for integers. It is named after Walter Wilson Stothers, who published it in 1981,[1] and R. C. Mason, who rediscovered it shortly thereafter.[2]

The theorem states:

Let Template:Math, Template:Math, and Template:Math be relatively prime polynomials over a field such that Template:Math and such that not all of them have vanishing derivative. Then
max{deg(a),deg(b),deg(c)}deg(rad(abc))1.

Here Template:Math is the product of the distinct irreducible factors of Template:Mvar. For algebraically closed fields it is the polynomial of minimum degree that has the same roots as Template:Mvar; in this case Template:Math gives the number of distinct roots of Template:Mvar.[3]

Examples

Proof

Template:Harvtxt gave the following elementary proof of the Mason–Stothers theorem.[4]

Step 1. The condition Template:Math implies that the Wronskians Template:Math, Template:Math, and Template:Math are all equal. Write Template:Mvar for their common value.

Step 2. The condition that at least one of the derivatives Template:Math, Template:Math, or Template:Math is nonzero and that Template:Mvar, Template:Mvar, and Template:Mvar are coprime is used to show that Template:Mvar is nonzero. For example, if Template:Math then Template:Math so Template:Mvar divides Template:Math (as Template:Mvar and Template:Mvar are coprime) so Template:Math (as Template:Math unless Template:Mvar is constant).

Step 3. Template:Mvar is divisible by each of the greatest common divisors Template:Math, Template:Math, and Template:Math. Since these are coprime it is divisible by their product, and since Template:Mvar is nonzero we get

Template:Math

Step 4. Substituting in the inequalities

Template:Math − (number of distinct roots of Template:Mvar)
Template:Math − (number of distinct roots of Template:Mvar)
Template:Math − (number of distinct roots of Template:Mvar)

(where the roots are taken in some algebraic closure) and

Template:Math

we find that

Template:Math

which is what we needed to prove.

Generalizations

There is a natural generalization in which the ring of polynomials is replaced by a one-dimensional function field. Let Template:Mvar be an algebraically closed field of characteristic 0, let Template:Math be a smooth projective curve of genus Template:Mvar, let

a,bk(C) be rational functions on Template:Mvar satisfying a+b=1,

and let Template:Mvar be a set of points in Template:Math containing all of the zeros and poles of Template:Mvar and Template:Mvar. Then

max{deg(a),deg(b)}max{|S|+2g2,0}.

Here the degree of a function in Template:Math is the degree of the map it induces from Template:Mvar to P1. This was proved by Mason, with an alternative short proof published the same year by J. H. Silverman .[5]

There is a further generalization, due independently to J. F. Voloch[6] and to W. D. Brownawell and D. W. Masser,[7] that gives an upper bound for Template:Mvar-variable Template:Mvar-unit equations Template:Math provided that no subset of the Template:Math are Template:Mvar-linearly dependent. Under this assumption, they prove that

max{deg(a1),,deg(an)}12n(n1)max{|S|+2g2,0}.

References

Template:Reflist