Lemma 2: unitary Hermitian matrices separate the complex trace pairing
ProvedQAlgorithms.Papers.Independent.Advance50.P40.lemma2_unitary_hermitian_trace_separatesprove2quantum
Let and let be arbitrary. If the complex trace vanishes against every unitary Hermitian matrix of the same size, then
This separates the full complex trace pairing without assuming that is Hermitian.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P40
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Advance50.P40
/-- Lemma 2, PDF p. 3, proof on PDF p. 4. The trace pairing is complex-valued,
and X need not be Hermitian. The quantifier covers every unitary Hermitian A. -/
theorem lemma2_unitary_hermitian_trace_separates {n : ℕ} [NeZero n]
(X : SystemMatrix n)
(htrace : ∀ A : Matrix.unitaryGroup (Fin n) ℂ,
(A : SystemMatrix n).IsHermitian →
Matrix.trace ((A : SystemMatrix n) * X) = 0) :
X = 0 := by sorry
end QAlgorithms.Papers.Independent.Advance50.P40
end
Source
Vanishing quantum discord is necessary and sufficient for completely positive maps, arXiv:0808.0175v2, PDF p. 3, Lemma 2
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number and every complex matrix , if
as a complex number for every unitary matrix that is also Hermitian, then . The matrix itself is not required to be Hermitian.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.