Eq. (2) — causal inequality for causally separable processes
ProvedOCB2012.pSucc_le_of_causallySeparableThroughout, (Alice's input and output) and (Bob's) are finite-dimensional systems; operators on are complex matrices in that tensor order. A CJ matrix of a CPTP map satisfies and . Let be causally separable (Eq. (6)): with , where and are process matrices. Let Alice use an instrument for each input bit , and Bob an instrument for each pair of input bits (positive semidefinite CJ matrices whose outcome sums are CPTP). With independent and uniform and , the success probability of Eq. (1) obeys
Dimensions are arbitrary.
Formalization Note The source derives Eq. (2) in an event-based setting (Appendix A) and states on p. 4 that causally separable processes cannot violate it; this item is that process-matrix form. Probabilities are real parts of traces.
import Mathlib import Definitions.Def_PeresTerno_kraus_basics import Definitions.Def_OCB2012_defs open Matrix open scoped Kronecker ComplexOrder
namespace OCB2012
theorem pSucc_le_of_causallySeparable {a1 a2 b1 b2 : Type*} [Fintype a1] [Fintype a2]
[Fintype b1] [Fintype b2] [DecidableEq a1] [DecidableEq a2] [DecidableEq b1] [DecidableEq b2]
(W : Matrix ((a1 × a2) × (b1 × b2)) ((a1 × a2) × (b1 × b2)) ℂ)
(hW : IsCausallySeparable W)
(MA : Bool → Bool → Matrix (a1 × a2) (a1 × a2) ℂ) (hMA : IsAliceInstrument MA)
(MB : Bool → Bool → Bool → Matrix (b1 × b2) (b1 × b2) ℂ) (hMB : IsBobInstrument MB) :
pSucc W MA MB ≤ 3 / 4 := by sorry
end OCB2012Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let be arbitrary finite types, each with decidable equality. They may be of any size, including empty, and they need not be qubits. Write (Alice's index set, input output), (Bob's), and . All matrices below have complex entries. "Positive semidefinite" (PSD) means Mathlib's notion: Hermitian, and (as a real number) for every complex vector . Bits are booleans, with and . The theorem quantifies universally over:
- a complex matrix ;
- a family indexed by two bits (first index is the "guess", second index is the "input");
- a family indexed by three bits (first index is the "guess");
subject to the three hypotheses below.
Auxiliary notions (unfolded).
- Partial trace over the second factor: for , .
- CPTP Choi matrix: is called CPTP-CJ if is PSD and . Concretely, for Alice this means , and for Bob it means .
- Probability: , where for and .
- Process matrix: is a process matrix if is PSD and (exactly, as a complex number) for every pair with CPTP-CJ and CPTP-CJ.
- No signalling form: there exists some matrix indexed by such that
which is . No condition is placed on beyond this equation.
- No signalling form: there exists some matrix indexed by such that
which is .
Hypotheses.
- Causal separability of . There exist a real with and matrices such that is a process matrix in no-signalling- form, is a process matrix in no-signalling- form, and
- Alice's instrument. Every is PSD, and for each the sum is CPTP-CJ.
- Bob's instrument. Every is PSD, and for each the sum is CPTP-CJ.
Conclusion. The real number
satisfies
In the first sum, Alice's guess index is set equal to , Bob's last bit is , and Bob's guess is summed over. In the second sum, Bob's guess index is set equal to , , and Alice's guess is summed over. Each trace is complex, and only its real part enters the sum. No hypothesis directly asserts that the traces are real; this follows only through the PSD assumptions.
Edge cases.
-
The dimensions are completely unrestricted. If any of the following holds, the hypotheses cannot all be satisfied, so the statement is vacuously true:
- is nonempty and is empty. Then no Alice-side matrix is CPTP-CJ, so Hypothesis 2 fails.
- is nonempty and is empty. Then Hypothesis 3 fails for the same reason.
- or is empty (and the previous two cases do not apply). Then is empty, so every trace equals , while CPTP-CJ pairs do exist. So no process matrix exists and Hypothesis 1 fails.
In all these cases would in any event be or the hypotheses would be contradictory.
-
The process-matrix condition quantifies over all CPTP-CJ pairs, not only over the given instruments.
-
and are allowed. In those cases is itself a single one-way process matrix.
-
The theorem imports the Peres–Terno Kraus/CP definitions, but none of them appears in the statement.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.