Nested actual-zero cutoffs and uniform zero-floor diagonal marker approximation
ProvedConnesGreen.canonical_nested_diagonal_actual_tail_marker_recoveryLet be an upper support bound, let be a fixed finite set of actual critical-strip zeta zeros, and let be any prescribed sequence of finite actual-zero packets. Let and be prescribed numerical schedules, both tending to zero. There exist nested finite reflection-closed sets containing and , chosen before all support windows, regularizations, and tests. For every and every , the original positive columns outside admit a bounded synthesis , with
Here is the covariance of the original negative columns outside . For every ,
The restored operator is nonnegative and invertible. Here is the original complete positive covariance, is the unchanged original selected negative synthesis, and uses the original total operator inverse. For every original smooth compactly supported test with support in and original physical source norm squared at most , the complete actual-zero norm tail is summable and satisfies
The multiplicities and Mellin transform are those of the original actual zeta-zero development. For every tolerance , one index makes the negative covariance norm, selected marker error, and complete actual norm tail less than for all , all , all , and all normalized original tests. This is uniform diagonal approximation by growing cutoffs. It does not exchange ordered limits or establish an arithmetic endpoint, quartet separation, or RH.
import Definitions.Def_ConnesGreen_RG0_original_actors 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 synthInstance.maxHeartbeats 1000000 set_option backward.isDefEq.respectTransparency false noncomputable section
theorem ConnesGreen.canonical_nested_diagonal_actual_tail_marker_recovery
(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‖) < δ)) := by sorry