Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3: transposition-class expansions

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.transposition_expansions

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.

For 0≤2μ≤n0\le2\mu\le n0≤2μ≤n, define

Cμ=∑a+b+c=μ(2a)!(2b)!(2c)!a!b!c!P2a,2b,2c.C_\mu=\sum_{a+b+c=\mu}\frac{(2a)!(2b)!(2c)!}{a!b!c!}P_{2a,2b,2c}.Cμ​=a+b+c=μ∑​a!b!c!(2a)!(2b)!(2c)!​P2a,2b,2c​.

In particular C0=IC_0=IC0​=I.

Let TμT_\muTμ​ consist of permutations with exactly μ\muμ disjoint transpositions and all other points fixed, and let Lμ=∑π∈TμR(π)L_\mu=\sum_{\pi\in T_\mu}R(\pi)Lμ​=∑π∈Tμ​​R(π), where R(π)∣b⟩=∣b∘π−1⟩R(\pi)|b\rangle=|b\circ\pi^{-1}\rangleR(π)∣b⟩=∣b∘π−1⟩. For each natural μ\muμ with 2μ≤n2\mu\le n2μ≤n, both identities hold:

Lμ=4−μ(n−2μ)!∑a+b+c+f=μ(2a)!(2b)!(2c)!(n−2(μ−f))!a!b!c!f!P2a,2b,2c,L_\mu=\frac{4^{-\mu}}{(n-2\mu)!}\sum_{a+b+c+f=\mu}\frac{(2a)!(2b)!(2c)!(n-2(\mu-f))!}{a!b!c!f!}P_{2a,2b,2c},Lμ​=(n−2μ)!4−μ​a+b+c+f=μ∑​a!b!c!f!(2a)!(2b)!(2c)!(n−2(μ−f))!​P2a,2b,2c​, Lμ=4−μ(n−2μ)!∑j=0μ(n−2j)!(μ−j)!Cj.L_\mu=\frac{4^{-\mu}}{(n-2\mu)!}\sum_{j=0}^{\mu}\frac{(n-2j)!}{(\mu-j)!}C_j.Lμ​=(n−2μ)!4−μ​j=0∑μ​(μ−j)!(n−2j)!​Cj​.

All indices are nonnegative and all factorial denominators are positive.

These identities relate the class-sum and Pauli central bases. The unbound kkk in the printed first denominator is corrected to μ\muμ using (B17)–(B22).

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 pp.12–13, Lemma 3: BOTH factorial formulas. Printed (B12) has an
unbound k in (n-2k)!; corrected to mu by (B17)–(B22). Ref.[18] overlap at p.13. -/
theorem transposition_expansions {n mu : ℕ} (hmu : 2 * mu ≤ n) :
    transpositionSum n mu = transpositionPauliExpansion n mu ∧
    transpositionSum n mu = transpositionCentralExpansion n mu := 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. 12, lemma3
Read-back

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

Let n,μn,\mun,μ be natural numbers with 2μ≤n2\mu\le n2μ≤n. On the computational basis {0,1}n\{0,1\}^n{0,1}n, let Pπ∣z⟩=∣z∘π−1⟩P_\pi|z\rangle=|z\circ\pi^{-1}\ranglePπ​∣z⟩=∣z∘π−1⟩, and let Tn,μT_{n,\mu}Tn,μ​ be the sum of PπP_\piPπ​ over permutations satisfying π2=id\pi^2=\mathrm{id}π2=id and moving exactly 2μ2\mu2μ positions. Let Sx,y,zS_{x,y,z}Sx,y,z​ be the unnormalized sum of all tensor products with exactly xxx Pauli XXX factors, yyy Pauli YYY factors, and zzz Pauli ZZZ factors, and identity factors elsewhere, taking this sum to be zero if there are no such products. Put

w(a,b,c)=(2a)!(2b)!(2c)!a! b! c!,Cn,j=∑a,b,c≥0a+b+c=jw(a,b,c)S2a,2b,2c.w(a,b,c)=\frac{(2a)!(2b)!(2c)!}{a!\,b!\,c!}, \qquad C_{n,j}=\sum_{\substack{a,b,c\ge0\\a+b+c=j}} w(a,b,c)S_{2a,2b,2c}.w(a,b,c)=a!b!c!(2a)!(2b)!(2c)!​,Cn,j​=a,b,c≥0a+b+c=j​∑​w(a,b,c)S2a,2b,2c​.

Then both matrix identities hold:

Tn,μ=4−μ(n−2μ)!∑0≤a,b,c,f≤μa+b+c+f=μw(a,b,c)(n−2(μ−f))!f! S2a,2b,2c,Tn,μ=4−μ(n−2μ)!∑j=0μ(n−2j)!(μ−j)! Cn,j.T_{n,\mu} =\frac{4^{-\mu}}{(n-2\mu)!} \sum_{\substack{0\le a,b,c,f\le\mu\\a+b+c+f=\mu}} w(a,b,c)\frac{(n-2(\mu-f))!}{f!}\, S_{2a,2b,2c}, \qquad T_{n,\mu} =\frac{4^{-\mu}}{(n-2\mu)!} \sum_{j=0}^{\mu}\frac{(n-2j)!}{(\mu-j)!}\,C_{n,j}.Tn,μ​=(n−2μ)!4−μ​0≤a,b,c,f≤μa+b+c+f=μ​∑​w(a,b,c)f!(n−2(μ−f))!​S2a,2b,2c​,Tn,μ​=(n−2μ)!4−μ​j=0∑μ​(μ−j)!(n−2j)!​Cn,j​.

All factorial coefficients are interpreted as real scalars multiplying complex matrices. The hypothesis ensures that the displayed subtractions have nonnegative results. The case μ=0\mu=0μ=0, including n=0n=0n=0, is included and gives the identity matrix in both expansions.

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