Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2, unnumbered remark (7): reversal anti-involution

Proved
QAlgorithms.Papers.Independent.Intake100.P58.reversal_anti_involution

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.

There is an RRR-linear algebra anti-isomorphism ∗:B→B*:B\to B∗:B→B satisfying

(ab)∗=b∗a∗,(a∗)∗=a,Y∗=Y,X∗=X,e∗=e.(ab)^*=b^*a^*,\qquad (a^*)^*=a,\qquad Y^*=Y,\quad X^*=X,\quad e^*=e.(ab)∗=b∗a∗,(a∗)∗=a,Y∗=Y,X∗=X,e∗=e.

The map preserves the unit and the scalars. It is the reversal anti-involution used to define the right tensor action in Section 4. No admissibility assumption is made.

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 2, equation (7), PDF p.4. This is reversal: it fixes Y,X,e
and is an involutive algebra anti-isomorphism, without admissibility. -/
theorem reversal_anti_involution (P : NonsplitParameters R k) (hdelta : RegularDelta P) :
    ∃ star : TwoStrandBMW P ≃ₐ[R] (TwoStrandBMW P)ᵐᵒᵖ,
      (∀ a, MulOpposite.unop (star (MulOpposite.unop (star a))) = a) ∧
      star (y P) = MulOpposite.op (y P) ∧
      star (x P) = MulOpposite.op (x P) ∧
      star (e P) = MulOpposite.op (e P) := 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. 4, Remark (7)
Read-back

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

Let RRR be any commutative ring, possibly the zero ring, let k>0k>0k>0, and let the parameter data consist of 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​, satisfying c0=cc_0=cc0​=c and λ−λ−1=δ(1−A0)\lambda-\lambda^{-1}=\delta(1-A_0)λ−λ−1=δ(1−A0​), where δ=q−q−1\delta=q-q^{-1}δ=q−q−1. Assume that multiplication by δ\deltaδ on RRR is injective. Let B\mathcal BB be the unital associative RRR-algebra generated by two-sided inverse pairs x,x−1x,x^{-1}x,x−1 and y,y−1y,y^{-1}y,y−1, and by eee, subject to

x−x−1=δ(1−e),xe=ex=λe,e2=A0e,yk=∑j=0k−1cjyj,xyxy=yxyx,yxye=eyxy=λ−1e,eyje=Aje (0≤j<k).x-x^{-1}=\delta(1-e),\quad xe=ex=\lambda e,\quad e^2=A_0e,\quad y^k=\sum_{j=0}^{k-1}c_jy^j,\quad xyxy=yxyx,\quad yxye=eyxy=\lambda^{-1}e,\quad ey^je=A_je\ (0\le j<k).x−x−1=δ(1−e),xe=ex=λe,e2=A0​e,yk=j=0∑k−1​cj​yj,xyxy=yxyx,yxye=eyxy=λ−1e,eyje=Aj​e (0≤j<k).

There exists an RRR-algebra isomorphism B→Bop\mathcal B\to\mathcal B^{\mathrm{op}}B→Bop whose underlying map τ:B→B\tau:\mathcal B\to\mathcal Bτ:B→B satisfies

τ(τ(a))=a(a∈B),τ(y)=y,τ(x)=x,τ(e)=e.\tau(\tau(a))=a\quad(a\in\mathcal B),\qquad \tau(y)=y,\qquad \tau(x)=x,\qquad \tau(e)=e.τ(τ(a))=a(a∈B),τ(y)=y,τ(x)=x,τ(e)=e.

Here Bop\mathcal B^{\mathrm{op}}Bop has the multiplication of B\mathcal BB reversed; thus τ\tauτ is a bijective RRR-linear, unit-preserving map satisfying τ(ab)=τ(b)τ(a)\tau(ab)=\tau(b)\tau(a)τ(ab)=τ(b)τ(a) for all a,b∈Ba,b\in\mathcal Ba,b∈B.

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