Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Antipodal spin coefficients and isometric embeddings

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.binomial_spinEmbeddings

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

prove2quantum

Let N,S≥0N,S\ge0N,S≥0 be integers, M=N+1M=N+1M=N+1, J=M/2>0J=M/2>0J=M/2>0, and let an integer K≥(S+1)MK\ge(S+1)MK≥(S+1)M count physical qubits. On spin labels m=0,…,Mm=0,\ldots,Mm=0,…,M, set vμ(m)=2−M/2(−1)μm(Mm)v_\mu(m)=2^{-M/2}(-1)^{\mu m}\sqrt{\binom M m}vμ​(m)=2−M/2(−1)μm(mM​)​. The usual spin-x matrix satisfies

Jxvμ=(−1)μM2vμ.J_xv_\mu=(-1)^\mu\frac M2v_\mu.Jx​vμ​=(−1)μ2M​vμ​.

The following three basis maps preserve inner products of all coefficient vectors: ∣m⟩↦∣(S+1)m⟩|m\rangle\mapsto|(S+1)m\rangle∣m⟩↦∣(S+1)m⟩ in one oscillator; ∣m⟩↦∣(S+1)(M−m),(S+1)m⟩|m\rangle\mapsto|(S+1)(M-m),(S+1)m\rangle∣m⟩↦∣(S+1)(M−m),(S+1)m⟩ in two oscillators; and ∣m⟩↦∣D(S+1)mK⟩|m\rangle\mapsto|D^K_{(S+1)m}\rangle∣m⟩↦∣D(S+1)mK​⟩, where the Dicke vector is the normalized equal sum of KKK-qubit words of the indicated weight. The first image of vμv_\muvμ​ is precisely the single-mode binomial codeword. The other images supply the two-mode and permutation-invariant descriptions. The two-mode total photon number is (S+1)M(S+1)M(S+1)M, so its physical Schwinger spin is (S+1)M/2(S+1)M/2(S+1)M/2, distinct from the coefficient spin M/2M/2M/2.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P65

open MeasureTheory Filter

open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

open scoped ComplexConjugate Matrix Topology

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF pp.14--15 (6.11)--(6.16): antipodal eigenvectors and their three isometric
coefficient embeddings. The physical Schwinger spin is (S+1)M/2; the transported
coefficient spin is M/2. Neither is silently substituted for the other.
Printed (6.16): 2J-(S+1)m; changed to (S+1)(2J-m), following the
preceding basis map and Fig.7(a), to retain fixed total occupation. -/
theorem binomial_spinEmbeddings (N S K : ℕ) (hK : (S + 1) * (N + 1) ≤ K) :
    (∀ mu : Fin 2, (spinX (N + 1)).mulVec (antipodal (N + 1) mu) =
      ((-1 : ℂ) ^ mu.val * ((N + 1 : ℕ) : ℂ) / 2) • antipodal (N + 1) mu ∧
      embedOne (N + 1) S (antipodal (N + 1) mu) = binomialCodeCoordinates N S mu) ∧
    (∀ v w : Fin (N + 2) → ℂ,
      fockInner (embedOne (N + 1) S v) (embedOne (N + 1) S w) = ∑ m, conj (v m) * w m) ∧
    (∀ v w : Fin (N + 2) → ℂ,
      (∑' n : ℕ × ℕ, conj (embedTwo (N + 1) S v n) * embedTwo (N + 1) S w n) =
        ∑ m, conj (v m) * w m) ∧
    (∀ v w : Fin (N + 2) → ℂ,
      (∑ x : Fin K → Fin 2, conj (embedDicke (N + 1) S K v x) * embedDicke (N + 1) S K w x) =
        ∑ m, conj (v m) * w m) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 14, §VI C, (6.11)–(6.16), Fig.7(a): spin-coherent characterization
Read-back

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

For all natural numbers N,S,KN,S,KN,S,K satisfying (S+1)(N+1)≤K(S+1)(N+1)\le K(S+1)(N+1)≤K, put M=N+1M=N+1M=N+1 and define, for μ∈{0,1}\mu\in\{0,1\}μ∈{0,1} and 0≤m≤M0\le m\le M0≤m≤M,

aμ(m)=(−1)μm(Mm)2M.a_\mu(m)=(-1)^{\mu m}\sqrt{\frac{\binom Mm}{2^M}}.aμ​(m)=(−1)μm2M(mM​)​​.

Let JJJ be the complex matrix indexed by 0,…,M0,\ldots,M0,…,M whose entries are

Jij={12(j+1)(M−j),i=j+1,12(i+1)(M−i),j=i+1,0,otherwise.J_{ij}= \begin{cases} \frac12\sqrt{(j+1)(M-j)},&i=j+1,\\ \frac12\sqrt{(i+1)(M-i)},&j=i+1,\\ 0,&\text{otherwise}. \end{cases}Jij​=⎩⎨⎧​21​(j+1)(M−j)​,21​(i+1)(M−i)​,0,​i=j+1,j=i+1,otherwise.​

For a coefficient vector vvv, define

E1(v)(n)=∑m=0M1{n=(S+1)m}vm,E2(v)(n1,n2)=∑m=0M1{(n1,n2)=((S+1)(M−m),(S+1)m)}vm,ED(v)(x)=∑m=0Mvm1{#{i:xi=1}=(S+1)m}(K(S+1)m),x∈{0,1}K.\begin{aligned} E_1(v)(n)&=\sum_{m=0}^{M}\mathbf1_{\{n=(S+1)m\}}v_m,\\ E_2(v)(n_1,n_2)&=\sum_{m=0}^{M} \mathbf1_{\{(n_1,n_2)=((S+1)(M-m),(S+1)m)\}}v_m,\\ E_D(v)(x)&=\sum_{m=0}^{M}v_m \frac{\mathbf1_{\{\#\{i:x_i=1\}=(S+1)m\}}} {\sqrt{\binom K{(S+1)m}}}, \qquad x\in\{0,1\}^K. \end{aligned}E1​(v)(n)E2​(v)(n1​,n2​)ED​(v)(x)​=m=0∑M​1{n=(S+1)m}​vm​,=m=0∑M​1{(n1​,n2​)=((S+1)(M−m),(S+1)m)}​vm​,=m=0∑M​vm​((S+1)mK​)​1{#{i:xi​=1}=(S+1)m}​​,x∈{0,1}K.​

Then, for each μ\muμ, Jaμ=(−1)μ(M/2)aμJa_\mu=(-1)^\mu(M/2)a_\muJaμ​=(−1)μ(M/2)aμ​, and E1(aμ)E_1(a_\mu)E1​(aμ​) equals the sequence that is zero unless nnn is divisible by S+1S+1S+1 and n/(S+1)≤N+1n/(S+1)\le N+1n/(S+1)≤N+1, and otherwise has value

(−1)μn/(S+1)(N+1n/(S+1))2N+1.(-1)^{\mu n/(S+1)} \frac{\sqrt{\binom{N+1}{n/(S+1)}}}{\sqrt{2^{N+1}}}.(−1)μn/(S+1)2N+1​(n/(S+1)N+1​)​​.

Moreover, for every pair of complex vectors v,wv,wv,w indexed by 0,…,N+10,\ldots,N+10,…,N+1,

∑n=0∞E1(v)(n)‾E1(w)(n)=∑m=0N+1vm‾wm,∑(n1,n2)∈N2E2(v)(n1,n2)‾E2(w)(n1,n2)=∑m=0N+1vm‾wm,∑x∈{0,1}KED(v)(x)‾ED(w)(x)=∑m=0N+1vm‾wm.\begin{aligned} \sum_{n=0}^{\infty}\overline{E_1(v)(n)}E_1(w)(n) &=\sum_{m=0}^{N+1}\overline{v_m}w_m,\\ \sum_{(n_1,n_2)\in\mathbb N^2}\overline{E_2(v)(n_1,n_2)}E_2(w)(n_1,n_2) &=\sum_{m=0}^{N+1}\overline{v_m}w_m,\\ \sum_{x\in\{0,1\}^K}\overline{E_D(v)(x)}E_D(w)(x) &=\sum_{m=0}^{N+1}\overline{v_m}w_m. \end{aligned}n=0∑∞​E1​(v)(n)​E1​(w)(n)(n1​,n2​)∈N2∑​E2​(v)(n1​,n2​)​E2​(w)(n1​,n2​)x∈{0,1}K∑​ED​(v)(x)​ED​(w)(x)​=m=0∑N+1​vm​​wm​,=m=0∑N+1​vm​​wm​,=m=0∑N+1​vm​​wm​.​

Here N=0N=0N=0 and S=0S=0S=0 are included, while the hypothesis forces K≥1K\ge1K≥1.

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