Proposition 17: rank-one matrix-unit projector refinement
ProvedQAlgorithms.Papers.Independent.Extend50.P31.proposition17_refinementLet 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.
In each fixed irrep coordinate basis define , for . Then
This describes the rank-one matrix-unit projector refinement 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.12, Proposition 17 Eqs.(56),(57). Trace/rank one are conclusions, not input fields. -/
theorem proposition17_refinement (D : Data G A n) :
(∀ a : OccurringIrrep D, centralMatrix D.U D.F a.val =
∑ i : Fin (D.F.dim a.val), fineMatrix D.U D.F a.val i) ∧
(∀ r s : Row D, fineMatrix D.U D.F r.1.val r.2 * fineMatrix D.U D.F s.1.val s.2 =
if r = s then fineMatrix D.U D.F r.1.val r.2 else 0) ∧
(∀ r : Row D, (fineMatrix D.U D.F r.1.val r.2)ᴴ = fineMatrix D.U D.F r.1.val r.2 ∧
Matrix.trace (fineMatrix D.U D.F r.1.val r.2) = 1 ∧
Matrix.rank (fineMatrix D.U D.F r.1.val r.2) = 1) := 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 . Put , let , and define
Then for every . For every , writing when ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.