Exact arithmetic half-bound obstruction after actual-zero finite marker restoration
ProvedConnesGreen.actual_zero_half_bound_iff_finite_restorationFix a positive support window and finite packet of actual nontrivial zeta zeros. There are fixed bounded syntheses of the original all-positive actors and selected negative actors, with their exact original basis columns. Put . At every , the full selected marker satisfies
if and only if, for every , there is a finite actual-zero restoration packet whose complete complementary negative synthesis has exactly its original basis columns and satisfies
The support window, regularization scale, selected compression, analytic multiplicities and pair normalization remain the same on both sides. Exact columns determine these bounded operators uniquely through the existing synthesis custody theorem.
This equivalence localizes the remaining arithmetic lower bound after the complete infinite tail has been controlled at the correct relative scale. It proves neither side unconditionally. In particular, it does not supply the finite-restored half-bound, exchange endpoint limits, establish neutral-shell persistence, or prove 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_half_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 < ε →
((1 / 2 : ℝ) • (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‖ ≤ α * ε ∧
(1 / 2 - α) • (1 : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ]
ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ)) ≤
marker (P ∘L P.adjoint + ε • 1 - B ∘L B.adjoint) M)) := by sorry