Every actual-zero marker lower bound is exactly its finite-restoration estimate
ProvedConnesGreen.actual_zero_lower_bound_iff_finite_restorationFix a positive support window and a finite packet of actual nontrivial zeta zeros. There are fixed bounded syntheses with exactly the original all-positive and selected negative Green columns, including their analytic multiplicities and pair normalization. For every and every real threshold ,
is equivalent to the following: for every there is a finite restoration packet and its bounded complete complementary negative synthesis , with exactly its original columns, such that
Here . The support window, positive regularization and selected compression stay unchanged; only the restoration cutoff depends on accuracy and regularization. This exact reduction covers approximate endpoint thresholds as well as the original case. It proves neither lower-bound side unconditionally and supplies no prescribed critical endpoint identification, neutral-shell persistence or RH.
import Definitions.Def_ConnesGreen_actual_pair_columns import Definitions.Def_WeilMarker_regularized_cost open Complex ConnesRZ ConnesRZFrontier ConnesGreen WeilDefect.ConnesNative WeilDefect.MarkerStability open scoped BigOperators InnerProductSpace lp ENNReal Classical ComplexOrder
theorem ConnesGreen.actual_zero_lower_bound_iff_finite_restoration (t : ℝ) (ht : 0 < t) (S : Finset CriticalZeros) :
∃ P : ℓ²(CriticalZeros, ℂ) →L[ℂ] Physical t,
∃ M : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ] Physical t,
(∀ ρ, P (lp.single 2 ρ (1 : ℂ)) =
positiveGreenColumn (fun τ => sourceEmbed t (actualGreenSource τ)) ρ) ∧
(∀ ρ, M (lp.single 2 ρ (1 : ℂ)) =
negativeGreenColumn (fun τ => sourceEmbed t (actualGreenSource τ)) ρ.1) ∧
(∀ ε : ℝ, 0 < ε → ∀ a : ℝ,
(a • (1 : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ]
ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ)) ≤ marker (P ∘L P.adjoint + ε • 1) M ↔
∀ α : ℝ, 0 < α → α < 1 →
∃ F : Finset CriticalZeros, S ⊆ F ∧
∃ B : ℓ²({ρ : CriticalZeros // ρ ∉ F}, ℂ) →L[ℂ] Physical t,
(∀ ρ, B (lp.single 2 ρ (1 : ℂ)) =
negativeGreenColumn (fun τ => sourceEmbed t (actualGreenSource τ)) ρ.1) ∧
‖B ∘L B.adjoint‖ ≤ α * ε ∧
(a - α) • (1 : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ]
ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ)) ≤
marker (P ∘L P.adjoint + ε • 1 - B ∘L B.adjoint) M)) := by sorry