Finite-restored actual-zero markers recover the original ordered support endpoint
ProvedConnesGreen.canonical_restored_diagonal_original_ordered_endpointFix , a finite selected packet of actual critical-strip zeta zeros, arbitrary finite requested packets , and prescribed positive numerical schedules and with . There exist nested reflection-closed finite actual-zero cutoffs retaining all conclusions of the preceding diagonal theorem: exact original positive-tail columns, covariance norm sum , complete actual spectral norm tail summability and sum for every original normalized supported test, and nonnegative original selected-marker error of norm at most for every regularization above , uniformly on .
Write for the original full-positive covariance, for the original negative covariance outside , for the unchanged original selected synthesis, and
For every fixed , these restored markers converge in operator norm to the original Picard marker:
For every , let be the original support-right marker, defined by first taking the positive-regularization Picard limit and then taking the support radius to from the right. The restored markers recover that same ordered endpoint with the following exact quantifiers:
The inner index may depend on the window. This identifies the finite-restored inner limit and its ordered outer endpoint without exchanging limits. It does not assert a uniform inner index over the outer windows, a prescribed joint diagonal limit, an arithmetic half-bound, critical-window location, quartet domination, or RH. All carriers, multiplicities, transforms and selected actors are the original ones.
import Definitions.Def_ConnesGreen_RG0_original_actors import Definitions.Def_WeilMarker_regularized_cost import Definitions.Def_ConnesGreen_RG0_original_support_right_marker 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 synthInstance.maxHeartbeats 1000000 set_option backward.isDefEq.respectTransparency false noncomputable section
theorem ConnesGreen.canonical_restored_diagonal_original_ordered_endpoint
(T : ℝ) (hT : 0 < T) (S : Finset CriticalZeros)
(K : ℕ → Finset CriticalZeros) (μ ε : ℕ → ℝ)
(hμ : ∀ n, 0 < μ n) (hε : ∀ n, 0 < ε n) (hε1 : ∀ n, ε n < 1)
(hμlim : Tendsto μ atTop (nhds 0)) (hεlim : Tendsto ε atTop (nhds 0)) :
∃ F : ℕ → Finset CriticalZeros, Monotone F ∧
(∀ n, S ⊆ F n ∧ K n ⊆ F n ∧ (∀ τ ∈ F n, reflectedZero τ ∈ F n)) ∧
(∀ n, ∀ t : ℝ, ∀ ht : 0 < t, t ≤ T →
∃ Ptail : ℓ²({τ : CriticalZeros // τ ∉ (F n)}, ℂ) →L[ℂ] Physical t,
(∀ τ, Ptail (lp.single 2 τ (1 : ℂ)) =
positiveGreenColumn (fun σ => sourceEmbed t (actualGreenSource σ)) τ.1) ∧
‖Ptail ∘L Ptail.adjoint‖ + ‖canonicalTailCovariance t ht (F n)‖ < ε n ∧
(∀ ν : ℝ, μ n ≤ ν →
‖canonicalTailCovariance t ht (F n)‖ ≤ ε n * ν ∧
IsStrictlyPositive (canonicalPositiveCovariance t ht + ν • 1 - canonicalTailCovariance t ht (F n)) ∧
0 ≤ marker (canonicalPositiveCovariance t ht + ν • 1) (canonicalSelectedSynthesis t ht S) -
marker (canonicalPositiveCovariance t ht + ν • 1 - canonicalTailCovariance t ht (F n))
(canonicalSelectedSynthesis t ht S) ∧
‖marker (canonicalPositiveCovariance t ht + ν • 1) (canonicalSelectedSynthesis t ht S) -
marker (canonicalPositiveCovariance t ht + ν • 1 - canonicalTailCovariance t ht (F n))
(canonicalSelectedSynthesis t ht S)‖ ≤ ε n) ∧
(∀ g : ℝ → ℂ, SupportedTest t g → ‖sourceEmbed t (problemOneL g)‖ ^ 2 ≤ 1 →
Summable (fun τ : CriticalZeros => ‖if τ ∈ (F n) then 0 else
(zeroMult τ.1 : ℂ) * mellinHat (conv g (starInv g)) τ.1‖) ∧
(∑' τ : CriticalZeros, ‖if τ ∈ (F n) then 0 else
(zeroMult τ.1 : ℂ) * mellinHat (conv g (starInv g)) τ.1‖) < ε n)) ∧
(∀ δ : ℝ, 0 < δ → ∃ N : ℕ, ∀ n : ℕ, N ≤ n →
∀ t : ℝ, ∀ ht : 0 < t, t ≤ T →
‖canonicalTailCovariance t ht (F n)‖ < δ ∧
(∀ ν : ℝ, μ n ≤ ν → ‖marker (canonicalPositiveCovariance t ht + ν • 1) (canonicalSelectedSynthesis t ht S) -
marker (canonicalPositiveCovariance t ht + ν • 1 - canonicalTailCovariance t ht (F n))
(canonicalSelectedSynthesis t ht S)‖ < δ) ∧
(∀ g : ℝ → ℂ, SupportedTest t g → ‖sourceEmbed t (problemOneL g)‖ ^ 2 ≤ 1 →
(∑' τ : CriticalZeros, ‖if τ ∈ F n then 0 else
(zeroMult τ.1 : ℂ) * mellinHat (conv g (starInv g)) τ.1‖) < δ)) ∧
(∀ t : ℝ, ∀ ht : 0 < t, t ≤ T →
Tendsto (fun n => marker (canonicalPositiveCovariance t ht + μ n • 1 - canonicalTailCovariance t ht (F n))
(canonicalSelectedSynthesis t ht S))
atTop (nhds (canonicalPicardMarker t ht S))) ∧
(∀ c : ℝ, ∀ hc : 0 ≤ c, c < T → ∀ δ : ℝ, 0 < δ →
∃ d : ℝ, 0 < d ∧ c + d ≤ T ∧
∀ t : ℝ, ∀ ht : 0 < t, c < t → t < c + d →
∃ N : ℕ, ∀ n : ℕ, N ≤ n →
‖marker (canonicalPositiveCovariance t ht + μ n • 1 - canonicalTailCovariance t ht (F n))
(canonicalSelectedSynthesis t ht S) - canonicalSupportRightMarker c hc S‖ < δ) := by sorry