Corollary 3, Eq. (17): minimum of two REE bounds
OpenQAlgorithms.Papers.Independent.Intakethird100.P09.ppt_minimum_ree_boundAll states are normalized finite-dimensional bipartite density matrices. Gamma denotes transposition of Bob in the fixed product basis. The trace norm is the full trace norm. For a finite Bell expression S with real coefficients, C(S) and Q(S) are its largest signed classical value and its supremal signed quantum value over arbitrary finite local dimensions; Q_S(rho) optimizes complete local POVMs on the fixed state.
The quantities R, T^infinity and R_H optimize arbitrary finite Bell scenarios and LOCC preprocessing of independent copies, using limsup per positive copy number. Input laws are arbitrary joint laws. T^infinity takes its innermost infimum over a one-copy separable sigma, comparing the same channel and the same measurements on rho^n and sigma^n. R_H counts the successful local-filter branch with its probability, after normalizing that branch; a zero-probability branch scores zero. E_r is the unregularized relative entropy of entanglement. All relative entropies and logarithms use bits and retain infinity on support failure. If rho is PPT, then
Both entanglement quantities are computed from the same state. This combines the two relative-entropy bounds.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P09
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P09
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
open Filter
open QAlgorithms.Entanglement (IsSeparableDensity)
open QAlgorithms.Papers.Independent.Dependency50.P24
(transposeSecond partyCut xForm swapPrivate hidingOne hidingTwo)
open QAlgorithms.Papers.Independent.Dependency50.P42 (dimensionedPower)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)
open QAlgorithms.Papers.Independent.Advance50.P47 (Box)
open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntanglement)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.4, Corollary 3, Eq.(17): both REEs are of the same PPT state and its Bob transpose. -/
theorem ppt_minimum_ree_bound (a b : ℕ+) (rho : Op (Fin a × Fin b))
(hrho : IsDensityMatrix rho) (hppt : (transposeSecond rho).PosSemidef) :
asymptoticR false rho ≤ min (relativeEntanglement rho)
(relativeEntanglement (transposeSecond rho)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive integers and every positive semidefinite trace- matrix on whose second-party transpose , defined by , is positive semidefinite,
Here in , where is the supremum over Bell experiments on , then over all nonnegative input distributions summing to , of the infimum over finite local boxes of . A Bell experiment applies a map in the ambient topological closure of finite LOCC maps, with positive finite local output dimensions, followed by local positive semidefinite measurement effects summing to the identity for each input of a finite scenario with positive input and output sizes; its probabilities are . Finite LOCC maps are obtained from the identity by finite recursive local Kraus measurements satisfying , branch-dependent continuation maps, and summation of branch outputs. A finite local box has the form , with nonnegative weights summing to . The classical divergence is when a positive numerator probability has zero denominator; otherwise it is the nonnegative truncation of . Tensor powers multiply corresponding entries across the copies and are relabeled by finite index sets. The quantity is the infimum of over all finite convex combinations of products of local positive semidefinite trace- matrices. This divergence is unless both arguments are density matrices and ; otherwise it equals , with matrix functions defined by functional calculus and the real logarithm assigned value at zero. The statement includes or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.