Theorem A.17: For compatible X1,X2,Y1,Y2, I(Y1:X2Y2|X1)=I(Y2:X1Y1|X2)=0 implies I(X1X2:Y1Y2)≤I(X1:Y1)+I(X2:Y2). For n pairs, H(Yk|all X, other Y
OpenQAlgorithms.Papers.Independent.Renew46.P43.conditionallyIndependentInformationFix a normalized ambient state and finite families of intrinsic subalgebras , whose distinct members commute elementwise. Do not assume a product ambient state. The displayed conditional-entropy equations are the source conditional-independence hypotheses; their two-pair specialization is exactly the two conditional-mutual-information-zero hypotheses.
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.17, PDF pp.73-74, including its n-fold continuation. The conditional
independence equation is exactly H(Y_k|all X,other Y)=H(Y_k|X_k); n=2 gives the
two displayed conditional-mutual-information-zero hypotheses. -/
theorem conditionallyIndependentInformation {n : ℕ} {A : Fin n × Bool → 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)
(hindependent : ∀ k : Fin n,
familyEntropy A (fun i => (E i).map) rho Finset.univ -
familyEntropy A (fun i => (E i).map) rho (Finset.univ.erase (k,true)) =
familyEntropy A (fun i => (E i).map) rho {(k,false),(k,true)} -
familyEntropy A (fun i => (E i).map) rho {(k,false)}) :
familyEntropy A (fun i => (E i).map) rho (xIndices n) +
familyEntropy A (fun i => (E i).map) rho (yIndices n) -
familyEntropy A (fun i => (E i).map) rho Finset.univ ≤
∑ k, (familyEntropy A (fun i => (E i).map) rho {(k,false)} +
familyEntropy A (fun i => (E i).map) rho {(k,true)} -
familyEntropy A (fun i => (E i).map) rho {(k,false),(k,true)}) := 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 , let for , and let , be systems with positive finite dimensions and a natural-number block label on each basis index. For every , let be a complex-linear map from matrices on to matrices on that preserves the identity and block-diagonal matrices, preserves multiplication and adjoints on block-diagonal matrices, and is injective on those matrices; at every finite amplification, including amplification dimension zero, it must also preserve positivity of matrices whose entries vanish between different -block labels. Let be positive semidefinite with trace , with whenever the -block labels of differ. Assume the images under of any block-diagonal matrices commute whenever . For a subset of the paired index set, define , indexed by tuples of basis indices of the systems in , by
where the product follows the finite-set enumeration used in the definition. Write , where is applied by continuous functional calculus. Let be the whole paired index set, , and . If, for every ,
then
The case is included: the independence assumptions are vacuous, the empty-family matrix is the scalar , and the inequality is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.