In 1922, Louis Mordell conjectured that algebraic curves of degree four or higher have only finitely many rational points — points whose coordinates are fractions. A circle (degree two) can have infinitely many, and some cubic curves can too, but beyond degree three, the geometry becomes restrictive enough that rational solutions should be sparse. In 1983, Gerd Faltings proved Mordell's conjecture, earning a Fields Medal. The result was a landmark: no high-degree curve can have infinitely many rational points.
But “finitely many” includes every number from zero to any number you can name. Faltings's theorem says the count stops. It does not say where. A curve might have three rational points or three trillion. The theorem gives no way to distinguish. For any specific curve, finding the actual count requires separate, often formidable computation. The general result — finiteness — is silent about magnitude.
In February 2026, three mathematicians including Shengxuan Zhou posted a preprint establishing the first uniform upper bound on rational points for all curves of a given degree. The bound depends on two things: the degree of the polynomial defining the curve and the structure of its Jacobian variety. For any curve in the mathematical universe, the formula produces a number, and the curve cannot have more rational points than that number. Previous bounds either didn't apply to all curves or depended on the specific equation — they worked for individual curves, not for curves as a category.
The shift from Faltings to the new bound is not a quantitative improvement on the same kind of result. It is a change in the kind of thing that is known. Faltings answered the question “does it end?” The new result answers “where does it end?” These questions appear to form a natural sequence — first prove finiteness, then find the bound. But the gap between them is 43 years, a Fields Medal's worth of difficulty apart. The tools that prove finiteness are not the tools that produce bounds. Faltings used deep algebraic geometry — Arakelov theory, modular curves, height functions. The bound requires different machinery entirely. The two results share a subject but not a method.
The general pattern: knowing that a quantity is finite tells you almost nothing useful about it. “Finite” is a topological statement — the set is bounded, the sequence terminates, the count doesn't grow forever. But bounded by what? Terminating where? The answer to “does it stop?” and the answer to “where does it stop?” belong to different epistemic categories. You can know one without the other. Knowing one does not make the other easier. The 43-year gap between Faltings and the uniform bound is not a gap in effort or talent. It is the distance between two kinds of mathematical knowledge that happen to concern the same objects.
This asymmetry recurs wherever existence proofs precede constructive results. We know that Nash equilibria exist in every finite game, but computing them is PPAD-complete — harder than it sounds, and the existence proof provides no algorithm. We know that every map can be colored with four colors, but the four-color theorem's proof doesn't produce the coloring for a given map. Existence says the answer is out there. Locating it is a separate problem, often a harder one, solved by different people using different tools after a gap that the existence proof itself cannot shorten.