Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5: one-step hopping with all boundary clauses

Open
QAlgorithms.Papers.Independent.Intakenext100.P38.oneStep_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 valid triples, write Pxyz∈igP_{xyz}\in_i\mathfrak gPxyz​∈i​g to mean iPxyz∈giP_{xyz}\in\mathfrak giPxyz​∈g. Then:

  1. If x+y+z≤nx+y+z\le nx+y+z≤n, y,z≥1y,z\ge1y,z≥1, and Pxyz,Px,y+1,z−1∈igP_{xyz},P_{x,y+1,z-1}\in_i\mathfrak gPxyz​,Px,y+1,z−1​∈i​g, then Px,y−1,z+1∈igP_{x,y-1,z+1}\in_i\mathfrak gPx,y−1,z+1​∈i​g.
  2. If x+y≤nx+y\le nx+y≤n, y≥1y\ge1y≥1, and Pxy0∈igP_{xy0}\in_i\mathfrak gPxy0​∈i​g, then Px,y−1,1∈igP_{x,y-1,1}\in_i\mathfrak gPx,y−1,1​∈i​g.
  3. If 1≤x≤n1\le x\le n1≤x≤n and Px00∈igP_{x00}\in_i\mathfrak gPx00​∈i​g, then Px−1,1,0∈igP_{x-1,1,0}\in_i\mathfrak gPx−1,1,0​∈i​g.

The first conclusion is the displayed hopping rule

iPx,y−1,z+1∈g.iP_{x,y-1,z+1}\in\mathfrak g.iPx,y−1,z+1​∈g.

These rules retain the collective-generator assumption used by the proof and the two boundary cases.

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 5: all three boundary clauses. The standing hypothesis
g2<=g supplies the collective one-body generators used by the proof. -/
theorem oneStep_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 → 1 ≤ y → 1 ≤ z →
      Complex.I • symmetricPauli n x y z ∈ g →
      Complex.I • symmetricPauli n x (y + 1) (z - 1) ∈ g →
      Complex.I • symmetricPauli n x (y - 1) (z + 1) ∈ g) ∧
    (∀ x y : ℕ, x + y ≤ n → 1 ≤ y →
      Complex.I • symmetricPauli n x y 0 ∈ g →
      Complex.I • symmetricPauli n x (y - 1) 1 ∈ g) ∧
    (∀ x : ℕ, x ≤ n → 1 ≤ x →
      Complex.I • symmetricPauli n x 0 0 ∈ g →
      Complex.I • symmetricPauli n (x - 1) 1 0 ∈ 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, lemma5
Read-back

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

Let n≥2n\ge2n≥2 be a natural number, and let Sx,y,zS_{x,y,z}Sx,y,z​ denote 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, taking an empty sum to be 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. Suppose g\mathfrak gg is any real Lie subalgebra of the complex matrices on {0,1}n\{0,1\}^n{0,1}n such that g2⊆g\mathfrak g_2\subseteq\mathfrak gg2​⊆g and every M∈gM\in\mathfrak gM∈g satisfies M†=−MM^\dagger=-MM†=−M. Then all three implications hold for natural-number coordinates:

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

Every displayed subtraction is ordinary subtraction under the given lower bounds; coordinates without a positive lower bound may be zero.

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