Theorem A.12: Compatible Xalg,Yalg and pure rho restricted to Xalg Yalg imply H(Xalg)=H(Yalg).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.pureMarginalEntropiesFix 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.12, PDF p.71: purity only on XY. The pullback by the surjective
multiplication map preserves that purity; ambient purity is not assumed. -/
theorem pureMarginalEntropies {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) (hpure : IsPure (jointState X Y E.map F.map rho)) :
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 with a positive integer dimension and a block label function on its coordinate indices. A matrix respects these blocks when its entries between differently labelled indices vanish. Let and be complex-linear embeddings: each is unital, preserves the block algebra, preserves products and adjoints on that algebra, is injective there, and preserves positivity under every finite matrix amplification restricted to matrices whose entries vanish between unequal source-block labels. Assume for every block-respecting on and on . Let be a positive semidefinite, trace- matrix respecting the blocks of . Define the restricted matrices by
and define a matrix on the product coordinate set by
Here and are matrix units in their respective spaces. If for some complex unit vector on the product coordinate set, then , where for every matrix ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.