Affine intertwiner identities
OpenQAlgorithms.Papers.Independent.Intakenext100.P34.proposition3_5Let be a commutative unital ring, with units and scalars for every integer . Assume . Write for the quotient of the affine braid group algebra by (2.42)–(2.43), with , , and . Both left and right versions of its defining relations are imposed.
Fix in level and write , , , , , and . Fractions are formal expansions at infinity. Then
The first right-hand side equals the displayed fraction in (3.18), with its squared denominator. Every product appears in the source's order and the second factor in the first identity contains .
These are identities in the unrestricted affine quotient and require no admissibility hypothesis.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P34
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.5, PDF pp.15--16, including both (3.18) and (3.19).
The RHS of (3.18) is written -Q⁻²(1+(2-q²-q⁻²)(g+g²)),
where g=Y_iY_(i+1)/(u²-Y_iY_(i+1)); this is the same formal fraction. -/
theorem proposition3_5 (P : AParams C) (i : ℕ) (hi : 1 ≤ i) :
let j : Adj (i+1) := ⟨i-1, by omega⟩
let m := awMap C P (i+1)
let a := m (affineYWord C P (adjacentLeft j))
let b := m (affineYWord C P (adjacentRight j))
let e := ps (m (affineContractionWord C P j))
let t := ps (m (aCrossing C j false))
let ti := ps (m (aCrossing C j true))
let v := multiplicativeResolvent a
let w := multiplicativeResolvent b
let g := pairResolvent (a*b)
let qi := ps (algebraMap C (AW C P (i+1)) (↑P.Q⁻¹ : C))
let q2 := ps (algebraMap C (AW C P (i+1)) ((P.Q : C)^2))
let c := ps (algebraMap C (AW C P (i+1)) (2-(P.q : C)^2-(↑P.q⁻¹ : C)^2))
(e*w-t*qi-g)*(e*v+ti*qi-g) = -(qi^2*(1+c*(g+g^2))) ∧
(w+t*qi-e*g)-q2*(v+1)*(w+t*qi-e*g)*v =
(t*v*ti+t*qi-e*g)-q2*w*(e*v*e+ps (algebraMap C (AW C P (i+1)) (P.z : C))*e*qi-e*g)*(w+1) := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P34
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a commutative ring, and let consist of units and a function , with
For each , let be the quotient of the free associative -algebra on invertible generators . Put
and
Empty products are ; write for , and for . The defining relations, whenever their indices exist, are
For every integer , work in , and set , , , , and . In the formal power series ring , regard algebra elements as constant series and define
Then both identities hold, with multiplication in exactly the displayed order:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.