Unifying Elliptic Curves and Modular Forms: A Review of 'A First Course in Modular Forms' — Epoche C1
A Paradigm Shift in Number Theory An elliptic curve over the rational numbers is, concretely, the set of solutions of an equation $y^2 = x^3 + ax + b$, where $a$ and $b$ are rational numbers chosen so that the cubic on the right has three distinct roots — equivalently, so that the discriminant $\Delta = -16(4a^3 + 27b^2)$ is non-zero, which guarantees the curve is smooth, with no sharp point or self-crossing. The arithmetic question is ancient: which points on the curve have rational coordinates? What sets elliptic curves apart from other Diophantine equations is that their rational points form a group. Given two rational points $P$ and $Q$, the straight line through them meets the cubic in exactly one further point (a line meets a curve of degree three in three points, counted with multiplicity, and if two intersection points have rational coordinates the third must as well, since it is the remaining root of a cubic with rational coefficients); reflecting that third point in the $x$-axis defines a sum $P + Q$ that is again a rational point. Mordell proved in 1922 that this group is finitely generated: a finite list of rational points suffices to produce every other one by repeated chord-and-tangent constructions. In group-theoretic notation, $E(\mathbb{Q}) \cong \mathbb{Z}^r \oplus T$ — some number $r$ of independent points of infinite order, together with a finite torsion part $T$. Weil's extension of this result to number fields gives it its modern name, the Mordell–Weil theorem. For decades the study of these rational points proceeded through classical algebraic methods — descent arguments in the style of Fermat, height functions, the machinery of algebraic geometry — and it was natural to assume this was the only available toolkit. The profound shift in perspective, masterfully elucidated in Diamond and Shurman's 'A First Course in Modular Forms' (2005), is that every elliptic curve over $\mathbb{Q}$ is secretly governed by an object from a different branch of mathematics altogether: a modular form, a complex-analytic function with an extravagant amount of symmetry. The common belief that the two subjects are disjoint, or connected only superficially, is thoroughly overturned by the book's exposition. The bridge is the Taniyama–Shimura conjecture, now the Modularity Theorem, and it was the crucial ingredient in the proof of Fermat's Last Theorem. Diamond writes with particular authority here: he is one of the four authors who completed the proof of the full Modularity Theorem in 2001. The Arithmetic Fingerprint: Counting Points Modulo p To see what the two sides of the bridge could possibly have in common, one must first extract numerical data from an elliptic curve. Fix a prime $p$ and read the equation $y^2 = x^3 + ax + b$ modulo $p$ — that is, as an equation among remainders on division by $p$. The solution set is now finite and can simply be counted. A rough estimate of the count comes from a symmetry of squares: for each of the $p$ possible values of $x$, the right-hand side is some fixed remainder $c$, and the equation $y^2 = c$ has two solutions when $c$ is a non-zero square modulo $p$, none when it is a non-square, and one when $c = 0$. For an odd prime, exactly half the non-zero remainders are squares, so one expects on average one value of $y$ per value of $x$: about $p$ solutions, plus one extra "point at infinity" that serves as the identity element of the group law. The interesting quantity is the deviation from this expectation, $$ a_p = p + 1 - \#E(\mathbb{F}_p), $$ where $\#E(\mathbb{F}_p)$ is the actual number of points modulo $p$. Hasse proved in the 1930s that the deviation is always small: $|a_p| \le 2\sqrt{p}$. At the finitely many bad primes — those dividing the discriminant, where the reduced curve acquires a singular point — the count is taken on the non-singular points, and $a_p$ is $1$, $-1$ or $0$ according to the type of singularity. These bad primes are bookkept by an integer $N$ called the conductor, divisible by exactly them. The sequence $a_2, a_3, a_5, a_7, \dots$ is the curve's arithmetic fingerprint, and the Modularity Theorem will assert that this fingerprint, generated by counting solutions of a cubic over every prime field in turn, coincides with one generated by an utterly different process. Modular Forms: Functions with an Extravagant Symmetry The book begins by establishing the foundational theory of the other side. The stage is the upper half-plane $\mathbb{H} = \{z \in \mathbb{C} : \mathrm{Im}(z) > 0\}$, the complex numbers with positive imaginary part. The modular group $\mathrm{SL}_2(\mathbb{Z})$ — the $2 \times 2$ matrices with integer entries and determinant $1$ — acts on $\mathbb{H}$ by the substitutions $z \mapsto \frac{az+b}{cz+d}$; a short computation shows such a map sends the upper half-plane to itself. A modular form of weight $k$ for a subgroup $\Gamma \subseteq \mathrm{SL}_2(\mathbb{Z})$ is a holomorphic (complex-differentiable) function $f$ on $\mathbb{H}$ satisfying $$ f\!\left(\frac{az+b}{cz+d}\right) = (cz+d)^k f(z) \quad \text{for all } \begin{pmatrix} a & b \\ c & d \end{pmatrix} \in \Gamma, $$ together with a growth condition at the boundary, explained below. The factor $(cz+d)^k$ is not an arbitrary decoration. Differentiating the substitution and using $ad - bc = 1$ gives $\frac{d}{dz}\left(\frac{az+b}{cz+d}\right) = (cz+d)^{-2}$, so the weight-$2$ transformation law says precisely that the differential $f(z)\,dz$ is unchanged by every substitution in $\Gamma$. Weight-$2$ forms are geometric objects in disguise, and this is why weight $2$ — not $1$, not $12$ — is the weight that speaks to elliptic curves. The subgroups relevant here are the congruence subgroups $\Gamma_0(N)$: matrices in $\mathrm{SL}_2(\mathbb{Z})$ whose lower-left entry is divisible by $N$. The integer $N$ is called the level. Every such group contains the translation matrix $\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix}$, for which the transformation