Lemma 7: countable complete OND subfamily
ProvedQAlgorithms.Papers.Independent.Gap48.P45.completeOND_containsCountableCompleteONDAll 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 complete OND pure-state family in a separable space contains a countable subfamily with
The original family need not be countable.
This result reduces a complete OND family to a countable family with the same closed span.
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 7, PDF p.25: a countable complete OND subfamily; no countability
hypothesis on the original family and no algebraic-span substitution. -/
theorem completeOND_containsCountableCompleteOND
{I : Type} [Countable I] [Nonempty I]
(S : Set (State I)) (hPure : S ⊆ pureStates I)
(hComplete : CompleteFamily S) (hOND : OrthogonallyNondecomposable S) :
∃ T ⊆ S, T.Countable ∧ CompleteFamily T ∧ OrthogonallyNondecomposable T := 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 a countable, nonempty type, and write . A state on is a complex matrix admitting vectors , indexed by , such that and ; for every finite and every , the sum is real and nonnegative; and the real diagonal entries form a summable family with . For any matrix , let be the bounded complex linear operator chosen to satisfy , where is the coordinate unit vector, if such an operator exists, and let otherwise. Let be a set of states, each of whose matrices has the form for some with . Assume that the closed complex linear span of all vectors , with the matrix of a state in and , equals . Also assume that for every subset for which both and are nonempty, there are states and such that , writing for the operator associated with the matrix of . Then there exists a countable subset such that the closed complex linear span of all , with and , equals , and for every with and , there are and satisfying . Here “countable” permits finite subsets, and the condition concerning a partition imposes no requirement when either part is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.