Example 1: Bell plus orthogonal product
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.example_oneAll 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 , let and . Put and
Then is a separable minimizer, and
The endpoints give zero and ; no uniqueness is asserted.
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
/-- Example 1, PDF p.23, Eqs.(54)–(56): includes the constructed optimizer and both endpoints. -/
theorem example_one (t : ℝ) (ht : t ∈ Set.Icc 0 1) :
IsMinimizer (exampleOneInput t) (exampleOneMinimum t) ∧
relativeEntanglementNats (exampleOneInput t) =
(((t-2)*Real.log (1-t/2) + (1-t)*Real.log (1-t) : ℝ) : 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
For every real , use the ordered basis of the two Boolean registers and define
Define when , and otherwise, where and matrix functions use functional calculus. Then is separable—a finite convex combination of tensor products of positive semidefinite trace-one matrices—and for every separable . Moreover,
as an extended-real equality. The logarithms are natural, the total-function convention is , and both endpoints are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.