A.14-subalgebra-monotonicity: If Xalg⊆Xprime,Yalg⊆Yprime and larger algebras compatible, I(Xalg:Yalg)≤I(Xprime:Yprime).
OpenQAlgorithms.Papers.Independent.Renew46.P43.subalgebraInformationFix 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
/-- Subalgebra monotonicity following Theorem A.14, PDF p.72. The larger
subalgebras commute; the smaller ones are their actual included subalgebras. -/
theorem subalgebraInformation {X Y Xbig Ybig A : IntrinsicSystem}
(E : Embedding Xbig A) (F : Embedding Ybig A) (hcompat : CommutingImages E.map F.map)
(i : Embedding X Xbig) (j : Embedding Y Ybig)
(rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) (hrho : A.IsState rho) :
intrinsicMutualInformation X Y (E.map.comp i.map) (F.map.comp j.map) rho ≤
intrinsicMutualInformation Xbig Ybig 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, each consisting of a positive integer dimension and a block-label function ; write for the matrices satisfying whenever . Let , , , and be embeddings in the following precise sense: each is a complex-linear map on the full matrix spaces, sends identity to identity, sends the source block algebra into the target block algebra, preserves adjoints and products on the source block algebra, and is injective on that algebra. Each also has the following positivity property for every integer : if a positive semidefinite matrix , indexed by pairs with and , vanishes whenever , then the matrix whose -entry is is positive semidefinite, where denotes the map in question. Assume for every and . Let be positive semidefinite with trace . For a map , define its restricted matrix by when , and otherwise, where is the matrix unit. For maps and , define by
Writing , where is applied by continuous functional calculus, the assertion is
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.