Lemma 3: degradation additivity
OpenQAlgorithms.Papers.Independent.Gap20.P15.degradation_additivityLet and be completely positive trace-preserving maps on the full trace class of nonzero separable complex Hilbert spaces. Let be a nonnegative discrete spectral energy observable with ground energy zero and for every . Fix a finite . Assume Condition 7: one finite bound on holds uniformly over all normalized states with . Entropies are in bits.
Define , interpreting an individual entropy difference as when the degraded output entropy is infinite. For every integer , put . Then
The optimization includes entangled inputs and imposes average energy across uses. It supplies the entropy optimization in the approximate-degradability bounds.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P15
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P15
open QAlgorithms.Papers.Independent.Frontier30.P24 (bosonicEntropy)
open QAlgorithms.Papers.Independent.Dependency50.P33 (State)
open QAlgorithms.Papers.Independent.Frontier18.P01 (Channel Hamiltonian)
open QAlgorithms.Papers.Independent.Gap48.P26 (entropyBits)
open QAlgorithms.Papers.Independent.Claimed50.P35 (traceClassChannelPower)
open scoped ENNReal
/-- Lemma 3, PDF pp.16-17, (4.3). Genuine trace-class channels on nonzero
separable spaces, Gibbs input energy, and standing Condition 7. Values may be
minus infinity when D creates infinite entropy. No finiteness of D is added. -/
theorem degradation_additivity
{I J E : Type} [Countable I] [Countable J] [Countable E]
[Nonempty I] [Nonempty J] [Nonempty E]
(N : Channel I J) (D : Channel J E) (H : Hamiltonian I)
(hnonnegative : ∀ i, 0 ≤ H.energy i)
(hground : ∃ i, H.energy i = 0) (hgibbs : H.gibbs)
(budget : ℝ) (hbudget : 0 ≤ budget)
(houtput : finiteOutputEntropy N H.energy budget)
(n : ℕ) (hn : 1 ≤ n) :
degradationSupremum (traceClassChannelPower N.val n)
(traceClassChannelPower D.val n) (averageSpectrum H.energy n) budget =
(n : EReal) * degradationSupremum N.val D.val H.energy budget := by sorry
end QAlgorithms.Papers.Independent.Gap20.P15
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countable, nonempty types, let and be channels in the following precise sense, and let consist of a real energy function , a real lower bound , and the inequalities for every . A matrix is called trace class here when it admits sequences with and ; write for the infimum, over all such expansions, of , as an extended nonnegative real, with infimum if there is no expansion. A state is a trace-class matrix whose every finite quadratic form is real and nonnegative and whose real diagonal entries are summable with sum . Each channel maps trace-class matrices to trace-class matrices, is additive and complex homogeneous on them, and, for every natural and every state indexed by input labels times , produces a state under the entrywise extension
Assume for every , some , and
Let be a real budget, and assume there exists a finite nonnegative real such that for every state with . Here, for every matrix ,
where is the finite coordinate restriction, , and the matrix logarithm is defined by continuous functional calculus. For a real function , define
with the entropy values converted to extended reals before subtraction. For any natural , put . The asserted equality is
The powers in this formula are defined on matrices indexed by tuples: preserves the sole entry indexed by empty tuples, and recursively
Thus the left supremum ranges over all states on satisfying the average-energy constraint, without a product-state restriction. The budget may be zero and is included, while is excluded; the equality is in the extended real numbers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.