Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 (Subspace controllability)

Open
QAlgorithms.Papers.Independent.Support50.P30.subspace_controllability

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

prove2quantum

Let n≥2n\ge2n≥2, let g\mathfrak gg be the real Lie algebra generated by −i-i−i times the three Hermitian generators in Eq. (9), and fix a Schur decomposition independently of circuit parameters. For each sector λ\lambdaλ, projection to its common block satisfies

gλ=su(dλ)orgλ=u(dλ).\mathfrak g_\lambda=\mathfrak{su}(d_\lambda)\quad\text{or}\quad\mathfrak g_\lambda=\mathfrak u(d_\lambda).gλ​=su(dλ​)orgλ​=u(dλ​).

Here u(d)\mathfrak u(d)u(d) consists of skew-Hermitian matrices and su(d)\mathfrak{su}(d)su(d) additionally imposes trace zero. The trivial sector permits su(1)={0}\mathfrak{su}(1)=\{0\}su(1)={0}. The source attributes this lemma to references [92] and [139]. It asserts controllability after projection and does not assert independent control of all block phases.

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

attribute [local instance] LieRing.ofAssociativeRing

/-- PDF p.13, Lemma 3, attributed to [92] and [139]. Projection onto each
block is su(d) or u(d); independent controllability is not asserted. -/
theorem subspace_controllability {n : ℕ} (hn : 2 ≤ n) (S : SchurFrame n) (m : Sector n) :
    (commonBlock S m '' (dynamicalLie n : Set (QnnOperator n))) =
      {A | A.conjTranspose = -A ∧ A.trace = 0} ∨
    (commonBlock S m '' (dynamicalLie n : Set (QnnOperator n))) =
      {A | A.conjTranspose = -A} := by sorry

end QAlgorithms.Papers.Independent.Support50.P30

end
Source
Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks, arXiv:2210.09974v3, PDF p. 13, Lemma 3 (Subspace controllability)
Read-back

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

For every natural number n≥2n\ge2n≥2, every Schur frame SSS described below, and every integer mmm with 0≤m≤⌊n/2⌋0\le m\le\lfloor n/2\rfloor0≤m≤⌊n/2⌋, set

dm=n−2m+1,rm=(nm)−{0,m=0,(nm−1),m>0.d_m=n-2m+1,\qquad r_m=\binom nm-\begin{cases}0,&m=0,\\\binom n{m-1},&m>0.\end{cases}dm​=n−2m+1,rm​=(mn​)−{0,(m−1n​),​m=0,m>0.​

Here a Schur frame is a complex matrix SSS with columns indexed by nnn-bit strings and rows indexed by triples (h,ν,j)(h,\nu,j)(h,ν,j) with 0≤h≤⌊n/2⌋0\le h\le\lfloor n/2\rfloor0≤h≤⌊n/2⌋, 0≤ν<rh0\le\nu<r_h0≤ν<rh​, and 0≤j<dh0\le j<d_h0≤j<dh​, satisfying SS†=ISS^\dagger=ISS†=I and S†S=IS^\dagger S=IS†S=I. It must send every matrix commuting with all qubit permutations to a block diagonal matrix consisting of rhr_hrh​ identical dh×dhd_h\times d_hdh​×dh​ blocks in each sector hhh; qubit permutation ppp means ∣x⟩↦∣x∘p−1⟩|x\rangle\mapsto|x\circ p^{-1}\rangle∣x⟩↦∣x∘p−1⟩. It must also send JX2+JY2+JZ2J_X^2+J_Y^2+J_Z^2JX2​+JY2​+JZ2​ to those repeated blocks with sector-hhh block (n−2h)(n−2h+2)Idh(n-2h)(n-2h+2)I_{d_h}(n−2h)(n−2h+2)Idh​​, where Jχ=∑qχqJ_\chi=\sum_q\chi_qJχ​=∑q​χq​, χq\chi_qχq​ acts as χ\chiχ on qubit qqq and as identity elsewhere, and X,Y,ZX,Y,ZX,Y,Z are the usual Pauli matrices. Let Rm,νR_{m,\nu}Rm,ν​ consist of the rows of SSS indexed by (m,ν,j)(m,\nu,j)(m,ν,j) and define

Bm(A)=1rm∑ν=0rm−1Rm,νARm,ν†.B_m(A)=\frac1{r_m}\sum_{\nu=0}^{r_m-1}R_{m,\nu}AR_{m,\nu}^\dagger.Bm​(A)=rm​1​ν=0∑rm​−1​Rm,ν​ARm,ν†​.

Let gn\mathfrak g_ngn​ be the smallest real Lie subalgebra, for bracket [A,B]=AB−BA[A,B]=AB-BA[A,B]=AB−BA, containing −iJX/n-\mathrm iJ_X/n−iJX​/n, −iJY/n-\mathrm iJ_Y/n−iJY​/n, and −2i∑q<rZqZr/[n(n−1)]-2\mathrm i\sum_{q<r}Z_qZ_r/[n(n-1)]−2i∑q<r​Zq​Zr​/[n(n−1)]. Then the image of this entire Lie algebra under BmB_mBm​ satisfies the disjunction

{Bm(A):A∈gn}={B∈Cdm×dm:B†=−B, tr⁡B=0}or{Bm(A):A∈gn}={B∈Cdm×dm:B†=−B}.\{B_m(A):A\in\mathfrak g_n\} =\{B\in\mathbb C^{d_m\times d_m}:B^\dagger=-B,\ \operatorname{tr}B=0\} \quad\text{or}\quad \{B_m(A):A\in\mathfrak g_n\} =\{B\in\mathbb C^{d_m\times d_m}:B^\dagger=-B\}.{Bm​(A):A∈gn​}={B∈Cdm​×dm​:B†=−B, trB=0}or{Bm​(A):A∈gn​}={B∈Cdm​×dm​:B†=−B}.

The disjunction is inclusive and does not specify which equality holds.

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