Theorem A.19: I(Xalg:Yalg)≤2min{H(Xalg),H(Yalg)} for compatible algebras.
ProvedQAlgorithms.Papers.Independent.Renew46.P43.informationEntropyBoundFix 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.19, PDF p.74. The factor two is essential even for an EPR pair. -/
theorem informationEntropyBound {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) :
intrinsicMutualInformation X Y E.map F.map rho ≤
2 * min (viewedEntropy X E.map rho) (viewedEntropy Y 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 . Call a matrix block diagonal for when whenever . Let and be complex-linear maps with the following properties: they preserve identity matrices and block diagonality; on block-diagonal matrices they preserve multiplication and conjugate transpose and are injective; and, for every integer , applying either map to every matrix block of a positive semidefinite matrix indexed by preserves positive semidefiniteness, provided its entries vanish whenever the two -indices have different block labels. Assume for every block-diagonal for and for . Let be positive semidefinite, have trace , and be block diagonal for . Define matrices by
where is the matrix with its sole nonzero entry in row , column , in the appropriate space. Writing , where is applied by functional calculus, the assertion is
All three system dimensions may equal , and block-label functions need not be injective.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.