Theorem 4.16:
OpenSemisimpleQFT.theorem_4_16diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory
For and every ,
Here is the set of Young-diagram labels of Theorems 4.12, 4.14, 4.15 and is the dimension of the irrep , which is the number of Bratteli paths from the root to 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 ; for it is stated for and .
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 SemisimpleQFTSource
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
Confirmed by the mission captain (proposal self-audit).