Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Characterization of centerless coefficients

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.centerless_coefficients

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 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 any complex 2n×2n2^n\times2^n2n×2n matrix AAA,

A∈dn⟺∃c real: A=M(c) and ℓμ(c)=0(0≤2μ≤n).A\in\mathfrak d_n\quad\Longleftrightarrow\quad \exists c\text{ real}:\ A=M(c)\ \text{and}\ \ell_\mu(c)=0\quad(0\le2\mu\le n).A∈dn​⟺∃c real: A=M(c) and ℓμ​(c)=0(0≤2μ≤n).

This describes the independent special-unitary block algebra, including the μ=0\mu=0μ=0 trace condition, in Pauli coordinates.

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.5, (30)–(31): BOTH directions, including mu=0 (trace zero).
The left side uses the intrinsic derived algebra, not the coefficient condition. -/
theorem centerless_coefficients (n : ℕ) (A : QnnOperator n) :
    A ∈ centerlessSymmetricAlgebra n ↔
      ∃ c : ℕ → ℕ → ℕ → ℝ, A = coefficientCombination n c ∧
        ∀ mu : ℕ, 2 * mu ≤ n → centralCoefficient c mu = 0 := 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. 5, centerless-coefficients
Read-back

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

For every natural number nnn and every complex matrix AAA on nnn-bit strings, let un\mathfrak u_nun​ be the real span of all skew-Hermitian matrices commuting with every permutation of the tensor factors, and let dn\mathfrak d_ndn​ be the real span of all BC−CBBC-CBBC−CB with B,C∈unB,C\in\mathfrak u_nB,C∈un​. Let Sn(x,y,z)S_n(x,y,z)Sn​(x,y,z) be the sum of all Pauli tensor products with exactly xxx factors XXX, yyy factors YYY, zzz factors ZZZ, and identities elsewhere. Then A∈dnA\in\mathfrak d_nA∈dn​ if and only if there exists a function c:N3→Rc:\mathbb N^3\to\mathbb Rc:N3→R such that

A=i∑x,y,z∈Nx+y+z≤nc(x,y,z)Sn(x,y,z)and∀μ∈N,2μ≤n ⟹ ∑a,b,d∈Na+b+d=μc(2a,2b,2d)a! b! d!=0.A=i\sum_{\substack{x,y,z\in\mathbb N\\x+y+z\le n}}c(x,y,z)S_n(x,y,z) \quad\text{and}\quad \forall\mu\in\mathbb N,\quad 2\mu\le n\ \Longrightarrow\ \sum_{\substack{a,b,d\in\mathbb N\\a+b+d=\mu}} \frac{c(2a,2b,2d)}{a!\,b!\,d!}=0.A=ix,y,z∈Nx+y+z≤n​∑​c(x,y,z)Sn​(x,y,z)and∀μ∈N,2μ≤n ⟹ a,b,d∈Na+b+d=μ​∑​a!b!d!c(2a,2b,2d)​=0.

The condition includes μ=0\mu=0μ=0, requiring c(0,0,0)=0c(0,0,0)=0c(0,0,0)=0; values of ccc at triples whose sum exceeds nnn are unrestricted. When n=0n=0n=0, the right-hand side requires A=0A=0A=0.

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