New Algebraic Points on Curves
Maleeha Khawaja, Samir Siksek
TL;DR
This work investigates how L-new points on a hyperbolic curve behave as L runs through degree-n extensions of the base field, proposing a statistical Diophantine stability conjecture that C(L)_new should be empty for 100% of fields in natural discriminant-ordered families. The authors develop a multi-pronged approach: a single-source reduction that forces most primitive degree-n points to lie in fibers of a degree-n map to P^1, discriminant-density analyses for polynomials defining L_t, and powerful results on cubic fields from Bhargava–Taniguchi–Thorne, complemented by Vojta’s theorem and unit-equation analyses. They verify the conjecture for n = 2 and certain hyperelliptic modular curves X0(N) (N ≠ 37) and for n = 3 on X0(23), X0(29), X0(31), X0(64), plus an analogue for the unit equation. Collectively, the results provide statistically compelling evidence that new points over random degree-n fields are rare, supporting a probabilistic view of Diophantine stability and offering concrete verifications on central families of curves.
Abstract
Let $C$ be a smooth projective absolutely irreducible curve of genus at least 2, defined over the rationals. For a number field $L$, we define the set of $L$-new points on $C$ to be $C(L)_{new} = \{P \in C(L) : \mathbb{Q}(P)=L\}$; this is the set of points on $C$ defined over $L$ but not any strictly smaller field. Let $n$ be at least 2. We conjecture that $C(L)_{new}$ is empty for 100 percent of degree $n$ number fields $L$ when ordered by absolute discriminant. For degrees $n=2$, $3$, we give sufficient criteria for our conjecture to hold in terms of an explicit model for $C$. For general $n$ we prove a theorem that harmonises with the conjecture. In particular, we verify our conjecture for $n=2$ and $C=X_0(N)$ for the $18$ values $N \ne 37$ such that $X_0(N)$ is hyperelliptic, and also for $n=3$ and $C=X_0(23)$, $X_0(29)$, $X_0(31)$, $X_0(64)$. Moreover, we prove the analogue of our conjecture for the unit equation, again with $n=3$.
