Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Degenerate intertwiner identities

Open
QAlgorithms.Papers.Independent.Intakenext100.P34.proposition3_1

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

Fix i≥1i\ge1i≥1 and work in Wi+1\mathcal W_{i+1}Wi+1​. All fractions below are geometric expansions at the formal point u=∞u=\inftyu=∞. Put v=(u−yi)−1v=(u-y_i)^{-1}v=(u−yi​)−1, w=(u−yi+1)−1w=(u-y_{i+1})^{-1}w=(u−yi+1​)−1, h=(2u−yi−yi+1)−1h=(2u-y_i-y_{i+1})^{-1}h=(2u−yi​−yi+1​)−1, t=tsit=t_{s_i}t=tsi​​, and e=eie=e_ie=ei​. Then

(ew−t−h)(ev+t−h)=−(1−h2),(ew-t-h)(ev+t-h)=-(1-h^2),(ew−t−h)(ev+t−h)=−(1−h2), (w+t−eh)−v(w+t−eh)v=(tvt+t−eh)−w(eve+ϵe−eh)w.(w+t-eh)-v(w+t-eh)v=(tvt+t-eh)-w(eve+\epsilon e-eh)w.(w+t−eh)−v(w+t−eh)v=(tvt+t−eh)−w(eve+ϵe−eh)w.

The first identity uses the denominators u−yi+1u-y_{i+1}u−yi+1​ and u−yiu-y_iu−yi​ appearing in the first computation of the source's proof. The printed statement has 1−y1-y1−y in those two places. The second identity is unchanged.

These identities hold in the presented algebra without admissibility assumptions. Their factor order is part of the assertion.

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]

/-- Proposition 3.1, PDF pp.12--13: both intertwiner identities, in their written order.
In (3.3) the printed denominators 1-y are corrected to u-y, as required by
its first proof computation on p.13. No admissibility or cancellation of e is used. -/
theorem proposition3_1 (P : DParams C) (i : ℕ) (hi : 1 ≤ i) :
    let j : Adj (i+1) := ⟨i-1, by omega⟩
    let m := dwMap C P (i+1)
    let a := m (dy C (adjacentLeft j))
    let b := m (dy C (adjacentRight j))
    let e := ps (m (de C j))
    let t := ps (m (dt C (trans j)))
    let v := infinityResolvent a
    let w := infinityResolvent b
    let h := halfResolvent (algebraMap C (DW C P (i+1)) (↑P.two⁻¹ : C)) (a+b)
    (e*w-t-h)*(e*v+t-h) = -(1-h^2) ∧
    (w+t-e*h)-v*(w+t-e*h)*v =
      (t*v*t+t-e*h)-w*(e*v*e+ps (algebraMap C (DW C P (i+1)) P.epsilon)*e-e*h)*w := by sorry

end

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

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

Let CCC be the commutative coefficient ring, and let PPP consist of a specified unit u∈C×u\in C^\timesu∈C× with underlying element 222, an element ε\varepsilonε satisfying ε=1\varepsilon=1ε=1 or ε=−1\varepsilon=-1ε=−1, an arbitrary sequence μ:N→C\mu:\mathbb N\to Cμ:N→C, and an optional scalar pair. For every natural number i≥1i\ge1i≥1, put N=i+1N=i+1N=i+1. Let BBB be the quotient of the free associative unital CCC-algebra on TwT_wTw​, for permutations of {0,…,N−1}\{0,\ldots,N-1\}{0,…,N−1}, on K0,K1K_0,K_1K0​,K1​, and on YrY_rYr​, for 0≤r<N0\le r<N0≤r<N, with sr=(r r+1)s_r=(r\ r+1)sr​=(r r+1) and abbreviations

Gr=Yr+1−TsrYrTsr,Er=1+TsrYr−Yr+1Tsr,G_r=Y_{r+1}-T_{s_r}Y_rT_{s_r}, \qquad E_r=1+T_{s_r}Y_r-Y_{r+1}T_{s_r},Gr​=Yr+1​−Tsr​​Yr​Tsr​​,Er​=1+Tsr​​Yr​−Yr+1​Tsr​​,

by all the equations

Tid=1,TwTv=Twv,YpYq=YqYp,K0K1=K1K0,KbYr=YrKb,K0Tsr=TsrK0,K1Ts0K1Ts0=Ts0K1Ts0K1,K1Tsr=TsrK1(r≠0),Tsr(Yr+Yr+1)=(Yr+Yr+1)Tsr,YpTsr=TsrYp(p∉{r,r+1}),TsrTsr+1GrTsr+1Tsr=Gr+1,ErTsr=εEr,TsrEr=εEr,ErTsqEr=εEr(r+1=q or q+1=r),E0Y0nE0=μnE0(n∈N),Er(Yr+Yr+1)=0,(Yr+Yr+1)Er=0,\begin{gathered} T_{\mathrm{id}}=1,\quad T_wT_v=T_{wv},\quad Y_pY_q=Y_qY_p,\quad K_0K_1=K_1K_0,\quad K_bY_r=Y_rK_b,\\ K_0T_{s_r}=T_{s_r}K_0,\quad K_1T_{s_0}K_1T_{s_0}=T_{s_0}K_1T_{s_0}K_1,\quad K_1T_{s_r}=T_{s_r}K_1\quad(r\ne0),\\ T_{s_r}(Y_r+Y_{r+1})=(Y_r+Y_{r+1})T_{s_r},\quad Y_pT_{s_r}=T_{s_r}Y_p\quad(p\notin\{r,r+1\}),\\ T_{s_r}T_{s_{r+1}}G_rT_{s_{r+1}}T_{s_r}=G_{r+1},\\ E_rT_{s_r}=\varepsilon E_r,\quad T_{s_r}E_r=\varepsilon E_r,\quad E_rT_{s_q}E_r=\varepsilon E_r\quad(r+1=q\ \text{or}\ q+1=r),\\ E_0Y_0^nE_0=\mu_nE_0\quad(n\in\mathbb N),\quad E_r(Y_r+Y_{r+1})=0,\quad (Y_r+Y_{r+1})E_r=0, \end{gathered}Tid​=1,Tw​Tv​=Twv​,Yp​Yq​=Yq​Yp​,K0​K1​=K1​K0​,Kb​Yr​=Yr​Kb​,K0​Tsr​​=Tsr​​K0​,K1​Ts0​​K1​Ts0​​=Ts0​​K1​Ts0​​K1​,K1​Tsr​​=Tsr​​K1​(r=0),Tsr​​(Yr​+Yr+1​)=(Yr​+Yr+1​)Tsr​​,Yp​Tsr​​=Tsr​​Yp​(p∈/{r,r+1}),Tsr​​Tsr+1​​Gr​Tsr+1​​Tsr​​=Gr+1​,Er​Tsr​​=εEr​,Tsr​​Er​=εEr​,Er​Tsq​​Er​=εEr​(r+1=q or q+1=r),E0​Y0n​E0​=μn​E0​(n∈N),Er​(Yr​+Yr+1​)=0,(Yr​+Yr+1​)Er​=0,​

where every adjacent index must exist, b∈{0,1}b\in\{0,1\}b∈{0,1}, and scalars mean their structural images from CCC; if the optional scalar pair is (c,d)(c,d)(c,d), additionally impose K0=cK_0=cK0​=c and K1=dK_1=dK1​=d. Write mmm for this quotient map, set j=i−1j=i-1j=i−1, and define elements and formal power series by

a=m(Yi−1),b=m(Yi),e=m(Ej),t=m(Tsj),H=the image of u−1 in B,v=∑n=0∞anTn+1,w=∑n=0∞bnTn+1,h=∑n=0∞H(H(a+b))nTn+1.\begin{gathered} a=m(Y_{i-1}),\qquad b=m(Y_i),\qquad e=m(E_j),\qquad t=m(T_{s_j}),\qquad H=\text{the image of }u^{-1}\text{ in }B,\\ v=\sum_{n=0}^{\infty}a^nT^{n+1},\qquad w=\sum_{n=0}^{\infty}b^nT^{n+1},\qquad h=\sum_{n=0}^{\infty}H\bigl(H(a+b)\bigr)^nT^{n+1}. \end{gathered}a=m(Yi−1​),b=m(Yi​),e=m(Ej​),t=m(Tsj​​),H=the image of u−1 in B,v=n=0∑∞​anTn+1,w=n=0∑∞​bnTn+1,h=n=0∑∞​H(H(a+b))nTn+1.​

Regard e,te,te,t, and the image of ε\varepsilonε as constant series in B[[T]]B[[T]]B[[T]]. Then both identities

(ew−t−h)(ev+t−h)=−(1−h2)(e w-t-h)(e v+t-h)=-(1-h^2)(ew−t−h)(ev+t−h)=−(1−h2)

and

(w+t−eh)−v(w+t−eh)v=(tvt+t−eh)−w(eve+εe−eh)w(w+t-e h)-v(w+t-e h)v =(tvt+t-e h)-w(eve+\varepsilon e-e h)w(w+t−eh)−v(w+t−eh)v=(tvt+t−eh)−w(eve+εe−eh)w

hold, with multiplication in exactly the displayed order. The case i=1i=1i=1 is included, so j=0j=0j=0 and BBB is the quotient at level 222; no admissibility condition on the parameter sequence is assumed.

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