Finite restoration of the complete actual-zero background at every marker regularization scale
ProvedConnesGreen.actual_zero_diagonal_marker_recoveryFix a positive support window and finite selected packet of actual nontrivial zeta zeros. On the previously certified canonical Green carrier there are bounded synthesis operators and whose basis columns are exactly all original positive pair actors and the original negative actors in , respectively. These fixed operators satisfy the following for every and every : there is a finite actual-zero packet and a bounded synthesis containing exactly every original negative actor outside such that, with and ,
The carrier, analytic multiplicities, reflection duplication, pair normalization, support window and selected compression remain unchanged. All unselected zeros are included in the covariance tail before finite restoration; no abstract zero surrogate is introduced.
The cutoff may depend on . This proves finite recovery at each regularization scale and remains valid when the selected inverse cost is large. It does not claim one fixed finite cutoff for all scales, uniformity over moving support windows, an explicit ordinate-cutoff rate, a marker half-threshold bound, 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_diagonal_marker_recovery (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 < ε → ∀ α : ℝ, 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‖ ≤ α * ε ∧
IsStrictlyPositive (P ∘L P.adjoint + ε • 1 - B ∘L B.adjoint) ∧
0 ≤ marker (P ∘L P.adjoint + ε • 1) M -
marker (P ∘L P.adjoint + ε • 1 - B ∘L B.adjoint) M ∧
‖marker (P ∘L P.adjoint + ε • 1) M -
marker (P ∘L P.adjoint + ε • 1 - B ∘L B.adjoint) M‖ ≤ α) := by sorry