Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§A.4: unitary representations and purifications of the channel state

Proved
QAlgorithms.Papers.Independent.Support50.P41.dilationPurifications

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let Φ\PhiΦ be a complex-linear CPTP map on dimension d≥1d\ge1d≥1, DDD its unnormalized input-first Choi operator, and EEE a nonzero finite environment. Applying any pure-environment unitary representation to normalized ΩRQ\Omega_{RQ}ΩRQ​ produces a unit vector vvv with

Tr⁡E∣v⟩⟨v∣=D/d.\operatorname{Tr}_E|v\rangle\langle v|=D/d.TrE​∣v⟩⟨v∣=D/d.

Conversely, every such normalized purification vvv and every unit initial environment vector η\etaη admit a unitary representation whose output on ΩRQ⊗η\Omega_{RQ}\otimes\etaΩRQ​⊗η is exactly vvv. This supplies both constructions; the full unitary need not be unique on the unused orthogonal complement.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P41

open QAlgorithms

open QAlgorithms.Entanglement (IsCompletelyPositive)

open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)

open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)

open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)

open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)

open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.

local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _

/-- PDF pp.35--36: both constructions between dilations and channel-state purifications, without full-unitary bijectivity. -/
theorem dilationPurifications {d e : ℕ} [NeZero d] [NeZero e]
    (Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
    (hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace) :
    (∀ (U : Matrix.unitaryGroup (Fin d × Fin e) ℂ) (eta : EuclideanSpace ℂ (Fin e)),
      IsState eta → (∀ X, Phi X = dilationChannel U eta X) →
      IsState (dilationChoiVector U eta) ∧
        traceRight (pureDensity (dilationChoiVector U eta)) = ((d : ℂ)⁻¹) • choi Phi) ∧
    (∀ (v : EuclideanSpace ℂ ((Fin d × Fin d) × Fin e)), IsState v →
      traceRight (pureDensity v) = ((d : ℂ)⁻¹) • choi Phi →
      ∀ eta : EuclideanSpace ℂ (Fin e), IsState eta →
        ∃ U : Matrix.unitaryGroup (Fin d × Fin e) ℂ,
          (∀ X, Phi X = dilationChannel U eta X) ∧ dilationChoiVector U eta = v) := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 36, §A.4: unitary representations and purifications of the channel state
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every pair of positive integers d,ed,ed,e and every complex-linear map Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C), assume that Φ\PhiΦ preserves trace on every complex matrix and is completely positive, meaning that applying it to each d×dd\times dd×d block preserves positive semidefiniteness for every finite ancillary dimension, including zero. Define JΦ((i,j),(i′,j′))=Φ(Eii′)jj′J_\Phi((i,j),(i',j'))=\Phi(E_{ii'})_{jj'}JΦ​((i,j),(i′,j′))=Φ(Eii′​)jj′​. For a unitary matrix UUU on Cd⊗Ce\mathbb C^d\otimes\mathbb C^eCd⊗Ce and a vector η∈Ce\eta\in\mathbb C^eη∈Ce, define

DU,η(X)=Tr⁡e ⁣[U(X⊗ηη†)U†],wU,η(i,j,a)=1d∑b=0e−1U(j,a),(i,b)ηb,\mathcal D_{U,\eta}(X)=\operatorname{Tr}_e\!\left[U(X\otimes\eta\eta^\dagger)U^\dagger\right], \qquad w_{U,\eta}(i,j,a)=\frac1{\sqrt d}\sum_{b=0}^{e-1}U_{(j,a),(i,b)}\eta_b,DU,η​(X)=Tre​[U(X⊗ηη†)U†],wU,η​(i,j,a)=d​1​b=0∑e−1​U(j,a),(i,b)​ηb​,

where (Tr⁡eY)ij=∑aY(i,a),(j,a)(\operatorname{Tr}_eY)_{ij}=\sum_aY_{(i,a),(j,a)}(Tre​Y)ij​=∑a​Y(i,a),(j,a)​ and (vv†)pq=vpvq‾(vv^\dagger)_{pq}=v_p\overline{v_q}(vv†)pq​=vp​vq​​. Two assertions hold. First, for every such U,ηU,\etaU,η, if ∥η∥=1\|\eta\|=1∥η∥=1 and Φ(X)=DU,η(X)\Phi(X)=\mathcal D_{U,\eta}(X)Φ(X)=DU,η​(X) for every complex matrix XXX, then ∥wU,η∥=1\|w_{U,\eta}\|=1∥wU,η​∥=1 and

∑a=0e−1wU,η(i,j,a) wU,η(i′,j′,a)‾=1dJΦ((i,j),(i′,j′)).\sum_{a=0}^{e-1}w_{U,\eta}(i,j,a)\, \overline{w_{U,\eta}(i',j',a)} =\frac1dJ_\Phi((i,j),(i',j')).a=0∑e−1​wU,η​(i,j,a)wU,η​(i′,j′,a)​=d1​JΦ​((i,j),(i′,j′)).

Second, for every vector v∈C(d×d)×ev\in\mathbb C^{(d\times d)\times e}v∈C(d×d)×e of norm one satisfying this same marginal identity with vvv in place of wU,ηw_{U,\eta}wU,η​, and for every η∈Ce\eta\in\mathbb C^eη∈Ce of norm one, there exists a unitary UUU such that Φ(X)=DU,η(X)\Phi(X)=\mathcal D_{U,\eta}(X)Φ(X)=DU,η​(X) for every complex matrix XXX and wU,η=vw_{U,\eta}=vwU,η​=v exactly. This second assertion is conditional on the existence of the stated vector vvv in the specified environment dimension eee.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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