Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§A.4: environment-unitary freedom of dilations

Proved
QAlgorithms.Papers.Independent.Support50.P41.dilationEnvironmentFreedom

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

prove2quantum

Suppose U,ηU,\etaU,η and V,ζV,\zetaV,ζ are two pure-environment unitary representations of the same channel on a nonzero finite-dimensional system, using the same nonzero finite environment. Both initial environment vectors are unit vectors. Then there exists a single unitary WWW on that environment such that, for every system vector vvv,

V(v⊗ζ)=(I⊗W)U(v⊗η).V(v\otimes\zeta)=(I\otimes W)U(v\otimes\eta).V(v⊗ζ)=(I⊗W)U(v⊗η).

This describes the freedom on the used input subspace. Representations with different environment sizes can first be padded to a common size.

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 p.36: common-environment dilations differ by a post-interaction environment unitary on the used input subspace. -/
theorem dilationEnvironmentFreedom {d e : ℕ} [NeZero d] [NeZero e]
    (U V : Matrix.unitaryGroup (Fin d × Fin e) ℂ)
    (eta zeta : EuclideanSpace ℂ (Fin e)) (heta : IsState eta) (hzeta : IsState zeta)
    (hsame : ∀ X, dilationChannel U eta X = dilationChannel V zeta X) :
    ∃ W : Matrix.unitaryGroup (Fin e) ℂ,
      ∀ v : EuclideanSpace ℂ (Fin d),
        act (V : Matrix (Fin d × Fin e) (Fin d × Fin e) ℂ)
          (WithLp.toLp 2 fun p => v p.1 * zeta p.2) =
        act (Matrix.kronecker (1 : Matrix (Fin d) (Fin d) ℂ)
          (W : Matrix (Fin e) (Fin e) ℂ))
          (act (U : Matrix (Fin d × Fin e) (Fin d × Fin e) ℂ)
            (WithLp.toLp 2 fun p => v p.1 * eta p.2)) := 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: environment-unitary freedom of dilations
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, every two unitary matrices U,VU,VU,V on Cd⊗Ce\mathbb C^d\otimes\mathbb C^eCd⊗Ce, and every two vectors η,ζ∈Ce\eta,\zeta\in\mathbb C^eη,ζ∈Ce with ∥η∥=∥ζ∥=1\|\eta\|=\|\zeta\|=1∥η∥=∥ζ∥=1, suppose that, for every complex matrix X∈Md(C)X\in M_d(\mathbb C)X∈Md​(C),

Tr⁡e ⁣[U(X⊗ηη†)U†]=Tr⁡e ⁣[V(X⊗ζζ†)V†],\operatorname{Tr}_e\!\left[U(X\otimes\eta\eta^\dagger)U^\dagger\right] = \operatorname{Tr}_e\!\left[V(X\otimes\zeta\zeta^\dagger)V^\dagger\right],Tre​[U(X⊗ηη†)U†]=Tre​[V(X⊗ζζ†)V†],

where (Tr⁡eY)ij=∑a=0e−1Y(i,a),(j,a)(\operatorname{Tr}_eY)_{ij}=\sum_{a=0}^{e-1}Y_{(i,a),(j,a)}(Tre​Y)ij​=∑a=0e−1​Y(i,a),(j,a)​ and (ηη†)ab=ηaηb‾(\eta\eta^\dagger)_{ab}=\eta_a\overline{\eta_b}(ηη†)ab​=ηa​ηb​​. Then there exists a unitary matrix WWW on Ce\mathbb C^eCe such that, for every vector v∈Cdv\in\mathbb C^dv∈Cd, including zero and vectors of arbitrary norm,

V(v⊗ζ)=(Id⊗W) U(v⊗η),(v⊗η)(i,a)=viηa.V(v\otimes\zeta)=(I_d\otimes W)\,U(v\otimes\eta), \qquad (v\otimes\eta)_{(i,a)}=v_i\eta_a.V(v⊗ζ)=(Id​⊗W)U(v⊗η),(v⊗η)(i,a)​=vi​ηa​.

The same WWW works for all vvv; the conclusion specifies these actions on the displayed input subspaces and does not assert equality of the full matrices VVV and (Id⊗W)U(I_d\otimes W)U(Id​⊗W)U.

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