Theorem 1, Eq. (1): partial-transpose Bell-value difference
OpenQAlgorithms.Papers.Independent.Intakethird100.P09.partialTranspose_bell_differenceAll 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. Let rho and sigma have the same positive local dimension d, and fix the same local POVMs for both. Write S_M for the resulting Bell operator and S_M(rho) for its expectation. Then
The coefficients may be signed, and neither state needs to be PPT. This relates a fixed Bell-value difference to distinguishability after transposition.
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 pp.2,6, Theorem 1, Eq.(1): general real Bell coefficients, fixed common POVMs.
Neither state is assumed PPT; the full trace norm is used. -/
theorem partialTranspose_bell_difference (d : ℕ+) (S : BellScenario) (s : BellCoefficients S)
(rho sigma : Op (Fin d × Fin d)) (hrho : IsDensityMatrix rho)
(hsigma : IsDensityMatrix sigma) (M : Measurements S (Fin d) (Fin d)) :
|bellValue s (measuredBox M rho) - bellValue s (measuredBox M sigma)| ≤
bellOperatorNorm (transposeSecond (bellOperator s M)) *
traceNorm (transposeSecond rho - transposeSecond sigma) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P09
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any positive integer, let be finite index sets of specified positive sizes forming a Bell scenario, and let be arbitrary real coefficients. Let be positive semidefinite complex matrices of trace on . For every pair of measurement families on , with every effect positive semidefinite and , , define , , and . If denotes transpose on the second factor, then
Here the first norm is the ambient matrix norm appearing in the definition of bellOperatorNorm, and . There is no sign restriction on the coefficients, and and one-element input or output sets are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.