§II.C: coherent-information subadditivity and additivity
OpenQAlgorithms.Papers.Independent.Support50.P01.coherentInformation_additivityLet , , and have positive finite dimensions and fixed orthonormal bases. Fix an isometry and define the channel and its genuine complement . Density operators are positive semidefinite with trace one, and all entropies use base-two logarithms with . Write , , and , with arbitrary entangled block inputs. Conjugate degradability means one CPTP map satisfies for every operator ; conjugate antidegradability reverses the receiver and environment in this identity. If is conjugate degradable, every two-use density operator , with actual partial-trace marginals , satisfies
The first assertion retains entangled inputs, and the second gives optimized additivity.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P01
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable dilationPower maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)
open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {a b e c : ℕ}
/-- PDF p.4: subadditivity on arbitrary two-use inputs and optimized n-use additivity. -/
theorem coherentInformation_additivity (ha : 0<a) (hb : 0<b) (he : 0<e)
(U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateDegradable U) :
(∀ rho : Matrix (Fin 2 → Fin a) (Fin 2 → Fin a) ℂ, IsDensityMatrix rho →
blockCoherentInformation U 2 rho ≤
coherentInformation (receiverChannel U) (fun x y => ∑ t : Fin a, rho ![x,t] ![y,t]) +
coherentInformation (receiverChannel U) (fun x y => ∑ t : Fin a, rho ![t,x] ![t,y])) ∧
∀ n : ℕ, 0<n → maximumCoherentInformation (dilationPower U n) = (n : ℝ) * maximumCoherentInformation U := by sorry
end QAlgorithms.Papers.Independent.Support50.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers and every complex matrix , assume and that a finite Kraus channel satisfies for every matrix , where , , and “finite Kraus channel” means with . Write , using continuous functional calculus, and
Here the identity extension applies separately to each reference block. For , let , let and be its two partial-trace maps, and put . Then every density matrix indexed by two -valued coordinates satisfies
Moreover, for every positive natural number ; this latter assertion does not quantify over .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.