Theorem 5: convexity
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.relativeEntanglement_convexAll 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.
For density matrices on the same bipartite register and weights with ,
This is convexity of the relative-entropy-generated measure.
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
/-- Theorem 5, PDF pp.15–16: convexity of relative entropy of entanglement. -/
theorem relativeEntanglement_convex {I J : Type} [Fintype I] [Fintype J]
[DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J]
(sigma tau : Matrix (I × J) (I × J) ℂ)
(hsigma : IsDensityMatrix sigma) (htau : IsDensityMatrix tau)
(x y : ℝ) (hx : 0 ≤ x) (hy : 0 ≤ y) (hxy : x+y=1) :
relativeEntanglementNats ((x : ℂ) • sigma + (y : ℂ) • tau) ≤
(x : EReal) * relativeEntanglementNats sigma + (y : EReal) * 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 finite nonempty types with decidable equality, let be positive semidefinite complex matrices on , each of trace , and let be nonnegative real numbers with . For any bipartite matrix , define , where separable matrices are finite convex combinations of tensor products of positive semidefinite trace-one matrices, and equals if , and otherwise; here , matrix functions use functional calculus, and . Then
in the extended real numbers, with real weights embedded into that number system. The allowed weights include and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.