Proposition 3.10
ProvedQAlgorithms.Papers.Independent.Intake100.P55.proposition_3_10Let 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 define for , with empty products at . For every such and every with ,
Furthermore, for all . These commutation relations identify the commuting winding elements.
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.10(1)--(3), PDF p.19. All x indices lie in 1..n and
all g/e indices lie in 1..n-1. -/
theorem proposition_3_10 (n : ℕ) :
(∀ r j, 1 ≤ r → r ≤ n → BMWIndex n j → j ≠ r → j+1 ≠ r →
ghCrossing P q true n j false * bmwWinding P q n false r =
bmwWinding P q n false r * ghCrossing P q true n j false) ∧
(∀ r j, 1 ≤ r → r ≤ n → BMWIndex n j → j ≠ r → j+1 ≠ r →
ghContraction P q true n j * bmwWinding P q n false r =
bmwWinding P q n false r * ghContraction P q true n j) ∧
(∀ r j, 1 ≤ r → r ≤ n → 1 ≤ j → j ≤ n →
bmwWinding P q n false j * bmwWinding P q n false r =
bmwWinding P q n false r * bmwWinding P q n false j) := 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 every , let be the quotient of the free associative unital -algebra on for , and on when , subject to
All scalar coefficients denote their images in the algebra; are the images of the two crossing symbols and the contraction symbol, respectively, and unavailable generator expressions are defined as . For , put
where each product is empty when , giving ; the underlying winding definition assigns . The theorem asserts the conjunction of the following three statements: for every satisfying , , , and ,
for every satisfying those same conditions,
and for every satisfying and ,
When , all three statements are vacuous; when , the first two are vacuous and the third has only .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.