# Teorema di Mason-Stothers

Mason–Stothers theorem 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, in chi l'ha pubblicato 1981,[1] e R. C. Mason, who rediscovered it shortly thereafter.[2] The theorem states: Let a(t), b(t), and c(t) be relatively prime polynomials over a field such that a + b = c and such that not all of them have vanishing derivative. Quindi {displaystyle max{gradi(un),gradi(b),gradi(c)}leq deg(nome operatore {rad} (abc))-1.} Here rad(f) is the product of the distinct irreducible factors of f. For algebraically closed fields it is the polynomial of minimum degree that has the same roots as f; in this case deg(rad(f)) gives the number of distinct roots of f.[3] Contenuti 1 Esempi 2 Prova 3 generalizzazioni 4 Riferimenti 5 External links Examples Over fields of characteristic 0 the condition that a, b, and c do not all have vanishing derivative is equivalent to the condition that they are not all constant. Over fields of characteristic p > 0 it is not enough to assume that they are not all constant. Per esempio, considered as polynomials over some field of characteristic p, the identity tp + 1 = (t + 1)p gives an example where the maximum degree of the three polynomials (a and b as the summands on the left hand side, and c as the right hand side) is p, but the degree of the radical is only 2. Taking a(t) = tn and c(t) = (t+1)n gives an example where equality holds in the Mason–Stothers theorem, showing that the inequality is in some sense the best possible. A corollary of the Mason–Stothers theorem is the analog of Fermat's Last Theorem for function fields: if a(t)n + b(t)n = c(t)n for a, b, c relatively prime polynomials over a field of characteristic not dividing n and n > 2 then either at least one of a, b, or c is 0 or they are all constant. Proof Snyder (2000) gave the following elementary proof of the Mason–Stothers theorem.[4] Fare un passo 1. The condition a + b + c = 0 implies that the Wronskians W(un, b) = ab′ − a′b, w(b, c), and W(c, un) are all equal. Write W for their common value.

Fare un passo 2. The condition that at least one of the derivatives a′, b′, or c′ is nonzero and that a, b, and c are coprime is used to show that W is nonzero. Per esempio, if W = 0 then ab′ = a′b so a divides a′ (as a and b are coprime) so a′ = 0 (as deg a > deg a′ unless a is constant).

Fare un passo 3. W is divisible by each of the greatest common divisors (un, a′), (b, b′), e (c, c′). Since these are coprime it is divisible by their product, and since W is nonzero we get deg (un, a′) + gradi (b, b′) + gradi (c, c′) ≤ deg W.

Fare un passo 4. Substituting in the inequalities deg (un, a′) ≥ deg a − (number of distinct roots of a) gradi (b, b′) ≥ deg b − (number of distinct roots of b) gradi (c, c′) ≥ deg c − (number of distinct roots of c) (where the roots are taken in some algebraic closure) and deg W ≤ deg a + deg b − 1 we find that deg c ≤ (number of distinct roots of abc) − 1 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 k be an algebraically closed field of characteristic 0, let C/k be a smooth projective curve of genus g, permettere {stile di visualizzazione a,bin k(C)} be rational functions on C satisfying {displaystyle a+b=1} , and let S be a set of points in C(K) containing all of the zeros and poles of a and b. Quindi {displaystyle max {all'improvviso {}gradi(un),gradi(b){più grande }}leq max {all'improvviso {}|S|+2g-2,0{più grande }}.} Here the degree of a function in k(C) is the degree of the map it induces from C to P1. This was proved by Mason, with an alternative short proof published the same year by J. H. Argentiere .[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 n-variable S-unit equations a1 + a2 + ... + an = 1 provided that no subset of the ai are k-linearly dependent. Under this assumption, they prove that {displaystyle max {all'improvviso {}gradi(un_{1}),ldot ,gradi(un_{n}){più grande }}leq {frac {1}{2}}n(n-1)max {all'improvviso {}|S|+2g-2,0{più grande }}.} References ^ Stothers, w. w. (1981), "Polynomial identities and hauptmoduln", Quarterly J. Matematica. Oxford, 2, 32: 349–370, doi:10.1093/qmath/32.3.349. ^ Mason, R. C. (1984), Diophantine Equations over Function Fields, Serie di appunti per le lezioni della London Mathematical Society, vol. 96, Cambridge, Inghilterra: Cambridge University Press. ^ Lang, Serge (2002). Algebra. New York, Berlino, Heidelberg: Springer-Verlag. p. 194. ISBN 0-387-95385-X. ^ Snyder, Noah (2000), "An alternate proof of Mason's theorem" (PDF), Elemente der Mathematik, 55 (3): 93–94, doi:10.1007/s000170050074, SIG 1781918. ^ Silverman, J. H. (1984), "The S-unit equation over function fields", Proc. Camb. Philos. soc., 95: 3–4 ^ Voloch, J. F. (1985), "Diagonal equations over function fields", Bol. soc. Bras. Stuoia., 16: 29–39 ^ Brownawell, w. D.; Masser, D. w. (1986), "Vanishing sums in function fields", Matematica. Proc. Filos di Cambridge. soc., 100: 427–434 External links Weisstein, Eric W. "Mason's Theorem". Math World. Mason-Stothers Theorem and the ABC Conjecture, Vishal Lama. A cleaned-up version of the proof from Lang's book. Categorie: Theorems about polynomials

Se vuoi conoscere altri articoli simili a Teorema di Mason-Stothers puoi visitare la categoria Theorems about polynomials.

Vai su

Utilizziamo cookie propri e di terze parti per migliorare l'esperienza dell'utente Maggiori informazioni