Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2: equality of central prefix spans

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.central_prefix_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.

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.

Let TμT_\muTμ​ consist of permutations with exactly μ\muμ disjoint transpositions and all other points fixed, and let Lμ=∑π∈TμR(π)L_\mu=\sum_{\pi\in T_\mu}R(\pi)Lμ​=∑π∈Tμ​​R(π), where R(π)∣b⟩=∣b∘π−1⟩R(\pi)|b\rangle=|b\circ\pi^{-1}\rangleR(π)∣b⟩=∣b∘π−1⟩. For 2μ≤n2\mu\le n2μ≤n,

span⁡R{L0,…,Lμ}=span⁡R{C0,…,Cμ}.\operatorname{span}_{\mathbb R}\{L_0,\ldots,L_\mu\}=\operatorname{span}_{\mathbb R}\{C_0,\ldots,C_\mu\}.spanR​{L0​,…,Lμ​}=spanR​{C0​,…,Cμ​}.

In particular, the full families with 0≤j≤⌊n/2⌋0\le j\le\lfloor n/2\rfloor0≤j≤⌊n/2⌋ have the same real span.

The families are prefixes, rather than a single LμL_\muLμ​: this is the interpretation supplied by the triangular identity (B13).

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.12–13, Corollary 2: PREFIX spans, not a singleton L_mu span.
The triangular identity (B13) supplies the intended reading. -/
theorem central_prefix_spans {n mu : ℕ} (hmu : 2 * mu ≤ n) :
    Submodule.span ℝ {A | ∃ j : ℕ, j ≤ mu ∧ A = transpositionSum n j} =
      Submodule.span ℝ {A | ∃ j : ℕ, j ≤ mu ∧ A = centralElement n j} ∧
    Submodule.span ℝ {A | ∃ j : ℕ, 2 * j ≤ n ∧ A = transpositionSum n j} =
      Submodule.span ℝ {A | ∃ j : ℕ, 2 * j ≤ n ∧ A = centralElement n j} := 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. 12, corollary2
Read-back

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

Let n,μn,\mun,μ be natural numbers satisfying 2μ≤n2\mu\le n2μ≤n. Let PπP_\piPπ​ act on computational basis vectors by Pπ∣z⟩=∣z∘π−1⟩P_\pi|z\rangle=|z\circ\pi^{-1}\ranglePπ​∣z⟩=∣z∘π−1⟩, and let Tn,jT_{n,j}Tn,j​ be the sum of these matrices over involutions π\piπ moving exactly 2j2j2j positions. Let Sx,y,zS_{x,y,z}Sx,y,z​ be the unnormalized sum of Pauli tensor products with exactly xxx factors XXX, yyy factors YYY, and zzz factors ZZZ, and identity factors elsewhere, with an empty sum equal to zero, and define

Cn,j=∑a,b,c≥0a+b+c=j(2a)!(2b)!(2c)!a! b! c! S2a,2b,2c.C_{n,j}=\sum_{\substack{a,b,c\ge0\\a+b+c=j}} \frac{(2a)!(2b)!(2c)!}{a!\,b!\,c!}\,S_{2a,2b,2c}.Cn,j​=a,b,c≥0a+b+c=j​∑​a!b!c!(2a)!(2b)!(2c)!​S2a,2b,2c​.

Then both equalities of real linear subspaces hold:

span⁡R{Tn,j:0≤j≤μ}=span⁡R{Cn,j:0≤j≤μ},span⁡R{Tn,j:2j≤n}=span⁡R{Cn,j:2j≤n}.\operatorname{span}_{\mathbb R}\{T_{n,j}:0\le j\le\mu\} =\operatorname{span}_{\mathbb R}\{C_{n,j}:0\le j\le\mu\}, \qquad \operatorname{span}_{\mathbb R}\{T_{n,j}:2j\le n\} =\operatorname{span}_{\mathbb R}\{C_{n,j}:2j\le n\}.spanR​{Tn,j​:0≤j≤μ}=spanR​{Cn,j​:0≤j≤μ},spanR​{Tn,j​:2j≤n}=spanR​{Cn,j​:2j≤n}.

Both spans include their j=0j=0j=0 generator, which is the identity matrix. The statement includes μ=0\mu=0μ=0 and n=0n=0n=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