Theorem 5: convexity of conjugate antidegradable channels
ProvedQAlgorithms.Papers.Independent.Support50.P01.conjugateAnti_convexLet and have positive finite dimensions and fixed complex orthonormal bases. Let be conjugate antidegradable CPTP maps, each with its own isometric complement and one input-independent CPTP antidegrading witness. For every ,
This gives convexity on common input and output spaces without requiring common environment dimensions or common witnesses.
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.14, Theorem 5: different mixture members may have different complements and witnesses. -/
theorem conjugateAnti_convex (ha : 0<a) (hb : 0<b)
(Phi Psi : Superop (Fin a) (Fin b))
(hPhi : ConjugateAntiChannel Phi) (hPsi : ConjugateAntiChannel Psi)
(t : ℝ) (ht0 : 0≤t) (ht1 : t≤1) :
ConjugateAntiChannel (fun X => (t : ℂ) • Phi X + ((1-t : ℝ) : ℂ) • Psi X) := by sorry
end QAlgorithms.Papers.Independent.Support50.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be positive natural numbers, and let map complex matrices to matrices. Assume that each map admits a positive natural number , a matrix satisfying , and a finite Kraus map from the second output factor to the first, such that for every complex input matrix ,
For every real with , the map also admits a positive natural number , a matrix with , and a finite Kraus map such that
A finite Kraus map means for some natural number , with on its input space; is ordinary transpose. The endpoint choices and are included, and the two original maps may use different environment dimensions and Kraus maps.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.