Theorem 58: norm, reconstruction and trace identities for raw eigenmatrices
ProvedQAlgorithms.Papers.Independent.Extend50.P31.theorem58_rawIdentitiesLet be a finite group and an ordinary unitary irreducible representation with . Fix a complete family of inequivalent unitary irreducibles , in fixed coordinate bases, with dimensions and characters . Assume , each occurring once. Throughout, , , and is unnormalized. Fine projectors use the diagonal matrix coefficient in place of the character. Whenever vectors occur, choose one pivot per fine sector with and set and . Write and when these spectral coordinates occur.
For occurring fine sectors , use the raw matrices , without normalizing and including zero pivots. Their norm, reconstruction and trace identities are
This describes the norm, reconstruction and trace identities for raw eigenmatrices in the fixed source conventions.
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P31
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Extend50.P31
open QAlgorithms.Papers.Independent.Information100.P44 (Mat matrixUnit)
open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)
open QAlgorithms.Papers.Independent.Bridge50.P37 (hsAdjoint)
open QAlgorithms.Papers.Independent.Information100.P34 (choi)
open QAlgorithms.Papers.Independent.Dependency50.P26 (TracePreserving)
open QAlgorithms.Papers.Independent.Dependency50.P16 (sandwich)
open QAlgorithms.Papers.Independent.Information100.P75 (phase)
variable {G A : Type*} [Group G] [Fintype G] [Fintype A] [DecidableEq A] {n : ℕ}
/-- PDF pp.31--32, Theorem 58 Eqs.(157)--(160), proof p.40 Eq.(192).
SOURCE CORRECTION: these are raw W, not normalized Eq.(62) V. At id and a diagonal
pivot, W=I/n has squared HS norm 1/n. Proof Eq.(194) also needs the omitted sum over s. -/
theorem theorem58_rawIdentities (D : Data G A n) :
(∀ r : Row D, ∀ p : Fin n × Fin n,
hs (rawMatrix D.U D.F r.1.val r.2 p) (rawMatrix D.U D.F r.1.val r.2 p) =
fineMatrix D.U D.F r.1.val r.2 p p) ∧
(∀ r : Row D, (∑ p : Fin n × Fin n,
hs (rawMatrix D.U D.F r.1.val r.2 p) (rawMatrix D.U D.F r.1.val r.2 p)) = 1) ∧
(∀ p : Fin n × Fin n, (∑ r : Row D, rawMatrix D.U D.F r.1.val r.2 p) = matrixUnit p.1 p.2) ∧
(∀ r : Row D, (∑ s : Fin n, rawMatrix D.U D.F r.1.val r.2 (s,s)) =
if r.1.val = D.F.trivial then 1 else 0) ∧
(∀ r : Row D, ∀ p : Fin n × Fin n, Matrix.trace (rawMatrix D.U D.F r.1.val r.2 p) =
if r.1.val = D.F.trivial ∧ p.1 = p.2 then 1 else 0) := by sorry
end QAlgorithms.Papers.Independent.Extend50.P31
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite group, a finite index type with decidable equality, and specify an irreducible unitary representation , , a complete family of pairwise inequivalent positive-dimensional irreducible unitary representations with designated one-dimensional trivial member , and an invertible complex-linear intertwining equivalence , each summand appearing once. Write . For and , define
and define . Then, for every , ; for every , ; for every , ; for every , if and equals the zero matrix otherwise; and, for every and , if both and , and equals otherwise.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.