Proposition: explicit Schmidt-diagonal minimizer
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.pure_minimizerAll 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 an orthonormal Schmidt expansion , with summing to one, put and . The constructed is separable, and
This is the explicit minimizing-state certificate supporting Theorem 3.
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
/-- Proposition and its proof, PDF pp.13–14: explicit Schmidt-diagonal minimizer
certificate, supporting the entropy equality of Theorem 3. -/
theorem pure_minimizer {I J K : Type} [Fintype I] [Fintype J] [Fintype K]
[DecidableEq I] [DecidableEq J] [Nonempty I] [Nonempty J] (s : FiniteSchmidtExpansion I J K) :
IsMinimizer (pureDensity (finiteSchmidtVector s)) (schmidtDiagonal s) ∧
relativeEntropy (pureDensity (finiteSchmidtVector s)) (schmidtDiagonal s) =
(finiteSchmidtEntropyNats s : EReal) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite types, with decidable equality on , and with nonempty. Suppose specifies nonnegative real weights summing to and orthonormal families , . Put
Here is when , and otherwise, where , matrix functions use functional calculus, and . The matrix is separable, meaning a finite convex combination of tensor products of positive semidefinite trace-one matrices; for every separable matrix , ; and
as an equality of extended real numbers. Zero weights are permitted, but an empty cannot support weights summing to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.