Canonical affine compression elements and their recursions
OpenQAlgorithms.Papers.Independent.Intakenext100.P34.theorem3_6Let be a commutative unital ring, with units and scalars for every integer . Assume . Write for the quotient of the affine braid group algebra by (2.42)–(2.43), with , , and . Both left and right versions of its defining relations are imposed.
There is a compatible family of central Laurent-polynomial representatives (, ), starting at the supplied scalars, with
Define , so both have zeroth coefficient . Put and
For , the identity in level is
In level ,
For , in level ,
The positive representatives are constructed coefficientwise from this product. At positive levels, the negative representatives are obtained from the first identity using the unit constant of the positive factor; at level zero the prescribed bilateral scalars are retained. Compression remains a conclusion and is never cancelled.
This supplies both recursions and the bilateral moment interface without assuming admissibility or tower injectivity.
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 3.6, PDF pp.16--18: centrality and compression for the
constructed representatives, followed by (3.26)--(3.28). Both positive and
negative moments have the same zeroth term. The squared denominator in
(3.26) is retained, and both stale E_(i+1) in (3.28) are corrected to E_k
as forced by its induction. No admissibility hypothesis is imposed. -/
theorem theorem3_6 (P : AParams C) :
(∀ (n : ℕ) (ell : ℤ), 0 < n → Central (aMomentAt C P n n ell (le_refl n))) ∧
(∀ (n : ℕ) (ell : ℤ),
let j : Adj (n+2) := ⟨n, by omega⟩
let m := awMap C P (n+2)
m (affineContractionWord C P j)*signedPow (m (affineYWord C P (adjacentLeft j) false))
(m (affineYWord C P (adjacentLeft j) true)) ell*m (affineContractionWord C P j) =
aMomentAt C P n (n+2) ell (by omega)*m (affineContractionWord C P j)) ∧
(∀ n : ℕ,
let j : Adj (n+2) := ⟨n, by omega⟩
let c := algebraMap C (AW C P (n+2))
let e := ps (awMap C P (n+2) (affineContractionWord C P j))
let h := 1+pairResolvent (1 : AW C P (n+2))
(aMomentSeries C P n (n+2) (by omega) true-ps (c ((P.z : C)*(↑P.Q⁻¹ : C)))-h)*
(aMomentSeries C P n (n+2) (by omega) false+ps (c ((↑P.z⁻¹ : C)*(↑P.Q⁻¹ : C)))-h)*e =
-(ps (c ((↑P.Q⁻¹ : C)^2))*aScalarFraction (c (P.q : C)) (c (↑P.q⁻¹ : C)))*e) ∧
(∀ n : ℕ,
let j : Adj (n+3) := ⟨n+1, by omega⟩
let y : Fin (n+3) := ⟨n, by omega⟩
let m := awMap C P (n+3)
let c := algebraMap C (AW C P (n+3))
let e := ps (m (affineContractionWord C P j))
let offset := ps (c ((↑P.z⁻¹ : C)*(↑P.Q⁻¹ : C)))-(1+pairResolvent (1 : AW C P (n+3)))
(aMomentSeries C P (n+1) (n+3) (by omega)+offset)*e =
(aMomentSeries C P n (n+3) (by omega)+offset)*
aRatio (c (P.q : C)) (c (↑P.q⁻¹ : C)) (m (affineYWord C P y false)) (m (affineYWord C P y true))*e) ∧
(∀ (k : ℕ) (hk : 0 < k),
let j : Adj (k+1) := ⟨k-1, by omega⟩
let m := awMap C P (k+1)
let c := algebraMap C (AW C P (k+1))
let e := ps (m (affineContractionWord C P j))
let offset := ps (c ((↑P.z⁻¹ : C)*(↑P.Q⁻¹ : C)))-(1+pairResolvent (1 : AW C P (k+1)))
(aMomentSeries C P (k-1) (k+1) (by omega)+offset)*e =
(aMomentSeries C P 0 (k+1) (by omega)+offset)*
(List.ofFn (fun a : Fin (k-1) =>
let y : Fin (k+1) := ⟨a.val, by have := a.isLt; omega⟩
aRatio (c (P.q : C)) (c (↑P.q⁻¹ : C)) (m (affineYWord C P y false)) (m (affineYWord C P y true)))).prod*e) := 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 a commutative ring, and let consist of units and moments , satisfying
For every natural number , let be the associative -algebra generated by invertible , and define
For an integer , write if , and if . The quotient relations, for all valid indices, are
The following notation specifies the moment expressions used in the assertions. In any coefficient algebra, regard scalars as their images and algebra elements as constant series, and put
For elements define the ordered formal series
whose denominator has constant coefficient . In the Laurent polynomial algebra , consisting of finite sums of integer-exponent monomials, define
The inverse of uses its unit constant coefficient . For , if , put
where is the scalar map and products are ordered by increasing index. The theorem asserts the conjunction of the following five universally quantified statements: for every , every , and every ,
for every and , in ,
for every , in ,
for every , in ,
and for every , in ,
All products retain the displayed order. The second, third, and fourth assertions include ; here . The final assertion includes , when its product is empty and equals .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.