Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.16: ∣{D∈D(A):pn(D)=k}∣=∑∣ρ∣=kdρ2|\{D\in\mathcal D(A):\mathrm{pn}(D)=k\}|=\sum_{|\rho|=k}d_\rho^2∣{D∈D(A):pn(D)=k}∣=∑∣ρ∣=k​dρ2​

Open
SemisimpleQFT.theorem_4_16

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

diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory

For A∈{Bn(d),Br,s(d),Pn(d)}A\in\{B_n(d),B_{r,s}(d),P_n(d)\}A∈{Bn​(d),Br,s​(d),Pn​(d)} and every kkk,

∣{D∈D(A):pn(D)=k}∣=∑ρ∈A^: ∣ρ∣=kdρ2.\big|\{D\in\mathcal D(A):\mathrm{pn}(D)=k\}\big|=\sum_{\rho\in\widehat A:\ |\rho|=k}d_\rho^2 .​{D∈D(A):pn(D)=k}​=ρ∈A: ∣ρ∣=k∑​dρ2​.

Here A^\widehat AA is the set of Young-diagram labels of Theorems 4.12, 4.14, 4.15 and dρd_\rhodρ​ is the dimension of the irrep ρ\rhoρ, which is the number of Bratteli paths from the root to ρ\rhoρ in the Bratteli diagram of the chain of Section 5.3 (branching rules of Theorem 5.2). The formal statement counts, on the right, the pairs of Bratteli paths with a common endpoint of size kkk; for Br,s(d)B_{r,s}(d)Br,s​(d) it is stated for r≤sr\le sr≤s and ∣(λ,μ)∣=∣λ∣+∣μ∣|(\lambda,\mu)|=|\lambda|+|\mu|∣(λ,μ)∣=∣λ∣+∣μ∣.

Preamble
import Definitions.Def_SemisimpleQFT_Chains

open scoped BigOperators ComplexConjugate
Formal statement
namespace SemisimpleQFT

theorem theorem_4_16 :
    (∀ n k : ℕ,
      Nat.card {D : Diagram n // IsBrauer D ∧ pn D = k} =
        Nat.card {pq : (brauerBratteli n).Path n × (brauerBratteli n).Path n //
          pq.1.last = pq.2.last ∧ pq.1.last.size = k}) ∧
    (∀ r s k : ℕ, r ≤ s →
      Nat.card {D : Diagram (r + s) // IsWalled r D ∧ pn D = k} =
        Nat.card {pq : (walledBratteli r (r + s)).Path (r + s) ×
            (walledBratteli r (r + s)).Path (r + s) //
          pq.1.last = pq.2.last ∧ pairSize pq.1.last = k}) ∧
    (∀ n k : ℕ,
      Nat.card {D : Diagram n // pn D = k} =
        Nat.card {pq : (partitionBratteli n).Path (2 * n) × (partitionBratteli n).Path (2 * n) //
          pq.1.last = pq.2.last ∧ pq.1.last.size = k}) := 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. 26, Theorem 4.16, Eq. (4.11); proof in Appendix B, p. 54
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