Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.4: norms of Fourier states under a multiplicity-free restriction

Open
SemisimpleQFT.lemma_5_4

by Shuze Chen · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory

Let B⊆AB\subseteq AB⊆A be semisimple algebras with a BBB-adapted Fourier basis of AAA and multiplicity-free branching, and assume AAA is δ\deltaδ-nice with respect to its computational basis. For σ∈B^\sigma\in\widehat Bσ∈B and basis indices k,lk,lk,l of σ\sigmaσ, let KKK be the number of irreps ρ∈A^\rho\in\widehat Aρ∈A with σ∈Res(ρ)BA\sigma\in\mathrm{Res}(\rho)^A_Bσ∈Res(ρ)BA​. Then

∥Eklσ∥22=(1+(K−1)ε)(∑ρ: σ∈Res(ρ)BA∥Ek∘ρ, l∘ρρ∥22)with ∣ε∣≤δ,\|E^\sigma_{kl}\|_2^2=(1+(K-1)\varepsilon)\Big(\sum_{\rho:\ \sigma\in\mathrm{Res}(\rho)^A_B}\|E^\rho_{k\circ\rho,\,l\circ\rho}\|_2^2\Big)\quad\text{with }|\varepsilon|\le\delta,∥Eklσ​∥22​=(1+(K−1)ε)(ρ: σ∈Res(ρ)BA​∑​∥Ek∘ρ,l∘ρρ​∥22​)with ∣ε∣≤δ,

i.e. ∣∥Eklσ∥22−Σ∣≤(K−1) δ Σ\big|\|E^\sigma_{kl}\|_2^2-\Sigma\big|\le(K-1)\,\delta\,\Sigma​∥Eklσ​∥22​−Σ​≤(K−1)δΣ where Σ\SigmaΣ is the sum on the right. The norm of EklσE^\sigma_{kl}Eklσ​ is taken in the computational inner product of AAA.

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 SemisimpleQFT
Source
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
  • Endorsed by Community (Bot) · Nov 19, 2026

  • Endorsed by Shuze Chen · Nov 19, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me