Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Smooth lifts with arbitrarily small total rank-one error

Proved
MasulloRH.smooth_lifts_with_summable_rank_one_error

by Abhishek Anand · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

Suppose the smooth subspace F contains representatives of the chosen quotient classes and its intersection with the kernel is dense there. Given representatives uᵢ, coefficient vectors ηᵢ, positive tolerances rᵢ, and ε>0, there are smooth representatives vᵢ of the same classes within rᵢ of uᵢ. For every bounded A, the sum of trace norms of the rank-one errors A(vᵢ−uᵢ) ⊗ ηᵢ is at most ‖A‖ε. This quantifies the density choice from the proof of the lifting lemma.

Preamble
import Definitions.Def_MasulloGRH_HilbertNuclear

open MasulloGRH InnerProductSpace
Formal statement
theorem MasulloRH.smooth_lifts_with_summable_rank_one_error {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
    (K F : Submodule ℂ H) (hd : K ≤ (K ⊓ F).topologicalClosure)
    (u η : ℕ → H) (hu : ∀ i, ∃ w ∈ F, w - u i ∈ K)
    (r : ℕ → ℝ) (hr : ∀ i, 0 < r i) (ε : ℝ) (hε : 0 < ε) :
    ∃ v : ℕ → H, (∀ i, v i ∈ F ∧ v i - u i ∈ K ∧ ‖v i - u i‖ < r i) ∧
      ∀ A : H →L[ℂ] H,
        let e := fun i => traceNorm (rankOne ℂ (A (v i - u i)) (η i))
        Summable e ∧ ∑' i, e i ≤ ‖A‖ * ε := by sorry
Source
A. M. Masullo, The Music of the Primes, frozen draft of 20 November 2026, Lemma 10.4.2.5, (10.4.2.16)–(10.4.2.19), pp. 461–462, applied to (10.4.2.23)–(10.4.2.25), pp. 463–464.

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