One reflection-closed actual-zero cutoff gives marker recovery uniformly over support windows
ProvedConnesGreen.actual_zero_uniform_marker_recoveryLet be an upper support bound and a fixed finite packet of actual nontrivial zeta zeros. For every and , there exists one finite actual-zero packet , closed under , that works for every support window . On each original canonical Green carrier , bounded operators have exactly the original full-positive, selected negative, and complete complementary negative basis columns. With and they satisfy
The finite cutoff is chosen before and is independent of the support window throughout this range. Exact original columns uniquely fix the bounded operators. All actual zeros, analytic multiplicities, reflection duplication, pair normalization and the selected packet are preserved.
This closes support-uniform finite recovery of the infinite negative background at each Picard regularization scale. The cutoff may depend on . The theorem supplies no cutoff independent of , explicit logarithmic ordinate-tail rate, arithmetic half-threshold bound, neutral-shell persistence, endpoint-limit interchange, or RH theorem.
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_uniform_marker_recovery (T : ℝ) (S : Finset CriticalZeros) (ε α : ℝ)
(hε : 0 < ε) (hα : 0 < α) (hα1 : α < 1) :
∃ F : Finset CriticalZeros, S ⊆ F ∧
(∀ ρ ∈ F, reflectedZero ρ ∈ F) ∧
∀ t : ℝ, ∀ ht : 0 < t, t ≤ T →
∃ P : ℓ²(CriticalZeros, ℂ) →L[ℂ] Physical t,
∃ M : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ] Physical t,
∃ B : ℓ²({ρ : CriticalZeros // ρ ∉ F}, ℂ) →L[ℂ] Physical t,
(∀ ρ, P (lp.single 2 ρ (1 : ℂ)) =
positiveGreenColumn (fun τ => sourceEmbed t (actualGreenSource τ)) ρ) ∧
(∀ ρ, M (lp.single 2 ρ (1 : ℂ)) =
negativeGreenColumn (fun τ => sourceEmbed t (actualGreenSource τ)) ρ.1) ∧
(∀ ρ, 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