Lemma 4.22: with equality iff
OpenSemisimpleQFT.lemma_4_22diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory
For any two partition diagrams and with columns,
with equality if and only if . Hence, for and distinct scaled diagrams , of the computational basis,
Preamble
import Definitions.Def_SemisimpleQFT_Diagram open scoped BigOperators ComplexConjugate
Formal statement
namespace SemisimpleQFT
theorem lemma_4_22 {n : ℕ} (D E : Diagram n) :
2 * cc (join D E) ≤ cc D + cc E ∧
(2 * cc (join D E) = cc D + cc E ↔ D = E) ∧
(∀ d : ℕ, 1 ≤ d → D ≠ E →
‖((scale d D : ℝ) : ℂ) * ((scale d E : ℝ) : ℂ) *
Matrix.trace ((schurDiagram d D).conjTranspose * schurDiagram d E)‖ ≤
(d : ℝ) ^ ((n : ℝ) - 1 / 2)) := by sorry
end SemisimpleQFTSource
B. Foxman, B. Nehoran, Y. Ding, Efficient Quantum Fourier Transforms For Semisimple Algebras, https://arxiv.org/abs/2605.05337, p. 28, Lemma 4.22
Human review
Confirmed by the mission captain (proposal self-audit).