Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Original inner half-bound is exactly original selected-test nonnegativity

Proved
ConnesGreen.canonical_picard_half_iff_original_selected_tests

by waitingintime · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

connes-weiloriginal-test-densityrg0-dependency-integration

For every positive original support window TTT and unchanged finite actual-zero packet SSS, let CT,SC_{T,S}CT,S​ be the constructed original inner Picard marker, PTP_TPT​ the complete original positive synthesis, and NT,SN_{T,S}NT,S​ the original selected synthesis. Then

12I≤CT,S⟺∀g original admissible at T, ∥PT∗sourceEmbed⁡T(Lg)∥2−∥NT,S∗sourceEmbed⁡T(Lg)∥2≥0.\tfrac12I\le C_{T,S}\quad\Longleftrightarrow\quad\forall g\text{ original admissible at }T,\ \|P_T^*\operatorname{sourceEmbed}_T(Lg)\|^2-\|N_{T,S}^*\operatorname{sourceEmbed}_T(Lg)\|^2\ge0.21​I≤CT,S​⟺∀g original admissible at T, ∥PT∗​sourceEmbedT​(Lg)∥2−∥NT,S∗​sourceEmbedT​(Lg)∥2≥0.

The accepted original inner half-bound/covariance equivalence and accepted original dense-test covariance criterion prove this. The quadratic expression is exactly the native selectedQuadratic definition expanded, not a new form. Actual zeros, analytic multiplicities, reflected pair normalization, physical metric, selected packet and the constructed inner limit are unchanged. The equivalence asserts neither side unconditionally, supplies no arithmetic endpoint jump budget, and does not establish RH.

Preamble
import Definitions.Def_ConnesGreen_RG0_original_inner_marker
open Complex ConnesRZ ConnesRZFrontier ConnesGreen WeilDefect WeilDefect.ConnesNative
open scoped BigOperators InnerProductSpace lp ENNReal Classical ComplexOrder Topology
open Filter Set
set_option autoImplicit false
set_option maxHeartbeats 2000000
set_option synthInstance.maxHeartbeats 200000
noncomputable section
Formal statement
theorem ConnesGreen.canonical_picard_half_iff_original_selected_tests (T : ℝ) (hT : 0 < T)
    (S : Finset CriticalZeros) :
    (1 / 2 : ℝ) • (1 : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ]
      ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ)) ≤ canonicalPicardMarker T hT S ↔
    ∀ g : ℝ → ℂ, SupportedTest T g →
      0 ≤ ‖(canonicalPositiveSynthesis T hT).adjoint (sourceEmbed T (problemOneL g))‖ ^ 2 -
        ‖(canonicalSelectedSynthesis T hT S).adjoint (sourceEmbed T (problemOneL g))‖ ^ 2 := by sorry
Source
monocap-tech/weil at 7c5b1bc48d1cd2dd7385b1e634cd33a1e95550c7. CanonicalGreenTestDensity.lean, CanonicalGreenQuadraticEndpoint.lean and CriticalWindowBoundary.lean. Exact native definitions are unfolded only where no separate platform definition exists; native Lean checks these public statements against the originals.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me