Unnumbered Eq.(76): subadditivity
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.relativeEntanglement_subadditiveAll local registers are nonzero and finite-dimensional. Density matrices are positive semidefinite with trace one. Entropies use natural logarithms, , and Umegaki relative entropy is on failure of support inclusion. The relative entropy of entanglement is , where separability is across the specified Alice:Bob cut.
Let and be density matrices on arbitrary nonzero finite local registers. Alice holds 1 and 3 and Bob holds 2 and 4. Then
The left minimization permits arbitrary entanglement inside either party’s registers. This subadditivity is separate from conjectured equality.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P42
open QAlgorithms QAlgorithms.Entanglement
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P04 (copies)
open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.26, Eq.(76): subadditivity across Alice's combined registers versus Bob's.
The comparison set permits arbitrary entanglement inside either party's registers. -/
theorem relativeEntanglement_subadditive {I J A B : Type}
[Fintype I] [Fintype J] [Fintype A] [Fintype B]
[DecidableEq I] [DecidableEq J] [DecidableEq A] [DecidableEq B]
[Nonempty I] [Nonempty J] [Nonempty A] [Nonempty B]
(sigma : Matrix (I × J) (I × J) ℂ) (tau : Matrix (A × B) (A × B) ℂ)
(hsigma : IsDensityMatrix sigma) (htau : IsDensityMatrix tau) :
relativeEntanglementNats (groupedProduct sigma tau) ≤
relativeEntanglementNats sigma + relativeEntanglementNats tau := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every four finite nonempty types , each equipped with decidable equality, and every positive semidefinite trace-one matrix indexed by and positive semidefinite trace-one matrix indexed by , define their grouped product on by
For each indicated bipartition, define as the extended-real infimum of over matrices , where is a natural number, , , and every is positive semidefinite with trace . Here if , and otherwise; logarithms are natural, interpreted by functional calculus with . The assertion is the extended-real inequality
where the bipartitions are , , and , respectively.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.