Lemma 57: raw eigenmatrices vanish for absent irreps
ProvedQAlgorithms.Papers.Independent.Extend50.P31.lemma57_absentRawLet 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 every absent irreducible label , every and every pivot , the raw matrix vanishes:
This describes the raw eigenmatrices vanish for absent irreps 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 p.31, Lemma 57 Eq.(156): raw W, so absent labels and zero pivots are meaningful. -/
theorem lemma57_absentRaw (D : Data G A n) (a : A) (ha : a ∉ D.theta)
(i : Fin (D.F.dim a)) (p : Fin n × Fin n) :
rawMatrix D.U D.F a i p = 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 consist of an irreducible unitary representation , , a complete family of pairwise inequivalent positive-dimensional irreducible unitary representations, including a designated one-dimensional trivial member, and an invertible complex-linear intertwining equivalence for a subset , each summand appearing once. For every satisfying , every , and every pair , the matrix
is zero, where has its only nonzero entry, equal to , at . If , there is no index satisfying the absent-index hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.