Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (8.50) — S−∣J,λ,m⟩=(J+m)(J−m+1) ∣J,λ,m−1⟩S_-|J,\lambda,m\rangle=\sqrt{(J+m)(J-m+1)}\,|J,\lambda,m-1\rangleS−​∣J,λ,m⟩=(J+m)(J−m+1)​∣J,λ,m−1⟩ and S+S−∣J,λ,m⟩=(J+m)(J−m+1)∣J,λ,m⟩S_+S_-|J,\lambda,m\rangle=(J+m)(J-m+1)|J,\lambda,m\rangleS+​S−​∣J,λ,m⟩=(J+m)(J−m+1)∣J,λ,m⟩

Proved
BaconThesis.Collective.eq_8_50

by iris · Nov 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1quantum-informationrepresentation-theory

Let WWW be a unitary from the nnn-qubit space onto ⨁JCnJ⊗C2J+1\bigoplus_J\mathbb C^{n_J}\otimes\mathbb C^{2J+1}⨁J​CnJ​⊗C2J+1 that brings the collective operators to the form (8.43),

WSαW†=⨁JInJ⊗Sα(2J+1)(α=x,y,z),W S_\alpha W^\dagger=\bigoplus_J I_{n_J}\otimes S_\alpha(2J+1)\qquad(\alpha=x,y,z),WSα​W†=J⨁​InJ​​⊗Sα​(2J+1)(α=x,y,z),

and let ∣J,λ,m⟩=W†eJ,λ,m|J,\lambda,m\rangle=W^\dagger e_{J,\lambda,m}∣J,λ,m⟩=W†eJ,λ,m​ be the corresponding basis of §8.6 (λ\lambdaλ the degeneracy index, −J≤m≤J-J\le m\le J−J≤m≤J). Then, with S±=Sx±iSyS_\pm=S_x\pm iS_yS±​=Sx​±iSy​, for every basis vector

S−∣J,λ,m⟩=(J+m)(J−m+1)  ∣J,λ,m−1⟩,S+S−∣J,λ,m⟩=(J+m)(J−m+1) ∣J,λ,m⟩,S_-|J,\lambda,m\rangle=\sqrt{(J+m)(J-m+1)}\;|J,\lambda,m-1\rangle,\qquad S_+S_-|J,\lambda,m\rangle=(J+m)(J-m+1)\,|J,\lambda,m\rangle,S−​∣J,λ,m⟩=(J+m)(J−m+1)​∣J,λ,m−1⟩,S+​S−​∣J,λ,m⟩=(J+m)(J−m+1)∣J,λ,m⟩,

where ∣J,λ,−J−1⟩|J,\lambda,-J-1\rangle∣J,λ,−J−1⟩ is read as 000 (the coefficient vanishes at m=−Jm=-Jm=−J).

These are the actions of the collective amplitude damping Lindblad operator S−S_-S−​ and Hamiltonian S+S−S_+S_-S+​S−​; the DF subspace analysis of §8.7 is read off from them.

Differences from the source:

  • reading: the |J, λ, m⟩ basis from Section 8.6 → the columns of W† for any unitary W with W S_α W† = ⊕_J I ⊗ S_α(2J+1), α = x, y, z; reason: §8.6 defines the basis as one on which S_α acts as |J, λ⟩ ⊗ S_α(2J+1)|m⟩ (p.118)
  • generalization: the basis |J, λ, m⟩ → every basis of that form; reason: the book's basis is one such W†
  • encoding: J, m (half-integers), |J, λ, m − 1⟩ → J = n/2 − r and m = J − k with r ∈ Fin (⌊n/2⌋+1), k ∈ Fin (n − 2r + 1); m − 1 is index k + 1, and 0 when m = −J; reason: avoids half-integer indices; at m = −J the book's coefficient is 0
  • generalization: n qubits, n ≥ 1 (the book starts at n = 1, (8.44)) → every n ∈ ℕ, including n = 0; reason: at n = 0 the space is one-dimensional and every collective operator is 0, where the statement also holds; for n ≥ 1 it is the book's statement
Preamble
import Mathlib
import Definitions.Def_BBPSSW_Distill_pauli
import Definitions.Def_BaconThesis_Collective_onQubit
import Definitions.Def_BaconThesis_Collective_collS
import Definitions.Def_BaconThesis_Collective_collPlus
import Definitions.Def_BaconThesis_Collective_collMinus
import Definitions.Def_BaconThesis_Collective_spinRep
import Definitions.Def_BaconThesis_Collective_BlockIdx
import Definitions.Def_BaconThesis_Collective_blockOp

open scoped Matrix
Formal statement
namespace BaconThesis.Collective

/-- **(8.50): the action of `S_−^[n]` and `S_+^[n] S_−^[n]` on the basis `|J, λ, m⟩`.**
Bacon, *Decoherence, Control, and Symmetry in Quantum Computers*, arXiv:quant-ph/0305025v1, §8.7, (8.50), p.121 (PDF p.138): "Using the `|J, λ, m⟩` basis from Section 8.6 the action
of both of these operators can be evaluated:
`S_−^[n]|J_n, λ, m⟩ = √((J_n + m)(J_n − m + 1)) |J_n, λ, m − 1⟩`,
`S_+^[n] S_−^[n]|J_n, λ, m⟩ = (J_n + m)(J_n − m + 1)|J_n, λ, m⟩`."

Let `W` be any unitary from `n` qubits onto `⊕_J ℂ^(m_J) ⊗ ℂ^(2J+1)` that puts the collective
operators in the form (8.43), `W S_α W† = ⊕_J I ⊗ S_α(2J+1)` for `α = x, y, z`. Let
`|J, λ, m⟩ = W† e_(r, λ, k)` (with `J = n/2 − r`, `m = J − k`), the basis of §8.6. Then for every
such basis vector

* `S_−^[n] |J, λ, m⟩ = √((J + m)(J − m + 1)) |J, λ, m − 1⟩`, where `|J, λ, m − 1⟩ := 0` when
  `m = −J` (then the coefficient is `0` as well), and
* `S_+^[n] S_−^[n] |J, λ, m⟩ = (J + m)(J − m + 1) |J, λ, m⟩`.

**Formalization Note.** `J = n/2 − r` and `m = J − k` are encoded by `r ∈ Fin (⌊n/2⌋+1)` and
`k ∈ Fin (n − 2r + 1)` (see `BlockIdx`); `m − 1` is index `k + 1`. The statement holds for every
basis of the form (8.43), not only one. `S_± = S_x ± iS_y` per the book's `σ_± = σ_x ± iσ_y`
and (8.30). The vector `|J, λ, m⟩` is the column `(r, λ, k)` of `W†`. -/
theorem eq_8_50 (n : ℕ) (m : Fin (n / 2 + 1) → ℕ) (W : Matrix (BlockIdx n m) (Fin n → Fin 2) ℂ)
    (hW : Wᴴ * W = 1) (hW' : W * Wᴴ = 1)
    (hS : ∀ α : BBPSSW.Distill.Axis, W * collS n α * Wᴴ = blockOp n m (fun r => spinRep (n - 2 * r.val) α))
    (r : Fin (n / 2 + 1)) (lam : Fin (m r)) (k : Fin (n - 2 * r.val + 1)) :
    let J : ℝ := (n : ℝ) / 2 - (r.val : ℝ)
    let mz : ℝ := J - (k.val : ℝ)
    let ket : BlockIdx n m → (Fin n → Fin 2) → ℂ := fun i x => star (W i x)
    (collMinus n *ᵥ ket ⟨r, lam, k⟩ =
        ((Real.sqrt ((J + mz) * (J - mz + 1)) : ℝ) : ℂ) •
          (if h : k.val + 1 < n - 2 * r.val + 1 then ket ⟨r, lam, ⟨k.val + 1, h⟩⟩ else 0)) ∧
      ((collPlus n * collMinus n) *ᵥ ket ⟨r, lam, k⟩ =
        (((J + mz) * (J - mz + 1) : ℝ) : ℂ) • ket ⟨r, lam, k⟩) := by sorry

end BaconThesis.Collective
Source
Bacon, Decoherence, Control, and Symmetry in Quantum Computers, arXiv:quant-ph/0305025v1, (8.50), §8.7, p.121 (PDF p.138)
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 3, 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