• Keine Ergebnisse gefunden

A generalization of Mason’s theorem for four polynomials

N/A
N/A
Protected

Academic year: 2022

Aktie "A generalization of Mason’s theorem for four polynomials"

Copied!
6
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

0013-6018/04/010023-6

DOI 10.1007/s00017-001-0203-2 Elemente der Mathematik

A generalization of Mason’s theorem for four polynomials

M. Bayat and H. Teimoori*

M. Bayat studied mathematics at the Imam Khomeiny International University of Qazvin in Iran. In 1996, he received his M.S. in mathematics from the Institute for Advanced Studies in Basic Sciences of Zanjan in Iran, where he is a research assistant since 1999. His research interests include combinatorics, number theory, commutative algebra, ordinary differential equations and mathematics education.

H. Teimoori studied mechanical engineering at the AmirKabeer University of Tech- nology of Tehran in Iran. In 1999, he received his M.S. in mathematics from the Institute for Advanced Studies in Basic Sciences at Zanjan in Iran, where he is now a research assistant. His research interests include combinatorics, number theory and mathematics education.

In 1981, W. Stothe´rs [4] discovered a new, very interesting fact about polynomials. This theorem was not being paid attention by mathematicians until R.C. Mason [2] rediscov- ered this theorem in 1983, and Fermat’s last theorem for non-constant polynomials could be proved in a simple way by means of this theorem. Of course, Fermat’s last theorem for polynomials had already been proved before using algebraic geometric tools.

.

Vor nunmehr fast zehn Jahren wurde die Vermutung von Fermat durch A. Wiles bewie- sen. U¨ ber diese spektakula¨re Entdeckung wurde in dieser Zeitschrift mehrfach berichtet.

Die analoge Vermutung fu¨r Polynome war bereits lange zuvor bewiesen worden; ein eleganter Beweis stammt von R.C. Mason aus dem Jahr 1983, in dem er einen bereits 1981 von W. Stothe´rs gefundenen, aber unbeachtet gebliebenen Satz wiederentdeckte.

Auch daru¨ber und N. Snyders vereinfachenden Beweis wurde hier berichtet. In der vorliegenden Arbeit beweisen die Autoren in Verallgemeinerung dazu, dass es keine paarweise teilerfremden, nicht-konstanten Polynomea,b,c,d∈C[t]gibt, die der Glei- chung

a(t)n1+b(t)n2+c(t)n3=d(t)n4 genu¨gen, sobald min{n1,n2,n3,n4} ≥8 gilt.

∗) The authors are supported in part by the Institute for Advanced Studies in Basic Sciences, Zanjan, IRAN.

(2)

First of all, let us introduce some elementary tools that will be needed later to prove our theorem.

We consider polynomials with complex numbers as coefficients. The set of all such polynomials in a variablet is denoted byC[t]; if f C[t], f =0, we write

f(t) =c r

i=1

(t−αi)mi,

whereα1, α2, . . . , αr are the distinct roots of f, and cis a constant,c=0. The integers mi (i=1,2, . . . ,r)are the multiplicities of the roots, and the degree of the polynomial

f is

deg(f) =m1+· · ·+mr.

The number of (distinct) roots of f will be denoted byn0(f), so by definition n0(f) =r.

It is obvious that deg(f) can be very large, but n0(f) may be small. For instance, f(t) = (t−α)10000has degree 10000, butn0(f) =1. Iff,gare two non-zero polynomials, then in general

n0(f g)≤n0(f) +n0(g).

In addition, if f,gare relatively prime, then we actually have the equality n0(f g) =n0(f) +n0(g).

Taking into account the above notations, we can now state Mason’s theorem.

Theorem 1 (Mason’s theorem) Let f,g,h C[t] be non-constant relatively prime polynomials satisfying f+g=h. Then, we have

max{deg(f),deg(g),deg(h)} ≤n0(f gh)1.

It can be easily seen that the equality is true by considering the following example:

Example:

f(t) = (t3+4t2+10t+6)3, g(t) =t

t4+6t3+21t2+35t+63 2

2

, h(t) =27t2+351

4 t+216.

Mason’s theorem has been proved in [1, 3] using logarithmic derivatives and divisibility properties. Here, we generalize this theorem to four polynomials using the same argument as in [3].

(3)

Theorem 2 Let f,g,h,k∈C[t]be non-constant relatively prime polynomials satisfying f+g+h= k. Then, we have

max{deg(f),deg(g),deg(h), deg(k)} ≤2n0(f gh k)3.

Proof . Without loss of generality, we may assume that deg(f)is maximal. Thus, it is necessary to show that

deg(f)2n0(f gh k)3.

To do this, we divide the equation f+g+h=k by k, and obtain f

k + g k + h

k =1.

Put R= kf, S = gk and T = hk. ThenR+S+T =1. Now, by taking derivatives on both sides of the above equation and dividing byT, we get

R T +S

T =1.

Now, repeating the above argument, puttingE= RT,F = ST and taking derivatives, we get the new equationE+F=0, which we rewrite in the form

E E E+F

F F =0, or, equivalently,

E

F =−F/F E/E .

Consider the quotient f/g. With our notation and the above equation, we obtain f

g=

g

g ×hh gg ×kk kk×hh hh ×gg +hh× kk +kk ×gg

f

f ×hh ff ×kk kk×hh hh × ff +hh× kk + kk× ff, (1)

or, equivalently, f g =

1 1 1

g

g h

h k

k g

g h

h k

k

·

1 1 1

f

f h

h k

k f

f h

h k

k

1

. (2)

If we denote the right-hand side byP/Q, the following equality results:

f·Q=g·P. (3)

First, we rewrite the equality f +g+h= k asg+h−k =−f. Now, we distinguish two cases:

(4)

Case I. Suppose g,hand k are linearly independent overC. Therefore, the following Wronskian is a non-zero polynomial:

g(x) h(x) k(x) g(x) h(x) k(x) g(x) h(x) k(x) =0.

Since the above polynomial andg,h, k have a finite number of roots, there is a number α∈C, such that

0=

g(α) h(α) k(α) g(α) h(α) k(α) g(α) h(α) k(α)

=g(α)h(α)k(α)

1 1 1

g(α) g(α)

h(α) h(α)

k(α) k(α) g(α)

g(α) h(α)

h(α)

k(α) k(α)

,

and, consequently,

1 1 1

g(α) g(α)

h(α) h(α)

k(α) k(α) g(α)

g(α) h(α)

h(α)

k(α) k(α)

=0.

Thus, the rational functionP and consequentlyQ, is a non-zero polynomial. Now, we suppose

f(t) =c1

(t−αi)mi, g(t) =c2

(t−βj)nj, h(t) =c3

(t−γs)ps, k(t) =c4

(t−δl)ql.

Taking logarithmic derivatives of f(t),g(t),h(t), k(t), we get respectively:

f

f = mi

(t−αi), f

f = mi

(t−αi) 2

mi

(t−αi)2, g

g = nj

(t−βj), g

g = nj

(t−βj) 2

nj

(t−βj)2, h

h = ps

(t−γs), h

h = ps

(t−γs) 2

ps (t−γs)2, k

k = ql

(t−δl), k

k = ql

(t−δl) 2

ql

(t−δl)2.

For the above rational functions, the quantity D(t) =

(t−αi)2

(t−βj)2

(t−γs)2

(t−δl)2

is a common denominator; obviously, we have deg(D(t)) = 2n0(f gh k). We multiply both sides of (3) byD(t). It is clear that both sides are polynomials. We then obtain

f ·Q·D(t) =g·P·D(t),

(5)

or, equivalently,

f|g·P·D(t). Since(f,g) =1, we find

f|P·D(t).

Now, considering (1), we get deg(f)deg(P·D(t))

max

deg

D(t)· g g ·h

h

,deg

D(t)· g g · k

k

, . . . ,deg

D(t)· k k · g

g .

Since

deg(D(t)) =2n0(f gh k), we conclude that

deg(f)2n0(f gh k)3.

Case II. Assume that g, h and k are linearly dependent over C, and g is a linear combination ofh, k overC. Therefore, there are λ, µ∈Csatisfying

g=λh+µk.

Sinceg,handkare relatively prime in pairs, thenλ=0 andµ=0. By using Theorem 1 andn0(ghk)1<n0(f ghk)1, we obtain

max{deg(g),deg(h),deg(k)} ≤n0(f gh k)1. Since,−f =g+h−k andn0(f ghk)12n0(f gh k)3, we get

max{deg(f),deg(g),deg(h),deg(k)} ≤2n0(f gh k)3.

Remark 3 If f,g,h, k are linearly dependent, then

max{deg(f),deg(g),deg(h),deg(k)} ≤2n0(f gh k)5. (4)

Corollary 4

deg(f ghk)8n0(f gh k)12.

As an application of our main theorem, we prove that a generalized version of Fermat’s last theorem for polynomials holds true under certain conditions.

Theorem 5 Letn=min{n1,n2,n3,n4}be an integer ≥8. Then, there is no solution of the equation

a(t)n1+b(t)n2+c(t)n3=d(t)n4, with non-constant relatively prime polynomialsa,b,c,d∈C[t].

(6)

Proof . Let f(t) =a(t)n1,g(t) =b(t)n2,h(t) =c(t)n3 andk(t) =d(t)n4. Then, our main theorem yields

deg(an1)2n0(an1bn2cn3dn4)3.

However deg(an1) =n1deg(a)andn0(an1)deg(a). Hence, we have

ndeg(a)≤n1deg(a)2(deg(a) +deg(b) +deg(c) +deg(d))3. (5) Similarly, we obtain analogous inequalities forb,candd, i.e.,

ndeg(b)2(deg(a) +deg(b) +deg(c) +deg(d))3, (6) ndeg(c)2(deg(a) +deg(b) +deg(c) +deg(d))3, (7) ndeg(d)2(deg(a) +deg(b) +deg(c) +deg(d))3. (8) Adding the three inequalities yields

ndeg(abcd)8 deg(abcd)12, or

(n8)deg(abcd)≤ −12.

The last inequality implies n−8 < 0, or n < 8, which contradicts our theorem’s

hypothesis. Thus the proof is complete. 䊐

References

[1] Lang, S.: Math Talks for Undergraduates. Spinger Verlag, 1999.

[2] Mason, R.C.: Diophantine Equations Over Function Fields. London Math. Soc. Lecture Note Series, Vol. 96, Cambridge University Press, 1984.

[3] Snyder, N.: An Alternate Proof of Mason’s Theorem. Elem. Math. 55 (2000) 3, 93–94.

[4] Stothe´rs, W.: Polynomial identities and hauptmoduln. Quart. Math. Oxford 32 (1981) 2, 349–370.

M. Bayat

Institute for Advanced Studies in Basic Sciences

P.O.Box 45195-159 Zanjan, Iran

e-mailBayat@iasbs.ac.ir H. Teimoori

Institute for Advanced Studies in Basic Sciences

P.O.Box 45195-159 Zanjan, Iran

e-mailTeimoori@iasbs.ac.ir

Referenzen

ÄHNLICHE DOKUMENTE

We have studied a class of abstract optimal control problems, called hypersonic rocket car problems, for a controlled second-order ordinary differential equation, a state variable

We apply tools from nonlinear control theory, specifically Lyapunov function and small-gain based feedback stabilization methods for systems with a globally asymptotically

In this work we study the problem of step size selection for numerical schemes, which guarantees that the numerical solution presents the same qualitative behavior as the

Standard error estimates for one{step numerical schemes for nonautonomous ordi- nary dierential equations usually assume appropriate smoothness in both time and state variables and

First, we show that the upper limit of a sequence of numerical attractors for a sequence of vanishing time step is an attractor for the approximated system if and only if for all

His research interests include classical mathematics, combinatorics and number theory.. Michael Joyce graduated Tulane University as a mathematics major

We present a necessary and sufficient criterion for the flow of an analytic ordinary differential equation to be strongly monotone; equivalently, strongly order-preserving1.

In other words, we combine the two approaches by changing the sought object (an input instead of a state) in an observation problem, or, symmetrically, the desired