Lemma 5.23
ProvedQAlgorithms.Papers.Independent.Intake100.P55.lemma_5_23Let 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.
Let and work in any ordinary level with . Put and , interpreting an empty product as . Then
These product identities replace consecutive braid generators by even contractions.
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)
/-- Lemma 5.23, PDF p.40, in any ordinary ambient bmwLevel containing the
largest generator 2k. At k=0 both identities are empty products. -/
theorem lemma_5_23 (n k : ℕ) (hn : 2*k < n) :
let g := fun i => ghCrossing P q false n i false
let e := ghContraction P q false n
let odd := oddContractions P q n k
let even := ((List.range k).map fun j => e (2*j+2)).prod
forward g 1 (2*k) * odd = even * odd ∧
odd * backward g 1 (2*k) = odd * even := 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 , let be the quotient of the free associative unital -algebra on , , with scalars interpreted through the canonical map from , by
Define the ordered products
with factors in increasing order of . Then both equalities
hold in . Every displayed product with no factors is . In particular, is allowed for every , and both equalities then read ; cannot satisfy .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.