Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An endpoint certificate must capture an attained physical maximizing direction

Proved
ConnesGreen.canonical_positive_endpoint_certificate_eigenvector_custody

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

connes-weilfull-tailsharp-thresholdspectral-theory

If the original sharp selected loss μ\muμ is positive and the ORIGINAL finite selected correction is nonnegative at EXACT accuracy δ=μ\delta=\muδ=μ, then there exists a NONZERO original physical eigenvector xxx of NSNS∗−PP∗N_SN_S^*-PP^*NS​NS∗​−PP∗ at μ\muμ which is shifted neutral and satisfies

⟨pρ,x⟩=0for EVERY actual positive column with ρ∉F.\langle p_\rho,x\rangle=0\quad\text{for EVERY actual positive column with }\rho\notin F.⟨pρ​,x⟩=0for EVERY actual positive column with ρ∈/F.

No packet-containment or reflection-closure premise is needed. This is a necessary endpoint constraint, not existence of endpoint certificates.

Preamble
import Definitions.Def_ConnesGreen_selected_loss_covariance
import Mathlib.Analysis.InnerProductSpace.Spectrum
import Mathlib.Analysis.InnerProductSpace.StarOrder
import Mathlib.Analysis.CStarAlgebra.ContinuousFunctionalCalculus.Order
import Mathlib.Analysis.Normed.Operator.Compact.FiniteDimension

import Theorems.Thm_ConnesGreen_canonical_positive_threshold_attained
import Theorems.Thm_ConnesGreen_canonical_finite_certificate_neutral_tail_zero
set_option autoImplicit false
set_option maxHeartbeats 3000000
set_option backward.isDefEq.respectTransparency false
set_option synthInstance.maxHeartbeats 200000
open Complex MeasureTheory ConnesRZ ConnesRZFrontier ContinuousLinearMap Set Filter
open scoped BigOperators InnerProductSpace lp ENNReal Classical ComplexOrder Topology
noncomputable section
open ConnesGreen WeilDefect WeilDefect.ConnesNative
open ContinuousFunctionalCalculus
Formal statement
theorem ConnesGreen.canonical_positive_endpoint_certificate_eigenvector_custody
    (t : ℝ) (ht : 0 < t) (S F : Finset CriticalZeros)
    (hμ : 0 < canonicalCertificateThreshold t ht S)
    (hF : 0 ≤ canonicalFiniteSelectedCorrection t ht S F
      (canonicalCertificateThreshold t ht S)) :
    ∃ x : Physical t, x ≠ 0 ∧
      canonicalLossCovariance t ht S x = (canonicalCertificateThreshold t ht S : ℂ) • x ∧
      (‖(canonicalPositiveSynthesis t ht).adjoint x‖ ^ 2 -
        ‖(canonicalSelectedSynthesis t ht S).adjoint x‖ ^ 2 +
          canonicalCertificateThreshold t ht S * ‖x‖ ^ 2 = 0) ∧
      ∀ ρ : CriticalZeros, ρ ∉ F →
        ⟪positiveGreenColumn (fun τ => sourceEmbed t (actualGreenSource τ)) ρ, x⟫_ℂ = 0 := by sorry
Source
monocap-tech/weil, WeilDefect/Connes/ThresholdSpectrum.lean, exact declaration ConnesGreen.canonical_positive_endpoint_certificate_eigenvector_custody, compiling source ab20377e04b8056e6db154b7054f60e0ce0a8f00

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