Data processing on the conditioning system
ProvedQAlgorithms.Papers.Independent.Support50.P23.alphaDataProcessingLet and be normalized finite-dimensional states and a trace-preserving completely positive map. Put and . For every ,
The channel acts on arbitrary entangled inputs through its blockwise identity extension. Thus processing the side information cannot decrease this conditional entropy.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
noncomputable section
open Filter
open scoped ENNReal ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Support50.P23
attribute [local instance] Classical.propDecidable
-- Exact accepted bodies. Other similarly named catalogue entries use different
-- smoothing, conditioning order, logarithm base, or channel-level objects.
open QAlgorithms.Papers.Independent.Gap20.P03 (fixedMin)
open QAlgorithms.Papers.Independent.Dependency50.P36 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P69 (matrixPower)
variable {A B C D I : Type*}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype I]
variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D] [DecidableEq I]
/-- Lemma 5, PDF p.4, (20): processing B cannot decrease entropy; includes 0,1,2. -/
theorem alphaDataProcessing [Nonempty A] [Nonempty B] [Nonempty C]
(rho : Matrix (A × B) (A × B) ℂ) (sigma : Matrix B B ℂ)
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(E : Superop B C) (hE : IsChannel E) (alpha : ℝ≥0∞) (halpha : alpha ≤ 2) :
alphaEntropy rho sigma alpha ≤
alphaEntropy (idTensorSuperop (R := A) E rho) (E sigma) alpha := by sorry
end QAlgorithms.Papers.Independent.Support50.P23
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite, nonempty index types with decidable equality, and let on and on be positive semidefinite complex matrices of trace one. Let be a map from complex matrices on to those on having a finite Kraus representation for every matrix , with . For any bipartite matrix and reference , put ; define when , and otherwise, where . For positive real , set if and that support condition fails, and otherwise set , with , otherwise, , and otherwise; matrix functions use continuous functional calculus. Set and . For every satisfying ,
where the extended map applies separately to each -matrix block indexed by a pair of -indices. The range of orders includes zero and two and excludes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.