Lemma 2: positive operator decomposition controlled by dual rank
OpenQAlgorithms.Papers.Independent.Gap48.P45.positiveOperator_dualRankDecompositionAll 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. Let be any bounded output operator, and suppose . Set . There exist vectors , allowing zero vectors, such that
This result controls a positive operator decomposition using the dimension lost by the channel dual.
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 2, PDF pp.10–11. B is bounded positive, not necessarily trace class.
The unrestricted dual kernel contributes at r=0; infinite sums are strong. -/
theorem positiveOperator_dualRankDecomposition
{I J : Type} [Countable I] [Countable J] [Nonempty I] [Nonempty J]
(Phi : Channel I J) (B : Hilbert J →L[ℂ] Hilbert J)
(hPositive : B.adjoint = B ∧ ∀ x, 0 ≤ (inner ℂ x (B x)).re)
(r : ℕ) (hRank : operatorRank (channelDual Phi.val B) = r) :
let m : ℕ∞ := min
(Cardinal.toENat (Module.rank ℂ (Submodule.span ℂ
{C : Hilbert J →L[ℂ] Hilbert J | channelDual Phi.val C = 0})) + (r : ℕ∞) ^ 2)
(dimensionCount J)
∃ psi : BoundIndex m → Hilbert J, ∀ x : Hilbert J,
HasSum (fun j => boundedOperator (rankOne (psi j)) x) (B x) := 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 ; a state is a nuclear matrix whose finite-coordinate quadratic forms are real and nonnegative and whose summable real diagonal sums to . Let preserve nuclear matrices, be additive and complex homogeneous on them, and take states to states after entrywise amplification by every finite identity. For a matrix , let be a chosen bounded operator with coordinate matrix , or zero if none exists; write . For a bounded operator on , define
where is the matrix unit, and all sums use the total infinite-sum convention. Let be bounded, self-adjoint, and satisfy for every . Let satisfy , where rank means the complex dimension of the operator’s range, converted to . Define
with all infinite dimensions and cardinalities converted to . Then there are vectors , indexed by the natural numbers , such that, for every , the unordered sum converges in and satisfies
No normalization or nonzero condition is imposed on the . The statement includes ; if , its indexing set is empty and the asserted sum is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.