Affine space & affine varieties
Forget where the origin is, and the natural maps become the affine ones — a linear part and a shift. Ask which points make a system of polynomials vanish and you get a variety, paired with an ideal of equations by a clean dictionary. Complete the plane with points at infinity and a single cubic becomes an elliptic curve that carries a group — whose rank is the deepest unsolved question about it. The geometric floor under the elliptic-curve and modular-forms climb — Cox's Ideals, Varieties, and Algorithms for the dictionary, Silverman's Arithmetic of Elliptic Curves for the payoff.
1 · The simplest affine map:
Start on the line. A linear map fixes the origin (); allow a shift and you have an affine map. Slide the stretch and the shift , and watch a line stay a line:
An affine map is a linear part (the stretch , a flip if ) plus a shift — the most general map that sends lines to lines and keeps ratios along them (watch the equal gaps stay equal). Set and nothing moves; otherwise one fixed point stays put while the rest slides past it. It is exactly what the calculator does to a variable (), and standardizing is the affine map to mean , variance .
2 · Affine space — a vector space that forgot its origin
Affine space is with the zero demoted — no privileged origin, no adding points. What survives: the difference of two points is a vector, and affine combinations with (weighted averages — the segment, the triangle).
The maps that respect this are the affine maps . Pick an origin and becomes the vector space — the change of basis move, now free to move the origin too.
3 · Affine varieties — and the ideal ⇄ variety dictionary
Now put equations on the space. An affine variety is the common zero set of polynomials, A line is , a circle is , and a cubic is the curve we are heading for. The deep move is a dictionary betweengeometry and algebra: to a variety attach the ideal of all polynomials vanishing on it, and to an ideal attach its zero set . Hilbert's Nullstellensatz makes the loop nearly exact over an algebraically closed field: . Geometry becomes computable — intersect varieties by adding ideals, project by eliminating variables — and the engine that runs it is the Gröbner basis (this is the heart of Cox, Little & O'Shea).
Each equation is a shape — the variety , the points where . Two shapes meet exactly where both equations hold, so the gold points are the solutions of the system — the single most common task in applied math (GPS is two circles meeting; robot kinematics, CAD, and optimization are all polynomial systems). Slide B and watch two real solutions slide together, touch (a double root — tangency), then vanish: they became complex. By Bézout, the count over is always — the real plane just hides some. Pick Cubic and a Line: three intersections — the chord of the group law. That is all algebraic geometry is: equations in, shapes out, and the ideal ⇄ variety dictionary translating between them.
One thing the explorer hides: which equation? A shape is cut out by infinitely many, and the ideal is the canonical object that holds them all — watch four polynomials trace the same circle:
Four different polynomials, one circle. The shape — the variety — does not pin down the equation; infinitely many polynomials vanish on it, and together they form the ideal . Here every one is a multiple of a single generator, — closed under addition and under multiplying by anything (that is what makes it an ideal, not just a set). Bump the constant to and the shape moves — a different ideal. This is why algebraic geometry carries the ideal, not a chosen equation: remembers the shape, remembers everything that vanishes — and the Nullstellensatz says the ideal is exactly the radical, multiplicities and all.
4 · Completing the picture — points at infinity
Affine space has a defect: parallel lines never meet. Projective space repairs it by adjoining one point at infinity per direction — formally, lines through the origin in , in homogeneous coordinates .
Homogenizing lifts a variety to its projective closure and Bézout holds exactly: a line meets a degree- curve in points (with multiplicity, counting infinity). For our cubic, that one extra point is what makes the curve a group.
5 · Elliptic curves — the chord-and-tangent group law
An elliptic curve is a smooth projective cubic with a chosen base point — affinely, with discriminant , plus the point at infinity . Its points form an abelian group: to add and , draw the line through them, take its third intersection with the curve, and reflect across the -axis. The tangent line doubles a point; the vertical line sends a point to its inverse, with the identity. Drag and and watch the law work — this is an affine variety that is also a group.
An affine variety — the zero set in the plane — that secretly carries a group. A line meets a cubic in three points; call the third R, reflect it, and you have P+Q. A vertical line's third point is the one we adjoined when we passed to — the point at infinity , which acts as the identity. The chord gives addition, the tangent gives doubling, and associativity (the hard axiom) is a theorem. Count the points of this same equation over a finite field and you get — the very numbers that become traces of Frobenius in the Eigenbook. Affine geometry (Cox), arithmetic payoff (Silverman).
6 · Two ranks — the Birch–Swinnerton-Dyer conjecture
Read the curve over a finite field and its point-count is an arithmetic fingerprint, with (Hasse). Hidden in those counts is the deepest invariant — the rank, how many independent rational points the curve carries — and Birch–Swinnerton-Dyer says that algebraic rank equals the analytic rank, the order of vanishing of at . Their evidence was a growth law you can watch: . Pick a curve and see the product fan apart by rank.
Two numbers that look unrelated. The algebraic rank counts independent rational points — global, infinite, hard. The analytic rank is how hard the L-function vanishes at — an analytic property of a generating function in the . Birch–Swinnerton-Dyer: they are equal — and the rank shows up as the growth rate of the point-count product, , which is exactly the fan you are watching. Local counts mod forecast the global rank: that is the miracle. Honest status: BSD is a Millennium Prize problem, open in general — proven only for analytic ranks 0 and 1 (Gross–Zagier, Kolyvagin). The bridge to the Eigenbook: these same are traces of Frobenius.