Proposition 1: a zero bath diagonal annihilates its connected off-diagonal pair
ProvedQAlgorithms.Papers.Independent.Advance50.P40.proposition1_zero_diagonalFix positive integers and fixed orthonormal system and bath coordinates. Write for the complex system matrices, , and let be fixed bath operators with and, for each , either or . Define
Here is a joint unitary and the bath is the second tensor factor. A scalar matrix is admissible when it is Hermitian, , and is a positive semidefinite trace-one matrix. Zero bath operators annihilate their corresponding matrix units on every input.
Assume that the same fixed family has the following property: for every joint unitary , the map is completely positive on all system matrices. Fix an admissible ; this retains the initial-state setting of the enclosing necessity proof. Complete positivity here does not require trace preservation. For distinct system indices ,
This is the zero-diagonal restriction used to analyze the coefficient blocks in the CP necessity proof.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P40
noncomputable section
namespace QAlgorithms.Papers.Independent.Advance50.P40
/-- Proposition 1, PDF p. 3, in the all-unitary CP necessity proof of Lemma 1.
The scalar input witnesses the standing SL density-state setting. -/
theorem proposition1_zero_diagonal {n m : ℕ} [NeZero n] [NeZero m]
(phi : BathFamily n m) (hphi : IsSLFamily phi)
(R : SystemMatrix n) (hR : IsSLAdmissibleInput phi R) (hcp : AllUnitaryCP phi)
(k l : Fin n) (hkl : k ≠ l) (hzero : phi k k = 0 ∨ phi l l = 0) :
phi k l = 0 ∧ phi l k = 0 := by sorry
end QAlgorithms.Papers.Independent.Advance50.P40
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers , let be complex matrices satisfying or for every , and . Define
Let be a Hermitian complex matrix with such that is positive semidefinite with trace . Assume also that for every unitary joint matrix , there exists a complex-linear map on complex matrices satisfying for every , and satisfying complete positivity in the following explicit sense: for every natural number and every positive semidefinite matrix indexed by pairs with , , the matrix with entries
is positive semidefinite; this includes . For any distinct indices , if or , then both and . The distinct-index hypothesis cannot hold when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.