Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Even signed convolution identity

Proved
QAlgorithms.Papers.Independent.Intake100.P65.evenCompression

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For a commutative unital ring RRR with 222 invertible, any scalar sequence Ω\OmegaΩ, and n≥2n\ge2n≥2, the affine algebra satisfies, for a>0a>0a>0,

0=(∑b=12a(−1)b−1ωb−1ω2a−b)E1.0=\left(\sum_{b=1}^{2a}(-1)^{b-1}\omega_{b-1}\omega_{2a-b}\right)E_1.0=(b=1∑2a​(−1)b−1ωb−1​ω2a−b​)E1​.

The coefficient is the paired even signed convolution appearing in the proof of Corollary 2.4.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P65
Formal statement
noncomputable section

open scoped BigOperators TensorProduct

open QAlgorithms.Papers.Independent.Renew46.P16

open QAlgorithms.Papers.Independent.Support21.P08 (IrreducibleRepresentation)

open QAlgorithms.Papers.Independent.Support21.P12

open QAlgorithms.Papers.Independent.Support21.P14 (BrauerPairing oddPairingCount)

namespace QAlgorithms.Papers.Independent.Intake100.P65

universe u v

/-- Remark 2.5, PDF pp.5--6: the even signed convolution times E_1. -/
theorem evenCompression (R : Type u) [CommRing R] [Invertible (2 : R)]
    (omega : ℕ → R) (n : ℕ) (hn : 2 ≤ n) (a : ℕ) (ha : 0 < a) :
    (0 : AffineBMW R omega n) =
      (∑ b ∈ Finset.range (2*a), (-1 : R)^b * omega b * omega (2*a-1-b)) •
        affineE R omega n 0 := by sorry

end QAlgorithms.Papers.Independent.Intake100.P65

end
Source
Cyclotomic Nazarov-Wenzl algebras, arXiv:math/0506467v5, PDF p. 5, Remark 2.5
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every commutative ring RRR equipped with an inverse of 222, sequence ω:N→R\omega:\mathbb N\to Rω:N→R, integer n≥2n\ge2n≥2, and positive integer aaa, let AnA_nAn​ be the quotient of the free associative unital RRR-algebra on si,eis_i,e_isi​,ei​ for 0≤i<n−10\le i<n-10≤i<n−1 and xjx_jxj​ for 0≤j<n0\le j<n0≤j<n, by

si2=1,ei2=ω0ei,siei=eisi=ei,sisj=sjsi,siej=ejsi,eiej=ejei(∣i−j∣>1),sisi+1si=si+1sisi+1,xjxk=xkxj,sixj=xjsi,eixj=xjei(j∉{i,i+1}),sixi−xi+1si=ei−1,xisi−sixi+1=ei−1,e0x0me0=ωme0(m≥1),siei+1ei=si+1ei,eiei+1si=eisi+1,ei+1eisi+1=ei+1si,si+1eiei+1=siei+1,ei+1eiei+1=ei+1,eiei+1ei=ei,ei(xi+xi+1)=(xi+xi+1)ei=0.\begin{gathered} s_i^2=1,\quad e_i^2=\omega_0e_i,\quad s_ie_i=e_is_i=e_i,\\ s_is_j=s_js_i,\quad s_ie_j=e_js_i,\quad e_ie_j=e_je_i \quad(|i-j|>1),\\ s_is_{i+1}s_i=s_{i+1}s_is_{i+1},\quad x_jx_k=x_kx_j,\\ s_ix_j=x_js_i,\quad e_ix_j=x_je_i\quad(j\notin\{i,i+1\}),\\ s_ix_i-x_{i+1}s_i=e_i-1,\quad x_is_i-s_ix_{i+1}=e_i-1,\\ e_0x_0^me_0=\omega_me_0\quad(m\ge1),\\ s_ie_{i+1}e_i=s_{i+1}e_i,\quad e_ie_{i+1}s_i=e_is_{i+1},\\ e_{i+1}e_is_{i+1}=e_{i+1}s_i,\quad s_{i+1}e_ie_{i+1}=s_ie_{i+1},\\ e_{i+1}e_ie_{i+1}=e_{i+1},\quad e_ie_{i+1}e_i=e_i,\\ e_i(x_i+x_{i+1})=(x_i+x_{i+1})e_i=0. \end{gathered}si2​=1,ei2​=ω0​ei​,si​ei​=ei​si​=ei​,si​sj​=sj​si​,si​ej​=ej​si​,ei​ej​=ej​ei​(∣i−j∣>1),si​si+1​si​=si+1​si​si+1​,xj​xk​=xk​xj​,si​xj​=xj​si​,ei​xj​=xj​ei​(j∈/{i,i+1}),si​xi​−xi+1​si​=ei​−1,xi​si​−si​xi+1​=ei​−1,e0​x0m​e0​=ωm​e0​(m≥1),si​ei+1​ei​=si+1​ei​,ei​ei+1​si​=ei​si+1​,ei+1​ei​si+1​=ei+1​si​,si+1​ei​ei+1​=si​ei+1​,ei+1​ei​ei+1​=ei+1​,ei​ei+1​ei​=ei​,ei​(xi​+xi+1​)=(xi​+xi+1​)ei​=0.​

All indices lie in their generator ranges, and adjacent s,es,es,e relations require i+2<ni+2<ni+2<n. Then

0=(∑b=02a−1(−1)bωbω2a−1−b)e0in An.0= \left( \sum_{b=0}^{2a-1}(-1)^b\omega_b\omega_{2a-1-b} \right)e_0 \quad\text{in }A_n.0=(b=0∑2a−1​(−1)bωb​ω2a−1−b​)e0​in An​.

The positivity of aaa makes all subscripts in this sum nonnegative without truncation. No admissibility condition on ω\omegaω, nonvanishing of e0e_0e0​, or injectivity of scalar multiplication on e0e_0e0​ is assumed.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 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