Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.4: pn(D1D2)≤min⁡{pn(D1),pn(D2)}\mathrm{pn}(D_1D_2)\le\min\{\mathrm{pn}(D_1),\mathrm{pn}(D_2)\}pn(D1​D2​)≤min{pn(D1​),pn(D2​)}

Open
SemisimpleQFT.lemma_4_4

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

diagram-algebrasquantum-computingquantum-fourier-transformrepresentation-theory

For all partition diagrams D1D_1D1​ and D2D_2D2​ with nnn columns, the propagating number of the diagram of the product satisfies

pn(D1D2)≤min⁡{pn(D1),pn(D2)}.\mathrm{pn}(D_1D_2)\le\min\{\mathrm{pn}(D_1),\mathrm{pn}(D_2)\}.pn(D1​D2​)≤min{pn(D1​),pn(D2​)}.
Preamble
import Definitions.Def_SemisimpleQFT_Diagram

open scoped BigOperators ComplexConjugate
Formal statement
namespace SemisimpleQFT

theorem lemma_4_4 {n : ℕ} (D₁ D₂ : Diagram n) :
    pn (comp D₁ D₂) ≤ min (pn D₁) (pn D₂) := 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. 23, Lemma 4.4
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