Original finite packets have either all positive half-bound windows or a finite closed cutoff
ProvedConnesGreen.canonical_half_window_dichotomyFor every unchanged finite packet of actual zeta zeros, write for the original Picard marker and for positiveSupportRadius. We prove the exact alternative
If not every positive window has the half-bound, choose a failed positive window . Antitonicity of the original marker bounds the set of successful positive windows above by . Its membership at makes this set nonempty. Its real supremum therefore satisfies . For every positive , the supremum property provides a successful larger window; antitonicity transfers its half-bound to . The accepted original all-smaller-windows closure theorem then supplies the half-bound at itself. Thus successful windows are exactly those at most . Lean uses real conditional completeness, the original positive-window marker identity, accepted original antitonicity and boundary closure. No prescribed critical-endpoint identification, right-limit continuity or off-line separation hypothesis is added.
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
theorem ConnesGreen.canonical_half_window_dichotomy (S : Finset CriticalZeros) :
(∀ T : ℝ, ∀ hT : 0 < T, (1 / 2 : ℝ) • (1 : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ] ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ)) ≤ canonicalPicardMarker T hT S) ∨
∃ c : ℝ, positiveSupportRadius ≤ c ∧ (∀ T : ℝ, ∀ hT : 0 < T, ((1 / 2 : ℝ) • (1 : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ] ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ)) ≤ canonicalPicardMarker T hT S) ↔ T ≤ c) := by sorry