← All problems

Effective Mordell conjecture

Let KK be a number field. Let CC be a smooth, projective, geometrically connected curve of genus g≥2g\ge2 over KK, given by explicit homogeneous equations in some PKN\mathbb P^N_K. Let h ⁣:PN(Qˉ)→R≥0h\colon\mathbb P^N(\bar{\mathbb Q})\to\mathbb R_{\ge0} be the absolute logarithmic Weil height. Faltings' theorem says that C(K)C(K) is finite [1].

Conjecture (effective Mordell). There is an algorithm with the following property. Given as input a number field KK (for example, by the minimal polynomial of a primitive element) and equations for such a curve C⊆PKNC\subseteq\mathbb P^N_K, it outputs a real number B=B(K,C)B=B(K,C) such that

h(P)≤Bfor every P∈C(K).h(P)\le B\qquad\text{for every } P\in C(K).

There are only finitely many points of PN(K)\mathbb P^N(K) of height at most BB, 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 C(K)C(K) and proves that the list is complete. This is the "algorithmic Mordell" formulation [7].

A stronger, explicit form asks for a bound of shape

h(P)≤c1 h(C)+c2log⁡∣ΔK∣+c3,h(P)\le c_1\,h(C)+c_2\log|\Delta_K|+c_3,

with cic_i depending only on gg, NN, deg⁡C\deg C and [K:Q][K:\mathbb Q]. Here h(C)h(C) is the height of the coefficients of the defining equations and ΔK\Delta_K 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 22 over Q\mathbb Q 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 pp-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
  1. G. Faltings, "Endlichkeitssätze für abelsche Varietäten über Zahlkörpern", Invent. Math. 73 (1983), 349–366.
  2. P. Vojta, "Siegel's theorem in the compact case", Ann. of Math. 133 (1991), 509–548. doi:10.2307/2944318
  3. E. Bombieri, "The Mordell conjecture revisited", Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 17 (1990), 615–640.
  4. N. D. Elkies, "ABC implies Mordell", Int. Math. Res. Not. 1991, no. 7, 99–109.
  5. B. Lawrence and A. Venkatesh, "Diophantine problems and pp-adic period mappings", Invent. Math. 221 (2020), 893–999. doi:10.1007/s00222-020-00966-7
  6. J. S. Balakrishnan, A. J. Best, F. Bianchi, B. Lawrence et al., "Two recent pp-adic approaches towards the (effective) Mordell conjecture", survey (2019). arXiv:1910.12755
  7. L. Alpöge and B. Lawrence, "Conditional algorithmic Mordell", preprint (2024). arXiv:2408.11653
  8. 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
  9. R. F. Coleman, "Effective Chabauty", Duke Math. J. 52 (1985), 765–770. doi:10.1215/S0012-7094-85-05240-8
  10. N. Garcia-Fritz and H. Pasten, "Effective Mordell for curves with enough automorphisms", preprint (2025). arXiv:2503.10443
  11. Wikipedia, Faltings's theorem.

Source: Wikipedia

Progress summary

Never refreshed

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.