Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section I: unitary invariance from metric and chaining

Proved
QAlgorithms.Papers.Independent.Advance50.P17.unitaryInvariance

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let Δ\DeltaΔ be a chaining family of metrics on finite-dimensional CPTP maps. Let E,F:I→J\mathcal E,\mathcal F:I\to JE,F:I→J be CPTP, and let UUU and VVV be unitaries on JJJ and III, respectively. Writing U\mathcal UU and V\mathcal VV for their conjugation channels,

Δ(U∘E∘V,U∘F∘V)=Δ(E,F).\Delta(\mathcal U\circ\mathcal E\circ\mathcal V,\mathcal U\circ\mathcal F\circ\mathcal V)=\Delta(\mathcal E,\mathcal F).Δ(U∘E∘V,U∘F∘V)=Δ(E,F).

The statement applies to arbitrary positive finite input and output dimensions.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P17
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped Matrix ComplexConjugate Topology

namespace QAlgorithms.Papers.Independent.Advance50.P17

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

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

open QAlgorithms.Papers.Independent.Information100.P75 (hermitianReal)

variable {I J K : Type} [Fintype I] [Fintype J] [Fintype K]
  [DecidableEq I] [DecidableEq J] [DecidableEq K]
  [Nonempty I] [Nonempty J] [Nonempty K]

/-- Section I, PDF p.2: unitary pre- and post-processing preserve every chaining process metric. -/
theorem unitaryInvariance (delta : ProcessDistance) (hm : ProcessMetrics delta)
    (hc : ProcessChaining delta) (E F : FiniteProcess I J)
    (U : Matrix.unitaryGroup J ℂ) (V : Matrix.unitaryGroup I ℂ) :
    delta (conjSuperop (U : Matrix J J ℂ) ∘ E.val ∘ conjSuperop (V : Matrix I I ℂ))
      (conjSuperop (U : Matrix J J ℂ) ∘ F.val ∘ conjSuperop (V : Matrix I I ℂ)) =
        delta E.val F.val := by sorry

end QAlgorithms.Papers.Independent.Advance50.P17

end
Source
Distance measures to compare real and ideal quantum processes, arXiv:quant-ph/0408063v2, PDF p. 2, Section I: unitary invariance from metric and chaining
Read-back

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

Let I,JI,JI,J be finite nonempty types with decidable equality. Let δ\deltaδ assign a real number to every pair of maps between complex matrix spaces of any finite types with decidable equality. Assume that, on channels between every pair of finite nonempty types, δ\deltaδ is nonnegative, vanishes exactly on equal channels, is symmetric, and satisfies the triangle inequality; also assume that for all composable channels E1,F1,E2,F2E_1,F_1,E_2,F_2E1​,F1​,E2​,F2​, δ(E2∘E1,F2∘F1)≤δ(E1,F1)+δ(E2,F2)\delta(E_2\circ E_1,F_2\circ F_1)\leq\delta(E_1,F_1)+\delta(E_2,F_2)δ(E2​∘E1​,F2​∘F1​)≤δ(E1​,F1​)+δ(E2​,F2​). Here a channel EEE means a map admitting a finite representation E(X)=∑jKjXKj†E(X)=\sum_j K_jXK_j^\daggerE(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=1\sum_jK_j^\dagger K_j=1∑j​Kj†​Kj​=1. For any channels E,FE,FE,F from matrices indexed by III to matrices indexed by JJJ, and any unitary matrices UUU on JJJ and VVV on III, writing CW(X)=WXW†\mathcal C_W(X)=WXW^\daggerCW​(X)=WXW†, one has

δ(CU∘E∘CV,CU∘F∘CV)=δ(E,F).\delta(\mathcal C_U\circ E\circ\mathcal C_V,\mathcal C_U\circ F\circ\mathcal C_V)=\delta(E,F).δ(CU​∘E∘CV​,CU​∘F∘CV​)=δ(E,F).
Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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