Mass captured by weakly convergent finite-rank projectors
ProvedQAlgorithms.Papers.Independent.Support50.P44.weak_projectors_capture_massLet be a complex separable Hilbert space and finite-rank orthogonal projectors converging to the identity in the weak operator topology: for all . For every density operator ,
No nesting or monotonicity is required. This shows that weakly exhausting finite supports capture the full probability mass.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P44
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a complex Hilbert space with a Hilbert basis indexed by a countable type . Let be bounded complex linear operators such that each satisfies , , and has finite dimensional range. Assume that for every ,
Let be a positive bounded complex linear operator with , admitting a trace class representation with . Then
No nesting or monotonicity of the projections is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.