Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Original inner half-bound has exact finite certificates on its selected coefficient space

Proved
ConnesGreen.canonical_picard_half_iff_finite_selected_certificates

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

arithmetic-transferconnes-weilselected-correction-certificates

At one fixed positive original support window t and unchanged selected actual-zero packet S, the original inner Picard marker is at least half the identity exactly when, for every positive accuracy δ, some finite reflection-closed actual-zero packet F containing S has COMPLETE omitted positive-column norm-square tail less than δ and nonnegative selected coefficient correction δI−NN+CB⁻¹C. Here P_F synthesizes exactly the original positive F columns, N is the ORIGINAL selected negative synthesis for S, B=P_FP_F+δI and C=P_FN. The correction acts only on the original selected S coefficient space; the sole inverse is on the finite positive F coefficient space and is guaranteed by positive δ. The same window, packets, δ and complete tail allowance are retained. This is an exact alternative to the larger tagged Gram PSD certificate, not a proof of the correction inequality, larger-window extension or RH.

Preamble
import Definitions.Def_ConnesGreen_finite_selected_correction
set_option autoImplicit false
set_option maxHeartbeats 2000000
set_option synthInstance.maxHeartbeats 200000
set_option backward.isDefEq.respectTransparency false
set_option backward.isDefEq.respectTransparency.types false
open Complex ConnesRZ ConnesRZFrontier ConnesGreen WeilDefect WeilDefect.ConnesNative
open scoped BigOperators InnerProductSpace lp ENNReal Classical ComplexOrder Topology
noncomputable section
open ContinuousLinearMap
Formal statement
theorem ConnesGreen.canonical_picard_half_iff_finite_selected_certificates
    (t : ℝ) (ht : 0 < t) (S : Finset CriticalZeros) :
    ((1 / 2 : ℝ) • (1 : ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ) →L[ℂ]
      ℓ²({ρ : CriticalZeros // ρ ∈ S}, ℂ)) ≤ canonicalPicardMarker t ht S) ↔
    ∀ δ : ℝ, 0 < δ → ∃ F : Finset CriticalZeros,
      S ⊆ F ∧ (∀ ρ ∈ F, reflectedZero ρ ∈ F) ∧
      (∑' ρ : {ρ : CriticalZeros // ρ ∉ F},
        ‖positiveGreenColumn (fun τ => sourceEmbed t (actualGreenSource τ)) ρ.1‖ ^ 2) < δ ∧
      0 ≤ canonicalFiniteSelectedCorrection t ht S F δ := by sorry
Source
monocap-tech/weil, WeilDefect/Screening/FiniteGram.lean and WeilDefect/Connes/FiniteSelectedCertificates.lean at compiling source head d28908eb3d61a4a81d7b4a5aff70ea26b6680897 Literature/source audit addendum (COR-22): The exact native finite-selected-certificate equivalence was independently checked in Lean. Positive-column tail summability supplies a finite cutoff, but does not by itself prove nonnegativity of the selected correction. The same positive regularization parameter is retained in the tail tolerance and selected correction. Arithmetic transfer checkpoint: monocap-tech/provenance 178c83225b2300506ff622899d08ec3c987137d5, rh/checkpoints/RH_ZERO_PROV_2_EULER_WEIL_MARKER_TRANSFER_20260920.md, SHA256 0bb48b950f09220f7b2f193c16b45b15add0333906f919f8b50ca915f77a1a0d. Exact checkpoint bytes were verified in retained local Git; public availability has not been checked.
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by waitingintime · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me