Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3: generator orthogonality

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.generators2_orthogonal

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 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. If n≥2n\ge2n≥2, H∈G2H\in G_2H∈G2​, 0≤2μ≤n0\le2\mu\le n0≤2μ≤n, and μ≠1\mu\ne1μ=1, then

Tr⁡(HCμ)=0.\operatorname{Tr}(HC_\mu)=0.Tr(HCμ​)=0.

This is a statement about the original Hermitian generators, so HHH carries no extra factor of iii. It identifies their missing central projections.

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,14, Theorem 3: H is Hermitian, so there is no extra i on H. -/
theorem generators2_orthogonal {n : ℕ} (hn : 2 ≤ n)
    (H : QnnOperator n) (hH : H ∈ generators2 n) (mu : ℕ)
    (hmu : 2 * mu ≤ n) (hne : mu ≠ 1) :
    Matrix.trace (H * centralElement n 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, theorem3
Read-back

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

For every natural number n≥2n\ge2n≥2, 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. For every complex matrix

H∈{Sn(1,0,0),Sn(0,1,0),Sn(0,0,2)}H\in\{S_n(1,0,0),S_n(0,1,0),S_n(0,0,2)\}H∈{Sn​(1,0,0),Sn​(0,1,0),Sn​(0,0,2)}

and every natural number μ\muμ satisfying 2μ≤n2\mu\le n2μ≤n and μ≠1\mu\ne1μ=1, define

Cn,μ=∑a,b,c∈Na+b+c=μ(2a)!(2b)!(2c)!a! b! c! Sn(2a,2b,2c).C_{n,\mu} =\sum_{\substack{a,b,c\in\mathbb N\\a+b+c=\mu}} \frac{(2a)!(2b)!(2c)!}{a!\,b!\,c!}\,S_n(2a,2b,2c).Cn,μ​=a,b,c∈Na+b+c=μ​∑​a!b!c!(2a)!(2b)!(2c)!​Sn​(2a,2b,2c).

Then the complex trace satisfies tr⁡(HCn,μ)=0\operatorname{tr}(HC_{n,\mu})=0tr(HCn,μ​)=0. The allowed indices include μ=0\mu=0μ=0, where Cn,0=IC_{n,0}=ICn,0​=I.

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