Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2: positive operator decomposition controlled by dual rank

Open
QAlgorithms.Papers.Independent.Gap48.P45.positiveOperator_dualRankDecomposition

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

prove2quantum

All physical Hilbert spaces are nonzero complex separable Hilbert spaces, with finite dimensions included. States are positive trace-class operators of trace one, channels are completely positive and trace preserving on the entire trace class, and logarithms are natural. Inner products are conjugate-linear in the first argument. Let B≥0B\ge0B≥0 be any bounded output operator, and suppose rank⁡Φ∗(B)=r<∞\operatorname{rank}\Phi^*(B)=r<\inftyrankΦ∗(B)=r<∞. Set m=min⁡{dim⁡ker⁡Φ∗+r2,dim⁡HB}m=\min\{\dim\ker\Phi^*+r^2,\dim H_B\}m=min{dimkerΦ∗+r2,dimHB​}. There exist vectors ψj∈HB\psi_j\in H_Bψj​∈HB​, allowing zero vectors, such that

B=∑j=1m∣ψj⟩⟨ψj∣.B=\sum_{j=1}^m|\psi_j\rangle\langle\psi_j|.B=j=1∑m​∣ψj​⟩⟨ψj​∣.

This result controls a positive operator decomposition using the dimension lost by the channel dual.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P45
Formal statement
noncomputable section

open Filter MeasureTheory

open scoped BigOperators ENNReal Topology

attribute [local instance] Classical.propDecidable Classical.decEq

attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus

namespace QAlgorithms.Papers.Independent.Gap48.P45

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsTraceClass IsTraceClassChannel traceSize traceClosure rankOne productCoeff tensorApply)

open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Complementary traceFirst traceSecond)

open QAlgorithms.Papers.Independent.Frontier18.P07
  (GeneralizedEnsemble averageCoefficients extendedEntropyNats extendedRelativeEntropyNats ensembleHolevo pureStates finiteEnsembleCapacity)

open QAlgorithms.Papers.Independent.Frontier18.P18
  (operatorCoeff boundedOperator conjugateCoeff ReversibleOn IsometricallyEquivalent
   IsParsevalFrame IsKrausRepresentation)

open QAlgorithms.Papers.Independent.Claimed50.P16 (tensorRankLE)

open QAlgorithms.Papers.Independent.Next46.P31 (positiveSquareRoot)

open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)

/-- Lemma 2, PDF pp.10–11. B is bounded positive, not necessarily trace class.
The unrestricted dual kernel contributes at r=0; infinite sums are strong. -/
theorem positiveOperator_dualRankDecomposition
    {I J : Type} [Countable I] [Countable J] [Nonempty I] [Nonempty J]
    (Phi : Channel I J) (B : Hilbert J →L[ℂ] Hilbert J)
    (hPositive : B.adjoint = B ∧ ∀ x, 0 ≤ (inner ℂ x (B x)).re)
    (r : ℕ) (hRank : operatorRank (channelDual Phi.val B) = r) :
    let m : ℕ∞ := min
      (Cardinal.toENat (Module.rank ℂ (Submodule.span ℂ
        {C : Hilbert J →L[ℂ] Hilbert J | channelDual Phi.val C = 0})) + (r : ℕ∞) ^ 2)
      (dimensionCount J)
    ∃ psi : BoundIndex m → Hilbert J, ∀ x : Hilbert J,
      HasSum (fun j => boundedOperator (rankOne (psi j)) x) (B x) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P45

end
Source
Reversibility conditions for quantum channels and their applications, arXiv:1203.0262v3, PDF p. 10, Lemma 2: positive operator decomposition controlled by dual rank
Read-back

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

Let I,JI,JI,J be countable nonempty sets and HA=ℓ2(A;C)H_A=\ell^2(A;\mathbb C)HA​=ℓ2(A;C). A coefficient matrix XXX is nuclear if Xab=∑nun(a)vn(b)‾X_{ab}=\sum_nu_n(a)\overline{v_n(b)}Xab​=∑n​un​(a)vn​(b)​ with ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞; a state is a nuclear matrix whose finite-coordinate quadratic forms are real and nonnegative and whose summable real diagonal sums to 111. Let Φ\PhiΦ preserve nuclear matrices, be additive and complex homogeneous on them, and take states to states after entrywise amplification by every finite identity. For a matrix XXX, let BXB_XBX​ be a chosen bounded operator with coordinate matrix XXX, or zero if none exists; write b(T)ab=(Teb)(a)b(T)_{ab}=(Te_b)(a)b(T)ab​=(Teb​)(a). For a bounded operator CCC on HJH_JHJ​, define

T(X,C)=∑ab(CBX)aa,DΦ(C)=B(T(Φ(Eba),C))a,b,T(X,C)=\sum_a b(CB_X)_{aa},\qquad D_\Phi(C)=B_{(T(\Phi(E_{ba}),C))_{a,b}},T(X,C)=a∑​b(CBX​)aa​,DΦ​(C)=B(T(Φ(Eba​),C))a,b​​,

where EbaE_{ba}Eba​ is the matrix unit, and all sums use the total infinite-sum convention. Let B:HJ→HJB:H_J\to H_JB:HJ​→HJ​ be bounded, self-adjoint, and satisfy Re⁡⟨x,Bx⟩≥0\operatorname{Re}\langle x,Bx\rangle\geq0Re⟨x,Bx⟩≥0 for every xxx. Let r∈Nr\in\mathbb Nr∈N satisfy rk⁡(DΦ(B))=r\operatorname{rk}(D_\Phi(B))=rrk(DΦ​(B))=r, where rank means the complex dimension of the operator’s range, converted to N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}. Define

m=min⁡ ⁣(dim⁡Cspan⁡{C:HJ→HJ bounded:DΦ(C)=0}+r2, ∣J∣),m=\min\!\left( \dim_{\mathbb C}\operatorname{span}\{C:H_J\to H_J\text{ bounded}:D_\Phi(C)=0\}+r^2,\ |J| \right),m=min(dimC​span{C:HJ​→HJ​ bounded:DΦ​(C)=0}+r2, ∣J∣),

with all infinite dimensions and cardinalities converted to ∞\infty∞. Then there are vectors ψj∈HJ\psi_j\in H_Jψj​∈HJ​, indexed by the natural numbers j<mj<mj<m, such that, for every x∈HJx\in H_Jx∈HJ​, the unordered sum converges in HJH_JHJ​ and satisfies

∑j<mBRψjx=Bx,Rψj(a,b)=ψj(a)ψj(b)‾.\sum_{j<m}B_{R_{\psi_j}}x=Bx,\qquad R_{\psi_j}(a,b)=\psi_j(a)\overline{\psi_j(b)}.j<m∑​BRψj​​​x=Bx,Rψj​​(a,b)=ψj​(a)ψj​(b)​.

No normalization or nonzero condition is imposed on the ψj\psi_jψj​. The statement includes r=0r=0r=0; if m=0m=0m=0, its indexing set is empty and the asserted sum is zero.

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

    Confirmed by the moderator at approval.

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