Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered trainability statistic for symmetric pure states

Proved
QAlgorithms.Papers.Independent.Support50.P30.symmetricPureState_delta

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

prove2quantum

Let n≥1n\ge1n≥1 and let ψ\psiψ be a normalized pure state invariant under every qubit permutation. In any fixed orthonormal Schur coordinates, its density matrix ρ=∣ψ⟩⟨ψ∣\rho=|\psi\rangle\langle\psi|ρ=∣ψ⟩⟨ψ∣ is supported in the symmetric sector λ=(n,0)\lambda=(n,0)λ=(n,0), of dimension n+1n+1n+1 and multiplicity one. Its centered statistic is

Δ(ρ(n,0))=1−1n+1,12≤Δ(ρ(n,0))≤1.\Delta(\rho_{(n,0)})=1-\frac1{n+1},\qquad \frac12\le\Delta(\rho_{(n,0)})\le1.Δ(ρ(n,0)​)=1−n+11​,21​≤Δ(ρ(n,0)​)≤1.

This gives a state-independent Θ(1)\Theta(1)Θ(1) data statistic. It does not by itself guarantee a nonzero derivative in every generator and measurement direction.

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.29, Example 1's single-state identity, with a uniform Theta(1)
bound. No conclusion of nonzero gradients in every direction is asserted. -/
theorem symmetricPureState_delta {n : ℕ} (hn : 1 ≤ n) (S : SchurFrame n)
    (psi : EuclideanSpace ℂ (Qubits n)) (hpsi : IsState psi)
    (hsym : ∀ p : Equiv.Perm (Fin n), act (qubitPermutationMatrix n p) psi = psi) :
    centeredDelta (aggregate S (symmetricSector n) (pureDensity psi)) = 1 - 1 / ((n : ℝ) + 1) ∧
    (1 / 2 : ℝ) ≤ centeredDelta (aggregate S (symmetricSector n) (pureDensity psi)) ∧
    centeredDelta (aggregate S (symmetricSector n) (pureDensity psi)) ≤ 1 := by sorry

end QAlgorithms.Papers.Independent.Support50.P30

end
Source
Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks, arXiv:2210.09974v3, PDF p. 29, Unnumbered trainability statistic for symmetric pure states
Read-back

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

For every natural number n≥1n\ge1n≥1, every Schur frame SSS described below, and every complex vector ψ\psiψ indexed by nnn-bit strings such that ∥ψ∥2=1\|\psi\|_2=1∥ψ∥2​=1 and Ppψ=ψP_p\psi=\psiPp​ψ=ψ for every permutation ppp of the qubit positions, the following identities and inequalities hold; here Pp∣x⟩=∣x∘p−1⟩P_p|x\rangle=|x\circ p^{-1}\ranglePp​∣x⟩=∣x∘p−1⟩. For sectors 0≤h≤⌊n/2⌋0\le h\le\lfloor n/2\rfloor0≤h≤⌊n/2⌋, put dh=n−2h+1d_h=n-2h+1dh​=n−2h+1 and rh=(nh)−(nh−1)r_h=\binom nh-\binom n{h-1}rh​=(hn​)−(h−1n​) for h>0h>0h>0, with r0=1r_0=1r0​=1. A Schur frame is a matrix SSS with columns indexed by bit strings and rows indexed by (h,ν,j)(h,\nu,j)(h,ν,j) for 0≤ν<rh0\le\nu<r_h0≤ν<rh​ and 0≤j<dh0\le j<d_h0≤j<dh​, satisfying SS†=S†S=ISS^\dagger=S^\dagger S=ISS†=S†S=I; conjugation by SSS sends every matrix commuting with all PpP_pPp​ to block diagonal form with rhr_hrh​ identical blocks of size dhd_hdh​ in sector hhh. It also sends JX2+JY2+JZ2J_X^2+J_Y^2+J_Z^2JX2​+JY2​+JZ2​ to repeated sector-hhh blocks (n−2h)(n−2h+2)Idh(n-2h)(n-2h+2)I_{d_h}(n−2h)(n−2h+2)Idh​​, where JχJ_\chiJχ​ is the sum of the usual single-qubit Pauli matrix χ∈{X,Y,Z}\chi\in\{X,Y,Z\}χ∈{X,Y,Z} over all qubit positions. Let R0,νR_{0,\nu}R0,ν​ denote the rows of SSS in sector 000 and copy ν\nuν, define the matrix ρψ\rho_\psiρψ​ by (ρψ)x,y=ψxψy‾(\rho_\psi)_{x,y}=\psi_x\overline{\psi_y}(ρψ​)x,y​=ψx​ψy​​, and set

A=∑ν=0r0−1R0,νρψR0,ν†,Δ(A)=Re⁡(tr⁡(A2)−(tr⁡A)2n+1).A=\sum_{\nu=0}^{r_0-1}R_{0,\nu}\rho_\psi R_{0,\nu}^\dagger,\qquad \Delta(A)=\operatorname{Re}\left(\operatorname{tr}(A^2) -\frac{(\operatorname{tr}A)^2}{n+1}\right).A=ν=0∑r0​−1​R0,ν​ρψ​R0,ν†​,Δ(A)=Re(tr(A2)−n+1(trA)2​).

Then all three assertions hold:

Δ(A)=1−1n+1,12≤Δ(A),Δ(A)≤1.\Delta(A)=1-\frac1{n+1},\qquad \frac12\le\Delta(A),\qquad \Delta(A)\le1.Δ(A)=1−n+11​,21​≤Δ(A),Δ(A)≤1.
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