Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The affine BMW center

Open
QAlgorithms.Papers.Independent.Intakenext100.P34.theorem4_5

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

prove2quantum

Let CCC be a commutative unital ring, with units q,z,Q=q−q−1q,z,Q=q-q^{-1}q,z,Q=q−q−1 and scalars Z0(ℓ)∈CZ_0^{(\ell)}\in CZ0(ℓ)​∈C for every integer ℓ\ellℓ. Assume Z0(0)=1+(z−z−1)/QZ_0^{(0)}=1+(z-z^{-1})/QZ0(0)​=1+(z−z−1)/Q. Write WkW_kWk​ for the quotient of the affine braid group algebra by (2.42)–(2.43), with Y1=zXϵ1Y_1=zX^{\epsilon_1}Y1​=zXϵ1​, Yi+1=TiYiTiY_{i+1}=T_iY_iT_iYi+1​=Ti​Yi​Ti​, and Ei=1−(Ti−Ti−1)/QE_i=1-(T_i-T_i^{-1})/QEi​=1−(Ti​−Ti−1​)/Q. Both left and right versions of its defining relations are imposed.

For the center statements assume the scalar formal-series identity

(Z0−−zQ−u2u2−1)(Z0++z−1Q−u2u2−1)=−(u2−q2)(u2−q−2)Q2(u2−1)2,\left(Z_0^- -\frac zQ-\frac{u^2}{u^2-1}\right) \left(Z_0^+ +\frac{z^{-1}}Q-\frac{u^2}{u^2-1}\right) =-\frac{(u^2-q^2)(u^2-q^{-2})}{Q^2(u^2-1)^2},(Z0−​−Qz​−u2−1u2​)(Z0+​+Qz−1​−u2−1u2​)=−Q2(u2−1)2(u2−q2)(u2−q−2)​,

where Z0±=∑ℓ≥0Z0(±ℓ)u−ℓZ_0^\pm=\sum_{\ell\ge0}Z_0^{(\pm\ell)}u^{-\ell}Z0±​=∑ℓ≥0​Z0(±ℓ)​u−ℓ.

For k≥1k\ge1k≥1, Laurent evaluation ev⁡Y:C[Y1±1,…,Yk±1]→Wk\operatorname{ev}_Y:C[Y_1^{\pm1},\ldots,Y_k^{\pm1}]\to W_kevY​:C[Y1±1​,…,Yk±1​]→Wk​ is injective and

Z(Wk)=ev⁡Y{f∈C[Y1±1,…,Yk±1]Sk:f(Y1,Y1−1,Y3,…,Yk)=f(1,1,Y3,…,Yk)}.Z(W_k)=\operatorname{ev}_Y\{f\in C[Y_1^{\pm1},\ldots,Y_k^{\pm1}]^{S_k}: f(Y_1,Y_1^{-1},Y_3,\ldots,Y_k)=f(1,1,Y_3,\ldots,Y_k)\}.Z(Wk​)=evY​{f∈C[Y1±1​,…,Yk±1​]Sk​:f(Y1​,Y1−1​,Y3​,…,Yk​)=f(1,1,Y3​,…,Yk​)}.

The Laurent ring has finite support in integer exponent vectors, and its substitution maps are formal. At level one no pair test is imposed and the center is the whole Laurent polynomial algebra.

The conclusion identifies the center of the unrestricted affine algebra. The conjectural generator description (4.32) is excluded.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P34
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P34

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

noncomputable section

universe u

variable (C : Type u) [CommRing C]

/-- Theorem 4.5, PDF pp.24--25. The hypotheses of the basis theorem
used by its first proof step are retained; (4.32) is not asserted. -/
theorem theorem4_5 (P : AParams C) (k : ℕ) (hk : 0 < k) (hadm : AAdmissible C P) :
    ACenterDescription C P k := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P34
Source
Affine and degenerate affine BMW algebras: The center, arXiv:1105.4207v2, PDF p. 24, Theorem 4.5
Read-back

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

For every commutative ring CCC, units q,z,Q∈C×q,z,Q\in C^\timesq,z,Q∈C× satisfying Q=q−q−1Q=q-q^{-1}Q=q−q−1, sequence μ:Z→C\mu:\mathbb Z\to Cμ:Z→C satisfying μ0=1+(z−z−1)Q−1\mu_0=1+(z-z^{-1})Q^{-1}μ0​=1+(z−z−1)Q−1, and positive natural number kkk, assume the following identity of formal power series over CCC. Write Z+(t)=∑n≥0μntnZ_+(t)=\sum_{n\ge0}\mu_nt^nZ+​(t)=∑n≥0​μn​tn, Z−(t)=∑n≥0μ−ntnZ_-(t)=\sum_{n\ge0}\mu_{-n}t^nZ−​(t)=∑n≥0​μ−n​tn, and g(t)=∑n≥1t2ng(t)=\sum_{n\ge1}t^{2n}g(t)=∑n≥1​t2n; the required identity is

(Z−−zQ−1−(1+g))(Z++z−1Q−1−(1+g))=−Q−2(1+(2−q2−q−2)(g+g2)).\bigl(Z_--zQ^{-1}-(1+g)\bigr) \bigl(Z_++z^{-1}Q^{-1}-(1+g)\bigr) = -Q^{-2}\bigl(1+(2-q^2-q^{-2})(g+g^2)\bigr).(Z−​−zQ−1−(1+g))(Z+​+z−1Q−1−(1+g))=−Q−2(1+(2−q2−q−2)(g+g2)).

Let WWW be the unital associative CCC-algebra generated by invertible X,T0,…,Tk−2X,T_0,\ldots,T_{k-2}X,T0​,…,Tk−2​, put

Yj=Tj−1⋯T0(zX)T0⋯Tj−1,Ei=1−Q−1(Ti−Ti−1),Y_j=T_{j-1}\cdots T_0(zX)T_0\cdots T_{j-1}, \qquad E_i=1-Q^{-1}(T_i-T_i^{-1}),Yj​=Tj−1​⋯T0​(zX)T0​⋯Tj−1​,Ei​=1−Q−1(Ti​−Ti−1​),

and impose, wherever the indices exist, the relations

TiTj=TjTi(i+1≠j, j+1≠i),TiTi+1Ti=Ti+1TiTi+1,XT0XT0=T0XT0X,XTi=TiX(i≥1),EiTiσ=TiσEi=z−σEi,EiTjσEi=zσEi(∣i−j∣=1),E0Y0mE0=μmE0(m∈Z),EiYiYi+1=YiYi+1Ei=Ei,\begin{gathered} T_iT_j=T_jT_i\quad(i+1\ne j,\ j+1\ne i),\qquad T_iT_{i+1}T_i=T_{i+1}T_iT_{i+1},\\ XT_0XT_0=T_0XT_0X,\qquad XT_i=T_iX\quad(i\ge1),\\ E_iT_i^\sigma=T_i^\sigma E_i=z^{-\sigma}E_i,\qquad E_iT_j^\sigma E_i=z^\sigma E_i\quad(|i-j|=1),\\ E_0Y_0^mE_0=\mu_mE_0\quad(m\in\mathbb Z),\qquad E_iY_iY_{i+1}=Y_iY_{i+1}E_i=E_i, \end{gathered}Ti​Tj​=Tj​Ti​(i+1=j, j+1=i),Ti​Ti+1​Ti​=Ti+1​Ti​Ti+1​,XT0​XT0​=T0​XT0​X,XTi​=Ti​X(i≥1),Ei​Tiσ​=Tiσ​Ei​=z−σEi​,Ei​Tjσ​Ei​=zσEi​(∣i−j∣=1),E0​Y0m​E0​=μm​E0​(m∈Z),Ei​Yi​Yi+1​=Yi​Yi+1​Ei​=Ei​,​

where σ∈{1,−1}\sigma\in\{1,-1\}σ∈{1,−1} and the empty products defining Y0Y_0Y0​ give Y0=zXY_0=zXY0​=zX. Then the ordered evaluation function

ev⁡P ⁣(∑d∈ZkcdXd)=∑dcdY0d0⋯Yk−1dk−1\operatorname{ev}_P\!\left(\sum_{d\in\mathbb Z^k}c_dX^d\right) =\sum_dc_dY_0^{d_0}\cdots Y_{k-1}^{d_{k-1}}evP​(d∈Zk∑​cd​Xd)=d∑​cd​Y0d0​​⋯Yk−1dk−1​​

is injective on all Laurent polynomials, and an element a∈Wa\in Wa∈W commutes with every element of WWW if and only if it equals ev⁡P(f)\operatorname{ev}_P(f)evP​(f) for some Laurent polynomial f=∑dcdXdf=\sum_dc_dX^df=∑d​cd​Xd whose coefficients satisfy cd∘w=cdc_{d\circ w}=c_dcd∘w​=cd​ for every permutation www and every exponent vector ddd, and which, when k≥2k\ge2k≥2, satisfies

f(X0,X0−1,X2,…)=f(1,1,X2,…).f(X_0,X_0^{-1},X_2,\ldots)=f(1,1,X_2,\ldots).f(X0​,X0−1​,X2​,…)=f(1,1,X2​,…).

The case k=1k=1k=1 is included; it has no TiT_iTi​, no EiE_iEi​, and no cancellation condition on fff. The ring CCC is not assumed nontrivial.

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

    Confirmed by the moderator at approval.

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