Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6: two-step hopping and the z=0,1 boundary

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.twoStep_hopping

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 let g\mathfrak gg be a real Lie algebra of skew-Hermitian matrices containing g2\mathfrak g_2g2​. For x+y+z≤nx+y+z\le nx+y+z≤n, the conclusion

iPx,y−2,z+2∈giP_{x,y-2,z+2}\in\mathfrak giPx,y−2,z+2​∈g

holds in each of these cases:

  1. y,z≥2y,z\ge2y,z≥2 and both iPxyziP_{xyz}iPxyz​ and iPx,y+2,z−2iP_{x,y+2,z-2}iPx,y+2,z−2​ lie in g\mathfrak gg.
  2. y≥2y\ge2y≥2, z≤1z\le1z≤1, and iPxyz∈giP_{xyz}\in\mathfrak giPxyz​∈g.

The second case keeps the source's special boundary clause, where the other neighbor does not exist.

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.15–16, Lemma 6: includes the special z=0,1 boundary, where the
negative-index neighbor is absent. All natural subtractions are guarded. -/
theorem twoStep_hopping {n : ℕ} (hn : 2 ≤ n) (g : LieSubalgebra ℝ (QnnOperator n))
    (hg : g2 n ≤ g)
    (hskew : ∀ M : QnnOperator n, M ∈ g → M.conjTranspose = -M) :
    (∀ x y z : ℕ, x + y + z ≤ n → 2 ≤ y → 2 ≤ z →
      Complex.I • symmetricPauli n x y z ∈ g →
      Complex.I • symmetricPauli n x (y + 2) (z - 2) ∈ g →
      Complex.I • symmetricPauli n x (y - 2) (z + 2) ∈ g) ∧
    (∀ x y z : ℕ, x + y + z ≤ n → 2 ≤ y → z ≤ 1 →
      Complex.I • symmetricPauli n x y z ∈ g →
      Complex.I • symmetricPauli n x (y - 2) (z + 2) ∈ g) := 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, lemma6
Read-back

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

Let n≥2n\ge2n≥2 be a natural number. Let Sx,y,zS_{x,y,z}Sx,y,z​ be the unnormalized sum of all nnn-fold tensor products of I,X,Y,ZI,X,Y,ZI,X,Y,Z having exactly xxx factors XXX, yyy factors YYY, and zzz factors ZZZ, with an empty sum equal to 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​, using bracket AB−BAAB-BAAB−BA. Suppose g\mathfrak gg is any real Lie subalgebra of the complex matrices on {0,1}n\{0,1\}^n{0,1}n containing g2\mathfrak g_2g2​, and every M∈gM\in\mathfrak gM∈g is skew-Hermitian. Then both implications hold for all natural numbers x,y,zx,y,zx,y,z:

x+y+z≤n, y≥2, z≥2,iSx,y,z∈g,iSx,y+2,z−2∈g⟹iSx,y−2,z+2∈g;x+y+z≤n, y≥2, z≤1,iSx,y,z∈g⟹iSx,y−2,z+2∈g.\begin{aligned} &x+y+z\le n,\ y\ge2,\ z\ge2,\quad iS_{x,y,z}\in\mathfrak g,\quad iS_{x,y+2,z-2}\in\mathfrak g &&\Longrightarrow iS_{x,y-2,z+2}\in\mathfrak g;\\ &x+y+z\le n,\ y\ge2,\ z\le1,\quad iS_{x,y,z}\in\mathfrak g &&\Longrightarrow iS_{x,y-2,z+2}\in\mathfrak g. \end{aligned}​x+y+z≤n, y≥2, z≥2,iSx,y,z​∈g,iSx,y+2,z−2​∈gx+y+z≤n, y≥2, z≤1,iSx,y,z​∈g​​⟹iSx,y−2,z+2​∈g;⟹iSx,y−2,z+2​∈g.​

Thus the second implication includes exactly the possibilities z=0z=0z=0 and z=1z=1z=1; the lower bounds ensure that the displayed subtractions do not truncate.

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