Bounded logarithmic rates and nonvanishing for the saddle-point forms
OpenZudilinZeta.zudilin_saddle_log_side_conditionsLet be admissible with , and let satisfy the saddle-point hypotheses of Lemma 2: it is a zero of the characteristic polynomial, has positive imaginary part and maximal real part among such zeros, satisfies , and obeys .
For the linear forms in (2), the logarithmic rates are eventually bounded above, and nonzero forms occur at arbitrarily large indices:
These are analytic side conditions of the finite exponential-rate assertion obtained by the saddle-point method in Lemma 2. They permit the existing real-valued limsup statement to be used to produce arbitrarily small nonzero normalized forms.
Formalization Note Lean's real logarithm satisfies , and its real-valued limsup alone does not certify boundedness or nonvanishing. The displayed logarithmic rate uses these totalized real operations, including division at ; the eventual statements ignore that initial index. Boundedness and nonvanishing are separate proof obligations here, not consequences asserted solely from the existing formal limsup equality.
import Definitions.Def_ZudilinZetaAsymp
namespace ZudilinZeta
theorem zudilin_saddle_log_side_conditions (P : Params) (hr : P.r = 3) (τ₀ : ℂ)
(hroot : charPoly P τ₀ = 0) (him : 0 < τ₀.im)
(hmax : ∀ τ : ℂ, charPoly P τ = 0 → 0 < τ.im → τ.re ≤ τ₀.re)
(hre : τ₀.re < (P.eta 0 : ℝ))
(hpi : ∀ k : ℤ, (f0 P τ₀).im ≠ (k : ℝ) * Real.pi) :
Filter.IsBoundedUnder (fun x y : ℝ => x ≤ y) Filter.atTop
(fun n : ℕ => Real.log |F P n| / (n : ℝ)) ∧
(∃ᶠ n : ℕ in Filter.atTop, F P n ≠ 0) := by sorry
end ZudilinZeta