Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pauli bases of the equivariant algebras

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.pauli_spans

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 every n≥0n\ge0n≥0,

un=span⁡R{iPxyz:x+y+z≤n},\mathfrak u_n=\operatorname{span}_{\mathbb R}\{iP_{xyz}:x+y+z\le n\},un​=spanR​{iPxyz​:x+y+z≤n}, sn=span⁡R{iPxyz:0<x+y+z≤n}.\mathfrak s_n=\operatorname{span}_{\mathbb R}\{iP_{xyz}:0<x+y+z\le n\}.sn​=spanR​{iPxyz​:0<x+y+z≤n}.

These are equalities of the full algebras. At n=0n=0n=0 they give the scalar skew algebra and the zero traceless algebra, respectively.

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.5,10, (26)–(27)/(A4): both complete real span equalities,
including n=0 (scalar skew algebra and zero traceless algebra). -/
theorem pauli_spans (n : ℕ) :
    symmetricUnitaryAlgebra n = Submodule.span ℝ
      {A | ∃ x y z : ℕ, x + y + z ≤ n ∧ A = Complex.I • symmetricPauli n x y z} ∧
    specialSymmetricAlgebra n = Submodule.span ℝ
      {A | ∃ x y z : ℕ, 0 < x + y + z ∧ x + y + z ≤ n ∧
        A = Complex.I • symmetricPauli n x y z} := 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, pauli-spans
Read-back

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

For every natural number nnn, including n=0n=0n=0, let Sn(x,y,z)S_n(x,y,z)Sn​(x,y,z) be the sum of all nnn-fold tensor products with exactly xxx Pauli XXX factors, yyy Pauli YYY factors, zzz Pauli ZZZ factors, and identities elsewhere. Let un\mathfrak u_nun​ be the real span of all skew-Hermitian complex matrices on nnn-bit strings commuting with every permutation of the tensor factors, and let sn\mathfrak s_nsn​ be the real span of the elements of un\mathfrak u_nun​ having trace zero. Then

un=span⁡R{iSn(x,y,z):x,y,z∈N, x+y+z≤n},sn=span⁡R{iSn(x,y,z):x,y,z∈N, 0<x+y+z≤n}.\mathfrak u_n =\operatorname{span}_{\mathbb R} \{iS_n(x,y,z):x,y,z\in\mathbb N,\ x+y+z\le n\}, \qquad \mathfrak s_n =\operatorname{span}_{\mathbb R} \{iS_n(x,y,z):x,y,z\in\mathbb N,\ 0<x+y+z\le n\}.un​=spanR​{iSn​(x,y,z):x,y,z∈N, x+y+z≤n},sn​=spanR​{iSn​(x,y,z):x,y,z∈N, 0<x+y+z≤n}.

The first generating set includes iSn(0,0,0)=iIiS_n(0,0,0)=iIiSn​(0,0,0)=iI; when n=0n=0n=0, the second generating set is empty and its span is zero.

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