Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Lemma 26, p. 17 — permutations of S(n−1) are invariant under the partial transposition ′ over the last subsystem

Proved
PTCommutant.OperatorBasis.ptLast_invariance

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1partial-transposepermutation-operators

Let V(τ)V(\tau)V(τ) denote the permutation operator of τ∈S(n)\tau\in S(n)τ∈S(n) on (Cd)⊗n(\mathbb C^d)^{\otimes n}(Cd)⊗n, and let X′X'X′ be the partial transpose of XXX on the last system. Regard S(n−1)S(n-1)S(n−1) as the permutations of S(n)S(n)S(n) fixing the last system. Then for all ρ,ρ′∈S(n−1)\rho,\rho'\in S(n-1)ρ,ρ′∈S(n−1) and τ∈S(n)\tau\in S(n)τ∈S(n):

  1. permutation operators of S(n−1)S(n-1)S(n−1) are invariant under partial transposition,
V′(ρ)=V(ρ);V'(\rho)=V(\rho);V′(ρ)=V(ρ);
  1. they pass through the partial transposition,
V(ρ) V′(τ) V(ρ′)=V′(ρ∘τ∘ρ′).V(\rho)\,V'(\tau)\,V(\rho')=V'(\rho\circ\tau\circ\rho').V(ρ)V′(τ)V(ρ′)=V′(ρ∘τ∘ρ′).

This is the fact used in the proof of Lemma 26 to rewrite ΠbV(fab−1(σab))V′(n n−1)Πa−1\Pi_b V(f_{ab}^{-1}(\sigma_{ab}))V'(n\ n-1)\Pi_a^{-1}Πb​V(fab−1​(σab​))V′(n n−1)Πa−1​ as V′(πb∘fab−1(σab)∘(n n−1)∘πa−1)V'(\pi_b\circ f^{-1}_{ab}(\sigma_{ab})\circ(n\ n-1)\circ\pi_a^{-1})V′(πb​∘fab−1​(σab​)∘(n n−1)∘πa−1​) (eq. (82)); it is what makes A\mathcal AA invariant under left and right multiplication by S(n−1)S(n-1)S(n−1).

Formalization Note. The paper's nnn is k+2k+2k+2 here; S(n−1)S(n-1)S(n−1) embeds into S(n)S(n)S(n) by liftPerm (k+1) 1. Statement (2) is the general form of the step in eq. (82); the case of eq. (82) is ρ=πb∘fab−1(σab)\rho=\pi_b\circ f^{-1}_{ab}(\sigma_{ab})ρ=πb​∘fab−1​(σab​), τ=(n n−1)\tau=(n\ n-1)τ=(n n−1), ρ′=πa−1\rho'=\pi_a^{-1}ρ′=πa−1​.

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

theorem ptLast_invariance {d k : ℕ} (ρ ρ' : Equiv.Perm (Fin (k + 1)))
    (τ : Equiv.Perm (Fin (k + 2))) :
    ptLast (tensorPermutation d (k + 2) (liftPerm (k + 1) 1 ρ)) =
        tensorPermutation d (k + 2) (liftPerm (k + 1) 1 ρ) ∧
      tensorPermutation d (k + 2) (liftPerm (k + 1) 1 ρ) *
          ptLast (tensorPermutation d (k + 2) τ) *
          tensorPermutation d (k + 2) (liftPerm (k + 1) 1 ρ') =
        ptLast (tensorPermutation d (k + 2)
          (liftPerm (k + 1) 1 ρ * τ * liftPerm (k + 1) 1 ρ')) := by sorry

end PTCommutant.OperatorBasis
Source
Studziński, Horodecki, Mozrzymas, Commutant structuture of U⊗(n−1)⊗U* transformations, arXiv:1305.6183v2, p. 17, proof of Lemma 26 (eq. (82))
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