Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A summed commutator forces diagonal relative unitaries

Open
QAlgorithms.Papers.Independent.Intakethird100.P96.diagonal_relative_unitaries

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥2d\ge2d≥2 and let U1,…,UdU_1,\ldots,U_dU1​,…,Ud​ and V1,…,VdV_1,\ldots,V_dV1​,…,Vd​ be unitary matrices on Cd\mathbb C^dCd. In its fixed standard orthonormal basis write Pμ=∣μ⟩⟨μ∣P_\mu=|\mu\rangle\langle\mu|Pμ​=∣μ⟩⟨μ∣. Suppose that for every pair A,B∈Md(C)A,B\in M_d(\mathbb C)A,B∈Md​(C),

∑μ,ν[Uμ∗AUμ⊗Pμ,  Pν⊗Vν∗BVν]=0.\sum_{\mu,\nu}[U_\mu^*AU_\mu\otimes P_\mu,\;P_\nu\otimes V_\nu^*BV_\nu]=0.μ,ν∑​[Uμ∗​AUμ​⊗Pμ​,Pν​⊗Vν∗​BVν​]=0.

There are unitary matrices U,VU,VU,V, chosen independently of the family index, such that

U∗Uμ and V∗Vμ are diagonal for every μ.U^*U_\mu\text{ and }V^*V_\mu\text{ are diagonal for every }\mu.U∗Uμ​ and V∗Vμ​ are diagonal for every μ.

The condition is on the entire sum of commutators. The conclusion provides a common reference unitary for each family.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P96
Formal statement
noncomputable section

open scoped TensorProduct Kronecker BigOperators

namespace QAlgorithms.Papers.Independent.Intakethird100.P96

open QAlgorithms.Papers.Independent.Information100.P26 (Mat)

/-- Lemma 9, PDF p.11. The hypothesis is the sum of commutators in (30). -/
theorem diagonal_relative_unitaries (d : ℕ) (hd : 2 ≤ d)
    (U V : Fin d → Matrix.unitaryGroup (Fin d) ℂ)
    (hcomm : ∀ A B : Mat d,
      (∑ i : Fin d, ∑ j : Fin d,
        (((star (U i : Mat d) * A * (U i : Mat d)) ⊗ₖ coordinateProjection i) *
            (coordinateProjection j ⊗ₖ (star (V j : Mat d) * B * (V j : Mat d))) -
          (coordinateProjection j ⊗ₖ (star (V j : Mat d) * B * (V j : Mat d))) *
            ((star (U i : Mat d) * A * (U i : Mat d)) ⊗ₖ coordinateProjection i))) = 0) :
    ∃ Ubase Vbase : Matrix.unitaryGroup (Fin d) ℂ,
      ∀ k : Fin d, ∀ i j : Fin d, i ≠ j →
        (star (Ubase : Mat d) * (U k : Mat d)) i j = 0 ∧
        (star (Vbase : Mat d) * (V k : Mat d)) i j = 0 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P96

end
Source
Reversible quantum cellular automata, arXiv:quant-ph/0405174v1, PDF p. 11, Lemma 9: diagonal relative unitaries
Read-back

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

For every natural number d≥2d\ge2d≥2, let (Ui)i=0d−1(U_i)_{i=0}^{d-1}(Ui​)i=0d−1​ and (Vi)i=0d−1(V_i)_{i=0}^{d-1}(Vi​)i=0d−1​ be families of unitary complex d×dd\times dd×d matrices. Write EiE_iEi​ for the matrix with a single 111 in diagonal position (i,i)(i,i)(i,i) and zeros elsewhere, ∗^{*}∗ for conjugate transpose, and ⊗\otimes⊗ for the matrix Kronecker product. Suppose that for every pair of complex d×dd\times dd×d matrices A,BA,BA,B,

∑i=0d−1∑j=0d−1[(Ui∗AUi⊗Ei)(Ej⊗Vj∗BVj)−(Ej⊗Vj∗BVj)(Ui∗AUi⊗Ei)]=0.\sum_{i=0}^{d-1}\sum_{j=0}^{d-1} \left[ (U_i^{*}AU_i\otimes E_i)(E_j\otimes V_j^{*}BV_j) -(E_j\otimes V_j^{*}BV_j)(U_i^{*}AU_i\otimes E_i) \right]=0.i=0∑d−1​j=0∑d−1​[(Ui∗​AUi​⊗Ei​)(Ej​⊗Vj∗​BVj​)−(Ej​⊗Vj∗​BVj​)(Ui∗​AUi​⊗Ei​)]=0.

Then there exist unitary complex d×dd\times dd×d matrices Ubase,VbaseU_{\mathrm{base}},V_{\mathrm{base}}Ubase​,Vbase​ such that for every k∈{0,…,d−1}k\in\{0,\ldots,d-1\}k∈{0,…,d−1} and every distinct pair i,ji,ji,j of indices, both (Ubase∗Uk)ij=0(U_{\mathrm{base}}^{*}U_k)_{ij}=0(Ubase∗​Uk​)ij​=0 and (Vbase∗Vk)ij=0(V_{\mathrm{base}}^{*}V_k)_{ij}=0(Vbase∗​Vk​)ij​=0; thus all these relative matrices are diagonal.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me