Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 (Exact Delta values for collective Pauli operators)

Open
QAlgorithms.Papers.Independent.Support50.P30.collectivePauli_delta

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Fix an orthonormal Schur decomposition on nnn qubits, a sector λ=(n−m,m)\lambda=(n-m,m)λ=(n−m,m) of dimension dλ=n−2m+1d_\lambda=n-2m+1dλ​=n−2m+1, and one Pauli matrix χ∈{X,Y,Z}\chi\in\{X,Y,Z\}χ∈{X,Y,Z}. Compress the following unnormalized permutation-equivariant operators to their common λ\lambdaλ block. With Δ(B)=Tr⁡(B2)−Tr⁡(B)2/dλ\Delta(B)=\operatorname{Tr}(B^2)-\operatorname{Tr}(B)^2/d_\lambdaΔ(B)=Tr(B2)−Tr(B)2/dλ​,

Δ ⁣([∑jχj]λ)=2(dλ+13),Δ ⁣([∑k<jχjχk]λ)=83(dλ+25),Δ ⁣([∏jχj]λ)=dλ2−1+(n mod 2)dλ.\Delta\!\left(\left[\sum_j\chi_j\right]_\lambda\right)=2\binom{d_\lambda+1}{3},\quad \Delta\!\left(\left[\sum_{k<j}\chi_j\chi_k\right]_\lambda\right)=\frac83\binom{d_\lambda+2}{5},\quad \Delta\!\left(\left[\prod_j\chi_j\right]_\lambda\right)=\frac{d_\lambda^2-1+(n\bmod2)}{d_\lambda}.Δ​[j∑​χj​]λ​​=2(3dλ​+1​),Δ​​k<j∑​χj​χk​​λ​​=38​(5dλ​+2​),Δ​[j∏​χj​]λ​​=dλ​dλ2​−1+(nmod2)​.

These exact values apply before the normalization factors in Eqs. (9) and (10). In particular the one-dimensional sectors have zero statistic, as do the two-dimensional sectors for the pair sum.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P30
Formal statement
noncomputable section

open MeasureTheory

open scoped BigOperators ComplexConjugate Matrix.Norms.L2Operator NNReal ENNReal

namespace QAlgorithms.Papers.Independent.Support50.P30

/-- PDF pp.6,27-28, Theorem 2: unnormalized sums/products. The intermediate
trace typos on p.28 do not enter these final Delta identities. -/
theorem collectivePauli_delta {n : ℕ} (S : SchurFrame n) (m : Sector n)
    (chi : Matrix Bool Bool ℂ) (hchi : chi ∈ ({pauliX, pauliY, pauliZ} : Set _)) :
    centeredDelta (commonBlock S m (collective n chi 1)) =
        2 * (((blockDim n m + 1).choose 3 : ℕ) : ℝ) ∧
    centeredDelta (commonBlock S m (collective n chi 2)) =
        (8 / 3 : ℝ) * (((blockDim n m + 2).choose 5 : ℕ) : ℝ) ∧
    centeredDelta (commonBlock S m (collective n chi n)) =
        ((blockDim n m : ℝ) ^ 2 - 1 + ((n % 2 : ℕ) : ℝ)) / (blockDim n m : ℝ) := by sorry

end QAlgorithms.Papers.Independent.Support50.P30

end
Source
Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks, arXiv:2210.09974v3, PDF p. 6, Theorem 2 (Exact Delta values for collective Pauli operators)
Read-back

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

Let nnn be any natural number, including zero. For each sector s=0,…,⌊n/2⌋s=0,\ldots,\lfloor n/2\rfloors=0,…,⌊n/2⌋, set ds=n−2s+1d_s=n-2s+1ds​=n−2s+1 and rs=(ns)−(ns−1)r_s=\binom ns-\binom n{s-1}rs​=(sn​)−(s−1n​), where the second term is defined to be zero for s=0s=0s=0 and the subtraction is natural-number subtraction. Let SSS be a complex matrix whose columns are indexed by nnn-bit strings and whose rows are indexed by triples (s,ν,j)(s,\nu,j)(s,ν,j), with 0≤ν<rs0\le\nu<r_s0≤ν<rs​ and 0≤j<ds0\le j<d_s0≤j<ds​, satisfying SS∗=ISS^*=ISS∗=I and S∗S=IS^*S=IS∗S=I. Assume also that every matrix AAA commuting with all permutations of the qubit positions has SAS∗SAS^*SAS∗ block diagonal, with a block BsB_sBs​ repeated identically for every multiplicity index ν\nuν, and that

S(JX2+JY2+JZ2)S∗=⨁s⨁ν<rs(n−2s)(n−2s+2)Ids,Jχ=∑q=0n−1χ(q).S(J_X^2+J_Y^2+J_Z^2)S^* = \bigoplus_s\bigoplus_{\nu<r_s}(n-2s)(n-2s+2)I_{d_s}, \qquad J_\chi=\sum_{q=0}^{n-1}\chi^{(q)}.S(JX2​+JY2​+JZ2​)S∗=s⨁​ν<rs​⨁​(n−2s)(n−2s+2)Ids​​,Jχ​=q=0∑n−1​χ(q).

Here χ(q)\chi^{(q)}χ(q) applies χ\chiχ at position qqq and the identity elsewhere, and

X=(0110),Y=(0−ii0),Z=(100−1).X=\begin{pmatrix}0&1\\1&0\end{pmatrix},\quad Y=\begin{pmatrix}0&-i\\i&0\end{pmatrix},\quad Z=\begin{pmatrix}1&0\\0&-1\end{pmatrix}.X=(01​10​),Y=(0i​−i0​),Z=(10​0−1​).

For any matrix χ\chiχ equal to X,YX,YX,Y, or ZZZ, define

Ck(χ)=∑F⊆{0,…,n−1}∣F∣=k⨂q=0n−1{χ,q∈F,I2,q∉F,C_k(\chi)=\sum_{\substack{F\subseteq\{0,\ldots,n-1\}\\|F|=k}} \bigotimes_{q=0}^{n-1} \begin{cases}\chi,&q\in F,\\I_2,&q\notin F,\end{cases}Ck​(χ)=F⊆{0,…,n−1}∣F∣=k​∑​q=0⨂n−1​{χ,I2​,​q∈F,q∈/F,​

let Ss,νS_{s,\nu}Ss,ν​ be the submatrix consisting of rows (s,ν,j)(s,\nu,j)(s,ν,j), and put

Bs(A)=1rs∑ν<rsSs,νASs,ν∗,Δ(B)=Re⁡ ⁣(tr⁡(B2)−(tr⁡B)2ds)B_s(A)=\frac1{r_s}\sum_{\nu<r_s}S_{s,\nu}AS_{s,\nu}^*, \qquad \Delta(B)=\operatorname{Re}\!\left(\operatorname{tr}(B^2)-\frac{(\operatorname{tr}B)^2}{d_s}\right)Bs​(A)=rs​1​ν<rs​∑​Ss,ν​ASs,ν∗​,Δ(B)=Re(tr(B2)−ds​(trB)2​)

for a ds×dsd_s\times d_sds​×ds​ matrix BBB. Then, for every chosen sector mmm, all three equalities hold:

Δ(Bm(C1(χ)))=2(dm+13),Δ(Bm(C2(χ)))=83(dm+25),Δ(Bm(Cn(χ)))=dm2−1+(n mod 2)dm.\Delta(B_m(C_1(\chi)))=2\binom{d_m+1}{3}, \qquad \Delta(B_m(C_2(\chi)))=\frac83\binom{d_m+2}{5}, \qquad \Delta(B_m(C_n(\chi)))=\frac{d_m^2-1+(n\bmod2)}{d_m}.Δ(Bm​(C1​(χ)))=2(3dm​+1​),Δ(Bm​(C2​(χ)))=38​(5dm​+2​),Δ(Bm​(Cn​(χ)))=dm​dm2​−1+(nmod2)​.

The empty tensor product is 111, so C0(χ)=IC_0(\chi)=IC0​(χ)=I, including when n=0n=0n=0; a sum over subsets of an unavailable size is zero. The expression defining Δ\DeltaΔ uses B2B^2B2 and (tr⁡B)2(\operatorname{tr}B)^2(trB)2, without complex conjugation.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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