Lemma 7
ProvedQAlgorithms.Papers.Independent.Support50.P21.cptp_monotonicityAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
Let be a density operator, , and any completely positive trace-preserving map between finite-dimensional systems. Then
The output dimension is arbitrary and is not required to be normalized. This is data processing for both divergences.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P21
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.
open QAlgorithms.Papers.Independent.Claimed50.P33
(FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
section Statements
variable [Nonempty I] [Nonempty J]
/-- Lemma 7, PDF p.4, (18)–(19): arbitrary finite output dimension and Kraus CPTP.
The reversed Petz inequality inside the printed proof is not copied. -/
theorem cptp_monotonicity (rho sigma : Mat I) (hrho : IsDensityMatrix rho)
(hsigma : sigma.PosSemidef) (T : Superop I J) (hT : IsChannel T) :
dMin (T rho) (T sigma) ≤ dMin rho sigma ∧
maxRelative (T rho) (T sigma) ≤ maxRelative rho sigma := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any finite index types with decidable equality, let be a positive semidefinite complex matrix on with complex trace one, let be any positive semidefinite complex matrix on , and let be a function from complex matrices on to complex matrices on admitting a finite Kraus representation: there exist and matrices from to such that and for every . For the orthogonal projection onto the range of , , and when , with otherwise, define
using extended-real infima, including for an empty feasible set. Then
No support inclusion or trace normalization of is required, and is allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.