The two presentations of the degenerate affine braid algebra
OpenQAlgorithms.Papers.Independent.Intakenext100.P34.theorem2_1Let be a commutative unital ring with invertible, and . Let be the algebra presented in (2.1)–(2.5). There is a -algebra isomorphism from to the algebra generated by (), and for distinct . Here permutations fix . Its relations are
The isomorphism preserves and sends
Its inverse sends to and to . All remaining positive-index kappas, and are sent to the conjugates specified by (2.15), for every permutation with the stated endpoint images.
This identifies the two actual presentations, without specializing any kappa generator to a scalar.
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]
/-- Theorem 2.1, PDF pp.4--6: an algebra isomorphism between the two
actual presentations, with the generator formulas (2.13)--(2.16).
The explicit unit whose value is 2 is the proof-used implicit hypothesis. -/
theorem theorem2_1 (k : ℕ) (hk : 0 < k) (two : Cˣ) (htwo : (two : C) = 2) :
let first : Fin k := ⟨0,hk⟩
∃ e : DBraid C k ≃ₐ[C] GBraid C k,
(∀ w, e (dbMap C k (dt C w)) = gbMap C k (gt C w)) ∧
e (dbMap C k (dk C false)) = gbMap C k (gk C none) ∧
e (dbMap C k (dk C true)) = gbMap C k (gk C (some first)) ∧
(∀ j, e (dbMap C k (dy C j)) = gbMap C k (gY C k (↑two⁻¹ : C) j)) ∧
e.symm (gbMap C k (gg C none (some first))) =
dbMap C k (dy C first-algebraMap C (DFree C k) (↑two⁻¹ : C)*dk C true) ∧
(∀ i : Adj k, e.symm (gbMap C k (gg C (some (adjacentLeft i)) (some (adjacentRight i)))) =
dbMap C k (dg C i)) ∧
(∀ (w : Equiv.Perm (Fin k)) (j : Fin k), w first = j →
e.symm (gbMap C k (gk C (some j))) = dbMap C k (dt C w*dk C true*dt C w⁻¹) ∧
e.symm (gbMap C k (gg C none (some j))) =
dbMap C k (dt C w*(dy C first-algebraMap C (DFree C k) (↑two⁻¹ : C)*dk C true)*dt C w⁻¹)) ∧
(∀ (i : Adj k) (w : Equiv.Perm (Fin k)) (a b : Fin k), i.val = 0 →
w (adjacentLeft i) = a → w (adjacentRight i) = b →
e.symm (gbMap C k (gg C (some a) (some b))) =
dbMap C k (dt C w*dg C i*dt C w⁻¹)) := 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 the commutative coefficient ring, let be a natural number, and let be a specified unit whose underlying element is ; put . Write , with distinguished element , and let exchange and , for . Define to be the quotient of the free associative unital -algebra on symbols , for permutations of , two symbols , and symbols , for , by the relations
where each relation is imposed only when its indices exist, and . Define to be the quotient of the free associative unital -algebra on symbols , symbols indexed by , and symbols for distinct , by
where permutations fix , and expressions , if used, mean . There exists a -algebra isomorphism satisfying, for every permutation and every ,
Its inverse satisfies
For every permutation and every with , both
hold. Finally, for every adjacent index , permutation , and , if , , and , then
Here all displayed generators in the isomorphism formulas denote their quotient classes, and coefficients act through the corresponding structural maps from . The case is included: there are no adjacent indices, so all assertions quantified over them are vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.