Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unital channels as a real convex set

Definition
WatrousTQI_UnitalChannels

by Mrnaiq · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

convexityquantum-channelsquantum-information

For each natural dimension ddd, this is the set of all maps on complex d×dd\times dd×d matrices that are trace-preserving completely positive quantum channels and satisfy Φ(Id)=Id\Phi(I_d)=I_dΦ(Id​)=Id​. The published channel predicate means an arbitrary finite normalized Kraus representation, not a random-unitary representation. The set is represented inside the space of all matrix-valued functions; convexity and finite-dimensionality of its channel span are separate theorem targets. The definition is total also at d=0d=0d=0; all general-dimension theorem targets explicitly require d>0d>0d>0, and the main goal uses d=2d=2d=2.

Definition code
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Channel
set_option autoImplicit false
noncomputable section
open scoped Matrix ComplexConjugate BigOperators

namespace WatrousTQI

def unitalChannels (d : ℕ) : Set (QAlgorithms.Superop (Fin d) (Fin d)) :=
  {Φ | QAlgorithms.IsChannel Φ ∧ Φ (1 : Matrix (Fin d) (Fin d) ℂ) = 1}

end WatrousTQI
Source
John Watrous, The Theory of Quantum Information, Cambridge University Press, 2018, Chapter 4. https://cs.uwaterloo.ca/~watrous/TQI/TQI.pdf; §4.2.1, proof of Theorem 4.23, equation (4.158), printed p.227 (PDF p.235).
Read-back

What the Lean code literally says, in plain math · GPT-6 (Codex)

For every natural number ddd, including d=0d=0d=0, this definition gives a set of functions Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C), where Md(C)M_d(\mathbb C)Md​(C) consists of complex matrices whose rows and columns are indexed by {0,…,d−1}\{0,\ldots,d-1\}{0,…,d−1}. A function belongs to this set exactly when there exist a natural number mmm and matrices Ej∈Md(C)E_j\in M_d(\mathbb C)Ej​∈Md​(C) for every j∈{0,…,m−1}j\in\{0,\ldots,m-1\}j∈{0,…,m−1} such that ∑j=0m−1Ej∗Ej=Id\sum_{j=0}^{m-1}E_j^*E_j=I_d∑j=0m−1​Ej∗​Ej​=Id​, and for every complex matrix ρ∈Md(C)\rho\in M_d(\mathbb C)ρ∈Md​(C) one has Φ(ρ)=∑j=0m−1EjρEj∗\Phi(\rho)=\sum_{j=0}^{m-1}E_j\rho E_j^*Φ(ρ)=∑j=0m−1​Ej​ρEj∗​, and additionally Φ(Id)=Id\Phi(I_d)=I_dΦ(Id​)=Id​. Here Ej∗E_j^*Ej∗​ denotes the conjugate transpose, matrix products and sums have their usual meanings, and IdI_dId​ is the identity matrix. The universal quantifier over ρ\rhoρ ranges over all complex matrices without positivity or trace restrictions; no linearity assumption is separately imposed on the initially quantified function. The integer mmm may be zero, in which case both sums are zero matrices: the normalization then cannot hold when d>0d>0d>0, whereas when d=0d=0d=0 there is only one empty matrix, its identity equals its zero matrix, and the unique function on this one-element matrix space satisfies the conditions with m=0m=0m=0.

Human review
  • Endorsed by Shuze Chen · Nov 12, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Mrnaiq · Nov 12, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me