Theorem 4: complete pure-family classification, all four equivalent conditions
OpenQAlgorithms.Papers.Independent.Gap48.P45.completePureFamily_fourConditionsAll 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 for the closed span of all output supports, , , and ; 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 projects onto the closed span of component . For vectors with and when , define on . Here has dimension , including countable infinity. Let be a complete pure family, use its canonical component projections, put , and define . For any fixed complement, the following four conditions are equivalent:
The are normalized states. Projections and are computed from .
This result classifies complete pure-family reversibility through its canonical orthogonal components.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P45
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable nonempty sets and . A coefficient matrix is nuclear if with ; let be the infimum of these costs, or when no representation exists. States are nuclear matrices with real nonnegative finite-coordinate quadratic forms and summable real diagonal of sum . Channels preserve nuclear matrices, are complex linear on them, and preserve states under entrywise amplification by every finite identity. Let and be channels for which there is a linear isometry such that, for every state , their outputs are the two partial diagonal sums of
Write , let be a chosen bounded operator with coordinate matrix , or zero if none exists, and put . Let consist of states with , and suppose the ranges , , have dense linear span in . Form the distinct components of by finite chains of states for which consecutive satisfy , allowing zero-length chains; let project onto the closed span of the ranges for . Define
Let be the closed span of all output ranges , let project onto , and set
with infinite dimensions converted to . In the following, a coefficient trace sum requires every and to be nuclear and the operators to sum to 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 with finite , and the infimum of these costs for the differences tends to zero. The existence of a channel recovering every member of after is equivalent, separately, to each of the following three conditions: there is a channel recovering every state for which in this coefficient trace sense; there are states on with such that, for every nuclear , in that sense; and there are a countable nonempty set and vectors , , with and for , such that
is a channel and there is a bounded satisfying and, for every nuclear ,
Each recovery condition allows its own recovery channel. Ranks are complex range dimensions converted to ; the dense-span assumption excludes an empty , and all otherwise unspecified infinite sums are total sums, zero in normed spaces when not summable.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.