Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnormalized PBT operator trace

Proved
QAlgorithms.Papers.Independent.Extend50.P28.proposition45

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let n,d≥2n,d\ge2n,d≥2, let H=(Cd)⊗nH=(\mathbb C^d)^{\otimes n}H=(Cd)⊗n with its fixed computational orthonormal basis, and put N=n−1N=n-1N=n−1. For a=1,…,Na=1,\ldots,Na=1,…,N, let TaT_aTa​ be the last-factor partial transpose of the tensor permutation swapping aaa and nnn, and put ρ=∑aTa\rho=\sum_aT_aρ=∑a​Ta​. Write dηd_\etadη​ for the actual Specht dimension and mηm_\etamη​ for the multiplicity of that Specht module in the appropriate tensor permutation representation; these are defined by dimensions of actual intertwiner spaces.

Tr⁡Hρ=(n−1)dn−1.\operatorname{Tr}_H\rho=(n-1)d^{n-1}.TrH​ρ=(n−1)dn−1.

The trace is taken on the full tensor space without state normalization.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P28
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Extend50.P28

open scoped Matrix Matrix.Norms.L2Operator ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

local notation "Shape" => (fun k : ℕ => QAlgorithms.Schur.Partition k k)

local notation "Word" => (fun d n : ℕ => Fin n → Fin d)

/-- PDF p.21, Proposition 45, Eq.(103): full, unnormalized tensor trace. -/
theorem proposition45 (n d : ℕ) (hn : 2 ≤ n) (hd : 2 ≤ d) :
    (pbtOperator d (n - 1)).trace = (((n : ℂ) - 1) * (d : ℂ) ^ (n - 1)) := by sorry

end QAlgorithms.Papers.Independent.Extend50.P28

end
Source
Simplified formalism of the algebra of partially transposed permutation operators with applications, arXiv:1708.02434v2, PDF p. 21, Proposition 45
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For all natural numbers n,dn,dn,d with n≥2n\ge2n≥2 and d≥2d\ge2d≥2, set N=n−1N=n-1N=n−1. For words x,y:{0,…,N}→{0,…,d−1}x,y:\{0,\ldots,N\}\to\{0,\ldots,d-1\}x,y:{0,…,N}→{0,…,d−1} and a∈{0,…,N−1}a\in\{0,\ldots,N-1\}a∈{0,…,N−1}, let Da(x,y)D_a(x,y)Da​(x,y) be 111 when xa=xNx_a=x_Nxa​=xN​, ya=yNy_a=y_Nya​=yN​, and xb=ybx_b=y_bxb​=yb​ for every b∉{a,N}b\notin\{a,N\}b∈/{a,N}, and 000 otherwise. These are the entries obtained by transposing the last tensor factor of the permutation matrix swapping positions aaa and NNN. The complex trace of their sum satisfies

tr⁡ ⁣(∑a=0N−1Da)=(n−1)d n−1.\operatorname{tr}\!\left(\sum_{a=0}^{N-1}D_a\right) =(n-1)d^{\,n-1}.tr(a=0∑N−1​Da​)=(n−1)dn−1.
Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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