Proposition 20: explicit normalized eigenmatrices
ProvedQAlgorithms.Papers.Independent.Extend50.P31.proposition20_eigenmatricesLet 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.
Write for a fine sector, set and . Every sector has a pivot with . For every such pivot set . These matrices have Hilbert–Schmidt norm one, satisfy the fine eigenmatrix equations, and any unit eigenmatrix in the range of is one of them up to a unit phase. For valid pivots and a real phase ,
The raw matrices and the normalized matrices are different objects. No rank or norm statement is assumed as input; these are conclusions of the construction.
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.13, Proposition 20 Eqs.(61)--(63). Eq.(62) constructs normalized representatives;
an arbitrary unit eigenmatrix is one of these up to phase. Eq.(67) instead concerns raw matrices. -/
theorem proposition20_eigenmatrices (D : Data G A n) :
(∀ r : Row D, ∃ p : Fin n × Fin n, 0 < pivotWeight D.U D.F r.1.val r.2 p) ∧
(∀ r : Row D, ∀ p, 0 < pivotWeight D.U D.F r.1.val r.2 p →
hs (normalizedMatrix D.U D.F r.1.val r.2 p) (normalizedMatrix D.U D.F r.1.val r.2 p) = 1 ∧
∀ s : Row D, fineMap D.U D.F s.1.val s.2 (normalizedMatrix D.U D.F r.1.val r.2 p) =
if s = r then normalizedMatrix D.U D.F r.1.val r.2 p else 0) ∧
(∀ r s : Row D, ∀ p q,
0 < pivotWeight D.U D.F r.1.val r.2 p → 0 < pivotWeight D.U D.F s.1.val s.2 q →
∃ zeta : ℝ, hs (normalizedMatrix D.U D.F r.1.val r.2 p)
(normalizedMatrix D.U D.F s.1.val s.2 q) = if r = s then phase zeta else 0) ∧
(∀ r : Row D, ∀ X : Mat n, hs X X = 1 → fineMap D.U D.F r.1.val r.2 X = X →
∃ p : Fin n × Fin n, 0 < pivotWeight D.U D.F r.1.val r.2 p ∧
∃ zeta : ℝ, X = phase zeta • normalizedMatrix D.U D.F r.1.val r.2 p) := 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 set with decidable equality, and consist of an irreducible unitary representation , , a complete family of pairwise inequivalent irreducible unitary representations of positive dimensions , including a designated one-dimensional trivial member, and a subset with a complex-linear intertwining isomorphism . Let . For , define
and, for a coordinate pair , put and , where has sole nonzero entry at , and the reciprocal square root uses the total real square-root and inverse operations. With , the following hold: every has some with ; whenever , and equals if , and otherwise, for every ; for every with and , there is such that
and, for every and every satisfying and , there exist with and such that .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.