Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Why endpoint weights do not close the surface approximation argument
This is a retained earlier research note. The current reading guide gives the latest status and distinguishes completed proofs from remaining cases.
P699 research · Erdős problem 699 · The uniform cubic attempt
This note tests a Diophantine approximation theorem against the remaining cubic case. Arbitrary weights at the five endpoint points cannot give the strict height inequality needed in the range . Section 4 proves this for every big rational divisor on the indicated surface, without assuming symmetry or nefness. Thus the fact that all three residue groups must grow does not repair this application of the theorem. This is an obstruction to a proposed proof, not a proof of nonexistence or finiteness of bad triples.
Sections 1--3 retain the earlier exact calculations for symmetric nef divisors. They illustrate the failure numerically; the argument in Section 4 explains why nonsymmetric choices fail as well.
1. The surface and the inequality needed
Start with and the necessary odd-prime endpoint conditions. Let be the blowup of at
Write for a fiber of the projection and for a fiber of the projection, and write for the exceptional divisor above . Thus and . Put . Consider
where are rational and
These conditions make nef. For a curve other than a vertical fiber, the sums of its multiplicities on each of the two rows are at most its intersection with a vertical fiber; this proves nonnegative intersection with (1). The two special vertical fibers give the first two inequalities in (2). Moreover
For a closed subscheme , use
The main theorem of Huang–Levin–Xiao permits a divisor and a point on it as a nested regular chain. Applied to at infinity and at , it gives the relevant inequality with contributions and when . The endpoint gcds give
Consequently, to exclude this remaining range by this application, one would need
At the finite place one may complete to a regular chain with an arbitrary point on it and discard the additional nonnegative term. For fixed odd in , enlarging the fixed set of places gives the same asymptotic test. The theorem's exceptional algebraic curves do not repair failure of the strict numerical inequality.
2. Exact beta constants
Put , where , and define
Then
Here are derivations which also specify the geometry behind the formulas.
For (4), fix a sufficiently divisible . At , the Taylor coefficient of order belongs to the subspace of polynomials in divisible by ; at , the corresponding condition is divisibility by . These are two filtrations of , so they admit a simultaneous constant basis . The section module has basis
Thus its dimension at -degree at most is . The intersection of the two filtration spaces has dimension
After scaling, the first moment of the total cost is , and its second moment is . Integrating over gives (4). In particular, the mixed second moment follows by integrating the joint tail
For (5), blow up as well and denote its exceptional divisor by . Put , , and . For , the negative part of is supported on the strict transforms of . Its coefficients are
where . These are obtained by setting the intersections of the remaining divisor with the active curves to zero. The remainder is nef and becomes zero at . One can check nefness on the exceptional curves, the vertical and horizontal fibers through the six points, and the four diagonal curves through and an unequal- pair from the two rows. These are all the negative curves: the row and fiber intersection bounds, combined with adjunction, force any other negative nonfiber curve to have bidegree ; the indicated four are exactly those possibilities.
Writing
integration of this Zariski decomposition gives
The elementary integral is , proving (5).
3. The strict inequality always has the wrong sign
Write . Multiplying the difference between the two sides of (3) by gives
Its coefficient of is negative, since
Thus is largest at . There it equals
Its derivative with respect to is
because (2) implies . It therefore suffices to set . The resulting expressions are
All three are negative. In the first case, putting gives . In the second case, putting and using gives . In the last case, gives .
We have proved, throughout (2),
For example, on the entire boundary family , , the difference is exactly .
4. Arbitrary endpoint weights still cannot give strictness
Suppose runs through an unbounded sequence of bad cubic pairs with . Let
and let be the three residue groups at . Then
where . Pass to a subsequence on which the five normalized logarithms converge, and write their limits as
All five numbers are nonnegative, and
For each pair , the coprime integers both divide
This affine expression is nonzero in , and its absolute value is less than . Hence
The polytope defined by (6)--(7) has exactly five vertices:
For verification, put . The inequalities say and . At fixed , the vertices of the latter triangle are the permutations of . Each lies on a segment between the corresponding two points in (8). This proves the assertion about the whole polytope.
A weighted Bezout inequality
For any nonzero affine polynomial of total degree , we have
It is enough to check an irreducible factor and the five mass vectors in (8). If that factor is one of the lines or , its weighted multiplicity sum is exactly one, equal to its degree. Otherwise Bezout with those two lines gives
and each individual multiplicity is at most . At a vertex with all nonzero masses equal to , average the two row inequalities and discard the unselected multiplicity in the second row. At a vertex with one , average the two row inequalities and the bound , with coefficient on each. These are exactly (9) at the five vertices. Convexity and additivity over factors prove (9) in general. This argument also shows that the divisor consisting of a line minus these five weighted exceptional divisors is nef on the blowup of at the endpoint points.
The resulting upper bound for both beta constants
Return to the surface of Section 1 and take any big rational divisor
Symmetry and nefness are not assumed. A section of , for sufficiently divisible , is represented by a polynomial of degree at most in and at most in , with the required endpoint multiplicities. Write this polynomial as , where . Its vanishing order along is . At its vanishing order is
The factor is a unit at all five endpoint points. Apply (9) to , using the multiplicities required by . Every nonzero section therefore satisfies
The two filtrations of by vanishing at and at admit a common adapted basis. Sum (10) over that basis, divide by , and let tend to infinity. By the definition of beta,
For the bad pairs in question, the right side of (11) is precisely . At infinity the nested chain contributes . At two the single divisor contributes at most , with equality to leading order for fixed odd part of . Thus (11) prevents this application of the theorem from exceeding the available height. Allowing the odd part of to vary cannot improve the inequality.
This conclusion concerns this choice of approximation data: the chain at infinity and the divisor at two, with arbitrary weights at the five endpoint points. It does not rule out using additional information at two, other subschemes, or a different Diophantine theorem. Nor does it cover a sequence with bounded away from one. Finally, does not imply ; even positivity of all three limiting masses would not turn (11) into the required strict inequality.
Source and provenance
Keping Huang, Aaron Levin and Zheng Xiao,
A New Diophantine Approximation Inequality on Surfaces and Its
Applications, arXiv:2406.18879v1
(2024), Theorem 1.4 and Definition 2.14. The theorem was checked in the
primary TeX source Surface_20240510.tex, at the theorem labeled
BetaMain and the definition labeled regulardef.
The calculations (1)–(5) and the general obstruction (6)–(11) are deductions here, not claims made in that paper.