Theorem A.20: Compatible quantum operations phi:X→A,psi:Y→A with X OR Y commutative satisfy H(phi|psi)≥0.
OpenQAlgorithms.Papers.Independent.Renew46.P43.classicalConditionalEntropyFix a normalized state on a finite ambient algebra and compatible CP-unital operations and . Commutativity is a disjunction on the entire domain algebras, not on one pair of operators.
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
/-- Theorem A.20, PDF p.74: at least one entire domain algebra is commutative;
no nonnegativity hypothesis is imposed on the desired conditional entropy. -/
theorem classicalConditionalEntropy {X Y A : IntrinsicSystem} (E : IntrinsicOperation X A) (F : IntrinsicOperation Y A)
(hcompat : CommutingImages E.map F.map)
(hclassical : (Function.Injective X.block) ∨ (Function.Injective Y.block))
(rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) (hrho : A.IsState rho) :
0 ≤ intrinsicConditionalEntropy 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 ; a matrix is block diagonal for if its entries between different block labels vanish. Let and be complex-linear, identity-preserving maps that preserve block diagonality and satisfy this positivity condition: for every integer and every positive semidefinite matrix indexed by pairs , with and a source-system index, if whenever the source block labels of differ, then the matrix with -block equal to the image of is positive semidefinite. Assume their images commute on block-diagonal inputs: for all such . Assume also that is injective or is injective, allowing both to be injective. Let be positive semidefinite, of trace , and block diagonal for . Define
where denotes the appropriate matrix unit. For , with applied by functional calculus, the conclusion is
Dimensions equal to are included; in particular, injectivity of a block-label function on a one-element index set is automatic.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.