Zeros from an alternating-sign sample chain
ProvedZetaReflection.alternating_signs_chainarda-rh65k-transfernumber-theoryriemann-zeta
Let lie in , and suppose consecutive values of the defined real function have strictly opposite signs:
Then there is a strictly increasing list of heights in for which
Here is the completed Riemann zeta function. The list provides distinct critical-line zeros for the counting argument.
Preamble
import Definitions.Def_ArdaRH65K_Turing121_DiffractionCore
import Definitions.Def_ArdaRH65K_Turing121_DlvpTheta
import Definitions.Def_ArdaRH65K_Turing121_DlvpZetaRateEffective
import Definitions.Def_ArdaRH65K_Turing121_RHInBoxAnalytic
import Definitions.Def_ArdaRH65K_Turing121_StripRepr
import Definitions.Def_ArdaRH65K_Turing121_StripReprR1
import Definitions.Def_ArdaRH65K_Turing121_TuringBand
import Definitions.Def_ArdaRH65K_XiLineZeros
import Mathlib
import Theorems.Thm_ZetaReflection_exists_zero_of_sign_change
namespace XiLineZeros
end XiLineZeros
namespace ZetaZeroLocalization
end ZetaZeroLocalization
/- SignChain.lean -- A2 Theorem 7: the alternating-sign-chain → hLine lemma.
Generalizes the per-instance IVT pattern of `XiLineZeros` (lambda_zero_*, lambda_two_zeros_*,
lambda_five_zeros_*) into ONE lemma parameterized by an arbitrary grid of `n+1` points:
alternating_signs_chain
Given `n+1` strictly increasing grid points `p₀ < p₁ < … < pₙ` in `[T0, T1]` at which the
real critical-line function `gLine` takes strictly sign-alternating values (encoded as the
single per-interval condition `gLine pᵢ · gLine pᵢ₊₁ < 0`), it produces the VERBATIM T5
`hLine` shape (see `TuringBand.BandStatement`):
∃ xs : List ℝ, xs.length = n ∧ xs.IsChain (· < ·) ∧
(∀ t ∈ xs, T0 ≤ t ∧ t ≤ T1) ∧
(∀ t ∈ xs, completedRiemannZeta (1/2 + t·I) = 0)
Each of the `n` consecutive sign-change subintervals yields, by the intermediate value
theorem on the continuous `gLine`, one interior zero; strict monotonicity of the grid
orders the zeros into a `<`-chain. A reflected sign-sweep (kernel-checked rational bounds
on `gLine` at the grid points, of alternating sign) discharges `hLine` through this lemma.
conjecture1_proved = False.
-/
open Complex ZetaZeroLocalization XiLineZeros
section
namespace ZetaReflection
end ZetaReflection
open ZetaReflection
Formal statement
theorem ZetaReflection.alternating_signs_chain
(T0 T1 : ℝ) (n : ℕ) (p : Fin (n + 1) → ℝ)
(hmono : StrictMono p)
(hlo : T0 ≤ p 0) (hhi : p (Fin.last n) ≤ T1)
(hsign : ∀ i : Fin n, gLine (p i.castSucc) * gLine (p i.succ) < 0) :
∃ xs : List ℝ, xs.length = n ∧ xs.IsChain (· < ·) ∧
(∀ t ∈ xs, T0 ≤ t ∧ t ≤ T1) ∧
(∀ t ∈ xs, completedRiemannZeta (1 / 2 + (t : ℂ) * Complex.I) = 0) := by sorry
Source