Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Physical total-spin decomposition of the signal sum

Open
QAlgorithms.Papers.Independent.Intakenext100.P53.total_spin_decomposition

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N≥1N\ge1N≥1 and d≥2d\ge2d≥2 be integers. Alice and Bob have NNN ordered ddd-dimensional ports, and the input register CCC has dimension ddd. Write s=(d−1)/2s=(d-1)/2s=(d−1)/2 and ∣S⟩=d−1/2∑m=−ss(−1)s−m∣s,m⟩∣s,−m⟩|S\rangle=d^{-1/2}\sum_{m=-s}^s(-1)^{s-m}|s,m\rangle|s,-m\rangle∣S⟩=d−1/2∑m=−ss​(−1)s−m∣s,m⟩∣s,−m⟩. Put Pi=∣S⟩⟨S∣AiC⊗IAˉiP_i=|S\rangle\langle S|_{A_iC}\otimes I_{\bar A_i}Pi​=∣S⟩⟨S∣Ai​C​⊗IAˉi​​, σi=d−(N−1)Pi\sigma_i=d^{-(N-1)}P_iσi​=d−(N−1)Pi​, and ρ=∑iσi\rho=\sum_i\sigma_iρ=∑i​σi​. A resource filter OOO gives ∣ΨO⟩=(OA⊗IB)∣S⟩⊗N|\Psi_O\rangle=(O_A\otimes I_B)|S\rangle^{\otimes N}∣ΨO​⟩=(OA​⊗IB​)∣S⟩⊗N and obeys tr⁡(O†O)=dN\operatorname{tr}(O^\dagger O)=d^Ntr(O†O)=dN. Alice measures ACACAC; Bob selects the reported port and discards the others. Entanglement fidelities are tested against a normalized reference-input singlet, with no correction on the selected port.

Let PAˉi(j)P_{\bar A_i}(j)PAˉi​​(j) be the spectral projector of the physical complementary-register squared angular momentum onto eigenvalue j(j+1)j(j+1)j(j+1), and define

ρj=d−(N−1)∑i∣S⟩⟨S∣AiC⊗PAˉi(j).\rho_j=d^{-(N-1)}\sum_i |S\rangle\langle S|_{A_iC}\otimes P_{\bar A_i}(j).ρj​=d−(N−1)i∑​∣S⟩⟨S∣Ai​C​⊗PAˉi​​(j).

Then ρ=∑jρj\rho=\sum_j\rho_jρ=∑j​ρj​. Each ρj\rho_jρj​ is supported on the actual total-spin-jjj sector of ACACAC and commutes with the total zzz component. For j≠j′j\ne j'j=j′, ρjρj′=0\rho_j\rho_{j'}=0ρj​ρj′​=0, hence its trace is zero. Only j≤(N−1)sj\le(N-1)sj≤(N−1)s with the physical parity can occur. Impossible sectors have zero projectors; at N=1N=1N=1 the complement is the one-dimensional spin-zero vacuum. This is total-spin block diagonality, without an additional SAS_ASA​ claim for general ddd.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P53
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P53

open scoped Classical ComplexConjugate ComplexOrder Matrix Matrix.Norms.L2Operator

-- Accepted generic matrix and positive-operator interfaces. The support is the
-- orthogonal range projection; all uses below are on positive physical rho.

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

open QAlgorithms.Papers.Independent.Information100.P07 (support)

open QAlgorithms.Papers.Independent.Next46.P39 (inverseSqrt)

/-- PDF p.2, Eqs.(7)-(8): full physical spin decomposition. The vacuum
complement at N=1 has spin zero. No S_A block diagonality is claimed for d>2. -/
theorem total_spin_decomposition (d N : ℕ) (hd : 2 ≤ d) (hN : 1 ≤ N) :
    pbtRho d N = ∑ t ∈ Finset.range ((N - 1) * (d - 1) + 1), rhoSpinBlock d N t ∧
    (∀ t : ℕ,
      casimirProjector (totalCasimir d N) t * rhoSpinBlock d N t = rhoSpinBlock d N t ∧
      rhoSpinBlock d N t * casimirProjector (totalCasimir d N) t = rhoSpinBlock d N t ∧
      totalComponent d N (quditSpinZ d) * rhoSpinBlock d N t =
        rhoSpinBlock d N t * totalComponent d N (quditSpinZ d)) ∧
    (∀ t u : ℕ, t ≠ u → rhoSpinBlock d N t * rhoSpinBlock d N u = 0 ∧
      Matrix.trace (rhoSpinBlock d N t * rhoSpinBlock d N u) = 0) ∧
    (∀ t : ℕ, (N - 1) * (d - 1) < t ∨ t % 2 ≠ ((N - 1) * (d - 1)) % 2 →
      rhoSpinBlock d N t = 0) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P53

end
Source
Some remarks on port-based teleportation, arXiv:1506.01555v2, PDF p. 2, II, Eqs.(7)-(8): total-spin block decomposition of rho
Read-back

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

For all natural numbers d,Nd,Nd,N satisfying 2≤d2\le d2≤d and 1≤N1\le N1≤N, consider A=[d][N]×[d]\mathcal A=[d]^{[N]}\times[d]A=[d][N]×[d]. Let Si:C[d][N]∖{i}→CAS_i:\mathbb C^{[d]^{[N]\setminus\{i\}}}\to\mathbb C^{\mathcal A}Si​:C[d][N]∖{i}→CA have entry (−1)xi/d(-1)^{x_i}/\sqrt d(−1)xi​/d​ from aaa to (x,c)(x,c)(x,c) if c=d−1−xic=d-1-x_ic=d−1−xi​ and x∣[N]∖{i}=ax|_{[N]\setminus\{i\}}=ax∣[N]∖{i}​=a, and entry zero otherwise. Define Jz=diag⁡((d−1)/2−r)J_z=\operatorname{diag}((d-1)/2-r)Jz​=diag((d−1)/2−r), (J+)rs=(r+1)(d−1−r)(J_+)_{rs}=\sqrt{(r+1)(d-1-r)}(J+​)rs​=(r+1)(d−1−r)​ if s=r+1s=r+1s=r+1 and zero otherwise, Jx=(J++J+†)/2J_x=(J_++J_+^\dagger)/2Jx​=(J+​+J+†​)/2, Jy=(J+−J+†)/(2i)J_y=(J_+-J_+^\dagger)/(2\mathrm i)Jy​=(J+​−J+†​)/(2i), and CW=∑α=x,y,z(∑j∈WJα(j))2C_W=\sum_{\alpha=x,y,z}(\sum_{j\in W}J_\alpha^{(j)})^2CW​=∑α=x,y,z​(∑j∈W​Jα(j)​)2, with identities on unaffected sites. Write Pt(C)=1{(t/2)(t/2+1)}(C)P_t(C)=\mathbf1_{\{(t/2)(t/2+1)\}}(C)Pt​(C)=1{(t/2)(t/2+1)}​(C), using continuous functional calculus, and put H=d−(N−1)∑iSiSi†H=d^{-(N-1)}\sum_iS_iS_i^\daggerH=d−(N−1)∑i​Si​Si†​, Ht=d−(N−1)∑iSiPt(C[N]∖{i})Si†H_t=d^{-(N-1)}\sum_iS_iP_t(C_{[N]\setminus\{i\}})S_i^\daggerHt​=d−(N−1)∑i​Si​Pt​(C[N]∖{i}​)Si†​, Kα=(∑j∈[N]Jα(j))⊗Id+I⊗JαK_\alpha=(\sum_{j\in[N]}J_\alpha^{(j)})\otimes I_d+I\otimes J_\alphaKα​=(∑j∈[N]​Jα(j)​)⊗Id​+I⊗Jα​, and Ctot=Kx2+Ky2+Kz2C_{\mathrm{tot}}=K_x^2+K_y^2+K_z^2Ctot​=Kx2​+Ky2​+Kz2​. With T=(N−1)(d−1)T=(N-1)(d-1)T=(N−1)(d−1), the theorem asserts all of the following:

H=∑t=0THt;Pt(Ctot)Ht=Ht=HtPt(Ctot),KzHt=HtKz(t∈N);H=\sum_{t=0}^{T}H_t;\qquad P_t(C_{\mathrm{tot}})H_t=H_t=H_tP_t(C_{\mathrm{tot}}),\quad K_zH_t=H_tK_z \quad(t\in\mathbb N);H=t=0∑T​Ht​;Pt​(Ctot​)Ht​=Ht​=Ht​Pt​(Ctot​),Kz​Ht​=Ht​Kz​(t∈N); HtHu=0,tr⁡(HtHu)=0(t,u∈N, t≠u);Ht=0if t>T or t mod 2≠T mod 2.H_tH_u=0,\quad\operatorname{tr}(H_tH_u)=0 \quad(t,u\in\mathbb N,\ t\ne u); \qquad H_t=0\quad\text{if }t>T\text{ or }t\bmod2\ne T\bmod2.Ht​Hu​=0,tr(Ht​Hu​)=0(t,u∈N, t=u);Ht​=0if t>T or tmod2=Tmod2.

The trace equality is an equality of complex numbers. The hypotheses include N=1N=1N=1, when T=0T=0T=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