A concise mathematical exposition has laid out why one of number theory’s central questions remains unresolved: whether two different ways of measuring rational points on certain smooth cubic curves always give the same answer. The Birch and Swinnerton-Dyer conjecture says they do, but the paper emphasizes that no general proof is known.
The discussion concerns rational points on smooth cubic plane curves, with the rank question restricted to curves that have at least one rational point. It is a brief, partially informal introduction to the conjecture and its rank definitions.
Two routes to the same mathematical quantity
The first route starts with geometry. A third-intersection rule, used together with a fixed point, supplies an addition operation on the projective cubic. The paper says this turns the points into an abelian group, in which the order of addition does not matter.
Mordell’s theorem, stated in the exposition, says that when the rational-point set is nonempty, the associated abelian group is finitely generated. The rank of the abelian group of rational points on the projective closure is called the algebraic rank.
The second route uses an L-function associated with the curve. The paper constructs it from a sequence indexed by primes, recording how the curve’s point counts deviate from a reference value, and packages that information in a Dirichlet-series and product construction. The analytic rank is the order of the resulting holomorphic L-function at s = 1.
Evidence, but no resolution
The conjecture proposes that the algebraic rank and analytic rank are equal for every curve in the stated class. That claim connects a question about rational points with information extracted from a function built from the curve’s behavior at primes.
The proposed link between point counts and rank is presented only as a heuristic—a line of reasoning meant to suggest why the connection might hold. The paper explicitly says it relies on a wrong equality used for intuition, so the argument cannot serve as a proof.
There are important one-way results. The paper states that analytic rank 0 implies algebraic rank 0, while analytic rank 1 implies algebraic rank 1. The reverse direction, needed for a full equivalence in general, is not established by that result.
It also reports a measure-based result in which curves of analytic rank 0 form a set of positive measure and, using the one-way implication, a positive-measure subset satisfies the conjecture. The supplied discussion does not provide the measure or the proof details.
The numerical picture described in the paper is suggestive but limited. It reports an average algebraic rank below 1.17 and says that at least 62.5% of smooth plane cubics have algebraic rank 0 or 1. The exposition itself warns that these figures do not establish the conjecture, which remains widely open despite the numerical evidence.
Why the conjecture matters
The paper describes a practical payoff if the conjecture is true. Effective algorithms can compute analytic rank when it is at most 3; under BSD, those computations would also give the algebraic rank.
In the paper’s formulation of the congruent-number problem, n is congruent exactly when its associated smooth plane cubic has infinitely many rational points. Under the Birch and Swinnerton-Dyer conjecture, that becomes a criterion based on positive analytic rank; the paper also mentions numbers congruent to 5, 6 or 7 modulo 8.
A guide to an open problem
The document is identified as arXiv:2608.25975v1, dated 26 August 2026. Its stated role is orientation: it introduces the two rank definitions, summarizes selected theorems and evidence, and describes conditional applications. It does not present a general proof of the conjecture, which the paper says remains widely open.
Paper data and sources
Original title: Introduction to the Birch and Swinnerton-Dyer Conjecture
Authors: Fabio Ferrari Ruffino
Journal/Repository: Matemática Contemporânea, Volume 61, pages 153-173 (2025)
Status: Peer-reviewed
First online: 2026-08-26
DOI: 10.1007/s44425-025-00035-2
Original paper · Full text