Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Mass captured by weakly convergent finite-rank projectors

Proved
QAlgorithms.Papers.Independent.Support50.P44.weak_projectors_capture_mass

by Goku · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let EEE be a complex separable Hilbert space and (Πn)n∈N(\Pi_n)_{n\in\mathbb N}(Πn​)n∈N​ finite-rank orthogonal projectors converging to the identity in the weak operator topology: ⟨x,Πny⟩→⟨x,y⟩\langle x,\Pi_n y\rangle\to\langle x,y\rangle⟨x,Πn​y⟩→⟨x,y⟩ for all x,y∈Ex,y\in Ex,y∈E. For every density operator σ\sigmaσ,

lim⁡n→∞tr⁡(Πnσ)=tr⁡σ.\lim_{n\to\infty}\operatorname{tr}(\Pi_n\sigma)=\operatorname{tr}\sigma.n→∞lim​tr(Πn​σ)=trσ.

No nesting or monotonicity is required. This shows that weakly exhausting finite supports capture the full probability mass.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P44
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P44

open QAlgorithms.Papers.Independent.Dependency50.P13 (IsTraceClass compression)

open QAlgorithms.Papers.Independent.Dependency50.P21 (marginalAB)

open QAlgorithms.Papers.Independent.Renew46.P37 (classicalKL)

open Filter

open scoped ENNReal ComplexOrder Matrix

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

/-- PDF p.27, Lemma E.2, (162): e in E is corrected to a natural-number
sequence, as in the proof. No nesting or monotonicity is imposed. -/
theorem weak_projectors_capture_mass {I : Type*} [Countable I]
    (b : HilbertBasis I ℂ H) (P : ℕ → H →L[ℂ] H)
    (hP : ∀ n, IsFiniteProjector (P n)) (hweak : WeaklyExhausts P)
    (sigma : H →L[ℂ] H) (hsigma : IsHilbertDensity b sigma) :
    Tendsto (fun n => (hilbertTrace b ((P n).comp sigma)).re) atTop
      (nhds (hilbertTrace b sigma).re) := by sorry

end QAlgorithms.Papers.Independent.Support50.P44

end
Source
Universal recovery map for approximate Markov chains, arXiv:1504.07251v3, PDF p. 27, Lemma E.2
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let HHH be a complex Hilbert space with a Hilbert basis b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​ indexed by a countable type III. Let (Pn)n∈N(P_n)_{n\in\mathbb N}(Pn​)n∈N​ be bounded complex linear operators such that each satisfies Pn∗=PnP_n^*=P_nPn∗​=Pn​, Pn2=PnP_n^2=P_nPn2​=Pn​, and has finite dimensional range. Assume that for every x,y∈Hx,y\in Hx,y∈H,

⟨x,Pny⟩⟶⟨x,y⟩.\langle x,P_ny\rangle\longrightarrow\langle x,y\rangle.⟨x,Pn​y⟩⟶⟨x,y⟩.

Let σ\sigmaσ be a positive bounded complex linear operator with ∑i⟨bi,σbi⟩=1\sum_i\langle b_i,\sigma b_i\rangle=1∑i​⟨bi​,σbi​⟩=1, admitting a trace class representation σx=∑r⟨vr,x⟩ur\sigma x=\sum_r\langle v_r,x\rangle u_rσx=∑r​⟨vr​,x⟩ur​ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞. Then

Re⁡∑i⟨bi,Pnσbi⟩⟶Re⁡∑i⟨bi,σbi⟩=1as n→∞.\operatorname{Re}\sum_i\langle b_i,P_n\sigma b_i\rangle \longrightarrow \operatorname{Re}\sum_i\langle b_i,\sigma b_i\rangle=1 \quad\text{as }n\to\infty.Rei∑​⟨bi​,Pn​σbi​⟩⟶Rei∑​⟨bi​,σbi​⟩=1as n→∞.

No nesting or monotonicity of the projections is assumed.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me