Theorem 5: unambiguous bounded-rank Kraus and r-PEB conclusion
OpenQAlgorithms.Papers.Independent.Gap48.P45.generalizedHolevoEquality_boundedRankComplementAll 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 and let be a Borel ensemble of states of rank at most , with full-rank computed average and finite Holevo quantity preserved by . Every fixed complement admits a countable Kraus family and satisfies
This separately inventoried qualitative conclusion does not claim the deferred numerical bound containing undefined n.
This result gives the unambiguous complementary-channel obstruction to finite-Holevo equality.
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 5's unambiguous bounded-rank conclusion, PDF p.20. The numerical
count with undefined n is separately deferred, not silently repaired. -/
theorem generalizedHolevoEquality_boundedRankComplement
{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)
(mu : GeneralizedEnsemble I) (r : ℕ) (hr : 0 < r)
(hRank : ∀ᵐ rho ∂(mu : Measure (State I)), operatorRank (boundedOperator rho.coefficients) ≤ r)
(hFullRank : FullRank (averageCoefficients mu))
(hFinite : ensembleHolevo (id : Matrix I I ℂ → Matrix I I ℂ) mu < ⊤)
(hEquality : ensembleHolevo Phi.val mu = ensembleHolevo (id : Matrix I I ℂ → Matrix I I ℂ) mu) :
HasBoundedRankKraus Psi.val r ⊤ ∧ PartiallyEntanglementBreaking Psi.val r := 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 types and . A matrix is trace class here if with ; let be the infimum of these sums, with empty infimum . States are trace-class matrices with real, nonnegative finite-coordinate quadratic forms and summable real diagonal of sum , topologized by the generated -balls and equipped with their Borel measurable structure. Channels preserve trace class, are additive and complex homogeneous there, and preserve states under blockwise amplification by the identity on every finite auxiliary coordinate space. Let and be channels for which there is a complex linear isometry such that, for every state ,
where . Let be a Borel probability measure on states of , let , and let satisfy . For a matrix , let be a chosen bounded operator with coordinate matrix , or if none exists; write , and let denote algebraic dimension with every infinite value replaced by . Assume that for -almost every , and that implies . Define
with and . Assume that and that this integral equals . Then there exist a countable type and bounded operators , each with , such that for every , with convergence of finite subsums in , and, for every trace-class ,
as the finite sets increase. The stated bound on the cardinality of is only . In addition, for every countable, nonempty auxiliary type and every state on , the blockwise amplification lies in the following closure: for every , it is within -distance of a finite real convex combination of matrices , where , , and
for some and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.