Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3, unnumbered (10)-(13): inverse, recurrence and shifted bases

Proved
QAlgorithms.Papers.Independent.Intake100.P58.companion_inverse_recurrence_bases

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).

The displayed companion map is invertible, and its inverse is

Yˉ−1vi=vi−1 (1≤i<k),Yˉ−1v0=−q0−1∑i=0k−1qi+1vi,qk=−1.\bar Y^{-1}v_i=v_{i-1}\ (1\le i<k),\qquad \bar Y^{-1}v_0=-q_0^{-1}\sum_{i=0}^{k-1}q_{i+1}v_i,\qquad q_k=-1.Yˉ−1vi​=vi−1​ (1≤i<k),Yˉ−1v0​=−q0−1​i=0∑k−1​qi+1​vi​,qk​=−1.

Both compositions with Yˉ\bar YYˉ equal the identity. The integer orbit agrees with the given standard vectors for 0≤i<k0\le i<k0≤i<k, and for every integer sss,

∑l=0kqlYˉlvs=0.\sum_{l=0}^kq_l\bar Y^lv_s=0.l=0∑k​ql​Yˉlvs​=0.

For every integer rrr, the family

(vr,vr+1,…,vr+k−1)(v_r,v_{r+1},\ldots,v_{r+k-1})(vr​,vr+1​,…,vr+k−1​)

is a basis of VVV. Empty sums have value zero. These conclusions justify all negative-index and shifted tensor coordinates used later.

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, equations (10)--(13), PDF p.5. This includes both inverse
identities, the inverse columns, the orbit convention, the signed recurrence,
and the specified shifted bases, without admissibility. -/
theorem companion_inverse_recurrence_bases (P : NonsplitParameters R k) (hdelta : RegularDelta P) :
    Yv P * YvInv P = 1 ∧ YvInv P * Yv P = 1 ∧
    (∀ i : Fin k, 1 ≤ i.val → YvInv P (vNat P i.val) = vNat P (i.val-1)) ∧
    YvInv P (vNat P 0) =
      -(↑P.constant⁻¹ : R) • (∑ i : Fin k, qAt P (i.val+1) • vNat P i.val) ∧
    (∀ i : Fin k, orbitVector P (i.val : ℤ) = vNat P i.val) ∧
    (∀ i : ℤ, (∑ l ∈ Finset.range (k+1), qAt P l • (Yv P ^ l) (orbitVector P i)) = 0) ∧
    (∀ l : ℤ, ∃ b : Module.Basis (Fin k) R (CompanionModule P),
      ∀ i : Fin k, b i = orbitVector P (l + (i.val : ℤ))) := 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. 5, Equations (10)–(13)
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, and let k>0k>0k>0. Take units q,λ,c∈R×q,\lambda,c\in R^\timesq,λ,c∈R×, coefficients c0,…,ck−1∈Rc_0,\ldots,c_{k-1}\in Rc0​,…,ck−1​∈R, and loop values A0,…,Ak−1∈RA_0,\ldots,A_{k-1}\in RA0​,…,Ak−1​∈R, 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, 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. Let V=RkV=R^kV=Rk, with standard basis v0,…,vk−1v_0,\ldots,v_{k-1}v0​,…,vk−1​, and set vj=0v_j=0vj​=0 for natural j≥kj\ge kj≥k. Define RRR-linear maps U,D:V→VU,D:V\to VU,D:V→V by

Uvj=vj+1 (0≤j<k−1),Uvk−1=∑r=0k−1crvr,Dv0=−c−1∑r=0k−1Qr+1vr,Dvj=vj−1 (1≤j<k).Uv_j=v_{j+1}\ (0\le j<k-1),\qquad Uv_{k-1}=\sum_{r=0}^{k-1}c_rv_r,\qquad Dv_0=-c^{-1}\sum_{r=0}^{k-1}Q_{r+1}v_r,\qquad Dv_j=v_{j-1}\ (1\le j<k).Uvj​=vj+1​ (0≤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).

For s∈Zs\in\mathbb Zs∈Z, define v(s)=Usv0v(s)=U^sv_0v(s)=Usv0​ when s≥0s\ge0s≥0, and v(s)=D−sv0v(s)=D^{-s}v_0v(s)=D−sv0​ when s<0s<0s<0, using nonnegative operator powers in both cases. The declaration asserts all of the following simultaneously:

UD=I,DU=I,Dvi=vi−1(1≤i<k),Dv0=−c−1∑i=0k−1Qi+1vi,v(i)=vi(0≤i<k),∑r=0kQr Urv(s)=0(s∈Z),for every ℓ∈Z there is an R-module basis (bi)0≤i<k of V with bi=v(ℓ+i) for all i.\begin{gathered} UD=I,\qquad DU=I,\\ Dv_i=v_{i-1}\qquad(1\le i<k),\qquad Dv_0=-c^{-1}\sum_{i=0}^{k-1}Q_{i+1}v_i,\\ v(i)=v_i\qquad(0\le i<k),\\ \sum_{r=0}^{k}Q_r\,U^r v(s)=0\qquad(s\in\mathbb Z),\\ \text{for every }\ell\in\mathbb Z\text{ there is an $R$-module basis }(b_i)_{0\le i<k} \text{ of }V\text{ with }b_i=v(\ell+i)\text{ for all }i. \end{gathered}UD=I,DU=I,Dvi​=vi−1​(1≤i<k),Dv0​=−c−1i=0∑k−1​Qi+1​vi​,v(i)=vi​(0≤i<k),r=0∑k​Qr​Urv(s)=0(s∈Z),for every ℓ∈Z there is an R-module basis (bi​)0≤i<k​ of V with bi​=v(ℓ+i) for all i.​

Here III is the identity map of VVV; when k=1k=1k=1, the assertions indexed by 1≤i<k1\le i<k1≤i<k have no instances.

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