Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2: OND complete families characterize universal recovery

Open
QAlgorithms.Papers.Independent.Gap48.P45.ondFamily_universalRecoveryCharacterization

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. 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. Let SSS be a complete pure-state family in HAH_AHA​. Quantify over every nonzero separable output space and every channel into it. Then

S is OND  ⟺  every channel reversible on S is isometrically equivalent to X↦X⊗σ,S\text{ is OND}\iff\text{every channel reversible on }S\text{ is isometrically equivalent to }X\mapsto X\otimes\sigma,S is OND⟺every channel reversible on S is isometrically equivalent to X↦X⊗σ,

for some ancillary space and a fixed state σ\sigmaσ. The ancilla and state may depend on the channel.

This result characterizes when recovering a pure family forces recovery of every input state.

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)

/-- Proposition 2, PDF p.13: quantify over ALL nonzero separable output spaces;
channel (13) appends a fixed, possibly mixed ancillary state. -/
theorem ondFamily_universalRecoveryCharacterization
    {I : Type} [Countable I] [Nonempty I]
    (S : Set (State I)) (hPure : S ⊆ pureStates I) (hComplete : CompleteFamily S) :
    OrthogonallyNondecomposable S ↔
      ∀ (J : Type) [Countable J] [Nonempty J] (Phi : Channel I J), ReversibleOn Phi.val S →
        ∃ (K : Type) (_ : Countable K) (_ : Nonempty K) (sigma : State K),
          IsometricallyEquivalent Phi.val (appendingMap sigma) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P45

end
Source
Reversibility conditions for quantum channels and their applications, arXiv:1203.0262v3, PDF p. 13, Proposition 2: OND complete families characterize universal recovery
Read-back

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

Let III be countable and nonempty and HA=ℓ2(A;C)H_A=\ell^2(A;\mathbb C)HA​=ℓ2(A;C). Call a matrix XXX nuclear if Xab=∑nun(a)vn(b)‾X_{ab}=\sum_nu_n(a)\overline{v_n(b)}Xab​=∑n​un​(a)vn​(b)​ for vectors with ∑n∥un∥∥vn∥<∞\sum_n\|u_n\|\|v_n\|<\infty∑n​∥un​∥∥vn​∥<∞; a state is a nuclear matrix with real nonnegative quadratic forms on every finite coordinate set and summable real diagonal of sum 111. Put 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 write b(T)ab=(Teb)(a)b(T)_{ab}=(Te_b)(a)b(T)ab​=(Teb​)(a). Let SSS be a set of states, each equal to RuR_uRu​ for some unit vector uuu, such that the closed span of the ranges of BρB_\rhoBρ​, ρ∈S\rho\in Sρ∈S, is all of HIH_IHI​. Then the following are equivalent: for every subset T⊆ST\subseteq ST⊆S with both TTT and S∖TS\setminus TS∖T nonempty, there are ρ∈T\rho\in Tρ∈T and σ∈S∖T\sigma\in S\setminus Tσ∈S∖T with BρBσ≠0B_\rho B_\sigma\ne0Bρ​Bσ​=0; and, for every countable nonempty set JJJ and every channel Φ:I→J\Phi:I\to JΦ:I→J admitting a channel R:J→I\mathcal R:J\to IR:J→I with R(Φ(ρ))=ρ\mathcal R(\Phi(\rho))=\rhoR(Φ(ρ))=ρ for every ρ∈S\rho\in Sρ∈S, there are a countable nonempty set KKK and a state σ\sigmaσ on KKK such that Φ\PhiΦ is isometrically equivalent to the map Aσ(X)(a,k),(b,l)=Xabσkl\mathcal A_\sigma(X)_{(a,k),(b,l)}=X_{ab}\sigma_{kl}Aσ​(X)(a,k),(b,l)​=Xab​σkl​. Explicitly, this equivalence of maps means that there is a bounded W:HJ→HI×KW:H_J\to H_{I\times K}W:HJ​→HI×K​ with WW∗W=WWW^*W=WWW∗W=W and, for every nuclear XXX,

Aσ(X)=b(WBΦ(X)W∗),Φ(X)=b(W∗BAσ(X)W).\mathcal A_\sigma(X)=b(WB_{\Phi(X)}W^*),\qquad \Phi(X)=b(W^*B_{\mathcal A_\sigma(X)}W).Aσ​(X)=b(WBΦ(X)​W∗),Φ(X)=b(W∗BAσ​(X)​W).

Here a channel means a map preserving nuclear matrices, additive and complex homogeneous on them, whose entrywise amplification by every finite identity preserves states; no condition on its values on nonnuclear matrices is included. The dense-span assumption excludes S=∅S=\varnothingS=∅, while the condition about splitting SSS is vacuous for a singleton.

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