Unnumbered: strict Bell-diagonal creation comparison and Fig.2
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.bell_diagonal_strict_comparisonAll 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 sum to one and let . Then
When every , both functionals vanish; when some , both equal . This retains exactly the equality exceptions in the p.33 strict static comparison.
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 pp.16,33 and Fig.2 pp.42,44: strict creation comparison for mixed entangled
Bell-diagonal states; equality on the separable regime and pure Bell endpoints. -/
theorem bell_diagonal_strict_comparison (p : Fin 4 → ℝ)
(hp : ∀ i, 0 ≤ p i) (htotal : ∑ i, p i = 1) :
((∃ i, 1/2 < p i ∧ p i < 1) →
relativeEntanglementNats (bellDiagonal p) < formationNats (bellDiagonal p)) ∧
((∀ i, p i ≤ 1/2) →
relativeEntanglementNats (bellDiagonal p) = 0 ∧ formationNats (bellDiagonal p) = 0) ∧
((∃ i, p i = 1) →
relativeEntanglementNats (bellDiagonal p) = (Real.log 2 : EReal) ∧
formationNats (bellDiagonal p) = (Real.log 2 : 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 four nonnegative real numbers with , let , where . Define as the extended-real infimum over separable density matrices of when , assigning otherwise; separable density matrices are finite convex combinations of products of positive semidefinite trace-one matrices. Define as the extended-real infimum of over all finite decompositions with , , and , where . All logarithms are natural and use in functional calculus. The assertion consists of three implications: if some satisfies , then ; if every , then ; and if some , then , with these real constants embedded into the extended reals.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.