Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

SM Eq. (6), Supplemental Material p. 1 — the flip in su(d) generators: F_ij = Σ_{α,β} S^{αβ}_i S^{βα}_j + 𝟙/d

Proved
WernerExt.TwoSided.flip_generators

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

casimir-operatorp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1werner-state

Let d≥2d\ge2d≥2 and Sαβ=∣β⟩⟨α∣−1dδβα1S^{\alpha\beta}=|\beta\rangle\langle\alpha|-\frac1d\delta_{\beta\alpha}\mathbb 1Sαβ=∣β⟩⟨α∣−d1​δβα​1 (α,β=1,…,d\alpha,\beta=1,\dots,dα,β=1,…,d) be the su(d)\mathfrak{su}(d)su(d) generators. Then

  1. on two ddd-level sites,
F=∑α,β=1dSαβ⊗Sβα+1d;F=\sum_{\alpha,\beta=1}^dS^{\alpha\beta}\otimes S^{\beta\alpha}+\frac{\mathbb 1}{d};F=α,β=1∑d​Sαβ⊗Sβα+d1​;
  1. on the joint system, for every Alice site iii and Bob site jjj,
Fij=∑α,β=1dSiαβSjβα+1d,F_{ij}=\sum_{\alpha,\beta=1}^dS^{\alpha\beta}_iS^{\beta\alpha}_j+\frac{\mathbb 1}{d},Fij​=α,β=1∑d​Siαβ​Sjβα​+d1​,

where SiS_iSi​ acts on Alice's site iii and SjS_jSj​ on Bob's site jjj.

This identity rewrites the Hamiltonian HWH^WHW through quadratic Casimir operators (Eq. (5)).

Formalization Note The basis of Cd\mathbb C^dCd is indexed by Fin d.

Differences from the source:

  • encoding: F_ij on two tensor components of an n-fold product → clause 1, the identity on two sites, and clause 2, its embedding at Alice's site i and Bob's site j of the joint system; reason: (6) is an identity of operators on two tensor factors; clause 2 is the embedding the mission uses
  • encoding: basis |1⟩, …, |d⟩ → basis indexed by Fin d; reason: Lean indexing convention; same instances
Preamble
import Mathlib
import Definitions.Def_WernerExt_TwoSided_Model
Formal statement
namespace WernerExt.TwoSided

open Matrix
open scoped Kronecker ComplexOrder

/-- SM Eq. (6), SM p. 1: the flip in terms of the `su(d)` generators,
`F_ij = ∑_{α,β} S^{αβ}_i S^{βα}_j + 𝟙/d`, (a) on two `d`-level sites and (b) for Alice's site
`i` and Bob's site `j` of the joint system. -/
theorem flip_generators (d : ℕ) (hd : 2 ≤ d) :
    flip d = ∑ a : Fin d, ∑ b : Fin d, (gen d a b ⊗ₖ gen d b a) +
        ((d : ℂ)⁻¹) • (1 : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ) ∧
      ∀ (nA nB : ℕ) (i : Fin nA) (j : Fin nB),
        flipAB (d := d) i j =
          ∑ a : Fin d, ∑ b : Fin d,
            (siteOp i (gen d a b) ⊗ₖ (1 : Matrix (Fin nB → Fin d) (Fin nB → Fin d) ℂ)) *
              ((1 : Matrix (Fin nA → Fin d) (Fin nA → Fin d) ℂ) ⊗ₖ siteOp j (gen d b a)) +
          ((d : ℂ)⁻¹) • (1 : Matrix (Cfg d nA nB) (Cfg d nA nB) ℂ) := by sorry

end WernerExt.TwoSided
Source
Jakab, Solymos, Zimborás, Extendibility of Werner States, arXiv:2208.13743v2, Supplemental Material p. 1 (PDF 7), SM Eq. (6)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · 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