Real Tate integrals of Gaussian times polynomial: Γ_ℝ-factorisation
Provedexists_entire_tateIntegral_polyGaussLinear_eq_GammaR_mulFix a natural number (a degree bound) and with . The assertion is the existence of a single function of four arguments, a coefficient vector , two reals and a complex , with the following four properties. First, for every and all real (no positivity required), is differentiable on all of , i.e. entire. Second, for every , all real with , and every with , the integral over of (the powers of being complex powers) equals , where . Third, for every vertical strip, given by reals , there are constants and , depending only on the strip (and on , ), such that for all , all , all real and all with ,
Fourth, for each fixed , the map is continuous on the set where .
This is the archimedean (real-place) local computation behind Tate-style integrals: the Mellin transform of a polynomial times a Gaussian with a linear term factors as the real Gamma factor times an entire function whose growth in vertical strips and dependence on the Gaussian data are controlled uniformly. It is used in the cubic-induction step of the Langlands–Tunnell argument, where the analogous unfolding integral is shown to be times a differentiable function; the estimate rests on the two-sided bounds for in vertical strips.
import Mathlib.Analysis.SpecialFunctions.Gamma.Deligne import Mathlib.Data.Real.Sign set_option maxHeartbeats 4000000 set_option synthInstance.maxHeartbeats 400000 set_option backward.isDefEq.respectTransparency.types false set_option autoImplicit false
theorem exists_entire_tateIntegral_polyGaussLinear_eq_GammaR_mul (n δ : ℕ) (hδ : δ ≤ 1) :
∃ E : (Fin (n + 1) → ℂ) → ℝ → ℝ → ℂ → ℂ,
(∀ (c : Fin (n + 1) → ℂ) (A B : ℝ), Differentiable ℂ (E c A B)) ∧
(∀ (c : Fin (n + 1) → ℂ) (A B : ℝ), 0 < A → ∀ z : ℂ, 0 < z.re →
∫ ρ : ℝ, (∑ j : Fin (n + 1), c j * (ρ : ℂ) ^ (j : ℕ)) *
(Real.exp (-(Real.pi * (A * ρ ^ 2 + 2 * B * ρ))) : ℂ) * (Real.sign ρ : ℂ) ^ δ * ((|ρ| : ℝ) : ℂ) ^ (z - 1) =
Complex.Gammaℝ (z + δ) * E c A B z) ∧
(∀ σ₁ σ₂ : ℝ, ∃ (C M : ℝ) (N : ℕ), ∀ (c : Fin (n + 1) → ℂ) (A B : ℝ), 0 < A → ∀ z : ℂ, σ₁ ≤ z.re → z.re ≤ σ₂ →
‖E c A B z‖ ≤ C * (∑ j : Fin (n + 1), ‖c j‖) * max A A⁻¹ ^ N * (1 + |B|) ^ N *
Real.exp (Real.pi * B ^ 2 / A) * Real.exp (M * |z.im|)) ∧
(∀ z : ℂ, ContinuousOn (fun p : (Fin (n + 1) → ℂ) × ℝ × ℝ => E p.1 p.2.1 p.2.2 z)
{p : (Fin (n + 1) → ℂ) × ℝ × ℝ | 0 < p.2.1}) := by sorry