Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4: coefficient sufficiency

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.twoBody_coefficient_sufficiency

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 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​​.

For n≥2n\ge2n≥2 and every such real coefficient family,

[ℓμ(c)=0 for all 0≤2μ≤n, μ≠1]⟹M(c)∈g2.\left[\ell_\mu(c)=0\text{ for all }0\le2\mu\le n,\ \mu\ne1\right]\quad\Longrightarrow\quad M(c)\in\mathfrak g_2.[ℓμ​(c)=0 for all 0≤2μ≤n, μ=1]⟹M(c)∈g2​.

This is sufficiency for membership in the actual generated Lie algebra; no orthogonality property of that algebra is assumed.

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,14–19, Theorem 4: sufficiency for the ACTUAL Lie closure;
no necessary-orthogonality theorem is assumed as an input. -/
theorem twoBody_coefficient_sufficiency {n : ℕ} (hn : 2 ≤ n)
    (c : ℕ → ℕ → ℕ → ℝ)
    (hc : ∀ mu : ℕ, 2 * mu ≤ n → mu ≠ 1 → centralCoefficient c mu = 0) :
    coefficientCombination n c ∈ g2 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. 6, theorem4
Read-back

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

For every natural number n≥2n\ge2n≥2 and every function c:N3→Rc:\mathbb N^3\to\mathbb Rc:N3→R, let Sn(x,y,z)S_n(x,y,z)Sn​(x,y,z) be the sum of all nnn-fold Pauli tensor products with exactly xxx factors XXX, yyy factors YYY, zzz factors ZZZ, and identities elsewhere. Suppose that for every natural number μ\muμ with 2μ≤n2\mu\le n2μ≤n and μ≠1\mu\ne1μ=1,

∑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!}=0.a,b,d∈Na+b+d=μ​∑​a!b!d!c(2a,2b,2d)​=0.

Then

i∑x,y,z∈Nx+y+z≤nc(x,y,z)Sn(x,y,z)i\sum_{\substack{x,y,z\in\mathbb N\\x+y+z\le n}} c(x,y,z)S_n(x,y,z)ix,y,z∈Nx+y+z≤n​∑​c(x,y,z)Sn​(x,y,z)

belongs to the smallest real Lie subalgebra of complex matrices on nnn-bit strings, 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 iSn(0,0,2)iS_n(0,0,2)iSn​(0,0,2). The hypothesis includes μ=0\mu=0μ=0, so c(0,0,0)=0c(0,0,0)=0c(0,0,0)=0; it imposes no condition at μ=1\mu=1μ=1, and coefficients at triples whose sum exceeds nnn do not enter the conclusion.

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