Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.11

Proved
QAlgorithms.Papers.Independent.Intake100.P55.proposition_3_11

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

prove2quantum

Let RRR be a commutative unital ring with units λ,δ\lambda,\deltaλ,δ and z∈Rz\in Rz∈R satisfying λ−1−λ=z(δ−1)\lambda^{-1}-\lambda=z(\delta-1)λ−1−λ=z(δ−1). For the affine algebra specify arbitrary scalars qsq_sqs​ for every positive integer sss, with no admissibility or cyclotomic condition. Write WnW_nWn​ and W^n\widehat W_nWn​ for the ordinary and affine BMW presentations of Definitions 3.1 and 3.6. Lower levels denote their canonical generator images; products of subspaces denote their RRR-linear spans.

For 1≤r<n1\le r<n1≤r<n in W^n\widehat W_nWn​, use the winding elements xs=(gs−1⋯g1)x1(g1⋯gs−1)x_s=(g_{s-1}\cdots g_1)x_1(g_1\cdots g_{s-1})xs​=(gs−1​⋯g1​)x1​(g1​⋯gs−1​). Then all eight identities hold:

grxr=xr+1gr−1,gr−1xr+1=xrgr,\grxr+1=xrgr−zxr+1+zerxr+1,gr−1xr=xr+1gr−1+zxr−zerxr,\erxr=λ−2erxr+1−1,xrer=λ−2xr+1−1er,\erxr−1=λ2erxr+1,xr−1er=λ2xr+1er.\begin{aligned}g_rx_r&=x_{r+1}g_r^{-1},&g_r^{-1}x_{r+1}&=x_rg_r,\g_rx_{r+1}&=x_rg_r-zx_{r+1}+ze_rx_{r+1},&g_r^{-1}x_r&=x_{r+1}g_r^{-1}+zx_r-ze_rx_r,\e_rx_r&=\lambda^{-2}e_rx_{r+1}^{-1},&x_re_r&=\lambda^{-2}x_{r+1}^{-1}e_r,\e_rx_r^{-1}&=\lambda^2e_rx_{r+1},&x_r^{-1}e_r&=\lambda^2x_{r+1}e_r.\end{aligned}gr​xr​​=xr+1​gr−1​,​gr−1​xr+1​​=xr​gr​,\gr​xr+1​​=xr​gr​−zxr+1​+zer​xr+1​,​gr−1​xr​​=xr+1​gr−1​+zxr​−zer​xr​,\er​xr​​=λ−2er​xr+1−1​,​xr​er​​=λ−2xr+1−1​er​,\er​xr−1​​=λ2er​xr+1​,​xr−1​er​​=λ2xr+1​er​.​

They describe adjacent-generator interactions with positive and negative windings.

Source correction: the printed coefficient zλz\lambdazλ of erxr+1e_rx_{r+1}er​xr+1​ is replaced by zzz, as required by Definition 3.6(6) and clause (1). All other clauses and hypotheses are retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P55
Formal statement
noncomputable section

open scoped Classical

namespace QAlgorithms.Papers.Independent.Intake100.P55

section Statements

variable {R : Type*} [CommRing R] (P : Ground R) (q : ℕ → R)

/-- Proposition 3.11(1)--(4), PDF p.19, with all eight identities.
Source correction in (2): printed z*lambda*e_r*x_(r+1) is changed to
z*e_r*x_(r+1). Multiplying the defining skein relation by x_(r+1)
and using (1) requires coefficient z; the printed extra lambda fails
in a nonzero two-strand scalar representation. -/
theorem proposition_3_11 (n r : ℕ) (hr : BMWIndex n r) :
    let g := ghCrossing P q true n r false
    let gi := ghCrossing P q true n r true
    let e := ghContraction P q true n r
    let x := bmwWinding P q n false r
    let y := bmwWinding P q n false (r+1)
    let xi := bmwWinding P q n true r
    let yi := bmwWinding P q n true (r+1)
    let z := algebraMap R (OrdinaryAffineBMW P q true n) P.z
    let l := algebraMap R (OrdinaryAffineBMW P q true n) (P.lam : R)
    let li2 := algebraMap R (OrdinaryAffineBMW P q true n) ((↑P.lam⁻¹ : R)^2)
    g*x = y*gi ∧ gi*y = x*g ∧
    g*y = x*g - z*y + z*e*y ∧ gi*x = y*gi + z*x - z*e*x ∧
    e*x = li2*e*yi ∧ x*e = li2*yi*e ∧
    e*xi = l^2*e*y ∧ xi*e = l^2*y*e := by sorry

end Statements

end QAlgorithms.Papers.Independent.Intake100.P55

end
Source
Affine Birman-Wenzl-Murakami Algebras and Tangles in the Solid Torus, arXiv:math/0411155v2, PDF p. 19, Proposition 3.11
Read-back

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

Let RRR be any commutative ring, let λ,δ∈R×\lambda,\delta\in R^\timesλ,δ∈R× and z∈Rz\in Rz∈R satisfy λ−1−λ=z(δ−1)\lambda^{-1}-\lambda=z(\delta-1)λ−1−λ=z(δ−1), and let q:N→Rq:\mathbb N\to Rq:N→R be any function. For all n,r∈Nn,r\in\mathbb Nn,r∈N satisfying 1≤r<n1\le r<n1≤r<n, consider the following RRR-algebra AAA. It is the quotient of the free associative unital RRR-algebra on symbols Gi+,Gi−,EiG_i^+,G_i^-,E_iGi+​,Gi−​,Ei​ for 1≤i<n1\le i<n1≤i<n, and T+,T−T^+,T^-T+,T−, by the relations listed below; coefficients from RRR in these relations mean their images under the scalar map R→AR\to AR→A. For every valid index iii, impose Gi+Gi−=Gi−Gi+=1G_i^+G_i^-=G_i^-G_i^+=1Gi+​Gi−​=Gi−​Gi+​=1, Ei2=δEiE_i^2=\delta E_iEi2​=δEi​, Gi+−Gi−=z(Ei−1)G_i^+-G_i^-=z(E_i-1)Gi+​−Gi−​=z(Ei​−1), and Gi+Ei=EiGi+=λ−1EiG_i^+E_i=E_iG_i^+=\lambda^{-1}E_iGi+​Ei​=Ei​Gi+​=λ−1Ei​. For 1≤i1\le i1≤i with i+1<ni+1<ni+1<n, impose Gi+Gi+1+Gi+=Gi+1+Gi+Gi+1+G_i^+G_{i+1}^+G_i^+=G_{i+1}^+G_i^+G_{i+1}^+Gi+​Gi+1+​Gi+​=Gi+1+​Gi+​Gi+1+​. For valid indices i,ji,ji,j with i+1<ji+1<ji+1<j or j+1<ij+1<ij+1<i, impose Gi+Gj+=Gj+Gi+G_i^+G_j^+=G_j^+G_i^+Gi+​Gj+​=Gj+​Gi+​, Gi+Ej=EjGi+G_i^+E_j=E_jG_i^+Gi+​Ej​=Ej​Gi+​, and EiEj=EjEiE_iE_j=E_jE_iEi​Ej​=Ej​Ei​. For valid indices i,ji,ji,j with i+1=ji+1=ji+1=j or j+1=ij+1=ij+1=i, impose EiEjEi=EiE_iE_jE_i=E_iEi​Ej​Ei​=Ei​, Gi+Gj+Ei=EjEiG_i^+G_j^+E_i=E_jE_iGi+​Gj+​Ei​=Ej​Ei​, EiGj+Gi+=EiEjE_iG_j^+G_i^+=E_iE_jEi​Gj+​Gi+​=Ei​Ej​, and EiGj+Ei=λEiE_iG_j^+E_i=\lambda E_iEi​Gj+​Ei​=λEi​. Also impose T+T−=T−T+=1T^+T^-=T^-T^+=1T+T−=T−T+=1, T+G1+T+G1+=G1+T+G1+T+T^+G_1^+T^+G_1^+=G_1^+T^+G_1^+T^+T+G1+​T+G1+​=G1+​T+G1+​T+, T+Gj+=Gj+T+T^+G_j^+=G_j^+T^+T+Gj+​=Gj+​T+ and T+Ej=EjT+T^+E_j=E_jT^+T+Ej​=Ej​T+ for 2≤j<n2\le j<n2≤j<n, E1(T+)mE1=q(m)E1E_1(T^+)^mE_1=q(m)E_1E1​(T+)mE1​=q(m)E1​ for every integer m≥1m\ge1m≥1, and E1T+G1+T+=λ−1E1=T+G1+T+E1E_1T^+G_1^+T^+=\lambda^{-1}E_1=T^+G_1^+T^+E_1E1​T+G1+​T+=λ−1E1​=T+G1+​T+E1​. For ε∈{+,−}\varepsilon\in\{+,-\}ε∈{+,−} and 1≤j≤n1\le j\le n1≤j≤n, define

Wjε=Gj−1εGj−2ε⋯G1ε Tε G1εG2ε⋯Gj−1ε,W_j^\varepsilon =G_{j-1}^\varepsilon G_{j-2}^\varepsilon\cdots G_1^\varepsilon\, T^\varepsilon\, G_1^\varepsilon G_2^\varepsilon\cdots G_{j-1}^\varepsilon,Wjε​=Gj−1ε​Gj−2ε​⋯G1ε​TεG1ε​G2ε​⋯Gj−1ε​,

where both products are empty when j=1j=1j=1, so W1ε=TεW_1^\varepsilon=T^\varepsilonW1ε​=Tε. Set g=Gr+g=G_r^+g=Gr+​, g−=Gr−g^-=G_r^-g−=Gr−​, e=Ere=E_re=Er​, x=Wr+x=W_r^+x=Wr+​, y=Wr+1+y=W_{r+1}^+y=Wr+1+​, x−=Wr−x^-=W_r^-x−=Wr−​, and y−=Wr+1−y^-=W_{r+1}^-y−=Wr+1−​. Then all eight equalities hold simultaneously in AAA:

gx=yg−,g−y=xg,gy=xg−zy+zey,g−x=yg−+zx−zex,ex=λ−2ey−,xe=λ−2y−e,ex−=λ2ey,x−e=λ2ye.\begin{aligned} gx&=yg^-,& g^-y&=xg,\\ gy&=xg-zy+zey,& g^-x&=yg^-+zx-zex,\\ ex&=\lambda^{-2}ey^-,& xe&=\lambda^{-2}y^-e,\\ ex^-&=\lambda^2ey,& x^-e&=\lambda^2ye. \end{aligned}gxgyexex−​=yg−,=xg−zy+zey,=λ−2ey−,=λ2ey,​g−yg−xxex−e​=xg,=yg−+zx−zex,=λ−2y−e,=λ2ye.​

Here λ−2\lambda^{-2}λ−2 denotes the scalar image of (λ−1)2(\lambda^{-1})^2(λ−1)2, and λ2\lambda^2λ2 the square of the scalar image of λ\lambdaλ. The hypothesis 1≤r<n1\le r<n1≤r<n forces n≥2n\ge2n≥2, so there are no instances with n=0n=0n=0 or n=1n=1n=1; it includes r=1r=1r=1 and r=n−1r=n-1r=n−1. No nonzero-ring assumption or additional restriction on qqq is imposed.

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