Eq. (6) is a completely positive map
ProvedPeresTerno.krausUpdate_completelyPositiveLet be a finite family of complex matrices and let . Then is completely positive: for every and every positive semidefinite matrix on , the matrix is positive semidefinite.
This is the "Kraus maps are completely positive" half of the source's statement that Eq. (6) is the most general completely positive linear map.
import Mathlib import Definitions.Def_PeresTerno_kraus_basics open Matrix open scoped ComplexOrder
namespace PeresTerno
theorem krausUpdate_completelyPositive {d e ι : Type*} [Fintype d] [Fintype e] [Fintype ι]
(A : ι → Matrix e d ℂ) :
IsCompletelyPositive (krausUpdate A) := by
sorry
end PeresTerno
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) - NON-BLIND: same agent that drafted the statements
Non-blind read-back - not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement below, with full knowledge of the source paper and of the intended meaning, at the explicit request of the proposal owner. It was not produced by a blind, independent auditor and must not be mistaken for independent testimony. Reviewers should compare the Lean code against the source themselves.
For finite index types , , and every family , the map is completely positive in the sense of the definition file: for every natural number (including ) and every positive semidefinite complex matrix indexed by , the matrix indexed by with entries
is positive semidefinite. No hypothesis on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.