Theorem 6: comparison with entanglement of creation
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.relativeEntanglement_le_formationAll 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.
Define the creation/formation roof by , over finite ensembles of unit vectors with nonnegative weights summing to one. Then
This compares static functionals; it does not identify a one-copy roof with an asymptotic operational cost.
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 6, PDF p.16, corrected by Eq.(6) and proof (40)–(41): E_R ≤ E_c.
The printed identification of E_c with min S is erroneous; creation is the pure-state roof. -/
theorem relativeEntanglement_le_formation {I J : Type} [Fintype I] [Fintype J]
[DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J]
(sigma : Matrix (I × J) (I × J) ℂ) (hsigma : IsDensityMatrix sigma) :
relativeEntanglementNats sigma ≤ formationNats sigma := 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 and every positive semidefinite matrix on of trace , let , where separable matrices are finite convex combinations of tensor products of positive semidefinite trace-one matrices, and when , and otherwise, using functional calculus, , and . For a matrix on , write and . Then
where the infimum and inequality are in the extended reals. Zero weights are allowed; cannot meet the weight-sum condition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.