Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One-call commutant has four sector generators

Open
QAlgorithms.Papers.Independent.Support50.P24.oneCallCommutant

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

prove2quantum

Let d≥1d\ge1d≥1 and let CCC be any complex matrix on four ddd-dimensional wires, grouped into two pairs. Put Π+=(I+S)/2\Pi_+=(I+S)/2Π+​=(I+S)/2 and Π−=(I−S)/2\Pi_-=(I-S)/2Π−​=(I−S)/2, where SSS swaps the two factors of a pair. Then

[C,V⊗2⊗W⊗2]=0for all V,W∈SU(d)⟺C=∑μ,ν∈{+,−}cμνΠμ⊗Πν[C,V^{\otimes2}\otimes W^{\otimes2}]=0\quad\text{for all }V,W\in\mathrm{SU}(d) \quad\Longleftrightarrow\quad C=\sum_{\mu,\nu\in\{+,-\}}c_{\mu\nu}\Pi_\mu\otimes\Pi_\nu[C,V⊗2⊗W⊗2]=0for all V,W∈SU(d)⟺C=μ,ν∈{+,−}∑​cμν​Πμ​⊗Πν​

for some complex coefficients cμνc_{\mu\nu}cμν​. The two group actions are independent. No positivity or causal normalization is imposed on CCC. At d=1d=1d=1 the antisymmetric sector vanishes, so the coefficients need not be unique. This characterizes the invariant search space in the one-call example.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P24
Formal statement
noncomputable section

open QAlgorithms MeasureTheory

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise

namespace QAlgorithms.Papers.Independent.Support50.P24

attribute [local instance] Classical.decEq Classical.propDecidable

attribute [local instance] QAlgorithms.Papers.Independent.Support50.P24.groupedContinuousENorm

/-- PDF p.3, Eq.(12): arbitrary matrices in the independent tensor-square commutant
are precisely linear combinations of the four physical sectors. At d=1 no uniqueness is claimed. -/
theorem oneCallCommutant (d : ℕ) (hd : 0 < d)
    (C : QAlgorithms.Papers.Independent.Next46.P24.CombMatrix d) :
    QAlgorithms.Papers.Independent.Next46.P24.InversionCovariant C ↔
      ∃ coefficient : Bool → Bool → ℂ,
        C = ∑ b : Bool, ∑ c : Bool, coefficient b c •
          QAlgorithms.Papers.Independent.Next46.P24.inversionSector d b c := by sorry

end QAlgorithms.Papers.Independent.Support50.P24

end
Source
Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly, arXiv:2209.02907v5, PDF p. 3, Unnumbered example, Eq.(12): one-call four-sector reduction
Read-back

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

For every natural number d>0d>0d>0 and every complex matrix CCC whose rows and columns are indexed by quadruples (a,b,c,e)∈{0,…,d−1}4(a,b,c,e)\in\{0,\ldots,d-1\}^4(a,b,c,e)∈{0,…,d−1}4, the following are equivalent: CCC commutes with every matrix

RU,W((a,b,c,e),(a′,b′,c′,e′))=Uaa′Wbb′Ucc′Wee′,U,W∈SU(d);R_{U,W}\bigl((a,b,c,e),(a',b',c',e')\bigr) =U_{aa'}W_{bb'}U_{cc'}W_{ee'}, \qquad U,W\in\mathrm{SU}(d);RU,W​((a,b,c,e),(a′,b′,c′,e′))=Uaa′​Wbb′​Ucc′​Wee′​,U,W∈SU(d);

and there exist four complex coefficients λϵ,η\lambda_{\epsilon,\eta}λϵ,η​, indexed by ϵ,η∈{0,1}\epsilon,\eta\in\{0,1\}ϵ,η∈{0,1}, such that

C(a,b,c,e),(a′,b′,c′,e′)=∑ϵ,η∈{0,1}λϵ,η Pϵ((a,c),(a′,c′)) Pη((b,e),(b′,e′)),C_{(a,b,c,e),(a',b',c',e')} =\sum_{\epsilon,\eta\in\{0,1\}} \lambda_{\epsilon,\eta}\, P_\epsilon((a,c),(a',c'))\, P_\eta((b,e),(b',e')),C(a,b,c,e),(a′,b′,c′,e′)​=ϵ,η∈{0,1}∑​λϵ,η​Pϵ​((a,c),(a′,c′))Pη​((b,e),(b′,e′)),

where

Pϵ((r,s),(r′,s′))=1r=r′, s=s′+(−1)ϵ1r=s′, s=r′2.P_\epsilon((r,s),(r',s')) =\frac{\mathbf1_{r=r',\,s=s'}+(-1)^\epsilon \mathbf1_{r=s',\,s=r'}}2.Pϵ​((r,s),(r′,s′))=21r=r′,s=s′​+(−1)ϵ1r=s′,s=r′​​.

There are no positivity, Hermiticity, or normalization assumptions on CCC or on the coefficients, and no uniqueness of the coefficients is asserted. The case d=1d=1d=1 is included; in that case P1=0P_1=0P1​=0.

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