Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.17 with Section 5: subalgebra adapted Fourier bases in the orthogonal form exist

Open
SemisimpleQFT.standard_gt_exists

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

diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory

For each of the chains

C≅B0(d)⊆B1(d)⊆⋯⊆Bn(d)(d∉{0,…,n}),\mathbb{C}\cong B_0(d)\subseteq B_1(d)\subseteq\dots\subseteq B_n(d)\quad(d\notin\{0,\dots,n\}),C≅B0​(d)⊆B1​(d)⊆⋯⊆Bn​(d)(d∈/{0,…,n}), B0,0(d)⊆B1,0(d)⊆B1,1(d)⊆⋯⊆Br,r(d)⊆Br,r+1(d)⊆⋯⊆Br,s(d)(r≤s, d∉{0,…,r+s−2}),B_{0,0}(d)\subseteq B_{1,0}(d)\subseteq B_{1,1}(d)\subseteq\dots\subseteq B_{r,r}(d)\subseteq B_{r,r+1}(d)\subseteq\dots\subseteq B_{r,s}(d)\quad(r\le s,\ d\notin\{0,\dots,r+s-2\}),B0,0​(d)⊆B1,0​(d)⊆B1,1​(d)⊆⋯⊆Br,r​(d)⊆Br,r+1​(d)⊆⋯⊆Br,s​(d)(r≤s, d∈/{0,…,r+s−2}), C≅P0(d)⊆P1/2(d)⊆P1(d)⊆⋯⊆Pn−1/2(d)⊆Pn(d)(d∉{0,…,2n−2}),\mathbb{C}\cong P_0(d)\subseteq P_{1/2}(d)\subseteq P_1(d)\subseteq\dots\subseteq P_{n-1/2}(d)\subseteq P_n(d)\quad(d\notin\{0,\dots,2n-2\}),C≅P0​(d)⊆P1/2​(d)⊆P1​(d)⊆⋯⊆Pn−1/2​(d)⊆Pn​(d)(d∈/{0,…,2n−2}),

there is a subalgebra adapted (Gelfand–Tsetlin) system of Fourier bases: every algebra of the chain is semisimple with irreps labelled by the Young diagrams (pairs of Young diagrams) of Theorems 4.12–4.15, the bases of the irrep spaces are indexed by the paths of the Bratteli diagram given by the branching rules of Theorem 5.2 and are adapted to the chain (Eqs. (5.7)–(5.8)); the basis of the top algebra is in the orthogonal form ρ(Dop)=ρ(D)†\rho(D^{\mathrm{op}})=\rho(D)^\daggerρ(Dop)=ρ(D)† (Eq. (5.25)); and the labelling of the top algebra satisfies Theorem 4.17: λ(D)=0\lambda(D)=0λ(D)=0 for every diagram DDD with pn(D)<∣λ∣\mathrm{pn}(D)<|\lambda|pn(D)<∣λ∣.

Preamble
import Definitions.Def_SemisimpleQFT_Chains

open scoped BigOperators ComplexConjugate
Formal statement
namespace SemisimpleQFT

theorem standard_gt_exists :
    (∀ n d : ℕ, n < d →
      ∃ G : GTSystem n (fun t => diagramAlgebra (brauerLevel n t) d) (brauerBratteli n),
        G.IsStandard Shape.size) ∧
    (∀ r s d : ℕ, r ≤ s → r + s < d + 2 →
      ∃ G : GTSystem (r + s) (fun t => diagramAlgebra (walledLevel r (r + s) t) d)
          (walledBratteli r (r + s)),
        G.IsStandard pairSize) ∧
    (∀ n d : ℕ, 2 * n < d + 2 →
      ∃ G : GTSystem (2 * n) (fun t => diagramAlgebra (partitionLevel n t) d)
          (partitionBratteli n),
        G.IsStandard Shape.size) := by sorry

end SemisimpleQFT
Source
B. Foxman, B. Nehoran, Y. Ding, Efficient Quantum Fourier Transforms For Semisimple Algebras, https://arxiv.org/abs/2605.05337, pp. 25–26, 31, 34–35: Theorems 4.12, 4.14, 4.15, 4.17, 5.2, Eqs. (5.20)–(5.25)
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