Theorem 4: nearest state persists along a segment
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.minimum_segmentAll 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 be a density matrix and let a separable minimize over separable states. For every , put . Then
The same minimizer persists on the entire closed segment, including both endpoints.
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 4, PDF p.15: the same closest state persists on the closed segment.
The theorem sentence fixes (1-x)sigma+x rho; Eq.(37) interchanges the weights. -/
theorem minimum_segment {I J : Type} [Fintype I] [Fintype J]
[DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J]
(sigma rho : Matrix (I × J) (I × J) ℂ) (hsigma : IsDensityMatrix sigma)
(hmin : IsMinimizer sigma rho) (x : ℝ) (hx : x ∈ Set.Icc 0 1) :
IsMinimizer (((1-x : ℝ) : ℂ) • sigma + (x : ℂ) • rho) rho := 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 complex matrices on , with positive semidefinite and of trace . Define if , and otherwise, using functional calculus, , and . Assume that is separable—a finite convex combination of tensor products of positive semidefinite trace-one matrices—and that for every separable . Then, for every real , is also a separable minimizer for : for every separable ,
Both endpoints are included, and no finiteness hypothesis on the original minimum is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.