Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Erdős 699: finiteness on every fixed algebraic curve
P699 research · The endpoint divisibilities · The elliptic approach
Every fixed algebraic curve in the -plane contains only finitely many bad pairs with index three. The odd part of may vary without restriction. More generally, the result holds for the endpoint conditions together with a fixed finite set of allowed denominator primes for .
Finiteness for each fixed exponent was already known from . The theorem here permits to grow without bound while fixing an arbitrary polynomial relation .
The proof uses Siegel's theorem to reduce to rational curves, polynomial abc to remove a common factor from the remaining parameterization, and the two-circle argument below to finish.
This is not global finiteness: an infinite set in the plane can meet every fixed curve only finitely often. It does mean that a global Zariski nondensity theorem would now imply finiteness of all bad cubic pairs, without first bounding the odd part of .
1. A polynomial rigidity lemma
Lemma. Let , where and , and let have degree at most . Suppose
Then
Proof. Write , and let range over the th roots of unity. Set
For every , the first divisibility says that , while the second says that . In particular both sets of values are real.
Since the are real, reality on a circle of radius gives
The characters are linearly independent as functions on the th roots of unity. Comparing their coefficients gives
Apply (3) at both radii. Since , a nonzero requires . Thus
unless is even, in which case there can also be a term .
Suppose that this extra term is nonzero. On the first circle, its two values are
They are distinct and both belong to , so their absolute difference is one. On the second circle the two values instead have absolute difference . This is impossible for two members of . Hence the extra term vanishes.
Finally and . The six choices give exactly (2).
In particular, no such polynomial family can satisfy for arbitrarily large positive .
2. Polynomial abc removes the common factor
We use the following characteristic-zero form of Mason–Stothers: if nonzero pairwise coprime polynomials , not all constant, satisfy , then
Here retains each distinct irreducible factor once. For a short proof, the nonzero Wronskian is divisible by : at a root of any of the three polynomials of multiplicity , it vanishes to order at least . Comparing degrees gives the bound for ; permutation gives the other two. This is also the statement proved in Mathlib's Mason–Stothers theorem.
Lemma. Let
Suppose
are polynomials, and holds for an unbounded sequence of positive real . Then is constant. In fact these hypotheses are impossible, by the two-circle lemma.
Proof. Put , , and . The physical inequalities give . Also is nonconstant: otherwise the first quotient in (5) would force . Thus .
Since and , (5) implies . Consequently the normalized coefficient cubic
belongs to and satisfies . Its coefficients equal those of
The two polynomials
are also in . Indeed, modulo the product is , and modulo the product is . The divisibilities in (5), and coprimality with , give (7). Neither polynomial is zero; for this also follows from along the given sequence.
Write and . Then
The inequality for also handles cancellation in the leading term of when tends to . The cubic discriminant identity gives
It can be checked directly from (6) and (7); equivalently,
The displayed expression is positive on the given physical sequence, so . Moreover, and , so .
Let . Since , (9) implies . Apply (4) to the pairwise coprime polynomials
They are not all constant, since the last has a zero at zero. Their distinct roots lie among the roots of , , , and . Apply (4) to the degree of the third polynomial. It gives
Cancel the common term and use (8):
Therefore , as required. Now with , and the two-circle lemma applied to (5) excludes the physical inequalities.
3. Finiteness on every fixed algebraic curve
Theorem. Fix a finite set of rational primes and a nonzero polynomial . There are only finitely many integer pairs satisfying
The last two quantities may in particular be integers. Every bad pair with index three satisfies (10) with . Indeed the endpoint conditions make the last two quantities integers, and for gives .
Proof. Suppose infinitely many pairs satisfy (10). Choose an irreducible component of containing infinitely many of them. It is geometrically irreducible: otherwise its rational points lie in finite intersections of distinct geometric conjugate components. The function is nonconstant, since each fixed row has only finitely many admissible columns.
Take the affine graph of the five rational functions
It has infinitely many -integral points. Siegel's theorem therefore says that its smooth projective model has genus zero and at most two geometric points at infinity, meaning the union of poles of these five functions. The precise -integral statement is recalled in Corvaja–Zannier's primary abstract. The model has rational points and hence is over .
First, cannot be constant. Otherwise for some . The function has poles over , and has poles over : their numerators there are respectively and , both nonzero. Together with a pole of , these give at least three distinct points at infinity, contrary to Siegel's theorem.
Let be the union of the poles of and alone. It is nonempty and contains at most two geometric points. There are three cases.
Two rational points in . Choose a rational parameter putting them at zero and infinity. Then , and at each end at least one of these Laurent polynomials has a pole. For every prime , integrality of bounds both above and below: as tends to either infinity, the term describing the corresponding pole uniquely dominates and has negative valuation. Outside a fixed finite set of primes all nonzero coefficients are units, so these bounds force . At the remaining primes the bounds are fixed finite intervals. Only finitely many rational are possible, contrary to the assumed infinite set.
Two conjugate points in . Along an infinite subsequence tends to infinity, so the real points approach a pole of . (If both poles are nonreal, is bounded on the compact real locus instead.) The bound makes regular at this pole. Galois conjugation makes it regular at the other pole too. The five-function graph permits no poles elsewhere, because its two possible points at infinity are already in . Thus is globally regular on , hence constant, contradicting the preceding paragraph.
One point in . This point is rational. Put it at infinity, so and are rational polynomials. Passing to a subsequence and changing the sign of if needed, we have . The physical inequalities imply , and the ratio has already been shown to be nonconstant.
Therefore has a finite pole. There can be only one such geometric point, since infinity is already a pole of . Its singleton support is Galois invariant, so it is rational. Translate it to zero. The reduced denominator of is then a power of , giving
The common factor is allowed to vanish at zero. In any case . The only possible finite pole of either or is zero, but their displayed denominators are nonzero there. Hence have no finite poles and are polynomials. The lemma in Section 2 gives the final contradiction. This proves the theorem.
4. The consequence and the remaining gap
The set of bad cubic pairs has the following dichotomy:
- it is finite; or
- every infinite subset is Zariski dense in the -plane.
Thus it now suffices to put all bad pairs in one proper algebraic subset of the plane. The theorem disposes of every curve component of such a subset, including rational curves, with no need to fix or bound .
No such global nondensity theorem has been proved here. Therefore this does not yet constrain all bad pairs to a finite exceptional set, even though it proves finiteness on every fixed curve. Nor does it make those curve-wise exceptional sets effective: the proof uses Siegel's theorem and supplies no general height bound. No finite search was used.