Lemma 5.4: norms of Fourier states under a multiplicity-free restriction
OpenSemisimpleQFT.lemma_5_4diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory
Let be semisimple algebras with a -adapted Fourier basis of and multiplicity-free branching, and assume is -nice with respect to its computational basis. For and basis indices of , let be the number of irreps with . Then
i.e. where is the sum on the right. The norm of is taken in the computational inner product of .
Preamble
import Definitions.Def_SemisimpleQFT_Fourier open scoped BigOperators ComplexConjugate
Formal statement
namespace SemisimpleQFT
open Classical in
theorem lemma_5_4 {R : Type*} [Ring R] [Algebra ℂ R] {A B : Subalgebra ℂ R} (hBA : B ≤ A)
{ΛA ΛB : Type*} {JA JB : Type*} [Fintype JA] [DecidableEq JA] [Fintype JB] [DecidableEq JB]
{ι : Type*} [Fintype ι] [DecidableEq ι]
(FA : FourierData A ΛA JA) (FB : FourierData B ΛB JB) (tr : JA → JB)
(h : IsAdapted hBA FA FB tr) (c : CompBasis A ι) (δ : ℝ) (hδ : FA.IsNice c δ)
(k l : JB) (hkl : FB.lab k = FB.lab l) :
|c.norm (⟨((FB.E k l : B) : R), hBA (FB.E k l).2⟩ : A) ^ 2 -
∑ P : JA, ∑ Q : JA,
if FA.lab P = FA.lab Q ∧ tr P = k ∧ tr Q = l then c.norm (FA.E P Q) ^ 2 else 0| ≤
((Nat.card {PQ : JA × JA // FA.lab PQ.1 = FA.lab PQ.2 ∧ tr PQ.1 = k ∧ tr PQ.2 = l} : ℝ) - 1) *
δ * ∑ P : JA, ∑ Q : JA,
if FA.lab P = FA.lab Q ∧ tr P = k ∧ tr Q = l then c.norm (FA.E P Q) ^ 2 else 0 := by sorry
end SemisimpleQFTSource
B. Foxman, B. Nehoran, Y. Ding, Efficient Quantum Fourier Transforms For Semisimple Algebras, https://arxiv.org/abs/2605.05337, p. 33, Lemma 5.4, Eq. (5.13)
Human review
Confirmed by the mission captain (proposal self-audit).