Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4: complete pure-family classification, all four equivalent conditions

Open
QAlgorithms.Papers.Independent.Gap48.P45.completePureFamily_fourConditions

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. Write HBΦH_B^\PhiHBΦ​ for the closed span of all output supports, dΦ=dim⁡HBΦd_\Phi=\dim H_B^\PhidΦ​=dimHBΦ​, m0(Φ)=dim⁡ker⁡(Φ∗∣B(HBΦ))m_0(\Phi)=\dim\ker(\Phi^*|_{\mathcal B(H_B^\Phi)})m0​(Φ)=dimker(Φ∗∣B(HBΦ​)​), and mr=min⁡{m0(Φ)+r2,dΦ}m_r=\min\{m_0(\Phi)+r^2,d_\Phi\}mr​=min{m0​(Φ)+r2,dΦ​}; dimensions retain infinity. An OND family admits no partition into two nonempty mutually orthogonal subfamilies. Its components are obtained by finite chains of nonorthogonal pure states, and PkP_kPk​ projects onto the closed span of component kkk. For vectors ψpk\psi_p^kψpk​ with ∑p∥ψpk∥2=1\sum_p\|\psi_p^k\|^2=1∑p​∥ψpk​∥2=1 and ⟨ψtk∣ψpk⟩=0\langle\psi_t^k|\psi_p^k\rangle=0⟨ψtk​∣ψpk​⟩=0 when p≠tp\ne tp=t, define NP,ψ(X)=∑k,l,p,tPkXPl⊗⟨ψtl∣ψpk⟩∣p⟩⟨t∣N_{P,\psi}(X)=\sum_{k,l,p,t}P_kXP_l\otimes\langle\psi_t^l|\psi_p^k\rangle|p\rangle\langle t|NP,ψ​(X)=∑k,l,p,t​Pk​XPl​⊗⟨ψtl​∣ψpk​⟩∣p⟩⟨t∣ on HA⊗HmH_A\otimes H_mHA​⊗Hm​. Here HmH_mHm​ has dimension mmm, including countable infinity. Let SSS be a complete pure family, use its canonical component projections, put m=m1m=m_1m=m1​, and define S^={ρ:ρ=∑kPkρPk}\widehat S=\{\rho:\rho=\sum_kP_k\rho P_k\}S={ρ:ρ=∑k​Pk​ρPk​}. For any fixed complement, the following four conditions are equivalent:

Φ reversible on S  ⟺  Φ reversible on S^  ⟺  Φ^(X)=∑kTr⁡(PkX)σk, rank⁡σk≤m  ⟺  Φ∼NP,ψ.\Phi\text{ reversible on }S\iff\Phi\text{ reversible on }\widehat S\iff\widehat\Phi(X)=\sum_k\operatorname{Tr}(P_kX)\sigma_k,\ \operatorname{rank}\sigma_k\le m\iff\Phi\sim N_{P,\psi}.Φ reversible on S⟺Φ reversible on S⟺Φ(X)=k∑​Tr(Pk​X)σk​, rankσk​≤m⟺Φ∼NP,ψ​.

The σk\sigma_kσk​ are normalized states. Projections and S^\widehat SS are computed from SSS.

This result classifies complete pure-family reversibility through its canonical orthogonal components.

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)

/-- Theorem 4, PDF pp.15–16: all four conditions. Components, projections,
and the block-diagonal family are computed from S, not supplied as premises. -/
theorem completePureFamily_fourConditions
    {I J E : Type} [Countable I] [Countable J] [Countable E]
    [Nonempty I] [Nonempty J] [Nonempty E]
    (Phi : Channel I J) (Psi : Channel I E) (hComp : Complementary Phi Psi)
    (S : Set (State I)) (hPure : S ⊆ pureStates I) (hComplete : CompleteFamily S) :
    (ReversibleOn Phi.val S ↔ ReversibleOn Phi.val (blockDiagonalStates (componentProjection S))) ∧
    (ReversibleOn Phi.val S ↔ HasBlockCQForm Psi.val (componentProjection S) (rankMultiplicity Phi.val 1)) ∧
    (ReversibleOn Phi.val S ↔ HasBlockNormalForm Phi.val (componentProjection S) (rankMultiplicity Phi.val 1)) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P45

end
Source
Reversibility conditions for quantum channels and their applications, arXiv:1203.0262v3, PDF p. 15, Theorem 4: complete pure-family classification, all four equivalent conditions
Read-back

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

Let I,J,EI,J,EI,J,E 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​∥<∞; let τ(X)\tau(X)τ(X) be the infimum of these costs, or ∞\infty∞ when no representation exists. States are nuclear matrices with real nonnegative finite-coordinate quadratic forms and summable real diagonal of sum 111. Channels preserve nuclear matrices, are complex linear on them, and preserve states under entrywise amplification by every finite identity. Let Φ:I→J\Phi:I\to JΦ:I→J and Ψ:I→E\Psi:I\to EΨ:I→E be channels for which there is a linear isometry V:HI→HJ×EV:H_I\to H_{J\times E}V:HI​→HJ×E​ such that, for every state XXX, their outputs are the two partial diagonal sums of

CV(X)p,q=∑a∑b(Vea)(p)Xab(Veb)(q)‾.C_V(X)_{p,q}=\sum_a\sum_b(Ve_a)(p)X_{ab}\overline{(Ve_b)(q)}.CV​(X)p,q​=a∑​b∑​(Vea​)(p)Xab​(Veb​)(q)​.

Write Ru(a,b)=u(a)u(b)‾R_u(a,b)=u(a)\overline{u(b)}Ru​(a,b)=u(a)u(b)​, let BXB_XBX​ be a chosen bounded operator with coordinate matrix XXX, or zero if none exists, and put b(T)ab=(Teb)(a)b(T)_{ab}=(Te_b)(a)b(T)ab​=(Teb​)(a). Let SSS consist of states RuR_uRu​ with ∥u∥=1\|u\|=1∥u∥=1, and suppose the ranges BρB_\rhoBρ​, ρ∈S\rho\in Sρ∈S, have dense linear span in HIH_IHI​. Form the distinct components CkC_kCk​ of SSS by finite chains of states for which consecutive ρ,σ\rho,\sigmaρ,σ satisfy BρBσ≠0B_\rho B_\sigma\ne0Bρ​Bσ​=0, allowing zero-length chains; let PkP_kPk​ project onto the closed span of the ranges BρB_\rhoBρ​ for ρ∈Ck\rho\in C_kρ∈Ck​. Define

T(X,A)=∑ab(ABX)aa,DΦ(A)=B(T(Φ(Eba),A))a,b.T(X,A)=\sum_a b(AB_X)_{aa},\quad D_\Phi(A)=B_{(T(\Phi(E_{ba}),A))_{a,b}}.T(X,A)=a∑​b(ABX​)aa​,DΦ​(A)=B(T(Φ(Eba​),A))a,b​​.

Let OOO be the closed span of all output ranges BΦ(ρ)B_{\Phi(\rho)}BΦ(ρ)​, let QQQ project onto OOO, and set

m=min⁡ ⁣(dim⁡Cspan⁡{A:QAQ=A, DΦ(A)=0}+1, dim⁡CO),M={n∈N:n<m},m=\min\!\left( \dim_{\mathbb C}\operatorname{span}\{A:QAQ=A,\ D_\Phi(A)=0\}+1,\ \dim_{\mathbb C}O \right),\qquad M=\{n\in\mathbb N:n<m\},m=min(dimC​span{A:QAQ=A, DΦ​(A)=0}+1, dimC​O),M={n∈N:n<m},

with infinite dimensions converted to ∞\infty∞. In the following, a coefficient trace sum ∑kXk=Y\sum_kX_k=Y∑k​Xk​=Y requires every XkX_kXk​ and YYY to be nuclear and the operators BXkB_{X_k}BXk​​ to sum to BYB_YBY​ through unordered finite sums in the nuclear cost: the target, every finite sum, and every difference from the target have operator-norm-convergent rank-one expansions ∑q∣aq⟩⟨bq∣\sum_q|a_q\rangle\langle b_q|∑q​∣aq​⟩⟨bq​∣ with finite ∑q∥aq∥∥bq∥\sum_q\|a_q\|\|b_q\|∑q​∥aq​∥∥bq​∥, and the infimum of these costs for the differences tends to zero. The existence of a channel recovering every member of SSS after Φ\PhiΦ is equivalent, separately, to each of the following three conditions: there is a channel recovering every state XXX for which ∑kb(PkBXPk∗)=X\sum_k b(P_kB_XP_k^*)=X∑k​b(Pk​BX​Pk∗​)=X in this coefficient trace sense; there are states σk\sigma_kσk​ on EEE with rk⁡(Bσk)≤m\operatorname{rk}(B_{\sigma_k})\leq mrk(Bσk​​)≤m such that, for every nuclear XXX, Ψ(X)=∑kT(X,Pk)σk\Psi(X)=\sum_kT(X,P_k)\sigma_kΨ(X)=∑k​T(X,Pk​)σk​ in that sense; and there are a countable nonempty set FFF and vectors ξk,p∈HF\xi_{k,p}\in H_Fξk,p​∈HF​, p∈Mp\in Mp∈M, with ∑p∥ξk,p∥2=1\sum_p\|\xi_{k,p}\|^2=1∑p​∥ξk,p​∥2=1 and ⟨ξk,t,ξk,p⟩=0\langle\xi_{k,t},\xi_{k,p}\rangle=0⟨ξk,t​,ξk,p​⟩=0 for p≠tp\ne tp=t, such that

Θ(X)(a,p),(b,q)=∑k∑lb(PkBXPl)ab⟨ξl,q,ξk,p⟩\Theta(X)_{(a,p),(b,q)} =\sum_k\sum_l b(P_kB_XP_l)_{ab}\langle\xi_{l,q},\xi_{k,p}\rangleΘ(X)(a,p),(b,q)​=k∑​l∑​b(Pk​BX​Pl​)ab​⟨ξl,q​,ξk,p​⟩

is a channel and there is a bounded W:HJ→HI×MW:H_J\to H_{I\times M}W:HJ​→HI×M​ satisfying WW∗W=WWW^*W=WWW∗W=W and, for every nuclear XXX,

Θ(X)=b(WBΦ(X)W∗),Φ(X)=b(W∗BΘ(X)W).\Theta(X)=b(WB_{\Phi(X)}W^*),\qquad \Phi(X)=b(W^*B_{\Theta(X)}W).Θ(X)=b(WBΦ(X)​W∗),Φ(X)=b(W∗BΘ(X)​W).

Each recovery condition allows its own recovery channel. Ranks are complex range dimensions converted to N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}; the dense-span assumption excludes an empty SSS, and all otherwise unspecified infinite sums are total sums, zero in normed spaces when not summable.

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