Lemma 5: unique countable orthogonal decomposition into OND components
ProvedQAlgorithms.Papers.Independent.Gap48.P45.pureFamily_uniqueCountableONDDecompositionAll 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 projects onto the closed span of component . Every pure-state family , including the empty family, has a finite or countable collection of nonempty pairwise disjoint OND components such that
This collection of subfamilies is unique, equivalently unique up to reindexing. For empty it is empty.
This result provides the unique orthogonal component decomposition used in channel classification.
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)
/-- Lemma 5, PDF pp.14–15: canonical countable orthogonal OND decomposition,
unique up to permutation; the empty family has an empty collection. -/
theorem pureFamily_uniqueCountableONDDecomposition
{I : Type} [Countable I] [Nonempty I]
(S : Set (State I)) (hPure : S ⊆ pureStates I) :
(componentSets S).Countable ∧ IsONDPartition S (componentSets S) ∧
∀ parts : Set (Set (State I)), IsONDPartition S parts → parts = componentSets S := 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 and nonempty and . A state is a coefficient matrix admitting an expansion with , having real nonnegative quadratic forms on every finite coordinate set, and having a summable real diagonal of sum . For any matrix , let be a chosen bounded operator with that coordinate matrix if one exists, and zero otherwise. Let be any set of states each of the form for a unit vector . For , define to contain those joined to by a finite chain of states in such that every consecutive pair satisfies ; chains of length zero are allowed. Let , with duplicate subsets identified. Then is countable, its union is , each member is nonempty and has the property that every split into two nonempty subsets contains a pair on opposite sides with , and distinct members are disjoint and satisfy for every choice of one state from each. Moreover, any set of subsets with precisely these union, nonemptiness, splitting, disjointness, and cross-orthogonality properties equals . The family need not be countable or complete; if it is empty, and the unique such partition are empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.