Unnormalized PBT operator trace
ProvedQAlgorithms.Papers.Independent.Extend50.P28.proposition45Let , let with its fixed computational orthonormal basis, and put . For , let be the last-factor partial transpose of the tensor permutation swapping and , and put . Write for the actual Specht dimension and for the multiplicity of that Specht module in the appropriate tensor permutation representation; these are defined by dimensions of actual intertwiner spaces.
The trace is taken on the full tensor space without state normalization.
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P28
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers with and , set . For words and , let be when , , and for every , and otherwise. These are the entries obtained by transposing the last tensor factor of the permutation matrix swapping positions and . The complex trace of their sum satisfies
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.