Lemma 3.9
ProvedQAlgorithms.Papers.Independent.Intake100.P55.lemma_3_9Let 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.
In either presentation all the following identities hold whenever their generator indices exist. For and , and either sign,
For , one also has . For , put and . Then
These identities transport generators through consecutive braid words.
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 3.9(1)--(5), PDF pp.18--19. Both signs and both product
orders in the two long-word transport clauses are retained. -/
theorem lemma_3_9 (aff : Bool) (n : ℕ) :
(∀ i, 1 ≤ i → i+1 < n → ∀ inv : Bool,
ghCrossing P q aff n i inv * (ghCrossing P q aff n (i+1) false * ghCrossing P q aff n i false) =
(ghCrossing P q aff n (i+1) false * ghCrossing P q aff n i false) * ghCrossing P q aff n (i+1) inv) ∧
(∀ i, 1 ≤ i → i+1 < n →
ghContraction P q aff n i * (ghCrossing P q aff n (i+1) false * ghCrossing P q aff n i false) =
(ghCrossing P q aff n (i+1) false * ghCrossing P q aff n i false) * ghContraction P q aff n (i+1)) ∧
(∀ i, 1 ≤ i → i+2 < n →
ghCrossing P q aff n i false * ghCrossing P q aff n (i+1) false * ghContraction P q aff n i * ghContraction P q aff n (i+2) =
ghCrossing P q aff n (i+2) false * ghCrossing P q aff n (i+1) false * ghContraction P q aff n i * ghContraction P q aff n (i+2)) ∧
(∀ i m, 1 ≤ i → i < m → m < n → ∀ inv : Bool,
ghCrossing P q aff n i inv * backward (fun j => ghCrossing P q aff n j false) 1 m =
backward (fun j => ghCrossing P q aff n j false) 1 m * ghCrossing P q aff n (i+1) inv ∧
ghCrossing P q aff n (i+1) inv * forward (fun j => ghCrossing P q aff n j false) 1 m =
forward (fun j => ghCrossing P q aff n j false) 1 m * ghCrossing P q aff n i inv) ∧
(∀ i m, 1 ≤ i → i < m → m < n →
ghContraction P q aff n i * backward (fun j => ghCrossing P q aff n j false) 1 m =
backward (fun j => ghCrossing P q aff n j false) 1 m * ghContraction P q aff n (i+1) ∧
ghContraction P q aff n (i+1) * forward (fun j => ghCrossing P q aff n j false) 1 m =
forward (fun j => ghCrossing P q aff n j false) 1 m * ghContraction P q aff n i) := 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 a commutative ring, let and satisfy , and let be arbitrary. For either Boolean choice and every , let be the quotient of the free associative unital -algebra on for , together with precisely when and , by
and, in the affine case, additionally
Scalar coefficients denote their images in this algebra. The symbols are respectively the images of the crossing symbols with Boolean arguments false and true, and is the image of the contraction symbol; expressions with unavailable indices are . Write , , and define the ordered products
both equal to when . The theorem asserts all five families simultaneously: for every natural with and , and every Boolean ,
for every natural with and ,
for every natural with and ,
for every pair of naturals with , and every Boolean , both
and for every pair of naturals with , both
All five families have no admissible indices when ; the third family also has no admissible index when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.