Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Chapter 3 Differentiating the Integers: Stepanov’s Determinant and the Dream of Multiplicity

Give a mathematician polynomials, and derivatives come free with roots to count; hand them whole numbers, and the stone refuses to bend—until you embed the integers inside geometry, where even stones grow tangent lines.

Why was the Riemann Hypothesis over finite-field curves solved decades ago while the integers held out for 160 years?

Replace with a curve over a finite field (such as ). There, the analogue of RH fell first to André Weil, later to Pierre Deligne, and—in 1969—to a shockingly short, elementary proof by Sergei Stepanov that needed barely a handful of pages of high-school-level algebra.

Stepanov’s whole magic trick comes down to a single word: multiplicity.

3.1 Stepanov’s Trick: Why High-Order Zeros Beat Point Counting

Here is the core idea in thirty seconds. Suppose you want to bound how many rational points lie on a curve. If you build an auxiliary polynomial that simply equals at each point (multiplicity ), each point uses up unit of your degree budget , leaving you with only the trivial bound.

Now suppose you force at every rational point to vanish not only at , but also at !

Suddenly every single point counts times against the degree of . As long as is not identically zero, one line closes the trap:

Make large, and the upper bound drops by a factor of . Imagine a banquet table 100 inches long: if every guest takes 1 inch, you can seat 100 guests; if you require every guest to occupy 10 inches side by side, at most 10 guests can fit in the room.

Simple zeros police the doorway; only high multiplicity clears the room. Yet outside polynomial rings, who lets you differentiate a whole number?

Here sits the discrete wall that blocked analytic number theory for a century and a half. In polynomials over a field, differentiation is free. Over the integers , and sit one stubborn unit apart: you cannot let , so ordinary calculus falls through the floor.

3.2 Manufacturing Derivatives Out of Integers: Quadrics, CM Curves, and Graded Weyl Divisibility

To force whole numbers to yield multiplicity , the proof engineers two complementary mechanisms that secretly speak the same geometric language:

  1. The geometric disguise: path quadrics and CM curves. Sums over Dirichlet characters are converted, via repeated Parseval identities and “path quadrics” , into bilinear pairings; and on elliptic curves with complex multiplication (CM), the invariant derivation satisfies at inert primes, acting as a built-in algebraic differentiation switch that forces divisibility by prime powers.
  2. The algebraic backbone: divided powers and Fock positivity. Whenever you build an object with “multiplicity ” over integers rather than complex numbers, ordinary derivatives spit out nasty factorials that tangle denominators. You have to replace derivatives with divided-power operators (rowDiv) and prove that the integral Weyl module stays locked tightly to its symmetric dual equations!

Left: simple crossing vs. multiplicity- tangency; Right: graded Weyl weights and the Fock staircase. On the left, the cyan quintic hugs the axis flat so one root consumes five units of degree. On the right, starting from the amber highest-weight corner, divided-power row operators rowDiv step cleanly down the grid while staying inside the green Weyl boundary under the cyan Fock inner product.

Let us look right inside this algebraic gearbox (GradedWeylDivisibility) with bare hands. Picture an matrix of variables where columns carry weight and rows carry symmetry. How do you guarantee that the span generated from the highest-weight vector by divided-power row operators (weyl) matches the kernel of column-symmetry equations (dualWeyl)—not only over , but up to controlled integer multipliers over ?

Enter an old friend from quantum mechanics: the Fock (Fischer) inner product! Given two rational polynomials , define

summing over monomials weighted by the product of factorials of their exponents! Just like creation and annihilation operators on a harmonic oscillator, multiplication by and differentiation —and more generally opposite divided-power row operators rowDiv a b k and rowDiv b a k—are exact adjoints of each other under this positive-definite pairing!

Five crisp theorems verified in FinalB.lean lock this gearbox shut:

Lemma 3.1 (Symmetry and strict positivity of the rational Fock pairing)LEAN ✓

For any index type and any multivariate polynomials , the rational Fock pairing is symmetric, , and whenever ,

Proof

In , every factorial product is strictly positive over ; if , at least one monomial coefficient is nonzero, making the sum strictly positive. The full proof is checked by the Lean kernel.

Lemma 3.2 (Fock adjointness of divided-power row operators)LEAN ✓

For all , all row indices , all , and all ,

Proof

Verified directly on monomial bases by matching the binomial factors produced when transferring powers from row to row against those from row to row weighted by exponent factorials. The full proof is checked by the Lean kernel.

Lemma 3.3 (Divided-power closed subspaces are row-weight graded)LEAN ✓

Let be a -submodule closed under all divided-power row operators . Then for every and every row weight , the -homogeneous component of also belongs to .

Proof

Scaling individual rows over the infinite field separates row-weight components via Vandermonde interpolation, and invariance under diagonal scaling is preserved by divided-power closure. The full proof is checked by the Lean kernel.

Put those three pieces together and any mismatch between weyl and dualWeyl vanishes on the spot: if weyl were strictly smaller than dualWeyl, its Fock-orthogonal complement would be non-empty; by positivity and adjointness, climbing by raising operators inside that complement would produce a second independent highest-weight line—contradicting the uniqueness of the highest-weight line!

Theorem 3.4 (Coincidence of rational Weyl and dual Weyl modules)LEAN ✓

For all natural numbers and every antitone weight , the rational Weyl and dual Weyl modules coincide:

Proof

Under the positive-definite Fock pairing (Lemma 3.1), weyl is the smallest divided-power closed submodule containing the highest-weight vector. By adjointness (Lemma 3.2) and grading (Lemma 3.3), any nonzero element in its orthogonal complement inside dualWeyl raises to a nonzero highest-weight vector orthogonal to hw, contradicting highest-weight uniqueness (hwLine). The full proof is checked by the Lean kernel.

Corollary 3.5 (Integral clearing of denominators for dual Weyl elements)LEAN ✓

For all , every antitone weight , and every integral element , there exists a nonzero integer such that

Proof

Embed into the rational module , express it in the rational Weyl basis via Theorem 3.4, and clear a common integer denominator back into . The full proof is checked by the Lean kernel.

See what this machine guarantees? No matter how high you stack algebraic multiplicity over , your integral structures never spring a rational-denominator leak.

Yet having a leak-proof algebraic container still leaves the central creative mystery unanswered: when staring at a von Mangoldt prime sum of length , where do we find a machine that actually manufactures layers of multiplicity natively in the automorphic world?

When a single space cannot bear the multiplicity you need, do not force one ruler harder—chain a sequence of mirrors so each reflection buys one more order of vanishing.

In the next chapter, we meet the signature leap of the entire proof: chaining unitary theta lifts end to end.