Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Canonical degenerate compression elements and their recursions

Open
QAlgorithms.Papers.Independent.Intakenext100.P34.theorem3_2

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−ℓ.

There is a compatible choice of polynomial representatives zn(ℓ)∈Wnz_n^{(\ell)}\in\mathcal W_nzn(ℓ)​∈Wn​ (n,ℓ≥0n,\ell\ge0n,ℓ≥0), starting at the supplied scalars z0(ℓ)z_0^{(\ell)}z0(ℓ)​, such that these representatives are central and

eiyiℓei=zi−1(ℓ)ei.e_i y_i^\ell e_i=z_{i-1}^{(\ell)}e_i.ei​yiℓ​ei​=zi−1(ℓ)​ei​.

The representatives are the coefficients of the explicit polynomial-valued series

zn(u)=(z0(u)+ϵu−12)∏j=1nR(yj,u)−ϵu+12,R(y,u)=((u+y)2−1)(u−y)2((u−y)2−1)(u+y)2.z_n(u)=(z_0(u)+\epsilon u-\tfrac12)\prod_{j=1}^n R(y_j,u)-\epsilon u+\tfrac12, \qquad R(y,u)=\frac{((u+y)^2-1)(u-y)^2}{((u-y)^2-1)(u+y)^2}.zn​(u)=(z0​(u)+ϵu−21​)j=1∏n​R(yj​,u)−ϵu+21​,R(y,u)=((u−y)2−1)(u+y)2((u+y)2−1)(u−y)2​.

For every i≥1i\ge1i≥1, in level i+1i+1i+1,

(zi−1(−u)−12−ϵu)(zi−1(u)−12+ϵu)ei=(12−ϵu)(12+ϵu)ei.(z_{i-1}(-u)-\tfrac12-\epsilon u)(z_{i-1}(u)-\tfrac12+\epsilon u)e_i =(\tfrac12-\epsilon u)(\tfrac12+\epsilon u)e_i.(zi−1​(−u)−21​−ϵu)(zi−1​(u)−21​+ϵu)ei​=(21​−ϵu)(21​+ϵu)ei​.

In level i+2i+2i+2,

(zi(u)+ϵu−12)ei+1=(zi−1(u)+ϵu−12)R(yi,u)ei+1.(z_i(u)+\epsilon u-\tfrac12)e_{i+1} =(z_{i-1}(u)+\epsilon u-\tfrac12)R(y_i,u)e_{i+1}.(zi​(u)+ϵu−21​)ei+1​=(zi−1​(u)+ϵu−21​)R(yi​,u)ei+1​.

For k≥1k\ge1k≥1, in level k+1k+1k+1,

(zk−1(u)+ϵu−12)ek=(z0(u)+ϵu−12)∏j=1k−1R(yj,u)ek.(z_{k-1}(u)+\epsilon u-\tfrac12)e_k =(z_0(u)+\epsilon u-\tfrac12)\prod_{j=1}^{k-1}R(y_j,u)e_k.(zk−1​(u)+ϵu−21​)ek​=(z0​(u)+ϵu−21​)j=1∏k−1​R(yj​,u)ek​.

Every representative is evaluated at a larger level using its explicit polynomial in the initial variables. No injectivity of a tower map or uniqueness of a compression representative is assumed. The level-zero representatives are scalars.

This gives central compression elements and all three source identities even for nonadmissible parameters.

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 3.2, PDF pp.13--14. Existence is witnessed by the explicitly
constructed coefficient polynomials; centrality, compression and all three
identities remain conclusions, with no admissibility assumption. In (3.9)
the two printed e_(i+1) are corrected to e_k, as forced by iteration of (3.8). -/
theorem theorem3_2 (P : DParams C) :
    (∀ (n ell : ℕ), 0 < n → Central (dMomentAt C P n n ell (le_refl n))) ∧
    (∀ (n ell : ℕ),
      let j : Adj (n+2) := ⟨n, by omega⟩
      let m := dwMap C P (n+2)
      m (de C j)*m (dy C (adjacentLeft j))^ell*m (de C j) =
        dMomentAt C P n (n+2) ell (by omega)*m (de C j)) ∧
    (∀ n : ℕ,
      let j : Adj (n+2) := ⟨n, by omega⟩
      let e := ps (dwMap C P (n+2) (de C j))
      let half := ps (algebraMap C (DW C P (n+2)) (↑P.two⁻¹ : C))
      let eps := ps (algebraMap C (DW C P (n+2)) P.epsilon)
      let t : PowerSeries (DW C P (n+2)) := PowerSeries.X
      (t*dMomentSeries C P n (n+2) (by omega) true-half*t-eps)*
        (t*dMomentSeries C P n (n+2) (by omega) false-half*t+eps)*e =
        (half*t-eps)*(half*t+eps)*e) ∧
    (∀ n : ℕ,
      let j : Adj (n+3) := ⟨n+1, by omega⟩
      let y : Fin (n+3) := ⟨n, by omega⟩
      let e := ps (dwMap C P (n+3) (de C j))
      let half := ps (algebraMap C (DW C P (n+3)) (↑P.two⁻¹ : C))
      let eps := ps (algebraMap C (DW C P (n+3)) P.epsilon)
      let t : PowerSeries (DW C P (n+3)) := PowerSeries.X
      (t*dMomentSeries C P (n+1) (n+3) (by omega)+eps-half*t)*e =
        (t*dMomentSeries C P n (n+3) (by omega)+eps-half*t)*
        dRatio (dwMap C P (n+3) (dy C y))*e) ∧
    (∀ (k : ℕ) (hk : 0 < k),
      let j : Adj (k+1) := ⟨k-1, by omega⟩
      let e := ps (dwMap C P (k+1) (de C j))
      let half := ps (algebraMap C (DW C P (k+1)) (↑P.two⁻¹ : C))
      let eps := ps (algebraMap C (DW C P (k+1)) P.epsilon)
      let t : PowerSeries (DW C P (k+1)) := PowerSeries.X
      (t*dMomentSeries C P (k-1) (k+1) (by omega)+eps-half*t)*e =
        (t*dMomentSeries C P 0 (k+1) (by omega)+eps-half*t)*
        dRatioProduct (fun a : Fin (k-1) => dwMap C P (k+1)
          (dy C (⟨a.val, by have := a.isLt; omega⟩ : Fin (k+1))))*e) := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P34
Source
Affine and degenerate affine BMW algebras: The center, arXiv:1105.4207v2, PDF p. 14, Theorem 3.2
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 uuu with value 222, an element ε∈{1,−1}\varepsilon\in\{1,-1\}ε∈{1,−1}, a sequence ω:N→C\omega:\mathbb N\to Cω:N→C, and an optional pair σ\sigmaσ; put h=u−1h=u^{-1}h=u−1. For every m∈Nm\in\mathbb Nm∈N, let WmW_mWm​ be the associative unital CCC-algebra generated by permutation symbols TwT_wTw​ for w∈Sym⁡({0,…,m−1})w\in\operatorname{Sym}(\{0,\ldots,m-1\})w∈Sym({0,…,m−1}), by κ0,κ1\kappa_0,\kappa_1κ0​,κ1​, and by YjY_jYj​ for j<mj<mj<m. Set Si=T(i i+1)S_i=T_{(i\ i+1)}Si​=T(i i+1)​, Γi=Yi+1−SiYiSi\Gamma_i=Y_{i+1}-S_iY_iS_iΓi​=Yi+1​−Si​Yi​Si​, Ei=1+SiYi−Yi+1SiE_i=1+S_iY_i-Y_{i+1}S_iEi​=1+Si​Yi​−Yi+1​Si​, and [a,b]=ab−ba[a,b]=ab-ba[a,b]=ab−ba. Its relations, for existing indices, are

T1=1,TwTv=Twv,[Ya,Yb]=[κ0,κ1]=[κc,Ya]=[κ0,Si]=0(c=0,1),(κ1S0)2=(S0κ1)2(m≥2),[κ1,Si]=0(i>0),[Si,Yi+Yi+1]=0,[Si,Yj]=0(j∉{i,i+1}),SiSi+1ΓiSi+1Si=Γi+1(i+2<m),EiSi=SiEi=εEi,EiSjEi=εEi(∣i−j∣=1),E0Y0aE0=ω(a)E0(m≥2, a≥0),Ei(Yi+Yi+1)=(Yi+Yi+1)Ei=0,\begin{gathered} T_1=1,\quad T_wT_v=T_{wv},\quad [Y_a,Y_b]=[\kappa_0,\kappa_1]=[\kappa_c,Y_a]=[\kappa_0,S_i]=0 \quad(c=0,1),\\ (\kappa_1S_0)^2=(S_0\kappa_1)^2\quad(m\ge2),\quad [\kappa_1,S_i]=0\quad(i>0),\\ [S_i,Y_i+Y_{i+1}]=0,\quad [S_i,Y_j]=0\quad(j\notin\{i,i+1\}),\\ S_iS_{i+1}\Gamma_iS_{i+1}S_i=\Gamma_{i+1}\quad(i+2<m),\\ E_iS_i=S_iE_i=\varepsilon E_i,\quad E_iS_jE_i=\varepsilon E_i\quad(|i-j|=1),\\ E_0Y_0^aE_0=\omega(a)E_0\quad(m\ge2,\ a\ge0),\quad E_i(Y_i+Y_{i+1})=(Y_i+Y_{i+1})E_i=0, \end{gathered}T1​=1,Tw​Tv​=Twv​,[Ya​,Yb​]=[κ0​,κ1​]=[κc​,Ya​]=[κ0​,Si​]=0(c=0,1),(κ1​S0​)2=(S0​κ1​)2(m≥2),[κ1​,Si​]=0(i>0),[Si​,Yi​+Yi+1​]=0,[Si​,Yj​]=0(j∈/{i,i+1}),Si​Si+1​Γi​Si+1​Si​=Γi+1​(i+2<m),Ei​Si​=Si​Ei​=εEi​,Ei​Sj​Ei​=εEi​(∣i−j∣=1),E0​Y0a​E0​=ω(a)E0​(m≥2, a≥0),Ei​(Yi​+Yi+1​)=(Yi​+Yi+1​)Ei​=0,​

and, if σ=some⁡(a,b)\sigma=\operatorname{some}(a,b)σ=some(a,b), also κ0=a1, κ1=b1\kappa_0=a1,\ \kappa_1=b1κ0​=a1, κ1​=b1, with neither scalar relation imposed when σ=none⁡\sigma=\operatorname{none}σ=none. For an element aaa of any of these algebras or of a polynomial ring, define

Ra(t)=((1+at)2−t2)(1−at)2(((1−at)2−t2)(1+at)2)−1,R_a(t)= \bigl((1+at)^2-t^2\bigr)(1-at)^2 \left(\bigl((1-at)^2-t^2\bigr)(1+at)^2\right)^{-1},Ra​(t)=((1+at)2−t2)(1−at)2(((1−at)2−t2)(1+at)2)−1,

using constant series for coefficients and the formal inverse of the denominator, whose constant coefficient is 111. In C[X0,…,Xr−1][[t]]C[X_0,\ldots,X_{r-1}][[t]]C[X0​,…,Xr−1​][[t]], set

Fr(t)=∏j=0r−1RXj(t),Z(t)=∑a≥0ω(a)ta,Gr,ℓ=[tℓ]((Z−h)Fr+h+ε Tail⁡(Fr−1)),F_r(t)=\prod_{j=0}^{r-1}R_{X_j}(t),\qquad Z(t)=\sum_{a\ge0}\omega(a)t^a,\qquad G_{r,\ell}=[t^\ell]\Bigl((Z-h)F_r+h+ \varepsilon\,\operatorname{Tail}(F_r-1)\Bigr),Fr​(t)=j=0∏r−1​RXj​​(t),Z(t)=a≥0∑​ω(a)ta,Gr,ℓ​=[tℓ]((Z−h)Fr​+h+εTail(Fr​−1)),

where Tail⁡(∑cata)=∑ca+1ta\operatorname{Tail}(\sum c_at^a)=\sum c_{a+1}t^aTail(∑ca​ta)=∑ca+1​ta. For r≤mr\le mr≤m, define Mr,m,ℓ∈WmM_{r,m,\ell}\in W_mMr,m,ℓ​∈Wm​ by evaluating Gr,ℓ=∑αcαXαG_{r,\ell}=\sum_\alpha c_\alpha X^\alphaGr,ℓ​=∑α​cα​Xα as ∑αcα‾Y0α0⋯Yr−1αr−1\sum_\alpha\overline{c_\alpha}Y_0^{\alpha_0}\cdots Y_{r-1}^{\alpha_{r-1}}∑α​cα​​Y0α0​​⋯Yr−1αr−1​​, with factors in increasing index order, and put

Zr,m+(t)=∑ℓ≥0Mr,m,ℓtℓ,Zr,m−(t)=∑ℓ≥0(−1)ℓMr,m,ℓtℓ.Z^+_{r,m}(t)=\sum_{\ell\ge0}M_{r,m,\ell}t^\ell,\qquad Z^-_{r,m}(t)=\sum_{\ell\ge0}(-1)^\ell M_{r,m,\ell}t^\ell.Zr,m+​(t)=ℓ≥0∑​Mr,m,ℓ​tℓ,Zr,m−​(t)=ℓ≥0∑​(−1)ℓMr,m,ℓ​tℓ.

The theorem asserts the conjunction of the following five statements, with h,εh,\varepsilonh,ε, and each EiE_iEi​ interpreted as constant series whenever needed: for every n>0n>0n>0 and every ℓ≥0\ell\ge0ℓ≥0, Mn,n,ℓM_{n,n,\ell}Mn,n,ℓ​ commutes with every element of WnW_nWn​; for every n,ℓ≥0n,\ell\ge0n,ℓ≥0, the identity

EnYnℓEn=Mn,n+2,ℓEnE_nY_n^\ell E_n=M_{n,n+2,\ell}E_nEn​Ynℓ​En​=Mn,n+2,ℓ​En​

holds in Wn+2W_{n+2}Wn+2​; for every n≥0n\ge0n≥0, the identity

(tZn,n+2−−ht−ε)(tZn,n+2+−ht+ε)En=(ht−ε)(ht+ε)En\bigl(tZ^-_{n,n+2}-ht-\varepsilon\bigr) \bigl(tZ^+_{n,n+2}-ht+\varepsilon\bigr)E_n = (ht-\varepsilon)(ht+\varepsilon)E_n(tZn,n+2−​−ht−ε)(tZn,n+2+​−ht+ε)En​=(ht−ε)(ht+ε)En​

holds in Wn+2[[t]]W_{n+2}[[t]]Wn+2​[[t]]; for every n≥0n\ge0n≥0, the identity

(tZn+1,n+3++ε−ht)En+1=(tZn,n+3++ε−ht)RYn(t)En+1\bigl(tZ^+_{n+1,n+3}+\varepsilon-ht\bigr)E_{n+1} = \bigl(tZ^+_{n,n+3}+\varepsilon-ht\bigr) R_{Y_n}(t)E_{n+1}(tZn+1,n+3+​+ε−ht)En+1​=(tZn,n+3+​+ε−ht)RYn​​(t)En+1​

holds in Wn+3[[t]]W_{n+3}[[t]]Wn+3​[[t]]; and for every k>0k>0k>0, the identity

(tZk−1,k+1++ε−ht)Ek−1=(tZ0,k+1++ε−ht)(∏a=0k−2RYa(t))Ek−1\bigl(tZ^+_{k-1,k+1}+\varepsilon-ht\bigr)E_{k-1} = \bigl(tZ^+_{0,k+1}+\varepsilon-ht\bigr) \left(\prod_{a=0}^{k-2}R_{Y_a}(t)\right)E_{k-1}(tZk−1,k+1+​+ε−ht)Ek−1​=(tZ0,k+1+​+ε−ht)(a=0∏k−2​RYa​​(t))Ek−1​

holds in Wk+1[[t]]W_{k+1}[[t]]Wk+1​[[t]]. All displayed products retain their written order. Empty products are 111, so G0,ℓ=ω(ℓ)G_{0,\ell}=\omega(\ell)G0,ℓ​=ω(ℓ) as a constant polynomial, the second through fourth assertions include n=0n=0n=0, and the final product is empty when k=1k=1k=1. Beyond the conditions built into PPP, the theorem assumes neither a scalar pair nor an additional identity for the moment series.

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