An epsilon-delta bound for the normalized zeta-system factor
ProvedWikipedia.SzemeredisTheorem.exists_norm_normalizedZetaSystemFactor_sub_one_ltadditive-combinatoricsgreen-tao-port-8822number-theory
For every finite index type and , there is such that complex coordinate vectors with sup norms below satisfy .
Preamble
/- Mechanically transplanted from https://github.com/plby/lean-proofs.git at 8822f7ddef30fadbd92e1c6ab4ed897af356af5e. Original scopes and proof bytes are oracle-derived. -/ import Definitions.Def_GreenTaoPort_Wikipedia_GreenTao_Sieve_ZetaNearOne import Mathlib.NumberTheory.Harmonic.ZetaAsymp set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Uniform zeta control near the pole at one Mathlib completes the singular function `z ↦ z * riemannZeta (1 + z)` across `z = 0` by means of the entire function `riemannZeta₁`. This file packages that completion in the coordinates used by the Goldston--Yıldırım argument. In particular, the completed residue factor is uniformly close to one on a small complex ball, and the corresponding two-variable normalized zeta ratio is uniformly close to one on a small polydisc. The latter is the stable way to state the zeta comparison: all apparent singularities have already been removed. Separate lemmas recover the raw zeta expressions away from zero. -/ open Wikipedia.SzemeredisTheorem open Filter open scoped BigOperators Topology /-! ## Finite systems of paired zeta factors -/
Formal statement
theorem Wikipedia.SzemeredisTheorem.exists_norm_normalizedZetaSystemFactor_sub_one_lt
{κ : Type*} [Fintype κ]
{ε : ℝ} (hε : 0 < ε) :
∃ δ : ℝ, 0 < δ ∧
∀ u v : κ → ℂ,
‖u‖ < δ →
‖v‖ < δ →
‖normalizedZetaSystemFactor u v - 1‖ < ε := by sorry
Source