Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5: exact k-body algebra

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.kBody_exact

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.

Write un\mathfrak u_nun​ for the skew-Hermitian commutant of the qubit-permuting representation of SnS_nSn​, sn\mathfrak s_nsn​ for its total-trace-zero subalgebra, and dn=[un,un]\mathfrak d_n=[\mathfrak u_n,\mathfrak u_n]dn​=[un​,un​] for its derived algebra, equivalently the algebra with independently traceless multiplicity blocks.

For 2≤k≤n2\le k\le n2≤k≤n, let Gk={P100,P010}∪{P00j:2≤j≤k}G_k=\{P_{100},P_{010}\}\cup\{P_{00j}:2\le j\le k\}Gk​={P100​,P010​}∪{P00j​:2≤j≤k} and gk=Lie⁡R{iH:H∈Gk}\mathfrak g_k=\operatorname{Lie}_{\mathbb R}\{iH:H\in G_k\}gk​=LieR​{iH:H∈Gk​}.

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.

For real coefficients cxyzc_{xyz}cxyz​ on the valid triples x+y+z≤nx+y+z\le nx+y+z≤n, put

M(c)=i∑x+y+z≤ncxyzPxyz,ℓμ(c)=∑a+b+c=μc2a,2b,2ca!b!c!.M(c)=i\sum_{x+y+z\le n}c_{xyz}P_{xyz},\qquad \ell_\mu(c)=\sum_{a+b+c=\mu}\frac{c_{2a,2b,2c}}{a!b!c!}.M(c)=ix+y+z≤n∑​cxyz​Pxyz​,ℓμ​(c)=a+b+c=μ∑​a!b!c!c2a,2b,2c​​.

Let Zk=span⁡R{iC1,…,iC⌊k/2⌋}Z_k=\operatorname{span}_{\mathbb R}\{iC_1,\ldots,iC_{\lfloor k/2\rfloor}\}Zk​=spanR​{iC1​,…,iC⌊k/2⌋​}. Then

gk=dn+Zk,Zk⊆z(un),dim⁡Zk=⌊k/2⌋.\mathfrak g_k=\mathfrak d_n+Z_k,\qquad Z_k\subseteq\mathfrak z(\mathfrak u_n),\qquad \dim Z_k=\lfloor k/2\rfloor.gk​=dn​+Zk​,Zk​⊆z(un​),dimZk​=⌊k/2⌋.

Furthermore, if ℓμ(c)=0\ell_\mu(c)=0ℓμ​(c)=0 for μ=0\mu=0μ=0 and for every ⌊k/2⌋<μ≤⌊n/2⌋\lfloor k/2\rfloor<\mu\le\lfloor n/2\rfloor⌊k/2⌋<μ≤⌊n/2⌋, then M(c)∈gkM(c)\in\mathfrak g_kM(c)∈gk​.

This identifies every generated central direction and retains the extra coefficient clause of the supplementary theorem on page 20. The k=2k=2k=2 boundary is the previously established two-body case.

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.6,20–21, Theorem 5: exact central span, its dimension and centrality,
and the additional 'Furthermore' coefficient-sufficiency clause (E3)–(E4). -/
theorem kBody_exact {n k : ℕ} (hk : 2 ≤ k) (hkn : k ≤ n) :
    (gK n k).toSubmodule = centerlessSymmetricAlgebra n ⊔ centralSpan n (k / 2) ∧
    centralSpan n (k / 2) ≤ algebraCenter (symmetricUnitaryAlgebra n) ∧
    Module.finrank ℝ (centralSpan n (k / 2)) = k / 2 ∧
    (∀ c : ℕ → ℕ → ℕ → ℝ,
      (∀ mu : ℕ, 2 * mu ≤ n → (mu = 0 ∨ k / 2 < mu) →
        centralCoefficient c mu = 0) → coefficientCombination n c ∈ gK n k) := 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. 6, theorem5
Read-back

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

For all natural numbers n,kn,kn,k satisfying 2≤k≤n2\le k\le n2≤k≤n, let Sn(x,y,z)S_n(x,y,z)Sn​(x,y,z) be the sum of all nnn-fold Pauli tensor products having exactly xxx factors XXX, yyy factors YYY, zzz factors ZZZ, and identities elsewhere. Let gn,k\mathfrak g_{n,k}gn,k​ be the smallest real Lie subalgebra, with bracket AB−BAAB-BAAB−BA, containing iSn(1,0,0)iS_n(1,0,0)iSn​(1,0,0), iSn(0,1,0)iS_n(0,1,0)iSn​(0,1,0), and every iSn(0,0,j)iS_n(0,0,j)iSn​(0,0,j) with 2≤j≤k2\le j\le k2≤j≤k. Let un\mathfrak u_nun​ be the real span of skew-Hermitian matrices on nnn-bit strings commuting with every permutation of the tensor factors, and let dn\mathfrak d_ndn​ be the real span of commutators of pairs of elements of un\mathfrak u_nun​. Define

Cn,μ=∑a,b,d∈Na+b+d=μ(2a)!(2b)!(2d)!a! b! d! Sn(2a,2b,2d),Zn,r=span⁡R{iCn,μ:1≤μ≤r}.C_{n,\mu} =\sum_{\substack{a,b,d\in\mathbb N\\a+b+d=\mu}} \frac{(2a)!(2b)!(2d)!}{a!\,b!\,d!}\,S_n(2a,2b,2d), \qquad Z_{n,r}=\operatorname{span}_{\mathbb R}\{iC_{n,\mu}:1\le\mu\le r\}.Cn,μ​=a,b,d∈Na+b+d=μ​∑​a!b!d!(2a)!(2b)!(2d)!​Sn​(2a,2b,2d),Zn,r​=spanR​{iCn,μ​:1≤μ≤r}.

Then the underlying real subspace of gn,k\mathfrak g_{n,k}gn,k​ equals dn+Zn,⌊k/2⌋\mathfrak d_n+Z_{n,\lfloor k/2\rfloor}dn​+Zn,⌊k/2⌋​; Zn,⌊k/2⌋Z_{n,\lfloor k/2\rfloor}Zn,⌊k/2⌋​ is contained in the real span of those elements of un\mathfrak u_nun​ commuting with every element of un\mathfrak u_nun​; and its real dimension is ⌊k/2⌋\lfloor k/2\rfloor⌊k/2⌋. In addition, for every function c:N3→Rc:\mathbb N^3\to\mathbb Rc:N3→R, if

∑a,b,d∈Na+b+d=μc(2a,2b,2d)a! b! d!=0\sum_{\substack{a,b,d\in\mathbb N\\a+b+d=\mu}} \frac{c(2a,2b,2d)}{a!\,b!\,d!}=0a,b,d∈Na+b+d=μ​∑​a!b!d!c(2a,2b,2d)​=0

for every natural number μ\muμ satisfying 2μ≤n2\mu\le n2μ≤n and either μ=0\mu=0μ=0 or ⌊k/2⌋<μ\lfloor k/2\rfloor<\mu⌊k/2⌋<μ, then i∑x+y+z≤nc(x,y,z)Sn(x,y,z)i\sum_{x+y+z\le n}c(x,y,z)S_n(x,y,z)i∑x+y+z≤n​c(x,y,z)Sn​(x,y,z) belongs to gn,k\mathfrak g_{n,k}gn,k​. Thus the coefficient conditions include μ=0\mu=0μ=0, impose no conditions at 1≤μ≤⌊k/2⌋1\le\mu\le\lfloor k/2\rfloor1≤μ≤⌊k/2⌋, and leave coefficients at triples whose sum exceeds nnn unrestricted.

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