Saddle-point factorization of the Riemann kernel
ProvedRSInt.rsG_cpow_factorarda-rh65k-transfernumber-theoryriemann-zeta
Let and be real, a nonnegative integer with , and with . Put
Using principal complex powers and the formal division convention ,
This expresses the contour integrand in a form centered at the saddle point.
Preamble
import Definitions.Def_ArdaRH65K_RS_B2
import Definitions.Def_ArdaRH65K_RS_B3
import Definitions.Def_ArdaRH65K_RS_C0
import Definitions.Def_ArdaRH65K_RS_Entire
import Definitions.Def_ArdaRH65K_RS_Fold
import Definitions.Def_ArdaRH65K_RS_Kernel
import Definitions.Def_ArdaRH65K_RS_Mellin
import Definitions.Def_ArdaRH65K_RS_Strip
import Mathlib
/- RS_B3.lean -- lane RS, brick B3 (the explicit Riemann-Siegel remainder), part 2: the exact
saddle-point reduction. Mathlib-only (imports `RS_C0`).
## Vocabulary (height t > 0)
a = rsAlpha t = sqrt(t / 2 pi), N = rsNn t = floor a, p = rsFrac t = a - N,
rsThetaMain t = (t/2) log t - (t/2) log(2 pi) - t/2 - pi/8 (verbatim the corpus thetaMain),
rsPsi p = cos(2 pi (p^2 - p - 1/16)) / cos(2 pi p) (Gabcke's C0 = Riemann's Psi),
rsRem t = -lineUp (N + 1/2) (x |-> rsG x x^(-(1/2 + i t))) (the exact RS remainder, B2).
By B2 (`completed_re_eq_rs_cos`), on the critical line
Re completedRiemannZeta(1/2+it) = 2M ( sum_{n<=N} n^(-1/2) cos(phi - t log n) + Re(e^{i phi} rsRem t) ).
## What this file proves (no `sorry`, no `native_decide`, no new axioms)
* `rsRem_factor` : moving the remainder line to the saddle point a and factoring out the
stationary phase,
rsRem t = (-1)^(N+1) e^{i pi a^2} a^(-s) (rsJ p + rsE1 a p),
where rsJ is the tau = 2 Mordell integral (RS_C0) and rsE1 the error integral of the amplitude
rsPhi a w - 1, rsPhi a w = e^{2 pi i a w - pi i w^2} (1 + w/a)^(-s).
* `rs_phase` : e^{i phi} e^{i pi a^2} a^(-s) = a^(-1/2) e^{i (phi - rsThetaMain t - pi/8)}.
* `rs_remainder_exact` : the EXACT identity
2 Re(e^{i phi} rsRem t) - (-1)^(N+1) a^(-1/2) Psi(p)
= (-1)^(N+1) a^(-1/2) [ 2 Re(e^{-i pi/8}(e^{i delta} - 1) rsJ p)
+ 2 Re(e^{i (delta - pi/8)} rsE1 a p) ], delta = phi - thetaMain t,
so the C0-corrected remainder is controlled by |delta| |rsJ p| and |rsE1 a p| alone.
conjecture1_proved = False.
-/
open Complex MeasureTheory Filter Topology Set
open scoped Real ComplexConjugate
noncomputable section
section
namespace RSInt
end RSInt
open RSInt
/-! ## 0. Vocabulary -/
/-! ## 1. Shifting the denominator by an integer -/
/-! ## 2. The factorization at the saddle point -/
Formal statement
theorem RSInt.rsG_cpow_factor {a p : ℝ} (ha : 0 < a) {N : ℕ} (hN : a = N + p) (w : ℂ)
(hw : (a : ℂ) + w ≠ 0) :
rsG (a + w) * (a + w) ^ (-((1 / 2 : ℂ) + 2 * ↑π * a ^ 2 * I)) =
(-1) ^ N * cexp (↑π * I * a ^ 2) * (a : ℂ) ^ (-((1 / 2 : ℂ) + 2 * ↑π * a ^ 2 * I)) *
(cexp (2 * ↑π * I * w ^ 2) / rsD (p + w) * rsPhi a w) := by sorry
Source