Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

p. 9 (with eq. (11), p. 4) — V′(n−1, n) = Φ⁺_{n−1,n}, the unnormalized maximally entangled projector on the last two systems

Proved
PTCommutant.OperatorBasis.ptLast_swapLast

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

maximally-entangled-statep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1partial-transposepermutation-operators

Let (n n−1)(n\ n-1)(n n−1) be the transposition of the last two of nnn systems of Cd\mathbb C^dCd and V′(n n−1)V'(n\ n-1)V′(n n−1) the partial transpose, on the last system, of its permutation operator. Then

V′(n−1,n)=11…n−2⊗∑l,l′=1d∣ll⟩⟨l′l′∣=11…n−2⊗Φ~n−1,n+,V'(n-1,n)=\mathbb 1_{1\ldots n-2}\otimes\sum_{l,l'=1}^{d}|ll\rangle\langle l'l'|=\mathbb 1_{1\ldots n-2}\otimes\widetilde\Phi^+_{n-1,n},V′(n−1,n)=11…n−2​⊗l,l′=1∑d​∣ll⟩⟨l′l′∣=11…n−2​⊗Φn−1,n+​,

the identity on the first n−2n-2n−2 systems tensored with the unnormalized projector onto the maximally entangled vector ∑l∣ll⟩\sum_l|ll\rangle∑l​∣ll⟩ of systems n−1,nn-1,nn−1,n. Entrywise: the matrix element between basis strings xxx and yyy is 111 if xs=ysx_s=y_sxs​=ys​ for all s≤n−2s\le n-2s≤n−2, xn−1=xnx_{n-1}=x_nxn−1​=xn​ and yn−1=yny_{n-1}=y_nyn−1​=yn​, and 000 otherwise.

This identifies the only generator of A\mathcal AA on which the partial transposition acts non-trivially, and it is the operator through which every vijab(α)v^{ab}_{ij}(\alpha)vijab​(α) is built.

Formalization Note. n=m+2n=m+2n=m+2, systems are 0-based, so systems n−1,nn-1,nn−1,n are the indices mmm and m+1m+1m+1 and the first n−2n-2n−2 systems are the images of Fin.castLE from Fin m. On p. 9 Φ+\Phi^+Φ+ denotes the unnormalized projector (eq. (11) calls ∣Φ~+⟩|\widetilde\Phi^+\rangle∣Φ+⟩ "unnormalized"); the statement is the unnormalized form, which is d⋅1⊗∣Φ+⟩⟨Φ+∣d\cdot\mathbb 1\otimes|\Phi^+\rangle\langle\Phi^+|d⋅1⊗∣Φ+⟩⟨Φ+∣ for the normalized ∣Φ+⟩|\Phi^+\rangle∣Φ+⟩ of Remark 3.

Preamble
import Mathlib
import Definitions.Def_PTCommutant_OperatorBasis_Model
Formal statement
namespace PTCommutant.OperatorBasis
open QAlgorithms.Schur

theorem ptLast_swapLast {m d : ℕ} (x y : Site d (m + 2)) :
    ptLast (tensorPermutation d (m + 2) (swapLast m)) x y =
      if (∀ i : Fin m, x (Fin.castLE (by omega) i) = y (Fin.castLE (by omega) i)) ∧
          x ⟨m, by omega⟩ = x (Fin.last (m + 1)) ∧ y ⟨m, by omega⟩ = y (Fin.last (m + 1))
        then 1 else 0 := by sorry

end PTCommutant.OperatorBasis
Source
Studziński, Horodecki, Mozrzymas, Commutant structuture of U⊗(n−1)⊗U* transformations, arXiv:1305.6183v2, p. 9 (§IV.A, generators of M: V′(n−1, n) = Φ⁺_{n−1,n}); eq. (11) p. 4
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me