Unnumbered: matrix local minima are global
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.local_minimum_globalAll 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.
Fix a density matrix and a separable state with finite . If is a local minimum of within the separable matrix domain in its finite-dimensional topology, then
This is the convex-matrix-domain minimum principle for the extended support-aware objective.
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.21: a finite local minimum in the convex MATRIX domain is global.
No stationarity or local minimality in angular coordinates is substituted. -/
theorem local_minimum_global {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)
(hrho : IsSeparableDensity rho) (hfinite : relativeEntropy sigma rho ≠ ⊤)
(hlocal : IsLocalMinOn (relativeEntropy sigma)
{tau : Matrix (I × J) (I × J) ℂ | IsSeparableDensity tau} rho) :
IsMinimizer sigma 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 matrices on , with positive semidefinite and of trace , and with separable, meaning a finite convex combination of tensor products of positive semidefinite trace-one matrices. Define if , and otherwise, using functional calculus, , and . Suppose , and suppose is a local minimum of on the separable matrices: there is a neighborhood of in the matrix topology on which every separable satisfies . Then is a global minimizer on that set:
Both local and global minimality use non-strict inequalities.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.