A.14-operation-processing: For compatible CP-unital psi_i:A_i→A and CP-unital phi_i:A_i_prime→A_i, I(psi1∘phi1:psi2∘phi2)≤I(psi1:psi2).
OpenQAlgorithms.Papers.Independent.Renew46.P43.operationInformationFix one normalized ambient state and finite intrinsic C*-algebras. Subsystem inclusions are unital star embeddings and distinct named compatible images commute elementwise, with central overlap allowed. Entropies are those of trace-adjoint restrictions; is entropy on the generated algebra, equivalently the spectrum-preserving pullback by multiplication. Mutual information is . In subalgebra processing the larger algebras are compatible. In operation processing the maps are compatible CP-unital maps and arbitrary composable CP-unital maps, not necessarily homomorphisms.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- General operation processing following Theorem A.14, PDF p.72: the local
operations are CP-unital maps, not assumed multiplicative. -/
theorem operationInformation {X Y Xnew Ynew A : IntrinsicSystem}
(E : IntrinsicOperation X A) (F : IntrinsicOperation Y A) (hcompat : CommutingImages E.map F.map)
(i : IntrinsicOperation Xnew X) (j : IntrinsicOperation Ynew Y)
(rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) (hrho : A.IsState rho) :
intrinsicMutualInformation Xnew Ynew (E.map.comp i.map) (F.map.comp j.map) rho ≤
intrinsicMutualInformation X Y E.map F.map rho := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be systems with positive integer dimensions and block-label functions , and let consist of matrices whose entries between unequal block labels are zero. Let , , , and be complex-linear maps on the full matrix spaces. Each map sends identity to identity, sends the source block algebra into the target block algebra, and satisfies the following positivity condition for every integer : whenever is indexed by , with and a source index, and for unequal source block labels, the amplified matrix with entries is positive semidefinite. Assume for all and , and let be positive semidefinite with trace . For , set when the block labels of agree, and otherwise; here is a matrix unit. For and , set
With , where is applied by continuous functional calculus, the conclusion is
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.