Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Erdős 699: an effective Runge criterion for fixed curves

P699 research · Finiteness on fixed curves


Fix an index i≥4i\ge4, let Si={p:p<i}S_i=\{p:p<i\} and si=∣Si∣s_i=|S_i|, and let C⊂An,j2C\subset\mathbf A^2_{n,j} be a fixed geometrically irreducible curve over Q\mathbf Q on which nn is nonconstant. Define

Hi={i,i is prime,1,i is composite,gt=Hi∏r=0t(j−r)n−t(0≤t<i).(1)H_i=\begin{cases}i,&i\text{ is prime},\\1,&i\text{ is composite},\end{cases} \qquad g_t=H_i\frac{\prod_{r=0}^t(j-r)}{n-t}\quad(0\le t<i).\tag{1}

Work on the smooth projective normalization C‾\overline C. A finite fiber n=tn=t is called a pole fiber here if it contains a pole of at least one of the functions j,g0,…,gi−1j,g_0,\ldots,g_{i-1}.

Proposition. If at least si+1s_i+1 of the fibers n=0,1,…,i−1n=0,1,\ldots,i-1 are pole fibers, then all bad triples with this index and (n,j)∈C(n,j)\in C form an effectively determinable finite set.

For indices four and five, three finite pole fibers suffice. More generally, the criterion asks for the following numbers:

IndexRequired finite pole fibers
4,54,53
6,76,74
8,98,95
12126
14147

This criterion applies to the given curve, with a bound depending effectively on that curve. It does not make all fixed curves effective and does not put all bad pairs on finitely many curves.

The integral functions supplied by badness

For every bad triple, the values of n,j,g0,…,gi−1n,j,g_0,\ldots,g_{i-1} lie in Z[Si−1]\mathbf Z[S_i^{-1}].

To prove this, let p≥ip\ge i and pA∥n−tp^A\Vert n-t. Since 0≤t<i≤p0\le t<i\le p, this is the unique numerator factor divisible by pp in (ni)\binom ni. Unless p=ip=i is prime and A=1A=1, the prime pp divides (ni)\binom ni. Badness implies p∤(nj)p\nmid\binom nj, so Lucas's theorem gives

j mod pA∈{0,…,t}.j\bmod p^A\in\{0,\ldots,t\}.

Consequently pA∣∏r=0t(j−r)p^A\mid\prod_{r=0}^t(j-r). In the exceptional case p=ip=i, A=1A=1, the factor HiH_i clears the denominator. This proves the assertion at every prime outside SiS_i.

The factor HiH_i is a fixed integer multiplier. It does not add a prime to the allowed denominator set. In particular the index-five functions are 5∏r=0t(j−r)/(n−t)5\prod_{r=0}^t(j-r)/(n-t), and their allowed denominator primes remain exactly 2,32,3.

Runge's condition and its effective conclusion

Use the geometric form of Runge's theorem given by Levin, Variations on a theme of Runge, Theorem 2 in the arXiv version. This is Theorem 1.2 in the published article. For a rational function ϕ\phi on a smooth projective curve over a number field KK, let rKr_K be the number of KK-irreducible components of the support of its pole divisor: equivalently, the number of Galois orbits of poles. If SS contains the archimedean places and rK>∣S∣r_K>|S|, the points satisfying ϕ(P)∈OK,S\phi(P)\in\mathcal O_{K,S} form an effectively determinable finite set.

Here let DD be the union of the poles of n,j,g0,…,gi−1n,j,g_0,\ldots,g_{i-1}. Choose integer coefficients in a linear combination ϕ\phi of these functions so that its pole support is exactly DD. This can be done effectively: at each of the finitely many poles, cancellation of all terms of largest pole order imposes a proper linear condition on the coefficients. Avoid those finitely many conditions. Integer coefficients preserve SiS_i-integrality.

Each finite pole fiber contributes at least one Galois orbit to DD. These orbits are distinct, because their values of the rational function nn are distinct rational integers. The nonconstant function nn has a pole, supplying at least one further orbit, disjoint from all finite fibers. Thus the proposition's hypothesis gives

rQ≥si+2>∣{∞}∪Si∣=si+1.r_{\mathbf Q}\ge s_i+2> |\{\infty\}\cup S_i|=s_i+1.

Runge's theorem proves the proposition. Rational nonsingular points of the original plane curve lift to rational points of its normalization. Its finitely many singular points can be determined separately, so they cause no gap.

The argument requires no enlargement of SiS_i for auxiliary coordinates. More generally, a known fixed denominator can be cleared by scaling the corresponding rational function by an integer, without changing its pole support.

How a fiber supplies a pole

Let P∈C‾P\in\overline C satisfy n(P)=tn(P)=t. If jj has a pole at PP, then P∈DP\in D. If j(P)j(P) is finite and not in {0,…,t}\{0,\ldots,t\}, then the numerator of gtg_t is nonzero there and its denominator vanishes, so gtg_t has a pole.

Even a point above the grid can contribute. If j(P)=r∈{0,…,t}j(P)=r\in\{0,\ldots,t\}, put

en=ord⁡P(n−t),ej=ord⁡P(j−r).e_n=\operatorname{ord}_P(n-t),\qquad e_j=\operatorname{ord}_P(j-r).

The other factors in the numerator of gtg_t are units at PP, giving

ord⁡P(gt)=ej−en.(2)\operatorname{ord}_P(g_t)=e_j-e_n.\tag{2}

When j−rj-r is identically zero, take ej=+∞e_j=+\infty; then gtg_t is identically zero and contributes no pole. Otherwise (2) is an exact valuation identity. Thus a fiber with no pole has all its branches above grid points and must satisfy

en≤ejon every branch.(3)\boxed{e_n\le e_j\quad\text{on every branch.}}\tag{3}

The converse holds as well for a fixed fiber: if jj is finite there and (3) holds at all its grid branches, then gtg_t is regular. For u≠tu\ne t, the denominator n−un-u is nonzero on that fiber, so every other gug_u is regular too.

In particular, if the proposition's sufficient fiber count fails, at least i−sii-s_i of these finite fibers have this complete grid property. This is only a necessary condition for failure of the criterion: additional pole orbits, including multiple orbits in a single fiber, can still make Runge's inequality hold.

A corollary for curves smooth at the grid

Let d=[Q(C):Q(n)]d=[\mathbf Q(C):\mathbf Q(n)] be the degree of the map n:C‾→P1n:\overline C\to\mathbf P^1. Suppose the plane curve is smooth at every grid point (t,r)(t,r) lying on it in one fiber n=tn=t.

If this fiber has no pole, (3) holds. At a smooth plane point, at least one of n−t,j−rn-t,j-r has order one; therefore (3) forces en=1e_n=1. There is only one branch at each such grid point, so the entire fiber contains at most t+1t+1 points, all of multiplicity one. Since a fiber has total multiplicity dd, it follows that

d>t+1⟹n=t is a pole fiber.(4)\boxed{d>t+1\quad\Longrightarrow\quad n=t\text{ is a pole fiber}.}\tag{4}

The possibility j=∞j=\infty in a finite nn-fiber is already included: it itself supplies a pole, so it cannot occur in the no-pole case.

Consequently, if CC is smooth at every point of the triangular grid 0≤j≤n<i0\le j\le n<i, and d≥si+2d\ge s_i+2, then the first si+1s_i+1 fibers are pole fibers and all bad triples on CC are effectively determinable. At index five this applies whenever d≥4d\ge4.

Singularities at grid points matter. Several normalized branches can lie above one grid point, and a branch can have en=ej>1e_n=e_j>1. Therefore the degree condition cannot be asserted for arbitrary singular curves without the smoothness hypothesis.