Theorem A.13: Compatible subalgebras and any state satisfy |H(Xalg)−H(Yalg)|≤H(Xalg Yalg).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.entropyTriangleFix 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.13, PDF pp.71-72: the intrinsic-algebra entropy triangle inequality. -/
theorem entropyTriangle {X Y A : IntrinsicSystem} (E : Embedding X A) (F : Embedding Y A)
(hcompat : CommutingImages E.map F.map) (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ)
(hrho : A.IsState rho) :
|viewedEntropy X E.map rho - viewedEntropy Y F.map rho| ≤
vnEntropy (jointState 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 coordinate block labels , and call a matrix block-respecting if its entries between unequal labels are zero. Let and be unital complex-linear maps that preserve the block algebras, preserve products and adjoints on those algebras, are injective on those algebras, and preserve positive semidefiniteness under every finite amplification on matrices supported within equal source-block labels. Suppose their images commute on these algebras: for every block-respecting . For every positive semidefinite, trace-, block-respecting matrix on , define
and
where the 's are the corresponding matrix units. Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.