Lemma 13
ProvedQAlgorithms.Papers.Independent.Support50.P21.relativeEntanglement_le_maxAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
Let be a bipartite density operator, and let contain all separable density operators on the same space. With minima over that entire set,
The relative-entropy minimum is attained. This is the upper-bound clause advertised in the abstract; neither optimization is restricted to product states.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P21
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.
open QAlgorithms.Papers.Independent.Claimed50.P33
(FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
section Statements
variable [Nonempty I] [Nonempty J]
/-- Lemma 13, PDF p.7, (38)–(39): all separable comparison states.
The unsubscripted D in the first line of (38) is the surrounding Dmax. -/
theorem relativeEntanglement_le_max (rho : Mat (I × J)) (hrho : IsDensityMatrix rho) :
eRelative rho ≤ eMax rho ∧
∃ sigma : Mat (I × J), IsSeparableDensity sigma ∧ unnormalizedRelativeBits rho sigma = eRelative rho := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index types with decidable equality, and let be a positive semidefinite complex matrix on with trace . Call a matrix separable if it has a finite decomposition , where , , and every is positive semidefinite with trace . Define the extended-real quantities
where matrix logarithms use functional calculus, with scalar logarithm assigned value at , and the latter infimum is taken in the extended reals. Then
and there exists a separable density matrix attaining the infimum on the left. No uniqueness of this is asserted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.