Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3, explicit Claim (19): Wv formula

Proved
QAlgorithms.Papers.Independent.Intake100.P58.claim_19

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

prove2quantum

Let k≥1k\ge1k≥1 and let RRR be a commutative unital ring. Choose units q0,q,λ∈R×q_0,q,\lambda\in R^\timesq0​,q,λ∈R×, coefficients q1,…,qk−1∈Rq_1,\ldots,q_{k-1}\in Rq1​,…,qk−1​∈R, and A0,…,Ak−1∈RA_0,\ldots,A_{k-1}\in RA0​,…,Ak−1​∈R. Put δ=q−q−1\delta=q-q^{-1}δ=q−q−1 and assume λ−λ−1=δ(1−A0)\lambda-\lambda^{-1}=\delta(1-A_0)λ−λ−1=δ(1−A0​). Let B=B2k(R)B=B_2^k(R)B=B2k​(R) be the unital associative algebra on invertible Y,XY,XY,X and an element eee, with relations (1)–(6) of Definition 2.1. In particular, Yk=∑i=0k−1qiYiY^k=\sum_{i=0}^{k-1}q_iY^iYk=∑i=0k−1​qi​Yi, X−X−1=δ(1−e)X-X^{-1}=\delta(1-e)X−X−1=δ(1−e), XYXY=YXYXXYXY=YXYXXYXY=YXYX, Xe=eX=λeXe=eX=\lambda eXe=eX=λe, YXYe=eYXY=λ−1eYXYe=eYXY=\lambda^{-1}eYXYe=eYXY=λ−1e, and eYme=AmeeY^me=A_meeYme=Am​e for 0≤m<k0\le m<k0≤m<k.

Assume multiplication by δ\deltaδ on RRR is injective (Assumption 2.2). Neither A0A_0A0​ nor δ\deltaδ need be units, and the cyclotomic polynomial need not split.

Let V=RkV=R^kV=Rk with its standard basis v0,…,vk−1v_0,\ldots,v_{k-1}v0​,…,vk−1​. The operators Yˉ,Xˉ,Eˉ\bar Y,\bar X,\bar EYˉ,Xˉ,Eˉ are the specific maps (8)–(17): Yˉvi=vi+1\bar Yv_i=v_{i+1}Yˉvi​=vi+1​ for i<k−1i<k-1i<k−1, Yˉvk−1=∑i=0k−1qivi\bar Yv_{k-1}=\sum_{i=0}^{k-1}q_iv_iYˉvk−1​=∑i=0k−1​qi​vi​, Xˉv0=λv0\bar Xv_0=\lambda v_0Xˉv0​=λv0​, Xˉv1=λ−1Yˉ−1v0\bar Xv_1=\lambda^{-1}\bar Y^{-1}v_0Xˉv1​=λ−1Yˉ−1v0​ when k>1k>1k>1, Xˉvi=Yˉ−1Xˉvi−1−δvi−2+δAi−1Yˉ−1v0\bar Xv_i=\bar Y^{-1}\bar Xv_{i-1}-\delta v_{i-2}+\delta A_{i-1}\bar Y^{-1}v_0Xˉvi​=Yˉ−1Xˉvi−1​−δvi−2​+δAi−1​Yˉ−1v0​ for 2≤i<k2\le i<k2≤i<k, and Eˉvi=Aiv0\bar Ev_i=A_iv_0Eˉvi​=Ai​v0​. Define Wˉ=Xˉ−δid⁡V+δEˉ\bar W=\bar X-\delta\operatorname{id}_V+\delta\bar EWˉ=Xˉ−δidV​+δEˉ and vs=Yˉsv0v_s=\bar Y^sv_0vs​=Yˉsv0​ for every integer sss, using the explicit inverse (10)–(11).

For each 0≤l<k0\le l<k0≤l<k,

Wˉvl=λ−1v−l+δ∑i=1l(Al+1−iv1−i−vl−2i+2).\bar Wv_l=\lambda^{-1}v_{-l}+\delta\sum_{i=1}^l \left(A_{l+1-i}v_{1-i}-v_{l-2i+2}\right).Wˉvl​=λ−1v−l​+δi=1∑l​(Al+1−i​v1−i​−vl−2i+2​).

The subscripts are integers, and the sum is empty at l=0l=0l=0. The formula gives the explicit Wˉ\bar WWˉ columns needed in the derivation of admissibility; no admissibility assumption is used.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P58
Formal statement
noncomputable section

open scoped BigOperators Classical

namespace QAlgorithms.Papers.Independent.Intake100.P58

open Accepted

variable {R : Type*} [CommRing R] {k : ℕ}

/-- Section 3, explicit Claim (19), PDF p.6. Integer subscripts preserve
all negative indices; at l=0 the finite sum is empty. -/
theorem claim_19 (P : NonsplitParameters R k) (hdelta : RegularDelta P) :
    ∀ l : Fin k, Wv P (orbitVector P (l.val : ℤ)) =
      (↑P.lam⁻¹ : R) • orbitVector P (-(l.val : ℤ)) +
      skeinDelta P • (∑ i ∈ Finset.Icc 1 l.val,
        (aAt P (l.val+1-i) • orbitVector P (1-(i : ℤ)) -
          orbitVector P ((l.val : ℤ)-2*(i : ℤ)+2))) := by sorry

end QAlgorithms.Papers.Independent.Intake100.P58

end
Source
The cyclotomic BMW algebra associated with the two string type B braid group, arXiv:math/0611518v3, PDF p. 6, Claim (19)
Read-back

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

For any commutative ring RRR, possibly the zero ring, positive integer kkk, units q,λ,c∈R×q,\lambda,c\in R^\timesq,λ,c∈R×, coefficients c0,…,ck−1c_0,\ldots,c_{k-1}c0​,…,ck−1​, and loop values A0,…,Ak−1A_0,\ldots,A_{k-1}A0​,…,Ak−1​, assume c0=cc_0=cc0​=c, λ−λ−1=δ(1−A0)\lambda-\lambda^{-1}=\delta(1-A_0)λ−λ−1=δ(1−A0​), where δ=q−q−1\delta=q-q^{-1}δ=q−q−1, and assume that multiplication by δ\deltaδ on RRR is injective. Define Qj=cjQ_j=c_jQj​=cj​ for 0≤j<k0\le j<k0≤j<k, Qk=−1Q_k=-1Qk​=−1, and Qj=0Q_j=0Qj​=0 for j>kj>kj>k; set Aj=0A_j=0Aj​=0 for natural j≥kj\ge kj≥k. Let V=RkV=R^kV=Rk, with standard basis v0,…,vk−1v_0,\ldots,v_{k-1}v0​,…,vk−1​, extended by vj=0v_j=0vj​=0 for natural j≥kj\ge kj≥k. Define RRR-linear operators U,D,X,EU,D,X,EU,D,X,E by

Uvj=vj+1 (j<k−1),Uvk−1=∑r=0k−1crvr,Dv0=−c−1∑r=0k−1Qr+1vr,Dvj=vj−1 (1≤j<k),C0=λv0,C1=λ−1Dv0,Cr+2=DCr+1−δvr+δAr+1Dv0 (r≥0),Xvj=Cj,Evj=Ajv0(0≤j<k),\begin{gathered} Uv_j=v_{j+1}\ (j<k-1),\qquad Uv_{k-1}=\sum_{r=0}^{k-1}c_rv_r,\\ Dv_0=-c^{-1}\sum_{r=0}^{k-1}Q_{r+1}v_r,\qquad Dv_j=v_{j-1}\ (1\le j<k),\\ C_0=\lambda v_0,\qquad C_1=\lambda^{-1}Dv_0,\qquad C_{r+2}=DC_{r+1}-\delta v_r+\delta A_{r+1}Dv_0\ (r\ge0),\\ Xv_j=C_j,\qquad Ev_j=A_jv_0\qquad(0\le j<k), \end{gathered}Uvj​=vj+1​ (j<k−1),Uvk−1​=r=0∑k−1​cr​vr​,Dv0​=−c−1r=0∑k−1​Qr+1​vr​,Dvj​=vj−1​ (1≤j<k),C0​=λv0​,C1​=λ−1Dv0​,Cr+2​=DCr+1​−δvr​+δAr+1​Dv0​ (r≥0),Xvj​=Cj​,Evj​=Aj​v0​(0≤j<k),​

and put W=X−δI+δEW=X-\delta I+\delta EW=X−δI+δE. For every integer sss, put v(s)=Usv0v(s)=U^sv_0v(s)=Usv0​ if s≥0s\ge0s≥0, and v(s)=D−sv0v(s)=D^{-s}v_0v(s)=D−sv0​ if s<0s<0s<0, with nonnegative powers of the specified operators. Then, for every integer ℓ\ellℓ with 0≤ℓ<k0\le\ell<k0≤ℓ<k,

Wv(ℓ)=λ−1v(−ℓ)+δ∑i=1ℓ(Aℓ+1−iv(1−i)−v(ℓ−2i+2)).Wv(\ell)=\lambda^{-1}v(-\ell) +\delta\sum_{i=1}^{\ell} \left(A_{\ell+1-i}v(1-i)-v(\ell-2i+2)\right).Wv(ℓ)=λ−1v(−ℓ)+δi=1∑ℓ​(Aℓ+1−i​v(1−i)−v(ℓ−2i+2)).

All arguments of v( ⋅ )v(\,\cdot\,)v(⋅) in this formula are integers. When ℓ=0\ell=0ℓ=0, the sum is empty and the assertion is Wv(0)=λ−1v(0)Wv(0)=\lambda^{-1}v(0)Wv(0)=λ−1v(0).

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