Hidden dependencies in Stepanov's method
Stepanov's method bounds the number of points on y^2 = f(x) over F_p by an auxiliary polynomial whose existence follows from counting unknowns against linear conditions. We show that these conditions are far from independent and compute the rank of the condition system. Proved: the kernel is the set of pairs (R, S) of bivariate polynomials in a box with (X-Y)^M | f(Y)^((p-1)/2) R + f(X)^((p-1)/2) S. For M <= J, p > 2M+m and K+J large enough, the rank equals M(K+J+1-M) plus a sum of local contributions over the divisor of f: every branch point of y^2 = f contributes floor(M^2/4), and a place of even order 2k contributes a term capped at k. The proof works on the M-th infinitesimal neighbourhood of the diagonal in P^1 x P^1. For all M the same expression bounds the rank from above. Consequence: for elliptic curves the constant obtainable by the method in |S| <= p/2 + C sqrt(p) improves from sqrt(6) to sqrt(2). Explicit certificates up to p = 307 are checked directly on the point set. Similar dependencies occur in the Heath-Brown-Konyagin system for shifts of multiplicative subgroups. Superelliptic curves (v1.1): y^d = f(x). The same argument bounds the rank by local lengths at the branch points; equality holds in 80/80 computed cases. Stepanov's independence lemma is proved for all d (v1.2), so the method reaches sqrt(2) times the Weil constant for every d and m with gcd(m, d) = 1. New in v1.2: the sqrt(2) corollaries are proved with explicit parameters (for elliptic curves |S| <= p/2 + (2p-5)/(sqrt(2p-9)-3) for p >= 11); the two-index Heath-Brown-Konyagin rank is A*min(B, D); exact ranks at p <= 151 show that the rank bound is the true threshold there; for shifts of multiplicative subgroups an independence lemma for exponent sets with short rows lets the Heath-Brown-Konyagin method reach #{x in H : x+1 in H} <= (3*2^(-2/3) + o(1))|H|^(2/3) with truncated triangular exponent sets (rectangles: (27/2)^(1/3)), reproducing Mattarei's best known constant inside Stepanov's method; and the arithmetic core is formalized in Lean 4 with Mathlib. A rank bound for the three-index Heath-Brown-Konyagin system, with local contributions from 0, -1 and infinity, is proved for arbitrary exponent sets (equality in 544 of 630 computed cases). Beyond M = J full equality of the rank fails, while the kernel threshold matches the bound in all 347 computed cases; this is stated as a conjecture. The archive contains the manuscript (PDF and LaTeX source), the Python code that computes ranks and certificates, unit tests and all measured data. The manuscript and data are licensed under CC BY 4.0; the code is licensed under the MIT license.
Authors
- Hakvin Vosteen
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24407364
- Primary Topic
- Algebraic Geometry and Number Theory
- Type
- preprint