Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Bounded synthesis of square-summable Hilbert columns with exact adjoint energy and uniqueness

Proved
ConnesRZNative.bounded_column_synthesis_with_adjoint_energy

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

adjointbounded-operatorsconnes-weilfunctional-analysishilbert-space

Let HHH be a complete complex Hilbert space and (vi)i∈I(v_i)_{i\in I}(vi​)i∈I​ a family with ∑i∥vi∥2<∞\sum_i\|v_i\|^2<\infty∑i​∥vi​∥2<∞. There is a unique bounded complex-linear map S:ℓ2(I,C)→HS:\ell^2(I,\mathbb C)\to HS:ℓ2(I,C)→H having these basis columns. It is given by the absolutely convergent synthesis series Su=∑iuiviSu=\sum_i u_i v_iSu=∑i​ui​vi​, satisfies ∥S∥2≤∑i∥vi∥2\|S\|^2\le\sum_i\|v_i\|^2∥S∥2≤∑i​∥vi​∥2, and its adjoint obeys

(S∗h)i=⟨vi,h⟩,∥S∗h∥2=∑i∣⟨vi,h⟩∣2.(S^*h)_i=\langle v_i,h\rangle,\qquad \|S^*h\|^2=\sum_i|\langle v_i,h\rangle|^2.(S∗h)i​=⟨vi​,h⟩,∥S∗h∥2=i∑​∣⟨vi​,h⟩∣2.

The Hilbert inner product is conjugate-linear in its first argument. All sums are unconditional, and no countability assumption on III is required.

This is the functional-analytic construction used in the Connes–Weil Green-column frontier: it derives bounded synthesis, exact adjoint norms, and uniqueness from square-summable supplied columns. Its hypothesis is square summability of those columns; it does not construct a physical Green metric, prove a zeta-zero counting bound, or prove RH. Identification with an existing native operator requires the same coefficient carrier and the same basis columns.

Preamble
import Mathlib
open scoped BigOperators InnerProductSpace lp ENNReal Classical
Formal statement
theorem ConnesRZNative.bounded_column_synthesis_with_adjoint_energy {ι H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
    [CompleteSpace H] (v : ι → H) (hv : Summable (fun i => ‖v i‖ ^ 2)) :
    ∃ S : ℓ²(ι, ℂ) →L[ℂ] H,
      (∀ u, S u = ∑' i, u i • v i) ∧
      (∀ i, S (lp.single 2 i (1 : ℂ)) = v i) ∧
      (∀ h i, (ContinuousLinearMap.adjoint S) h i = ⟪v i, h⟫_ℂ) ∧
      (∀ h, ‖(ContinuousLinearMap.adjoint S) h‖ ^ 2 = ∑' i, ‖⟪v i, h⟫_ℂ‖ ^ 2) ∧
      ‖S‖ ^ 2 ≤ ∑' i, ‖v i‖ ^ 2 ∧
      (∀ T : ℓ²(ι, ℂ) →L[ℂ] H,
        (∀ i, T (lp.single 2 i (1 : ℂ)) = v i) → T = S) := by sorry
Source
Repository monocap-tech/weil, WeilDefect/Connes/ColumnSynthesis.lean: columnSynthesis_apply, columnSynthesis_single, columnSynthesis_adjoint_coordinate, columnSynthesis_adjoint_norm_sq, columnSynthesis_norm_sq_le, columnSynthesis_unique. Cauchy–Schwarz synthesis construction and Parseval identity; supporting generic analytic result for the actual-zero Green frontier. Literature/source audit addendum (2026-10-11): This graph export is assembled from WeilDefect.ConnesNative.columnSynthesis_apply, columnSynthesis_single, columnSynthesis_adjoint_coordinate, columnSynthesis_adjoint_norm_sq, columnSynthesis_norm_sq_le, and columnSynthesis_unique. The graph name is a recovered named export, rather than a literal native declaration in ColumnSynthesis.lean. The exact graph type was independently checked in Lean.
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by waitingintime · Oct 7, 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