Determination of bounds for the solutions to those binary Diophantine equations that satisfy the hypotheses of Runge’s theorem

David Lee Hilliker, E. G. Straus

Transactions of the American Mathematical Society · 1983 · 29 citations · 0 references

DOIFull text

Open access

Concepts

Abstract

In 1887 Runge [ <bold>13</bold> ] proved that a binary Diophantine equation <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper F left-parenthesis x comma y right-parenthesis equals 0"> <mml:semantics> <mml:mrow> <mml:mi>F</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo>=</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">F(x,y) = 0</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , with <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper F"> <mml:semantics> <mml:mi>F</mml:mi> <mml:annotation encoding="application/x-tex">F</mml:annotation> </mml:semantics> </mml:math> </inline-formula> irreducible, in a class including those in which the leading form of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper F"> <mml:semantics> <mml:mi>F</mml:mi> <mml:annotation encoding="application/x-tex">F</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is not a constant multiple of a power of an irreducible polynomial, has only a finite number of solutions. It follows from Runge’s method of proof that there exists a computable upper bound for the absolute value of each of the integer solutions <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="x"> <mml:semantics> <mml:mi>x</mml:mi> <mml:annotation encoding="application/x-tex">x</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="y"> <mml:semantics> <mml:mi>y</mml:mi> <mml:annotation encoding="application/x-tex">y</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . Runge did not give such a computation. Here we first deduce Runge’s Theorem from a more general theorem on Puiseux series that may be of interest in its own right. Second, we extend the Puiseux series theorem and deduce from the generalized version a generalized form of Runge’s Theorem in which the solutions <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="x"> <mml:semantics> <mml:mi>x</mml:mi> <mml:annotation encoding="application/x-tex">x</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="y"> <mml:semantics> <mml:mi>y</mml:mi> <mml:annotation encoding="application/x-tex">y</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of the polynomial equation <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper F left-parenthesis x comma y right-parenthesis equals 0"> <mml:semantics> <mml:mrow> <mml:mi>F</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo>=</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">F(x,y) = 0</mml:annotation> </mml:semantics> </mml:math> </inline-formula> are integers, satisfying certain conditions, of an arbitrary algebraic number field. Third, we compute bounds for the solutions <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="left-parenthesis x comma y right-parenthesis element-of bold upper Z squared"> <mml:semantics> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo> ∈ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="bold">Z</mml:mi> </mml:mrow> </mml:mrow> <mml:mn>2</mml:mn> </mml:msup> </mml:mrow> </mml:mrow> <mml:annotation encoding="application/x-tex">(x,y) \in {{\mathbf {Z}}^2}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in terms of the height of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper F"> <mml:semantics> <mml:mi>F</mml:mi> <mml:annotation encoding="application/x-tex">F</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and the degrees in <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="x"> <mml:semantics> <mml:mi>x</mml:mi> <mml:annotation encoding="application/x-tex">x</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="y"> <mml:semantics> <mml:mi>y</mml:mi> <mml:annotation encoding="application/x-tex">y</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper F"> <mml:semantics> <mml:mi>F</mml:mi> <mml:annotation encoding="application/x-tex">F</mml:annotation> </mml:semantics> </mml:math> </inline-formula> .