Effective Mordell conjecture
Let be a number field. Let be a smooth, projective, geometrically connected curve of genus over , given by explicit homogeneous equations in some . Let be the absolute logarithmic Weil height. Faltings' theorem says that is finite [1].
Conjecture (effective Mordell). There is an algorithm with the following property. Given as input a number field (for example, by the minimal polynomial of a primitive element) and equations for such a curve , it outputs a real number such that
There are only finitely many points of of height at most , and they can be enumerated. So the conjecture is equivalent to the existence of an algorithm that, on the same input, outputs the finite set and proves that the list is complete. This is the "algorithmic Mordell" formulation [7].
A stronger, explicit form asks for a bound of shape
with depending only on , , and . Here is the height of the coefficients of the defining equations and is the discriminant. Bounds of this type are predicted by Vojta's height conjecture. Any effective bound already answers the conjecture above.
Background
Mordell conjectured in 1922 that a curve of genus at least over has only finitely many rational points. Faltings proved this over every number field in 1983 [1]. Vojta and Bombieri later gave proofs by Diophantine approximation [2, 3], and Lawrence and Venkatesh gave a proof by -adic period maps [5]. All of these proofs are ineffective. They bound the number of points, but they give no bound on their heights, so they do not find the points.
The contrast is with integral points on curves: Baker's method from transcendence theory gives effective height bounds for integral points in many cases. Elkies showed that a uniform effective abc conjecture over number fields would imply effective Mordell, using Belyi maps [4]. This is one reason the problem is regarded as a central test of effectivity in Diophantine geometry. [6]
References
- G. Faltings, "Endlichkeitssätze für abelsche Varietäten über Zahlkörpern", Invent. Math. 73 (1983), 349–366.
- P. Vojta, "Siegel's theorem in the compact case", Ann. of Math. 133 (1991), 509–548. doi:10.2307/2944318
- E. Bombieri, "The Mordell conjecture revisited", Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 17 (1990), 615–640.
- N. D. Elkies, "ABC implies Mordell", Int. Math. Res. Not. 1991, no. 7, 99–109.
- B. Lawrence and A. Venkatesh, "Diophantine problems and -adic period mappings", Invent. Math. 221 (2020), 893–999. doi:10.1007/s00222-020-00966-7
- J. S. Balakrishnan, A. J. Best, F. Bianchi, B. Lawrence et al., "Two recent -adic approaches towards the (effective) Mordell conjecture", survey (2019). arXiv:1910.12755
- L. Alpöge and B. Lawrence, "Conditional algorithmic Mordell", preprint (2024). arXiv:2408.11653
- V. Dimitrov, Z. Gao and P. Habegger, "Uniformity in Mordell–Lang for curves", Ann. of Math. 194 (2021), 237–298. doi:10.4007/annals.2021.194.1.4
- R. F. Coleman, "Effective Chabauty", Duke Math. J. 52 (1985), 765–770. doi:10.1215/S0012-7094-85-05240-8
- N. Garcia-Fritz and H. Pasten, "Effective Mordell for curves with enough automorphisms", preprint (2025). arXiv:2503.10443
- Wikipedia, Faltings's theorem.
Source: Wikipedia
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.