Proposition 3.12
ProvedQAlgorithms.Papers.Independent.Intake100.P55.proposition_3_12Let be a commutative unital ring with units and satisfying . For the affine algebra specify arbitrary scalars for every positive integer , with no admissibility or cyclotomic condition. Write and 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 -linear spans.
For every , work in and define . Then
These are the general affine braid and unwrapping identities.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P55
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.12(1)--(4), PDF p.20, verified in the page image.
The displayed e_n,g_n live in W_(n+1); r≥1 makes r-1 nontruncated. -/
theorem proposition_3_12 (n r : ℕ) (hn : 1 ≤ n) (hr : 1 ≤ r) :
let g := ghCrossing P q true (n+1) n false
let gi := ghCrossing P q true (n+1) n true
let e := ghContraction P q true (n+1) n
let x := bmwWinding P q (n+1) false n
let xi := bmwWinding P q (n+1) true n
g*x*g*x = x*g*x*g ∧
e*x*g*x = algebraMap R _ (↑P.lam⁻¹ : R)*e ∧
e*x^r*g*x = algebraMap R _ ((↑P.lam⁻¹ : R)^2)*e*x^(r-1)*gi ∧
e*xi^r*gi*xi = algebraMap R _ ((P.lam : R)^2)*e*xi^(r-1)*g := by sorry
end Statements
end QAlgorithms.Papers.Independent.Intake100.P55
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any commutative unital ring, let and satisfy , and let be arbitrary. For every with and , put . Work in the quotient of the free associative unital -algebra on , , and , with scalars interpreted through the canonical map from , by the relations
Here all indices in relations involving lie between and . Set
where an empty product is , so and when . The assertion is the conjunction of
The case is included, with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.