Chapter 2 The Prime Shadow and Landau’s Trap: Turning Zeros into Signs
Chasing an invisible zero across the infinite complex plane is like trying to catch a mosquito in the dark with a butterfly net. The smarter trick is to set a scale on the real line: if a zero dares step off center, the balance tips visibly to one side.
Directly solving across the half-plane is hopeless—the imaginary part runs off to infinity, and you cannot patrol every height one zero at a time.
Instead, we haul the entire complex problem down onto the real number line. Specifically, we watch a single real-valued prime ledger and its fluctuation .
2.1 Hand-Computing the Prime Shadow
To keep track of primes, analytic number theorists hire a crisp accountant called the von Mangoldt function :
- if is a prime power (such as ), it records ;
- otherwise (for , , and so on), it records .
Why weight prime powers by instead of just counting ? Because primes thin out with density roughly . Multiplying by flattens the average step size to —a mathematical governor that keeps the speed steady.
Even with , the raw sum jumps sharply upward at every prime power. To smooth out those jagged steps, StatementOC.lean integrates once (a Cesàro average):
where is the Euler–Mascheroni constant. Subtracting the smooth main term leaves : the pure oscillating shadow of the primes.
Let us plug in concrete numbers by hand using , , , and :
- At : only contributes ( has factor ), so . Subtracting gives .
- At : summing over gives and .
- At : , while , leaving .
- At : versus main term , leaving !
Notice what just happened: even as grows from to and both terms climb past , their difference hovers calmly around the constant (the residue contribution ):
| Smooth term | Shadow | |||
|---|---|---|---|---|
The prime fluctuation shadow vs. an off-line rogue wave. The cyan curve plots exact computed values of , staying calmly near zero inside the dashed green envelope. By contrast, a hypothetical off-line zero at (magenta MODEL wave ) rapidly bursts right through the barrier.
The formalization first establishes that is well-behaved and Lipschitz continuous—it can never spike arbitrarily steeply:
There exists a constant such that for all real numbers ,
Starting from and Chebyshev’s upper bound on , one obtains Mertens’ bound . Writing piecewise linearly minus bounds every local derivative by , yielding a uniform Lipschitz constant on . The full proof is checked by the Lean kernel.
2.2 The Mellin Transform and Landau’s Trap: Why a One-Sided Bound Kills Complex Zeros
Now we wire this real-line prime ledger back to in the complex plane. The connecting cable is the Mellin transform: integrate a function of against . For any real sequence bounded by , the smoothed sum transforms into an exact Dirichlet series divided by :
Suppose and satisfy for all . Then is measurable, for all , and for all with ,
Interchange summation and integration by Fubini/dominated convergence. Each single term evaluates in closed form to for , and summing over yields the -series divided by . The full proof is checked by the Lean kernel.
For , the series is . Subtract the Mellin transforms of and , and the pole at cancels clean away! What remains is a meromorphic function whose only poles in sit at the zeros of .
Now comes Edmund Landau’s masterstroke—the non-negative integral trap (Landau’s Lemma).
Picture walking westward along the real axis from toward , carrying a function whose values are never negative. Expand its Mellin integral in a Taylor series around a real point toward :
Look at the signs: and leaves zero room for cancellation! Every term in the Taylor series is positive. So as long as continues analytically along the real interval , that all-positive series converges—which forces the integral itself to converge everywhere in the half-plane . And a convergent integral cannot blow up at a complex pole!
When every entry in the ledger has the same sign, complex zeros lose their camouflage: unable to hide behind cancellation on the real axis, they cannot exist off the real axis either.
Lean proves this analytic backbone cleanly:
Given the Mellin differentiation rule MellinDeriv: if , is measurable on with , for all , and an analytic function agrees with that integral for while extending analytically to the real interval , then for every ,
Suppose for contradiction that the abscissa of convergence lies in . Expanding at a point slightly right of turns into the non-negative integral . Swapping summation and non-negative integration pushes integrability past to some , contradicting the definition of . The full proof is checked by the Lean kernel.
Here is why Landau’s lemma is pure magic for : we do not even need a two-sided bound . A one-sided bound alone—either or —creates a non-negative function
On the real interval , it is elementary that (since is a decreasing alternating series). So is analytic along the whole real segment , Landau’s trap snaps shut, and cannot vanish anywhere in !
Let and . If there exist constants such that for all ,
then for all with .
Absorb the bounded values of on into to obtain a function for all . Using zetaRealNonvanish ( on ) together with Theorem 2.3 and the Mellin representation Theorem 2.2, the integral extends analytically to , precluding any logarithmic pole from a zero of in that half-plane. The full proof is checked by the Lean kernel.
Let and . If for every there exist such that for all , then for every with .
For any with , pick and apply Theorem 2.4 at threshold . The full proof is checked by the Lean kernel.
And the same mechanism generalizes cleanly to Dirichlet character sums and complex linear combinations (OCStep, FamilyLandauC in StatementOC.lean / StatementFL.lean): whoever pins down the one-sided fluctuation to clears the entire right half-plane.
Landau explicit-formula rogue wave: The cyan curve computes directly from (, ), remaining inside the dashed envelope, while the magenta MODEL wave for breaks through near and swings to by .
2.3 Where Classical Weapons Stall: de la Vallée Poussin and Siegel
Before we unveil the genuinely new engines in Chapters 3–6, let us be honest about two classical pillars built more than a century ago. Neither one comes anywhere near on its own, yet both are formalized in full inside the repository because the later machinery needs them as local scaffolding.
The first is the 1896 Hadamard–de la Vallée Poussin zero-free region, built on the humble trigonometric inequality
It pushes zeros away from , yet as grows the protected strip hugs the wall ever tighter and never approaches :
There exists a constant such that for all with and
we have .
Combines the local logarithmic-derivative expansion landauLocal with Mertens’ prime estimate, the positivity inequality, growth bounds in the right half-plane, and an explicit check at bounded heights. The full proof is checked by the Lean kernel.
The second classical pillar is Carl Ludwig Siegel’s 1935 lower bound on for real quadratic characters—the shield against possible Landau–Siegel real zeros close to , without which averaging over arithmetic progressions would lose control of bad moduli :
For every , there exists a constant such that for every positive modulus and every nontrivial real Dirichlet character modulo (, ),
Constructs an auxiliary product -function whose coefficients satisfy the key inequality bqKey, then splits by whether an exceptional real zero close to exists. As classically, the constant is ineffective, which suffices for the Siegel–Walfisz-type prime estimates needed later. The full proof is checked by the Lean kernel.
So the classical toolbox is on the table. Why did trigonometric positivity and single log-derivative bounds get stuck just left of for over a century?
Because only uses first-order positivity—it sees only single ripples of primes and has no way to enforce high multiplicity over the integers.
Old methods hit a wall not because primes are too wild, but because they try to measure an ocean with a one-inch ruler.
In the next chapter, we look at the finite-field miracle that breaks that wall—Stepanov’s high-multiplicity polynomial trick—and see how the proof forces the stubborn integers to submit to differentiation.
The full mirror and prime-shadow lab: Switch freely between the complex -plane mirror and the computed fluctuation view, drag the test zero across the critical strip, and explore all four presets (on-line, off-line, imprimitive, landau-trap).