One original negative test gives a common Picard gap below half on every larger window
ProvedConnesGreen.canonical_uniform_picard_gap_of_supported_negative_testFrom one original supported selected-negative test on , we prove a common original Picard marker gap
The complete proof first constructs, using a closed scalar-margin helper, a uniform regularized gap for the same unchanged packet and all larger windows. Original test energy and actor analysis norms are independent of those larger windows, giving constants chosen once. If the original Picard marker admitted the lower bound, the accepted exact canonicalPicardMarker_lower_iff_all_regularized would transfer that bound to every positive regularization scale. Choosing contradicts the regularized gap. The existing positive regularization limit is retained; no existence premise is added and no limit order is exchanged. The public negative-test premise remains explicit.
import Definitions.Def_ConnesGreen_small_support_constants import Definitions.Def_ConnesGreen_RG0_original_inner_marker open Complex MeasureTheory ConnesRZ ConnesRZFrontier ConnesGreen WeilDefect WeilDefect.ConnesNative Set open scoped BigOperators InnerProductSpace lp ENNReal Classical ComplexOrder Topology set_option autoImplicit false set_option maxHeartbeats 3000000 noncomputable section open WeilDefect.MarkerStability
theorem ConnesGreen.canonical_uniform_picard_gap_of_supported_negative_test (t : ℝ) (ht : 0 < t) (S : Finset CriticalZeros)
(g : ℝ → ℂ) (hg : SupportedTest t g)
(hn : ‖(canonicalPositiveSynthesis t ht).adjoint (sourceEmbed t (problemOneL g))‖ ^ 2 -
‖(canonicalSelectedSynthesis t ht S).adjoint (sourceEmbed t (problemOneL g))‖ ^ 2 < 0):
∃ β : ℝ, 0 < β ∧ β < 1 / 2 ∧
∀ T : ℝ, ∀ hT : 0 < T, t ≤ T →
¬ β • (1 : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ] ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ)) ≤ canonicalPicardMarker T hT S := by sorry