Proof of Lemma 26, p. 17 — permutations of S(n−1) are invariant under the partial transposition ′ over the last subsystem
ProvedPTCommutant.OperatorBasis.ptLast_invariancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1partial-transposepermutation-operators
Let denote the permutation operator of on , and let be the partial transpose of on the last system. Regard as the permutations of fixing the last system. Then for all and :
- permutation operators of are invariant under partial transposition,
- they pass through the partial transposition,
This is the fact used in the proof of Lemma 26 to rewrite as (eq. (82)); it is what makes invariant under left and right multiplication by .
Formalization Note. The paper's is here; embeds into by liftPerm (k+1) 1. Statement (2) is the general form of the step in eq. (82); the case of eq. (82) is , , .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.