Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The two BMW centers are cancellation rings

Open
QAlgorithms.Papers.Independent.Intakenext100.P34.abstract_centers

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

prove2quantum

Let CCC be a commutative unital ring in which 222 is invertible, let ϵ∈{1,−1}\epsilon\in\{1,-1\}ϵ∈{1,−1}, and fix scalars z0(ℓ)∈Cz_0^{(\ell)}\in Cz0(ℓ)​∈C for all ℓ≥0\ell\ge0ℓ≥0. Write Wk\mathcal W_kWk​ for the actual quotient defined by (2.1)–(2.5) and (2.21)–(2.24), and z0(u)=∑ℓ≥0z0(ℓ)u−ℓz_0(u)=\sum_{\ell\ge0}z_0^{(\ell)}u^{-\ell}z0​(u)=∑ℓ≥0​z0(ℓ)​u−ℓ.

For the center statements, specialize κ0,κ1\kappa_0,\kappa_1κ0​,κ1​ to scalars and assume the identity

(z0(−u)−12−ϵu)(z0(u)−12+ϵu)=(12−ϵu)(12+ϵu).(z_0(-u)-\tfrac12-\epsilon u)(z_0(u)-\tfrac12+\epsilon u)=(\tfrac12-\epsilon u)(\tfrac12+\epsilon u).(z0​(−u)−21​−ϵu)(z0​(u)−21​+ϵu)=(21​−ϵu)(21​+ϵu).

Let DDD 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(ℓ)∈DZ_0^{(\ell)}\in DZ0(ℓ)​∈D 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 positive levels, the canonical polynomial and Laurent evaluations are injective and identify the two centers as

Z(Wk)={f∈C[y1,…,yk]Sk:f(y1,−y1,y3,…)=f(0,0,y3,…)},Z(\mathcal W_k)=\{f\in C[y_1,\ldots,y_k]^{S_k}:f(y_1,-y_1,y_3,\ldots)=f(0,0,y_3,\ldots)\},Z(Wk​)={f∈C[y1​,…,yk​]Sk​:f(y1​,−y1​,y3​,…)=f(0,0,y3​,…)}, Z(Wl)={f∈D[Y1±1,…,Yl±1]Sl:f(Y1,Y1−1,Y3,…)=f(1,1,Y3,…)}.Z(W_l)=\{f\in D[Y_1^{\pm1},\ldots,Y_l^{\pm1}]^{S_l}:f(Y_1,Y_1^{-1},Y_3,\ldots)=f(1,1,Y_3,\ldots)\}.Z(Wl​)={f∈D[Y1±1​,…,Yl±1​]Sl​:f(Y1​,Y1−1​,Y3​,…)=f(1,1,Y3​,…)}.

The affine coefficient ring DDD and its parameters can be chosen independently of the degenerate coefficient ring CCC. At level one there is no pair substitution and the entire polynomial or Laurent polynomial algebra is the center.

These are the precise two center identifications asserted in the abstract; no assertion about quantum algorithms or the expected generators (4.32) is included.

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]

/-- Abstract main result, PDF p.1, precisely the conjunction of the two
center identifications (Theorems 4.2 and 4.5, pp.20--25). The two
coefficient rings and parameter systems are independent. -/
theorem abstract_centers (P : DParams C) (k : ℕ) (hk : 0 < k)
    (hscalar : P.scalarKappa.isSome) (hd : DAdmissible C P)
    (D : Type u) [CommRing D] (Q : AParams D) (l : ℕ) (hl : 0 < l)
    (ha : AAdmissible D Q) :
    DCenterDescription C P k ∧ ACenterDescription D Q l := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P34
Source
Affine and degenerate affine BMW algebras: The center, arXiv:1105.4207v2, PDF p. 1, Abstract main result
Read-back

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

Let CCC be a commutative ring, and let PPP consist of a unit u∈C×u\in C^\timesu∈C× with u=2u=2u=2, an element ε∈C\varepsilon\in Cε∈C with ε=1\varepsilon=1ε=1 or ε=−1\varepsilon=-1ε=−1, a sequence μ:N→C\mu:\mathbb N\to Cμ:N→C, and an optional pair of scalars. Assume that the optional pair is present, say (α,β)(\alpha,\beta)(α,β), and that k>0k>0k>0. Put h=u−1h=u^{-1}h=u−1, Z(t)=∑n≥0μntnZ(t)=\sum_{n\ge0}\mu_nt^nZ(t)=∑n≥0​μn​tn, and Z−(t)=∑n≥0(−1)nμntnZ_-(t)=\sum_{n\ge0}(-1)^n\mu_nt^nZ−​(t)=∑n≥0​(−1)nμn​tn, and assume

(tZ−−ht−ε)(tZ−ht+ε)=(ht−ε)(ht+ε).(tZ_--ht-\varepsilon)(tZ-ht+\varepsilon) =(ht-\varepsilon)(ht+\varepsilon).(tZ−​−ht−ε)(tZ−ht+ε)=(ht−ε)(ht+ε).

Independently, let DDD be a commutative ring, and let Q\mathcal QQ consist of units q,z,δ∈D×q,z,\delta\in D^\timesq,z,δ∈D× with δ=q−q−1\delta=q-q^{-1}δ=q−q−1, together with ν:Z→D\nu:\mathbb Z\to Dν:Z→D satisfying ν0=1+(z−z−1)δ−1\nu_0=1+(z-z^{-1})\delta^{-1}ν0​=1+(z−z−1)δ−1. Assume ℓ>0\ell>0ℓ>0, and, writing V±(t)=∑n≥0ν±ntnV_\pm(t)=\sum_{n\ge0}\nu_{\pm n}t^nV±​(t)=∑n≥0​ν±n​tn and g(t)=∑n≥1t2ng(t)=\sum_{n\ge1}t^{2n}g(t)=∑n≥1​t2n, assume

(V−−zδ−1−(1+g))(V++z−1δ−1−(1+g))=−δ−2(1+(2−q2−q−2)(g+g2)).(V_--z\delta^{-1}-(1+g))(V_++z^{-1}\delta^{-1}-(1+g)) =-\delta^{-2}\bigl(1+(2-q^2-q^{-2})(g+g^2)\bigr).(V−​−zδ−1−(1+g))(V+​+z−1δ−1−(1+g))=−δ−2(1+(2−q2−q−2)(g+g2)).

The conclusion concerns two presented algebras. The first, WDW_DWD​, is the unital associative CCC-algebra generated by twt_wtw​ for permutations www of {0,…,k−1}\{0,\ldots,k-1\}{0,…,k−1}, by K0,K1K_0,K_1K0​,K1​, and by y0,…,yk−1y_0,\ldots,y_{k-1}y0​,…,yk−1​. Write ti=t(i i+1)t_i=t_{(i\ i+1)}ti​=t(i i+1)​, γi=yi+1−tiyiti\gamma_i=y_{i+1}-t_iy_it_iγi​=yi+1​−ti​yi​ti​, and ei=1+tiyi−yi+1tie_i=1+t_iy_i-y_{i+1}t_iei​=1+ti​yi​−yi+1​ti​. Its relations are

t1=1,twtv=twv,yiyj=yjyi,K0K1=K1K0,Kbyj=yjKb,K0ti=tiK0,K1t0K1t0=t0K1t0K1,K1ti=tiK1 (i≠0),ti(yi+yi+1)=(yi+yi+1)ti,yjti=tiyj (j≠i,i+1),titi+1γiti+1ti=γi+1,eiti=tiei=εei,eitjei=εei (∣i−j∣=1),e0y0ne0=μne0 (n≥0),ei(yi+yi+1)=(yi+yi+1)ei=0,K0=α,K1=β,\begin{gathered} t_1=1,\quad t_wt_v=t_{wv},\quad y_iy_j=y_jy_i,\quad K_0K_1=K_1K_0,\quad K_by_j=y_jK_b,\\ K_0t_i=t_iK_0,\quad K_1t_0K_1t_0=t_0K_1t_0K_1,\quad K_1t_i=t_iK_1\ (i\ne0),\\ t_i(y_i+y_{i+1})=(y_i+y_{i+1})t_i,\quad y_jt_i=t_iy_j\ (j\ne i,i+1),\\ t_it_{i+1}\gamma_it_{i+1}t_i=\gamma_{i+1},\quad e_it_i=t_ie_i=\varepsilon e_i,\quad e_it_je_i=\varepsilon e_i\ (|i-j|=1),\\ e_0y_0^ne_0=\mu_ne_0\ (n\ge0),\quad e_i(y_i+y_{i+1})=(y_i+y_{i+1})e_i=0,\quad K_0=\alpha,\quad K_1=\beta, \end{gathered}t1​=1,tw​tv​=twv​,yi​yj​=yj​yi​,K0​K1​=K1​K0​,Kb​yj​=yj​Kb​,K0​ti​=ti​K0​,K1​t0​K1​t0​=t0​K1​t0​K1​,K1​ti​=ti​K1​ (i=0),ti​(yi​+yi+1​)=(yi​+yi+1​)ti​,yj​ti​=ti​yj​ (j=i,i+1),ti​ti+1​γi​ti+1​ti​=γi+1​,ei​ti​=ti​ei​=εei​,ei​tj​ei​=εei​ (∣i−j∣=1),e0​y0n​e0​=μn​e0​ (n≥0),ei​(yi​+yi+1​)=(yi​+yi+1​)ei​=0,K0​=α,K1​=β,​

with every indexed relation imposed only where its indices exist. The second, WAW_AWA​, is the unital associative DDD-algebra generated by invertible X,T0,…,Tℓ−2X,T_0,\ldots,T_{\ell-2}X,T0​,…,Tℓ−2​. Put Yj=Tj−1⋯T0(zX)T0⋯Tj−1Y_j=T_{j-1}\cdots T_0(zX)T_0\cdots T_{j-1}Yj​=Tj−1​⋯T0​(zX)T0​⋯Tj−1​ and Ei=1−δ−1(Ti−Ti−1)E_i=1-\delta^{-1}(T_i-T_i^{-1})Ei​=1−δ−1(Ti​−Ti−1​); its relations, wherever defined, are

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, σ∈{1,−1}),E0Y0mE0=νmE0 (m∈Z),EiYiYi+1=YiYi+1Ei=Ei.\begin{gathered} T_iT_j=T_jT_i\ (i+1\ne j,\ j+1\ne i),\quad T_iT_{i+1}T_i=T_{i+1}T_iT_{i+1},\\ XT_0XT_0=T_0XT_0X,\quad XT_i=T_iX\ (i\ge1),\\ E_iT_i^\sigma=T_i^\sigma E_i=z^{-\sigma}E_i,\quad E_iT_j^\sigma E_i=z^\sigma E_i\ (|i-j|=1,\ \sigma\in\{1,-1\}),\\ E_0Y_0^mE_0=\nu_mE_0\ (m\in\mathbb Z),\quad 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, σ∈{1,−1}),E0​Y0m​E0​=νm​E0​ (m∈Z),Ei​Yi​Yi+1​=Yi​Yi+1​Ei​=Ei​.​

For these algebras, both of the following assertions hold: ordered polynomial evaluation f↦f(y0,…,yk−1)f\mapsto f(y_0,\ldots,y_{k-1})f↦f(y0​,…,yk−1​), with factors in increasing index order, is injective on C[X0,…,Xk−1]C[X_0,\ldots,X_{k-1}]C[X0​,…,Xk−1​], and an element of WDW_DWD​ commutes with every element precisely when it is the evaluation of a polynomial invariant under all permutations of its variables and satisfying f(X0,−X0,X2,…)=f(0,0,X2,…)f(X_0,-X_0,X_2,\ldots)=f(0,0,X_2,\ldots)f(X0​,−X0​,X2​,…)=f(0,0,X2​,…) if k≥2k\ge2k≥2; and ordered Laurent evaluation ∑dcdXd↦∑dcdY0d0⋯Yℓ−1dℓ−1\sum_dc_dX^d\mapsto\sum_dc_dY_0^{d_0}\cdots Y_{\ell-1}^{d_{\ell-1}}∑d​cd​Xd↦∑d​cd​Y0d0​​⋯Yℓ−1dℓ−1​​ is injective on D[X0±1,…,Xℓ−1±1]D[X_0^{\pm1},\ldots,X_{\ell-1}^{\pm1}]D[X0±1​,…,Xℓ−1±1​], and an element of WAW_AWA​ commutes with every element precisely when it is the evaluation of a Laurent polynomial whose coefficients satisfy cd∘w=cdc_{d\circ w}=c_dcd∘w​=cd​ for all exponent vectors and permutations, and which 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​,…) if ℓ≥2\ell\ge2ℓ≥2. For k=1k=1k=1 or ℓ=1\ell=1ℓ=1, the corresponding cancellation condition is absent. Neither coefficient ring is 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