Theorem A.9: Compatible A1,A2,A3 satisfy subadditivity H(A1A2)≤H(A1)+H(A2), SSA H(A1A2A3)+H(A2)≤H(A1A2)+H(A2A3), equivalently conditional subad
ProvedQAlgorithms.Papers.Independent.Renew46.P43.intrinsicSubadditivityFix 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
/-- Theorem A.9, PDF p.70: subadditivity and strong subadditivity for genuinely
compatible intrinsic subalgebras, which may overlap in the center. -/
theorem intrinsicSubadditivity {A : Fin 3 → IntrinsicSystem} {C : IntrinsicSystem}
(E : ∀ i, Embedding (A i) C) (rho : Matrix (Fin C.dim) (Fin C.dim) ℂ)
(hrho : C.IsState rho) (hcompat : ∀ i j, i ≠ j → CommutingImages (E i).map (E j).map) :
familyEntropy A (fun i => (E i).map) rho {0,1} ≤
familyEntropy A (fun i => (E i).map) rho {0} + familyEntropy A (fun i => (E i).map) rho {1} ∧
familyEntropy A (fun i => (E i).map) rho Finset.univ +
familyEntropy A (fun i => (E i).map) rho {1} ≤
familyEntropy A (fun i => (E i).map) rho {0,1} +
familyEntropy A (fun i => (E i).map) rho {1,2} := 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, each with a positive finite dimension and a natural number block label on each basis index; a matrix is block diagonal if its entries vanish between indices with different labels. For each , let be a complex linear map from matrices on to matrices on that preserves the identity and block diagonality, preserves products and adjoints of block diagonal matrices, and is injective on block diagonal matrices. Require also that every finite amplification of , including amplification size zero, preserves positive semidefiniteness on matrices whose entries vanish between distinct -block labels. Let be a positive semidefinite block diagonal -matrix with trace . Assume that for all distinct , all block diagonal matrices on , and all block diagonal matrices on , one has . For a subset , define a matrix , indexed by tuples , by
where is the matrix unit on ; the product is the finite enumerated product in the definition, and its factors commute under the stated assumptions. Write , where is applied by continuous functional calculus, and put . Then both inequalities hold:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.