Original ordered endpoint half-bound iff uniform finite-restored arithmetic tests
ProvedConnesGreen.canonical_endpoint_half_iff_uniform_finite_arithmetic_testsFor every nonnegative endpoint and every finite selected packet of ACTUAL nontrivial zeta zeros, the original ordered support-right marker satisfies if and only if the following uniform arithmetic condition holds. For every there is a neighborhood size such that for every regularization there is a finite reflection-closed restoration packet working for ALL positive windows and ALL original smooth tests supported strictly in that window. At each window, the complete negative covariance outside has norm at most , the original restored denominator is strictly positive, and every such test obeys
Here is the ORIGINAL embedded , and is exactly the integral of plus one quarter of the integral of . The selected packet remains ; is a distinct restoration cutoff. The neighborhood is chosen BEFORE regularization, and the restoration cutoff BEFORE the window and test. The full actual-zero complement, analytic multiplicities, reflected column normalization, physical carrier and unchanged signed Weil distribution are retained.
This is an exact criterion for an arbitrary nonnegative parameter , including and empty selected packets. It does not establish the displayed arithmetic condition at the intended critical endpoint, identify that endpoint, or prove a neutral-shell bound or RH. Positive regularization tends to zero first; support tends to the endpoint from the right second. No limit or quantifier order is exchanged.
import Definitions.Def_ConnesGreen_RG0_original_support_right_marker import Definitions.Def_WeilMarker_regularized_cost open Complex MeasureTheory ConnesRZ ConnesRZFrontier ConnesGreen WeilDefect WeilDefect.ConnesNative WeilDefect.MarkerStability open scoped BigOperators InnerProductSpace lp ENNReal Classical ComplexOrder Topology open ContinuousLinearMap Filter Set set_option autoImplicit false set_option maxHeartbeats 3000000 set_option backward.isDefEq.respectTransparency false noncomputable section
theorem ConnesGreen.canonical_endpoint_half_iff_uniform_finite_arithmetic_tests
(c : ℝ) (hc : 0 ≤ c) (S : Finset CriticalZeros) :
(1 / 2 : ℝ) • (1 : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ]
ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ)) ≤ canonicalSupportRightMarker c hc S ↔
∀ η : ℝ, 0 < η → η < 1 / 2 → ∃ δ : ℝ, 0 < δ ∧
∀ ε : ℝ, 0 < ε → ∃ F : Finset CriticalZeros, S ⊆ F ∧
(∀ ρ ∈ F, reflectedZero ρ ∈ F) ∧
∀ T : ℝ, ∀ hT : 0 < T, c < T → T < c + δ →
‖canonicalTailCovariance T hT F‖ ≤ (η / 2) * ε ∧
IsStrictlyPositive (canonicalPositiveCovariance T hT + ε • 1 -
canonicalTailCovariance T hT F) ∧
∀ g : ℝ → ℂ, SupportedTest T g →
‖(canonicalSelectedSynthesis T hT S).adjoint (sourceEmbed T (problemOneL g))‖ ^ 2 ≤
((1 / 2 - η)⁻¹ - 1) * ((weilDistribution (conv g (starInv g))).re +
‖(canonicalSelectedSynthesis T hT F).adjoint (sourceEmbed T (problemOneL g))‖ ^ 2 +
ε * ((∫ x : ℝ, ‖iteratedDeriv 1 g x‖ ^ 2) + (1 / 4 : ℝ) * (∫ x : ℝ, ‖g x‖ ^ 2))) := by sorry