Positive filtering preserves entanglement breaking
ProvedQAlgorithms.Papers.Independent.Support50.P19.positiveFilterLet be a completely positive entanglement-breaking map on positive-dimensional finite complex spaces; trace preservation is not required. For every positive semidefinite operator on , define . Then
The input and output dimensions may differ, and is not normalized. This closure property permits the positive filtering used in the channel subadditivity argument.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
open Filter Topology
namespace QAlgorithms.Papers.Independent.Support50.P19
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P35
(tr Dominates spectralPower elog elogNN rawTrace cq)
open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)
open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)
open QAlgorithms.Papers.Independent.Dependency50.P23
(UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
open QAlgorithms.Papers.Independent.Claimed50.P26
(CovariantIrreducible minOutput UnassistedExponentialConverse)
variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]
variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]
/-- PDF p.7, Remark 1: arbitrary rectangular CP EB maps remain CP and EB after filtering. -/
theorem positiveFilter [Nonempty I] [Nonempty J] (N : Superop I J) (hCP : FiniteKrausCP N) (hEB : IsEB N)
(Y : Matrix J J ℂ) (hY : Y.PosSemidef) :
FiniteKrausCP (filtered Y N) ∧ IsEB (filtered Y N) := by sorry
end QAlgorithms.Papers.Independent.Support50.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, and let be a function from complex matrices on to complex matrices on admitting a finite representation , without any normalization requirement on the . Assume that for every natural and every positive semidefinite trace-one matrix on the reference space times , the matrix is a finite sum , where and the factors are positive semidefinite trace-one matrices on the reference and output spaces; the weights need not sum to , and the sum may be empty. For every positive semidefinite matrix on , define . The theorem asserts that also admits a finite representation , and that every for and a density-matrix input has a finite decomposition of the same form. Amplification means applying the function separately to each reference-indexed matrix block. Neither nor is required here to preserve trace, and is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.