Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.23 proof — extreme unital qubit channels are unitary

Open
WatrousTQI.extreme_unital_qubit_is_unitary

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

convexitymixed-unitaryquantum-channelsquantum-information

Every extreme point Φ\PhiΦ of the real convex set of unital quantum channels on a qubit is conjugation by a single unitary matrix: one unitary UUU satisfies Φ(X)=UXU†\Phi(X)=UXU^\daggerΦ(X)=UXU† for every complex 2×22\times22×2 matrix XXX. Membership in the extreme-point set includes membership in the channel set, so complete positivity, trace preservation, and unitality are part of the hypothesis, not omitted assumptions.

Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_WatrousTQI_UnitalChannels
set_option autoImplicit false
noncomputable section
open scoped Matrix ComplexConjugate BigOperators
Formal statement
namespace WatrousTQI

theorem extreme_unital_qubit_is_unitary
    (Φ : QAlgorithms.Superop (Fin 2) (Fin 2))
    (h : Φ ∈ (unitalChannels 2).extremePoints ℝ) :
    ∃ U : Matrix.unitaryGroup (Fin 2) ℂ,
      ∀ X : Matrix (Fin 2) (Fin 2) ℂ,
        Φ X = (U : Matrix (Fin 2) (Fin 2) ℂ) * X *
          (U : Matrix (Fin 2) (Fin 2) ℂ)ᴴ := by sorry

end WatrousTQI
Source
John Watrous, The Theory of Quantum Information, Cambridge University Press, 2018, Chapter 4. https://cs.uwaterloo.ca/~watrous/TQI/TQI.pdf; Proof of Theorem 4.23, printed pp.227–228 (PDF pp.235–236), reduction to extreme points and the two Kraus-rank cases.
Read-back

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

For every function Φ:M2(C)→M2(C)\Phi:M_2(\mathbb C)\to M_2(\mathbb C)Φ:M2​(C)→M2​(C), assume that Φ\PhiΦ belongs to the set SSS of unital channels and is an extreme point of SSS over R\mathbb RR, with the following meanings: a function Ψ\PsiΨ belongs to SSS precisely when Ψ(I2)=I2\Psi(I_2)=I_2Ψ(I2​)=I2​ and there exist a natural number mmm and complex 2×22\times22×2 matrices E0,…,Em−1E_0,\ldots,E_{m-1}E0​,…,Em−1​ such that ∑j=0m−1Ej∗Ej=I2\sum_{j=0}^{m-1}E_j^*E_j=I_2∑j=0m−1​Ej∗​Ej​=I2​ and, for every complex 2×22\times22×2 matrix XXX, Ψ(X)=∑j=0m−1EjXEj∗\Psi(X)=\sum_{j=0}^{m-1}E_jXE_j^*Ψ(X)=∑j=0m−1​Ej​XEj∗​; being an extreme point means that Φ∈S\Phi\in SΦ∈S and, for every Ψ,Θ∈S\Psi,\Theta\in SΨ,Θ∈S and all real numbers a,b>0a,b>0a,b>0 with a+b=1a+b=1a+b=1, if Φ=aΨ+bΘ\Phi=a\Psi+b\ThetaΦ=aΨ+bΘ as functions (real scalar multiplication and addition being pointwise), then Ψ=Φ\Psi=\PhiΨ=Φ and Θ=Φ\Theta=\PhiΘ=Φ. Under this assumption there exists a single complex 2×22\times22×2 unitary matrix UUU (so U∗U=UU∗=I2U^*U=UU^*=I_2U∗U=UU∗=I2​) such that, for every complex 2×22\times22×2 matrix XXX, Φ(X)=UXU∗\Phi(X)=UXU^*Φ(X)=UXU∗. Here M2(C)M_2(\mathbb C)M2​(C) is the space of matrices whose rows and columns are indexed by {0,1}\{0,1\}{0,1}, I2I_2I2​ is its identity matrix, and A∗A^*A∗ denotes conjugate transpose. The natural number mmm is allowed to be zero in the defining existential quantifier, with empty sums interpreted as zero, although that choice cannot satisfy ∑jEj∗Ej=I2\sum_jE_j^*E_j=I_2∑j​Ej∗​Ej​=I2​; the universally quantified inputs XXX are arbitrary matrices, without positivity, self-adjointness, or trace restrictions.

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