Definition 4.2 — random-unitary channels preserve the identity
ProvedWatrousTQI.random_unitary_is_unitalLet and let admit a finite random-unitary decomposition on every complex operator: the real weights lie in , sum to one, and the conjugating matrices are unitary. Then . The representation and probability constraints reuse the published IsRandomUnitary predicate; unitality is a conclusion.
import Mathlib import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P11 set_option autoImplicit false noncomputable section open scoped Matrix ComplexConjugate BigOperators
namespace WatrousTQI
theorem random_unitary_is_unital {d : ℕ} (hd : 0 < d)
(Φ : QAlgorithms.Superop (Fin d) (Fin d))
(h : QAlgorithms.Papers.Independent.Dependency50.P11.IsRandomUnitary Φ) :
Φ (1 : Matrix (Fin d) (Fin d) ℂ) = 1 := by sorry
end WatrousTQI
Read-back
What the Lean code literally says, in plain math · GPT-6 (Codex)
For every natural number with , and every function from the complex matrices to themselves, suppose that there exist a natural number , real numbers indexed by , and complex unitary matrices (so ), such that for every , , and, for every complex matrix , , where the real weights are embedded in the complex numbers and denotes conjugate transpose; then . The dimension is excluded by the hypothesis; the existential quantifier permits syntactically, but the required weight sum would then be , so no such witness satisfies the hypotheses; individual weights may be zero or one. No linearity or channel hypothesis on is assumed separately from the displayed representation.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.