Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7: propagation from the three printed seeds

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.seeded_level

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. Let n≥2n\ge2n≥2 and 1≤k≤n1\le k\le n1≤k≤n. Assume iPk−1,1,0iP_{k-1,1,0}iPk−1,1,0​, iP0,k−1,1iP_{0,k-1,1}iP0,k−1,1​, and iP1,0,k−1iP_{1,0,k-1}iP1,0,k−1​ all belong to g2\mathfrak g_2g2​. Then

x+y+z=k,(x odd or y odd or z odd)⟹iPxyz∈g2.x+y+z=k,\quad(x\text{ odd or }y\text{ odd or }z\text{ odd})\quad\Longrightarrow\quad iP_{xyz}\in\mathfrak g_2.x+y+z=k,(x odd or y odd or z odd)⟹iPxyz​∈g2​.

In particular, if kkk is odd, every triple at level kkk has this membership.

This conditional result retains all three seeds exactly as printed in the lemma, even though symmetry can make them redundant.

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.16–17, Lemma 7: the three printed seeds, the odd-coordinate
conclusion, and the explicit odd-level consequence are all retained. -/
theorem seeded_level {n k : ℕ} (hn : 2 ≤ n) (hk : 1 ≤ k) (hkn : k ≤ n)
    (hX : Complex.I • symmetricPauli n (k - 1) 1 0 ∈ g2 n)
    (hY : Complex.I • symmetricPauli n 0 (k - 1) 1 ∈ g2 n)
    (hZ : Complex.I • symmetricPauli n 1 0 (k - 1) ∈ g2 n) :
    (∀ x y z : ℕ, x + y + z = k → (Odd x ∨ Odd y ∨ Odd z) →
      Complex.I • symmetricPauli n x y z ∈ g2 n) ∧
    (Odd k → ∀ x y z : ℕ, x + y + z = k →
      Complex.I • symmetricPauli n x y z ∈ g2 n) := 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. 16, lemma7
Read-back

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

Let n,kn,kn,k be natural numbers with n≥2n\ge2n≥2 and 1≤k≤n1\le k\le n1≤k≤n. For natural numbers x,y,zx,y,zx,y,z, let Sx,y,zS_{x,y,z}Sx,y,z​ be the unnormalized sum of all nnn-fold Pauli tensor products having exactly xxx factors XXX, yyy factors YYY, and zzz factors ZZZ, with identity factors elsewhere and an empty sum interpreted as zero. Let g2\mathfrak g_2g2​ be the real Lie subalgebra generated by iS1,0,0iS_{1,0,0}iS1,0,0​, iS0,1,0iS_{0,1,0}iS0,1,0​, and iS0,0,2iS_{0,0,2}iS0,0,2​, with bracket AB−BAAB-BAAB−BA. Assume all three memberships

iSk−1,1,0∈g2,iS0,k−1,1∈g2,iS1,0,k−1∈g2.iS_{k-1,1,0}\in\mathfrak g_2,\qquad iS_{0,k-1,1}\in\mathfrak g_2,\qquad iS_{1,0,k-1}\in\mathfrak g_2.iSk−1,1,0​∈g2​,iS0,k−1,1​∈g2​,iS1,0,k−1​∈g2​.

Then every triple of natural numbers x,y,zx,y,zx,y,z satisfying x+y+z=kx+y+z=kx+y+z=k and having at least one odd coordinate satisfies iSx,y,z∈g2iS_{x,y,z}\in\mathfrak g_2iSx,y,z​∈g2​. In addition, if kkk is odd, then iSx,y,z∈g2iS_{x,y,z}\in\mathfrak g_2iSx,y,z​∈g2​ for every triple with x+y+z=kx+y+z=kx+y+z=k, without a separate coordinate-parity hypothesis. The case k=1k=1k=1 is included, so the seed expressions may contain k−1=0k-1=0k−1=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