Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6: finite-projection compactness criterion

Open
QAlgorithms.Papers.Independent.Support50.P34.proposition6_projectionCompactness

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

prove2quantum

Let AAA be a trace-norm closed subset of T1(H)T_1(\mathcal H)T1​(H), the positive operators of trace at most one. Then

A is compact⟺∀ε>0 ∃ finite-rank orthogonal projection Pε: ∀T∈A, Tr⁡((I−Pε)T)<ε.A\text{ is compact}\quad\Longleftrightarrow\quad\forall\varepsilon>0\ \exists\text{ finite-rank orthogonal projection }P_\varepsilon:\ \forall T\in A,\ \operatorname{Tr}((I-P_\varepsilon)T)<\varepsilon.A is compact⟺∀ε>0 ∃ finite-rank orthogonal projection Pε​: ∀T∈A, Tr((I−Pε​)T)<ε.

Orthogonal projections are self-adjoint and idempotent. The trace upper bound is retained for every operator, and a rank-zero projection is permitted. This is the finite-projection compactness criterion on the bounded source domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P34
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped ENNReal NNReal BigOperators

namespace QAlgorithms.Papers.Independent.Support50.P34

open QAlgorithms.Papers.Independent.Dependency50.P13
  (State PositiveTraceClass traceNormValue stateTraceNormTopology traceNormTopology
   operatorTrace IsPositive IsTraceClass stateEntropy relativeEntropy entropyWeight)

open QAlgorithms.Papers.Independent.Dependency50.P25 (extendedIntegral)

open QAlgorithms.Papers.Independent.Frontier18.P01 (binaryEntropy)

attribute [local instance] Classical.propDecidable Classical.decEq

section Operators

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

variable {I : Type*}

section Statements

variable [hsep : TopologicalSpace.SeparableSpace H] [hI : Countable I]

include hsep hI

/-- Proposition 6, arXiv:0904.1963v3, PDF p.36: the trace-at-most-one compactness
criterion. Finite rank permits rank zero for the empty set. -/
theorem proposition6_projectionCompactness (b : HilbertBasis I ℂ H)
    (A : Set (PositiveCone H)) (hclosed : IsClosed A)
    (htrace : ∀ T ∈ A, (operatorTrace b (coneOp T)).re ≤ 1) :
    IsCompact A ↔ ∀ eps : ℝ, 0 < eps → ∃ P : H →L[ℂ] H,
      P.adjoint = P ∧ P.comp P = P ∧ (∃ k : ℕ, RankLE k P) ∧
      ∀ T ∈ A, (operatorTrace b (((ContinuousLinearMap.id ℂ H) - P).comp (coneOp T))).re < eps := by sorry

end Statements

end Operators

end QAlgorithms.Papers.Independent.Support50.P34

end
Source
Continuity of the von Neumann entropy, arXiv:0904.1963v3, PDF p. 36, Proposition 6: finite-projection compactness criterion
Read-back

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

Let HHH be a complete complex inner product space with Hilbert basis b=(bi)i∈Ib=(b_i)_{i\in I}b=(bi​)i∈I​. A trace-class operator here is a continuous complex-linear TTT admitting Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; let τ(T)\tau(T)τ(T) be the real conversion of the infimum of the extended nonnegative sums of these norm products. Equip the positive trace-class operators, characterized by T∗=TT^*=TT∗=T and Re⁡⟨x,Tx⟩≥0\operatorname{Re}\langle x,Tx\rangle\ge0Re⟨x,Tx⟩≥0 for every xxx, with the topology generated by T↦τ(T−S)T\mapsto\tau(T-S)T↦τ(T−S) for all trace-class SSS. For tr⁡bT=∑i⟨bi,Tbi⟩\operatorname{tr}_bT=\sum_i\langle b_i,Tb_i\rangletrb​T=∑i​⟨bi​,Tbi​⟩, let AAA be a closed subset of this cone satisfying Re⁡tr⁡bT≤1\operatorname{Re}\operatorname{tr}_bT\le1Retrb​T≤1 for every T∈AT\in AT∈A. Then AAA is compact if and only if, for every real ε>0\varepsilon>0ε>0, there exists a continuous complex-linear operator P:H→HP:H\to HP:H→H such that P∗=PP^*=PP∗=P, P2=PP^2=PP2=P, its range is contained in the span of some finite family of vectors, and

Re⁡tr⁡b((idH−P)∘T)<εfor every T∈A.\operatorname{Re}\operatorname{tr}_b\bigl((\mathrm{id}_H-P)\circ T\bigr)<\varepsilon \qquad\text{for every }T\in A.Retrb​((idH​−P)∘T)<εfor every T∈A.

The projection may depend on ε\varepsilonε, but must work for all T∈AT\in AT∈A; rank zero and the empty set AAA are allowed.

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