Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4: invariance under axis interchanges

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.twoBody_axis_invariant

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

prove2quantum

Let nnn denote the number of qubits, with computational basis indexed by {0,1}n\{0,1\}^n{0,1}n. Write PxyzP_{xyz}Pxyz​ for the unnormalized sum of distinct phase-zero Pauli words with xxx copies of XXX, yyy copies of the standard Y=(0−ii0)Y=\left(\begin{smallmatrix}0&-i\\i&0\end{smallmatrix}\right)Y=(0i​−i0​), and zzz copies of ZZZ. All Lie closures, linear spans, and dimensions below are over R\mathbb RR; commutators are [A,B]=AB−BA[A,B]=AB-BA[A,B]=AB−BA.

Let G2={P100,P010,P002}G_2=\{P_{100},P_{010},P_{002}\}G2​={P100​,P010​,P002​} and let g2=Lie⁡R{iH:H∈G2}\mathfrak g_2=\operatorname{Lie}_{\mathbb R}\{iH:H\in G_2\}g2​=LieR​{iH:H∈G2​} be its actual dynamical Lie algebra. For a permutation σ\sigmaσ of the three axes, let TσT_\sigmaTσ​ be the complex-linear map that sends each full tensor Pauli word to the word obtained by applying σ\sigmaσ on each nonidentity factor, fixing every identity factor. For n≥2n\ge2n≥2,

Tσ(g2)=g2.T_\sigma(\mathfrak g_2)=\mathfrak g_2.Tσ​(g2​)=g2​.

The map is defined on the entire Pauli-word basis; an odd axis permutation is not assumed to be unitary conjugation.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P38
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P38

open scoped BigOperators

open QAlgorithms.Papers.Independent.Support50.P30
  (QnnOperator qubitPermutationMatrix PermutationEquivariant)

attribute [local instance] LieRing.ofAssociativeRing

/-- PDF p.15, Lemma 4: exact subspace invariance under any axis permutation;
the map acts on full Pauli-word coefficients and fixes the identity label. -/
theorem twoBody_axis_invariant {n : ℕ} (hn : 2 ≤ n) (sigma : Equiv.Perm (Fin 3)) :
    axisRelabel (n := n) sigma '' (g2 n : Set (QnnOperator n)) = (g2 n : Set (QnnOperator n)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P38

end
Source
On the universality of SnS_nSn​-equivariant kkk-body gates, arXiv:2303.00728v2, PDF p. 15, lemma4
Read-back

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

Let n≥2n\ge2n≥2 be a natural number, and let σ\sigmaσ be any permutation of the three axis labels 0,1,20,1,20,1,2, corresponding respectively to the standard Pauli matrices X,Y,ZX,Y,ZX,Y,Z. For a labeling w:{0,…,n−1}→{∅,0,1,2}w:\{0,\ldots,n-1\}\to\{\varnothing,0,1,2\}w:{0,…,n−1}→{∅,0,1,2}, let PwP_wPw​ be the tensor product having factor III at a position labeled ∅\varnothing∅ and the indicated Pauli matrix otherwise. Let Sx,y,zS_{x,y,z}Sx,y,z​ be the sum of all PwP_wPw​ with exactly x,y,zx,y,zx,y,z occurrences of labels 0,1,20,1,20,1,2, respectively, and let g2\mathfrak g_2g2​ be the real Lie subalgebra generated by iS1,0,0iS_{1,0,0}iS1,0,0​, iS0,1,0iS_{0,1,0}iS0,1,0​, and iS0,0,2iS_{0,0,2}iS0,0,2​, using bracket AB−BAAB-BAAB−BA. Define, for every complex matrix AAA on {0,1}n\{0,1\}^n{0,1}n,

Aσ(A)=∑wtr⁡(PwA)2n Pσ∗w,\mathcal A_\sigma(A) =\sum_w\frac{\operatorname{tr}(P_wA)}{2^n}\,P_{\sigma_*w},Aσ​(A)=w∑​2ntr(Pw​A)​Pσ∗​w​,

where σ∗w\sigma_*wσ∗​w leaves ∅\varnothing∅ unchanged and applies σ\sigmaσ to every other label. Then

{Aσ(M):M∈g2}=g2.\{\mathcal A_\sigma(M):M\in\mathfrak g_2\}=\mathfrak g_2.{Aσ​(M):M∈g2​}=g2​.
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

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