Definitions for Affine and degenerate affine BMW algebras: The center
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P34The objects the formalized statements of Affine and degenerate affine BMW algebras: The center (arXiv:1105.4207) are stated in. Each was checked against the paper by a blind read-back and a moderator.
Adj: Valid adjacent-generator positions; this is empty at level one.adjacentLeft: Left endpoint of a valid adjacent pair, in zero-based coordinates.adjacentRight: Right endpoint of a valid adjacent pair.trans: The source's adjacent transposition.DLetter: Letters of (2.1); false/true label kappa_0/kappa_1.DFree: Free algebra before imposing (2.2)--(2.5).dt: Permutation letter in the free algebra.dk: Kappa letter in the free algebra.dy: Commuting-variable letter before the quotient.dg: Adjacent gamma as defined in (2.5).DRel: Exactly (2.2)--(2.5); the permutation identity represents the algebra unit.DBraid: The unspecialized degenerate affine braid algebra of Section 2.1.dbMap: Its canonical quotient homomorphism.GIndex: Indices 0,...,k, with none representing 0 and some j representing j+1.GLetter: Letters of the alternative presentation (2.8), with distinct gamma endpoints.GFree: Free algebra for the alternate presentation.gt: Permutation generator in the alternate presentation.gk: Kappa generator in the alternate presentation.gg: Gamma generator; the diagonal value is unused in every relation.gAction: Permutations fix index zero.GRel: Precisely the relations (2.9)--(2.11).GBraid: The algebra defined by the second presentation, with no scalar kappa specialization.gbMap: Its canonical quotient map.gY: The generator change y_j=kappa_j/2+sum_(0≤l<j) gamma_(l,j), (2.16).de: The source's e_i, defined by (2.21), before the BMW quotient.DParams: Parameter data, including the implicit invertibility of 2. No admissibility assumed.DWRel: All BMW relations (2.23)--(2.24), optionally specializing the two kappas.DW: The actual degenerate affine BMW algebra, including the chosen scalar specialization.dwMap: Canonical map into the presented algebra.ps: Constant series in a possibly noncommutative coefficient algebra.geometric: Geometric series (1-a u⁻¹)⁻¹, with its coefficients specified directly.infinityResolvent: The formal resolvent (u-a)⁻¹.halfResolvent: The formal series (2u-a)⁻¹ when h represents 1/2.DAdmissible: The admissibility identity (4.5), multiplied by u⁻² and written in X=u⁻¹.DCancel: Formal substitution for the additive cancellation test, with no test at level one.dEval: Canonical evaluation in the commuting y-generators, ordered by variable index.DCenterDescription: Equality of the center with the canonically evaluated cancellation ring.dRatio: The rational factor in (3.8), expanded at infinity using its unit constant denominator.dRatioProduct: Ordered product of the (3.8) factors for a finite family of commuting variables.seriesTail: Removing the constant coefficient shifts Xⁿ⁺¹ to Xⁿ, hence multiplies by u.dMomentPolynomial: Constructive compression representatives: coefficients of (z_0(u)+epsilonu-1/2) product R(y_j,u)-epsilonu+1/2. The cancelled principal part is implemented by seriesTail(product-1). These are polynomials, not arbitrary representatives of a compression equation.dMomentAt: Canonical representative evaluated in a larger level by the initial-variable inclusion.dMomentSeries: The positive or sign-reversed representative generating series at a specified level.AParams: Unit parameters and all integer-indexed moments from Section 2.4. The zeroth moment is supplied as parameter data, even when E_1 vanishes.ALetter: Group generators and their inverse letters; false/true means generator/inverse.AFree: Free algebra used to present the affine braid group algebra and its BMW quotient.aCrossing: A crossing or inverse crossing.ax: The flagpole group generator or its inverse.affineYWord: Y_j and Y_j⁻¹ from (2.38)--(2.39), constructed without any arbitrary inverse.affineContractionWord: E_i=1-(T_i-T_i⁻¹)/Q, (2.45).signedPow: Integer powers represented using an element and its specified inverse.AWRel: Exactly the group presentation (2.33)--(2.36) and quotient (2.42)--(2.43). All signs and both sides of each two-sided relation are retained.AW: The unrestricted affine BMW algebra; there is no cyclotomic polynomial relation.awMap: The canonical quotient map.multiplicativeResolvent: Y/(u-Y), expanded at infinity.pairResolvent: Y_i Y_(i+1)/(u²-Y_i Y_(i+1)), expanded at infinity.AAdmissible: The scalar admissibility condition (4.20); u²/(u²-1)=1+g.Laurent: Laurent polynomials with integer exponent vectors and finite support.aEval: Canonical Laurent evaluation using the actual Y_j and their constructed inverses.laurentVariable: A Laurent variable, or its inverse, as a finite exponent-vector monomial.aRatio: The factor of (3.27) after division by its leading u⁴ coefficient.aScalarFraction: The normalized numerator (u²-q²)(u²-q⁻²)/(u²-1)² in (3.26).aShiftedPositive: The shifted positive series Z_n^++z⁻¹/Q-u²/(u²-1), constructed by (3.28).aMomentPolynomial: Explicit integer-moment representatives as Laurent polynomials. At n=0 the supplied bilateral scalar sequence is retained. At higher n, positive moments come from (3.28) and negative ones from (3.26), using the unit constant z/Q of its positive factor. No E_i is cancelled.aMomentAt: Canonical evaluation of the n-variable representative at a larger level.aMomentSeries: The two series both use u⁻ˡ as degree; only the moment index changes sign.ACancel: Permutation invariance of Laurent coefficients and the formal reciprocal-pair test. The substitutions send (d_1,d_2,...) to (d_1-d_2,0,...) or (0,0,...).ACenterDescription: Center equality in the actual affine quotient via its canonical Laurent embedding.leftMultiples: Principal left ideal as the actual set of left multiples.CyclotomicIntegers: The actual ring Z[zeta] inside the complex numbers.CyclotomicField: The actual field Q(zeta) inside the complex numbers.integralRoot: The distinguished root as an element of its integer coefficient ring.Wheel: The r-variable root-of-unity wheel condition, as a formal polynomial identity.coefficientPowerSum: The integral power sum from the frozen library, extended along the canonical integer map.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Support21_P08
import Definitions.Def_QAlgorithms_Papers_Independent_Support21_P12
/-!
Statements from Daugherty--Ram--Virk, arXiv:1105.4207v2.
Indices in Fin k are the source's indices 1,...,k shifted down by one.
All presentations below are actual quotients of free algebras. No basis,
centrality, admissibility, or tower injectivity is included in a presentation.
The formal variable X in PowerSeries is u⁻¹, never a numerical specialization.
-/
namespace QAlgorithms.Papers.Independent.Intakenext100.P34
open QAlgorithms.Papers.Independent.Support21.P08 (Central)
noncomputable section
universe u
variable (C : Type u) [CommRing C]
/-- Valid adjacent-generator positions; this is empty at level one. -/
abbrev Adj (k : ℕ) := Fin (k - 1)
/-- Left endpoint of a valid adjacent pair, in zero-based coordinates. -/
def adjacentLeft {k : ℕ} (i : Adj k) : Fin k := ⟨i.val, by have := i.isLt; omega⟩
/-- Right endpoint of a valid adjacent pair. -/
def adjacentRight {k : ℕ} (i : Adj k) : Fin k := ⟨i.val + 1, by have := i.isLt; omega⟩
/-- The source's adjacent transposition. -/
def trans {k : ℕ} (i : Adj k) : Equiv.Perm (Fin k) := Equiv.swap (adjacentLeft i) (adjacentRight i)
/-- Letters of (2.1); false/true label kappa_0/kappa_1. -/
inductive DLetter (k : ℕ)
| perm : Equiv.Perm (Fin k) → DLetter k
| kappa : Bool → DLetter k
| y : Fin k → DLetter k
/-- Free algebra before imposing (2.2)--(2.5). -/
abbrev DFree (k : ℕ) := FreeAlgebra C (DLetter k)
/-- Permutation letter in the free algebra. -/
def dt {k : ℕ} (w : Equiv.Perm (Fin k)) : DFree C k := FreeAlgebra.ι C (.perm w)
/-- Kappa letter in the free algebra. -/
def dk {k : ℕ} (b : Bool) : DFree C k := FreeAlgebra.ι C (.kappa b)
/-- Commuting-variable letter before the quotient. -/
def dy {k : ℕ} (j : Fin k) : DFree C k := FreeAlgebra.ι C (.y j)
/-- Adjacent gamma as defined in (2.5). -/
def dg {k : ℕ} (i : Adj k) : DFree C k :=
dy C (adjacentRight i) - dt C (trans i) * dy C (adjacentLeft i) * dt C (trans i)
/-- Exactly (2.2)--(2.5); the permutation identity represents the algebra unit. -/
inductive DRel (k : ℕ) : DFree C k → DFree C k → Prop
| identity : DRel k (dt C (1 : Equiv.Perm (Fin k))) 1
| perm (w v) : DRel k (dt C w * dt C v) (dt C (w * v))
| yy (i j) : DRel k (dy C i * dy C j) (dy C j * dy C i)
| kappas : DRel k (dk C false * dk C true) (dk C true * dk C false)
| kappay (b j) : DRel k (dk C b * dy C j) (dy C j * dk C b)
| kappa0t (i : Adj k) :
DRel k (dk C false * dt C (trans i)) (dt C (trans i) * dk C false)
| kappa1first (i : Adj k) (h : i.val = 0) :
DRel k (dk C true * dt C (trans i) * dk C true * dt C (trans i))
(dt C (trans i) * dk C true * dt C (trans i) * dk C true)
| kappa1other (i : Adj k) (h : i.val ≠ 0) :
DRel k (dk C true * dt C (trans i)) (dt C (trans i) * dk C true)
| sum (i : Adj k) :
DRel k (dt C (trans i) * (dy C (adjacentLeft i) + dy C (adjacentRight i)))
((dy C (adjacentLeft i) + dy C (adjacentRight i)) * dt C (trans i))
| distant (i : Adj k) (j : Fin k) (h1 : j ≠ adjacentLeft i) (h2 : j ≠ adjacentRight i) :
DRel k (dy C j * dt C (trans i)) (dt C (trans i) * dy C j)
| gamma (i j : Adj k) (h : j.val = i.val + 1) :
DRel k (dt C (trans i) * dt C (trans j) * dg C i * dt C (trans j) * dt C (trans i))
(dg C j)
/-- The unspecialized degenerate affine braid algebra of Section 2.1. -/
abbrev DBraid (k : ℕ) := RingQuot (DRel C k)
/-- Its canonical quotient homomorphism. -/
def dbMap (k : ℕ) : DFree C k →ₐ[C] DBraid C k := RingQuot.mkAlgHom C (DRel C k)
/-- Indices 0,...,k, with none representing 0 and some j representing j+1. -/
abbrev GIndex (k : ℕ) := Option (Fin k)
/-- Letters of the alternative presentation (2.8), with distinct gamma endpoints. -/
inductive GLetter (k : ℕ)
| perm : Equiv.Perm (Fin k) → GLetter k
| kappa : GIndex k → GLetter k
| gamma : {p : GIndex k × GIndex k // p.1 ≠ p.2} → GLetter k
/-- Free algebra for the alternate presentation. -/
abbrev GFree (k : ℕ) := FreeAlgebra C (GLetter k)
/-- Permutation generator in the alternate presentation. -/
def gt {k : ℕ} (w : Equiv.Perm (Fin k)) : GFree C k := FreeAlgebra.ι C (.perm w)
/-- Kappa generator in the alternate presentation. -/
def gk {k : ℕ} (j : GIndex k) : GFree C k := FreeAlgebra.ι C (.kappa j)
/-- Gamma generator; the diagonal value is unused in every relation. -/
def gg {k : ℕ} (i j : GIndex k) : GFree C k :=
if h : i ≠ j then FreeAlgebra.ι C (.gamma ⟨(i,j),h⟩) else 0
/-- Permutations fix index zero. -/
def gAction {k : ℕ} (w : Equiv.Perm (Fin k)) : GIndex k → GIndex k := Option.map w
/-- Precisely the relations (2.9)--(2.11). -/
inductive GRel (k : ℕ) : GFree C k → GFree C k → Prop
| identity : GRel k (gt C (1 : Equiv.Perm (Fin k))) 1
| perm (w v) : GRel k (gt C w * gt C v) (gt C (w*v))
| conjugateKappa (w) (i : GIndex k) :
GRel k (gt C w * gk C i * gt C w⁻¹) (gk C (gAction w i))
| conjugateGamma (w) (i j : GIndex k) (h : i ≠ j) :
GRel k (gt C w * gg C i j * gt C w⁻¹) (gg C (gAction w i) (gAction w j))
| kappas (i j : GIndex k) : GRel k (gk C i * gk C j) (gk C j * gk C i)
| kappaGamma (i l m : GIndex k) (h : l ≠ m) :
GRel k (gk C i * gg C l m) (gg C l m * gk C i)
| symmetry (i j : GIndex k) (h : i ≠ j) : GRel k (gg C i j) (gg C j i)
| disjoint (p r l m : GIndex k) (hpr : p ≠ r) (hlm : l ≠ m)
(hpl : p ≠ l) (hpm : p ≠ m) (hrl : r ≠ l) (hrm : r ≠ m) :
GRel k (gg C p r * gg C l m) (gg C l m * gg C p r)
| triangle (i j r : GIndex k) (hij : i ≠ j) (hir : i ≠ r) (hjr : j ≠ r) :
GRel k (gg C i j * (gg C i r + gg C j r))
((gg C i r + gg C j r) * gg C i j)
/-- The algebra defined by the second presentation, with no scalar kappa specialization. -/
abbrev GBraid (k : ℕ) := RingQuot (GRel C k)
/-- Its canonical quotient map. -/
def gbMap (k : ℕ) : GFree C k →ₐ[C] GBraid C k := RingQuot.mkAlgHom C (GRel C k)
/-- The generator change y_j=kappa_j/2+sum_(0≤l<j) gamma_(l,j), (2.16). -/
def gY (k : ℕ) (half : C) (j : Fin k) : GFree C k :=
algebraMap C (GFree C k) half*gk C (some j) + gg C none (some j) +
∑ l : Fin k, if l.val < j.val then gg C (some l) (some j) else 0
example (half : C) : gY C 1 half (0 : Fin 1) =
algebraMap C (GFree C 1) half*gk C (some 0) + gg C none (some 0) := by
simp [gY]
/-- The source's e_i, defined by (2.21), before the BMW quotient. -/
def de {k : ℕ} (i : Adj k) : DFree C k :=
1 + dt C (trans i) * dy C (adjacentLeft i) - dy C (adjacentRight i) * dt C (trans i)
/-- Parameter data, including the implicit invertibility of 2. No admissibility assumed. -/
structure DParams where
two : Cˣ
two_val : (two : C) = 2
epsilon : C
epsilon_sign : epsilon = 1 ∨ epsilon = -1
moment : ℕ → C
scalarKappa : Option (C × C)
/-- All BMW relations (2.23)--(2.24), optionally specializing the two kappas. -/
inductive DWRel (P : DParams C) (k : ℕ) : DFree C k → DFree C k → Prop
| braid {a b} (h : DRel C k a b) : DWRel P k a b
| et (i : Adj k) : DWRel P k (de C i * dt C (trans i))
(algebraMap C (DFree C k) P.epsilon * de C i)
| te (i : Adj k) : DWRel P k (dt C (trans i) * de C i)
(algebraMap C (DFree C k) P.epsilon * de C i)
| neighbor (i j : Adj k) (h : i.val + 1 = j.val ∨ j.val + 1 = i.val) :
DWRel P k (de C i * dt C (trans j) * de C i)
(algebraMap C (DFree C k) P.epsilon * de C i)
| compression (i : Adj k) (h : i.val = 0) (n : ℕ) :
DWRel P k (de C i * dy C (adjacentLeft i) ^ n * de C i)
(algebraMap C (DFree C k) (P.moment n) * de C i)
| killLeft (i : Adj k) : DWRel P k (de C i * (dy C (adjacentLeft i) + dy C (adjacentRight i))) 0
| killRight (i : Adj k) : DWRel P k ((dy C (adjacentLeft i) + dy C (adjacentRight i)) * de C i) 0
| scalar0 (a b : C) (h : P.scalarKappa = some (a,b)) :
DWRel P k (dk C false) (algebraMap C (DFree C k) a)
| scalar1 (a b : C) (h : P.scalarKappa = some (a,b)) :
DWRel P k (dk C true) (algebraMap C (DFree C k) b)
/-- The actual degenerate affine BMW algebra, including the chosen scalar specialization. -/
abbrev DW (P : DParams C) (k : ℕ) := RingQuot (DWRel C P k)
/-- Canonical map into the presented algebra. -/
def dwMap (P : DParams C) (k : ℕ) : DFree C k →ₐ[C] DW C P k :=
RingQuot.mkAlgHom C (DWRel C P k)
/-- Constant series in a possibly noncommutative coefficient algebra. -/
abbrev ps {A : Type*} [Semiring A] (a : A) : PowerSeries A := PowerSeries.C a
/-- Geometric series (1-a u⁻¹)⁻¹, with its coefficients specified directly. -/
def geometric {A : Type*} [Semiring A] (a : A) : PowerSeries A := PowerSeries.mk (fun n => a ^ n)
/-- The formal resolvent (u-a)⁻¹. -/
def infinityResolvent {A : Type*} [Semiring A] (a : A) : PowerSeries A := PowerSeries.X * geometric a
/-- The formal series (2u-a)⁻¹ when h represents 1/2. -/
def halfResolvent {A : Type*} [Semiring A] (h a : A) : PowerSeries A :=
ps h * PowerSeries.X * geometric (h * a)
example {A : Type*} [Semiring A] (a : A) : PowerSeries.coeff 0 (geometric a) = 1 := by
simp [geometric]
example {A : Type*} [Semiring A] (a : A) : PowerSeries.coeff 0 (infinityResolvent a) = 0 := by
simp [infinityResolvent]
/-- The admissibility identity (4.5), multiplied by u⁻² and written in X=u⁻¹. -/
def DAdmissible (P : DParams C) : Prop :=
let h : C := ↑P.two⁻¹
let z := PowerSeries.mk P.moment
let zm := PowerSeries.mk (fun n => (-1 : C)^n * P.moment n)
(PowerSeries.X*zm-ps h*PowerSeries.X-ps P.epsilon) *
(PowerSeries.X*z-ps h*PowerSeries.X+ps P.epsilon) =
(ps h*PowerSeries.X-ps P.epsilon)*(ps h*PowerSeries.X+ps P.epsilon)
/-- Formal substitution for the additive cancellation test, with no test at level one. -/
def DCancel (k : ℕ) (f : MvPolynomial (Fin k) C) : Prop :=
MvPolynomial.IsSymmetric f ∧ ∀ h : 2 ≤ k,
let a : Fin k := ⟨0, by omega⟩
let b : Fin k := ⟨1, by omega⟩
MvPolynomial.eval₂ MvPolynomial.C
(fun j => if j = a then MvPolynomial.X a else if j = b then -MvPolynomial.X a
else MvPolynomial.X j) f =
MvPolynomial.eval₂ MvPolynomial.C
(fun j => if j = a ∨ j = b then 0 else MvPolynomial.X j) f
/-- Canonical evaluation in the commuting y-generators, ordered by variable index. -/
def dEval (P : DParams C) (k : ℕ) (f : MvPolynomial (Fin k) C) : DW C P k :=
(AddMonoidAlgebra.coeff f).sum (fun d c => algebraMap C (DW C P k) c *
(List.ofFn (fun j : Fin k => (dwMap C P k (dy C j)) ^ d j)).prod)
/-- Equality of the center with the canonically evaluated cancellation ring. -/
def DCenterDescription (P : DParams C) (k : ℕ) : Prop :=
Function.Injective (dEval C P k) ∧
∀ a : DW C P k, Central a ↔ ∃ f, DCancel C k f ∧ dEval C P k f = a
/-- The rational factor in (3.8), expanded at infinity using its unit constant denominator. -/
def dRatio {A : Type*} [Ring A] (a : A) : PowerSeries A :=
let t : PowerSeries A := PowerSeries.X
let plus := 1+ps a*t
let minus := 1-ps a*t
let numerator := (plus^2-t^2)*minus^2
let denominator := (minus^2-t^2)*plus^2
numerator*PowerSeries.invOfUnit denominator 1
/-- Ordered product of the (3.8) factors for a finite family of commuting variables. -/
def dRatioProduct {A : Type*} [Ring A] {n : ℕ} (y : Fin n → A) : PowerSeries A :=
(List.ofFn (fun j => dRatio (y j))).prod
/-- Removing the constant coefficient shifts Xⁿ⁺¹ to Xⁿ, hence multiplies by u. -/
def seriesTail {A : Type*} [Semiring A] (s : PowerSeries A) : PowerSeries A :=
PowerSeries.mk (fun n => PowerSeries.coeff (n+1) s)
/-- Constructive compression representatives: coefficients of
(z_0(u)+epsilon*u-1/2) product R(y_j,u)-epsilon*u+1/2.
The cancelled principal part is implemented by seriesTail(product-1).
These are polynomials, not arbitrary representatives of a compression equation. -/
def dMomentPolynomial (P : DParams C) (n ell : ℕ) : MvPolynomial (Fin n) C :=
let product := dRatioProduct (fun j : Fin n => (MvPolynomial.X j : MvPolynomial (Fin n) C))
let z := PowerSeries.mk (fun m => MvPolynomial.C (P.moment m) : ℕ → MvPolynomial (Fin n) C)
let half := MvPolynomial.C (↑P.two⁻¹ : C)
PowerSeries.coeff ell ((z-ps half)*product+ps half+
ps (MvPolynomial.C P.epsilon)*seriesTail (product-1))
/-- Canonical representative evaluated in a larger level by the initial-variable inclusion. -/
def dMomentAt (P : DParams C) (n level ell : ℕ) (h : n ≤ level) : DW C P level :=
dEval C P level (MvPolynomial.rename (Fin.castLE h) (dMomentPolynomial C P n ell))
/-- The positive or sign-reversed representative generating series at a specified level. -/
def dMomentSeries (P : DParams C) (n level : ℕ) (h : n ≤ level) (negative : Bool := false) :
PowerSeries (DW C P level) :=
PowerSeries.mk (fun ell => (if negative then (-1 : DW C P level)^ell else 1)*
dMomentAt C P n level ell h)
example (P : DParams C) (ell : ℕ) :
dMomentPolynomial C P 0 ell = MvPolynomial.C (P.moment ell) := by
simp [dMomentPolynomial, dRatioProduct, seriesTail]
/-- Unit parameters and all integer-indexed moments from Section 2.4.
The zeroth moment is supplied as parameter data, even when E_1 vanishes. -/
structure AParams where
q : Cˣ
z : Cˣ
Q : Cˣ
Q_val : (Q : C) = (q : C) - (↑q⁻¹ : C)
moment : ℤ → C
moment_zero : moment 0 = 1 + ((z : C) - (↑z⁻¹ : C)) * (↑Q⁻¹ : C)
/-- Group generators and their inverse letters; false/true means generator/inverse. -/
inductive ALetter (k : ℕ)
| crossing : Adj k → Bool → ALetter k
| flag : Bool → ALetter k
/-- Free algebra used to present the affine braid group algebra and its BMW quotient. -/
abbrev AFree (k : ℕ) := FreeAlgebra C (ALetter k)
/-- A crossing or inverse crossing. -/
def aCrossing {k : ℕ} (i : Adj k) (inverse : Bool := false) : AFree C k :=
FreeAlgebra.ι C (.crossing i inverse)
/-- The flagpole group generator or its inverse. -/
def ax {k : ℕ} (inverse : Bool := false) : AFree C k := FreeAlgebra.ι C (.flag inverse)
/-- Y_j and Y_j⁻¹ from (2.38)--(2.39), constructed without any arbitrary inverse. -/
def affineYWord (P : AParams C) {k : ℕ} (j : Fin k) (inverse : Bool := false) : AFree C k :=
let word := List.ofFn (fun i : Fin j.val =>
aCrossing C (⟨i.val, by have := i.isLt; have := j.isLt; omega⟩ : Adj k) inverse)
let middle := algebraMap C (AFree C k) (if inverse then (↑P.z⁻¹ : C) else (P.z : C)) * ax C inverse
word.reverse.prod * middle * word.prod
/-- E_i=1-(T_i-T_i⁻¹)/Q, (2.45). -/
def affineContractionWord (P : AParams C) {k : ℕ} (i : Adj k) : AFree C k :=
1-algebraMap C (AFree C k) (↑P.Q⁻¹ : C)*(aCrossing C i false-aCrossing C i true)
/-- Integer powers represented using an element and its specified inverse. -/
def signedPow {A : Type*} [Monoid A] (a inverse : A) (n : ℤ) : A :=
if 0 ≤ n then a ^ n.toNat else inverse ^ (-n).toNat
/-- Exactly the group presentation (2.33)--(2.36) and quotient (2.42)--(2.43).
All signs and both sides of each two-sided relation are retained. -/
inductive AWRel (P : AParams C) (k : ℕ) : AFree C k → AFree C k → Prop
| inverseT (i : Adj k) (b : Bool) : AWRel P k (aCrossing C i b * aCrossing C i (!b)) 1
| inverseX (b : Bool) : AWRel P k (ax C b * ax C (!b)) 1
| distant (i j : Adj k) (h1 : i.val+1 ≠ j.val) (h2 : j.val+1 ≠ i.val) :
AWRel P k (aCrossing C i * aCrossing C j) (aCrossing C j * aCrossing C i)
| braid (i j : Adj k) (h : j.val = i.val+1) :
AWRel P k (aCrossing C i * aCrossing C j * aCrossing C i) (aCrossing C j * aCrossing C i * aCrossing C j)
| flagFirst (i : Adj k) (h : i.val = 0) :
AWRel P k (ax C * aCrossing C i * ax C * aCrossing C i) (aCrossing C i * ax C * aCrossing C i * ax C)
| flagOther (i : Adj k) (h : 0 < i.val) : AWRel P k (ax C * aCrossing C i) (aCrossing C i * ax C)
| et (i : Adj k) (b : Bool) : AWRel P k (affineContractionWord C P i * aCrossing C i b)
(algebraMap C (AFree C k) (if b then (P.z : C) else (↑P.z⁻¹ : C)) * affineContractionWord C P i)
| te (i : Adj k) (b : Bool) : AWRel P k (aCrossing C i b * affineContractionWord C P i)
(algebraMap C (AFree C k) (if b then (P.z : C) else (↑P.z⁻¹ : C)) * affineContractionWord C P i)
| neighbor (i j : Adj k) (h : i.val+1 = j.val ∨ j.val+1 = i.val) (b : Bool) :
AWRel P k (affineContractionWord C P i * aCrossing C j b * affineContractionWord C P i)
(algebraMap C (AFree C k) (if b then (↑P.z⁻¹ : C) else (P.z : C)) * affineContractionWord C P i)
| compression (i : Adj k) (h : i.val = 0) (n : ℤ) :
AWRel P k (affineContractionWord C P i * signedPow (affineYWord C P (adjacentLeft i) false) (affineYWord C P (adjacentLeft i) true) n * affineContractionWord C P i)
(algebraMap C (AFree C k) (P.moment n) * affineContractionWord C P i)
| killLeft (i : Adj k) : AWRel P k (affineContractionWord C P i * affineYWord C P (adjacentLeft i) * affineYWord C P (adjacentRight i)) (affineContractionWord C P i)
| killRight (i : Adj k) : AWRel P k (affineYWord C P (adjacentLeft i) * affineYWord C P (adjacentRight i) * affineContractionWord C P i) (affineContractionWord C P i)
/-- The unrestricted affine BMW algebra; there is no cyclotomic polynomial relation. -/
abbrev AW (P : AParams C) (k : ℕ) := RingQuot (AWRel C P k)
/-- The canonical quotient map. -/
def awMap (P : AParams C) (k : ℕ) : AFree C k →ₐ[C] AW C P k :=
RingQuot.mkAlgHom C (AWRel C P k)
/-- Y/(u-Y), expanded at infinity. -/
def multiplicativeResolvent {A : Type*} [Semiring A] (a : A) : PowerSeries A :=
ps a * infinityResolvent a
/-- Y_i Y_(i+1)/(u²-Y_i Y_(i+1)), expanded at infinity. -/
def pairResolvent {A : Type*} [Ring A] (a : A) : PowerSeries A :=
PowerSeries.mk (fun n => if n % 2 = 0 then a ^ (n/2) else 0) - 1
example {A : Type*} [Semiring A] (a : A) :
PowerSeries.coeff 0 (multiplicativeResolvent a) = 0 := by
simp [multiplicativeResolvent, infinityResolvent]
example {A : Type*} [Ring A] (a : A) : PowerSeries.coeff 0 (pairResolvent a) = 0 := by
simp [pairResolvent]
/-- The scalar admissibility condition (4.20); u²/(u²-1)=1+g. -/
def AAdmissible (P : AParams C) : Prop :=
let zp := PowerSeries.mk (fun n => P.moment (n : ℤ))
let zm := PowerSeries.mk (fun n => P.moment (-(n : ℤ)))
let g : PowerSeries C := pairResolvent (1 : C)
let qi := ps (↑P.Q⁻¹ : C)
(zm-ps (P.z : C)*qi-(1+g))*(zp+ps (↑P.z⁻¹ : C)*qi-(1+g)) =
-(qi^2*(1+ps (2-(P.q : C)^2-(↑P.q⁻¹ : C)^2)*(g+g^2)))
/-- Laurent polynomials with integer exponent vectors and finite support. -/
abbrev Laurent (k : ℕ) := AddMonoidAlgebra C (Fin k → ℤ)
/-- Canonical Laurent evaluation using the actual Y_j and their constructed inverses. -/
def aEval (P : AParams C) (k : ℕ) (f : Laurent C k) : AW C P k :=
(AddMonoidAlgebra.coeff f).sum (fun d c => algebraMap C (AW C P k) c *
(List.ofFn (fun j : Fin k => signedPow (awMap C P k (affineYWord C P j false))
(awMap C P k (affineYWord C P j true)) (d j))).prod)
/-- A Laurent variable, or its inverse, as a finite exponent-vector monomial. -/
def laurentVariable {k : ℕ} (j : Fin k) (inverse : Bool := false) : Laurent C k :=
AddMonoidAlgebra.single (Pi.single j (if inverse then (-1 : ℤ) else 1)) 1
/-- The factor of (3.27) after division by its leading u⁴ coefficient. -/
def aRatio {A : Type*} [Ring A] (q qi y yi : A) : PowerSeries A :=
let t : PowerSeries A := PowerSeries.X
let f (a : A) := 1-ps a*t
(f y)^2*f (qi^2*yi)*f (q^2*yi)*
PowerSeries.invOfUnit ((f yi)^2*f (q^2*y)*f (qi^2*y)) 1
/-- The normalized numerator (u²-q²)(u²-q⁻²)/(u²-1)² in (3.26). -/
def aScalarFraction {A : Type*} [Ring A] (q qi : A) : PowerSeries A :=
let g := pairResolvent (1 : A)
1+ps (2-q^2-qi^2)*(g+g^2)
/-- The shifted positive series Z_n^++z⁻¹/Q-u²/(u²-1), constructed by (3.28). -/
def aShiftedPositive (P : AParams C) (n : ℕ) : PowerSeries (Laurent C n) :=
let c := algebraMap C (Laurent C n)
let h := 1+pairResolvent (1 : Laurent C n)
let initial := PowerSeries.mk (fun ell => c (P.moment (ell : ℤ)))+
ps (c ((↑P.z⁻¹ : C)*(↑P.Q⁻¹ : C)))-h
initial*(List.ofFn (fun j : Fin n => aRatio (c (P.q : C)) (c (↑P.q⁻¹ : C))
(laurentVariable C j false) (laurentVariable C j true))).prod
/-- Explicit integer-moment representatives as Laurent polynomials.
At n=0 the supplied bilateral scalar sequence is retained. At higher n,
positive moments come from (3.28) and negative ones from (3.26), using the
unit constant z/Q of its positive factor. No E_i is cancelled. -/
def aMomentPolynomial (P : AParams C) (n : ℕ) (ell : ℤ) : Laurent C n :=
let c := algebraMap C (Laurent C n)
if n = 0 then c (P.moment ell) else
let h := 1+pairResolvent (1 : Laurent C n)
let shifted := aShiftedPositive C P n
let positive := shifted-ps (c ((↑P.z⁻¹ : C)*(↑P.Q⁻¹ : C)))+h
let unitConstant : (Laurent C n)ˣ := Units.map c (P.z*P.Q⁻¹)
let negative := ps (c ((P.z : C)*(↑P.Q⁻¹ : C)))+h-
ps (c ((↑P.Q⁻¹ : C)^2))*aScalarFraction (c (P.q : C)) (c (↑P.q⁻¹ : C))*
PowerSeries.invOfUnit shifted unitConstant
if 0 ≤ ell then PowerSeries.coeff ell.toNat positive
else PowerSeries.coeff (-ell).toNat negative
/-- Canonical evaluation of the n-variable representative at a larger level. -/
def aMomentAt (P : AParams C) (n level : ℕ) (ell : ℤ) (h : n ≤ level) : AW C P level :=
(AddMonoidAlgebra.coeff (aMomentPolynomial C P n ell)).sum (fun d c => algebraMap C (AW C P level) c *
(List.ofFn (fun j : Fin n =>
let a : Fin level := ⟨j.val, lt_of_lt_of_le j.isLt h⟩
signedPow (awMap C P level (affineYWord C P a false))
(awMap C P level (affineYWord C P a true)) (d j))).prod)
/-- The two series both use u⁻ˡ as degree; only the moment index changes sign. -/
def aMomentSeries (P : AParams C) (n level : ℕ) (h : n ≤ level) (negative : Bool := false) :
PowerSeries (AW C P level) :=
PowerSeries.mk (fun ell => aMomentAt C P n level
(if negative then -(ell : ℤ) else (ell : ℤ)) h)
example (P : AParams C) (ell : ℤ) :
aMomentPolynomial C P 0 ell = algebraMap C (Laurent C 0) (P.moment ell) := by
simp [aMomentPolynomial]
/-- Permutation invariance of Laurent coefficients and the formal reciprocal-pair test.
The substitutions send (d_1,d_2,...) to (d_1-d_2,0,...) or (0,0,...). -/
def ACancel (k : ℕ) (f : Laurent C k) : Prop :=
(∀ (w : Equiv.Perm (Fin k)) (d : Fin k → ℤ), AddMonoidAlgebra.coeff f (d ∘ w) = AddMonoidAlgebra.coeff f d) ∧
∀ h : 2 ≤ k,
let a : Fin k := ⟨0, by omega⟩
let b : Fin k := ⟨1, by omega⟩
(AddMonoidAlgebra.coeff f).sum (fun d c => (AddMonoidAlgebra.single
(fun j => if j = a then d a-d b else if j = b then 0 else d j) c : Laurent C k)) =
(AddMonoidAlgebra.coeff f).sum (fun d c => (AddMonoidAlgebra.single
(fun j => if j = a ∨ j = b then 0 else d j) c : Laurent C k))
/-- Center equality in the actual affine quotient via its canonical Laurent embedding. -/
def ACenterDescription (P : AParams C) (k : ℕ) : Prop :=
Function.Injective (aEval C P k) ∧
∀ a : AW C P k, Central a ↔ ∃ f, ACancel C k f ∧ aEval C P k f = a
/-- Principal left ideal as the actual set of left multiples. -/
def leftMultiples {A : Type*} [Mul A] (e : A) : Set A := {a | ∃ b, a = b*e}
/-- The actual ring Z[zeta] inside the complex numbers. -/
def CyclotomicIntegers (zeta : ℂ) := Algebra.adjoin ℤ ({zeta} : Set ℂ)
/-- The actual field Q(zeta) inside the complex numbers. -/
def CyclotomicField (zeta : ℂ) := IntermediateField.adjoin ℚ ({zeta} : Set ℂ)
/-- The distinguished root as an element of its integer coefficient ring. -/
def integralRoot (zeta : ℂ) : CyclotomicIntegers zeta :=
⟨zeta, Algebra.subset_adjoin (by simp)⟩
/-- The r-variable root-of-unity wheel condition, as a formal polynomial identity. -/
def Wheel (k r : ℕ) (hk : 0 < k) (zeta : C) (f : MvPolynomial (Fin k) C) : Prop :=
MvPolynomial.IsSymmetric f ∧
MvPolynomial.eval₂ MvPolynomial.C
(fun j => if j.val < r then MvPolynomial.C (zeta^j.val)*MvPolynomial.X (⟨0,hk⟩ : Fin k)
else MvPolynomial.X j) f =
MvPolynomial.eval₂ MvPolynomial.C
(fun j => if j.val < r then 0 else MvPolynomial.X j) f
/-- The integral power sum from the frozen library, extended along the canonical integer map. -/
def coefficientPowerSum (k n : ℕ) : MvPolynomial (Fin k) C :=
MvPolynomial.map (Int.castRingHom C)
(QAlgorithms.Papers.Independent.Support21.P12.powerSum k n)
example (k : ℕ) : coefficientPowerSum C k 1 = ∑ j : Fin k, MvPolynomial.X j := by
simp [coefficientPowerSum, QAlgorithms.Papers.Independent.Support21.P12.powerSum]
end
end QAlgorithms.Papers.Independent.Intakenext100.P34
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P34.AAdmissible
Let be a commutative ring, and let consist of units and moments , satisfying and . Define
The predicate -admissibility of means precisely the following equality in , where coefficients such as and denote constant series:
QAlgorithms.Papers.Independent.Intakenext100.P34.ACancel
For a commutative ring , a natural number , and a Laurent polynomial with coefficients in and finite support, this predicate says that for every permutation of and every exponent vector , and that, whenever , the following equality holds in the same Laurent polynomial ring:
Thus the second condition is precisely ; coefficients of monomials that coincide after substitution are added. For or , there is no second condition, and the permutation condition is automatic.
QAlgorithms.Papers.Independent.Intakenext100.P34.ACenterDescription
Let be a commutative ring, and let consist of units , with , and a sequence satisfying . For , let be the unital associative -algebra presented by invertible generators . Put , with , and . Its defining relations, for all indices for which the displayed generators exist, are
The relations involving index among the or occur only when . Define a function from the Laurent polynomial ring by ordered evaluation,
where coefficients act through the structure map . The predicate asserts that this function is injective on the entire Laurent polynomial ring and that, for every ,
No positivity of , nontriviality of , or admissibility identity for is assumed in this definition. When , the Laurent polynomial ring is , evaluation is the scalar map, and the presented algebra still has the invertible generator .
QAlgorithms.Papers.Independent.Intakenext100.P34.AFree
For a commutative ring and every natural number , this abbreviates the free associative unital -algebra on the letters consisting of a crossing letter for every natural number with and every Boolean , together with a flag letter for every Boolean . No relations among these generators are imposed beyond the -algebra axioms. When or , this is the free -algebra on the two flag letters.
QAlgorithms.Papers.Independent.Intakenext100.P34.ALetter
For every natural number , this defines a type of letters with two distinct constructors: a crossing letter for every natural number satisfying and every Boolean , and a flag letter for every Boolean . Letters from different constructors are distinct, and each constructor distinguishes its arguments. The crossing index set is , where natural-number subtraction is truncated at zero. Thus, when or , there are no crossing letters and there are exactly two flag letters. The Boolean labels carry no additional relations.
QAlgorithms.Papers.Independent.Intakenext100.P34.AParams
For a commutative ring , this structure consists of three specified units , an equality of their underlying ring elements
an integer-indexed sequence , and an equality
All inverses here are inverses of the specified units. In particular, is required to be a unit because it equals . The sequence includes both positive and negative integer indices, and the only condition imposed on its values by this structure is the displayed value at .
QAlgorithms.Papers.Independent.Intakenext100.P34.AW
For a commutative ring , parameters comprising units and satisfying and , and any natural number , this abbreviates the ring quotient of the free associative unital -algebra on generators for natural with and Boolean , together with , by the smallest ring congruence imposing the equations below. Identify the Boolean labels with , put , , , and define, with scalars embedded from ,
Here , empty products equal , and means for integers and for . The imposed equations, for every valid crossing index and Boolean , are
The distant equation includes , and the compression equations include . When or , there are no crossing generators and the only imposed equations are for both Boolean values.
QAlgorithms.Papers.Independent.Intakenext100.P34.AWRel
Let be a commutative ring, let consist of units and a function with and , and let be any natural number. Put . In the free associative unital -algebra on crossing generators for and Boolean , and flag generators , identify false and true with and , respectively, write , and put , ,
Scalars here are embedded from , and empty products equal . For , put when and when , so . This defines a binary relation whose constructor pairs are exactly the following, with all displayed crossing indices in , every Boolean, and every integral:
The arrows denote membership in this relation, rather than equalities already holding in the free algebra; the definition does not itself close these pairs under symmetry, transitivity, addition, or multiplication. The distant rule permits . When or , only the flag inverse pairs remain.
QAlgorithms.Papers.Independent.Intakenext100.P34.Adj
For every natural number , is the type of natural numbers satisfying , where subtraction is truncated at zero. Thus is empty for and ; for , its elements are .
QAlgorithms.Papers.Independent.Intakenext100.P34.CyclotomicField
For any complex number , this defines the smallest intermediate field of containing , namely
No root-of-unity or algebraicity assumption is imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P34.CyclotomicIntegers
For any complex number , this defines the smallest -subalgebra of containing , namely
There is no assumption that is a root of unity or is algebraic or integral.
QAlgorithms.Papers.Independent.Intakenext100.P34.DAdmissible
Let be the commutative coefficient ring, and let consist of a specified unit whose underlying element equals , an element with or , a sequence , and an optional scalar pair. Put , and form the formal power series
This definition is the proposition that the following equality holds in , with and inserted as constant series:
It is an equality of all formal coefficients, including degree zero, and requires no analytic convergence. The optional scalar pair does not occur in this proposition.
QAlgorithms.Papers.Independent.Intakenext100.P34.DBraid
For a commutative ring and a natural number , is the quotient of the free associative unital -algebra on generators indexed by permutations of , two generators , and generators for , by the smallest ring congruence imposing the following equations. Writing for the permutation exchanging and , and , the equations are
Here acts by , and uses truncated natural-number subtraction. The definition includes and , when there are no adjacent indices; for there are also no generators.
QAlgorithms.Papers.Independent.Intakenext100.P34.DCancel
For a commutative ring , a natural number , and a polynomial , this predicate means that is invariant under every permutation of its variables and, whenever , the following equality holds as an equality of polynomials:
The coefficients are unchanged by both substitutions. For or , the substitution condition is vacuous, so only permutation invariance is required.
QAlgorithms.Papers.Independent.Intakenext100.P34.DCenterDescription
Let be a commutative ring, , and let specify a unit with value , a sign , a sequence , and an optional scalar pair . Define as the associative unital -algebra with generators for permutations of , , and for . Write , , , and . Its relations, for existing indices, are
together with if , and no such scalar relations if . For a polynomial , let
with the product ordered by increasing index. The predicate asserts both that is injective on the entire polynomial ring , and that, for every ,
For , the substitution condition is vacuous; for , polynomial evaluation uses the empty product .
QAlgorithms.Papers.Independent.Intakenext100.P34.DFree
For a commutative ring and every natural number , is the free associative unital -algebra on formal generators indexed by permutations of , two formal generators , and formal generators indexed by . Its elements are finite -linear combinations of words in these generators; no additional relations among these generators are imposed. In particular, is a formal generator, and for the generating alphabet still contains and the two generators.
QAlgorithms.Papers.Independent.Intakenext100.P34.DLetter
For every natural number , is the disjoint union of three types of formal letters: a letter for each permutation of , a letter for each Boolean value , and a letter for each . Each constructor is injective, and letters from different constructors are distinct. For , there are no letters, while the unique permutation of the empty set still supplies a letter.
QAlgorithms.Papers.Independent.Intakenext100.P34.DParams
Over the commutative coefficient ring , a value of this structure consists of a specified unit together with a proof that its underlying element equals , an element together with a proof of the disjunction or , an arbitrary sequence , and an optional ordered pair of elements of . The optional pair is either absent or has the form . The structure imposes no further condition on the sequence or on this optional pair, and the two alternatives for need not be distinct in .
QAlgorithms.Papers.Independent.Intakenext100.P34.DRel
For a commutative ring and a natural number , work in the free associative unital -algebra on generators for permutations of , generators for Boolean values , and generators for . Write for the permutation exchanging and , and put whenever , with subtraction in the index bound truncated at zero. The binary relation is inductively generated by precisely the following ordered pairs, universally quantified over the indices and permutations indicated:
Here is permutation composition, acting by . These are pairs in a relation on the free algebra; reflexive, symmetric, transitive, additive, and multiplicative closure are not additional constructors of this relation. All clauses requiring an adjacent index have no instances for or , and the last clause has no instances for .
QAlgorithms.Papers.Independent.Intakenext100.P34.DW
For the commutative coefficient ring , a natural number , and parameters consisting of a unit representing , a sign , a sequence , and an optional scalar pair, this abbreviation denotes the following ring quotient. Start with the free associative unital -algebra on , for all permutations of , two generators , and generators , for . For , let exchange and , and abbreviate
Take the quotient by the smallest ring congruence imposing
Here , coefficients are inserted through the structural map from , and all indexed equations are imposed only when their indices exist. If the optional scalar pair is , also impose and ; if it is absent, impose neither of these additional equations. The compression equation includes . The definition allows and , when every equation requiring an adjacent index is absent, and it imposes no admissibility condition on .
QAlgorithms.Papers.Independent.Intakenext100.P34.DWRel
Let be the commutative coefficient ring, let consist of a specified unit with underlying element , an element satisfying or , a sequence , and an optional scalar pair, and let . Put , let exchange and for , and work in the free associative unital -algebra on , for permutations of , on , and on , for . Write for the structural image of , and define
The declaration defines the least binary relation on this free algebra containing the following ordered pairs:
All indices range over their stated sets, , and each pair is included only when its adjacent indices exist. In addition, for every such that the optional scalar pair of is exactly , it contains and . If that pair is absent, these last constructors supply no pairs. The compression pairs include , yielding . No reflexive, symmetric, transitive, or ring-congruence closure is part of this inductively defined relation itself. For or , there are no adjacent indices and hence no pairs requiring them.
QAlgorithms.Papers.Independent.Intakenext100.P34.GBraid
For every commutative ring and natural number , this denotes the ring quotient of the free associative unital -algebra on generators for permutations of , for , and for ordered distinct pairs in , imposing precisely the following generating equations and their consequences as ring equations. Write and . For all permutations and all indices satisfying the indicated restrictions, the equations are
The definition includes ; then there are no generators, and all conditions requiring distinct indices have no instances.
QAlgorithms.Papers.Independent.Intakenext100.P34.GFree
For every commutative ring and natural number , this denotes the free associative unital -algebra whose generators are for every permutation of , for every in , and for every ordered pair of distinct elements . No additional equations among these generators are imposed by this definition. In particular, opposite orders of a pair give separate generators. For , the generators consist of and .
QAlgorithms.Papers.Independent.Intakenext100.P34.GIndex
For every natural number , this defines the index type as the disjoint union of with one additional element. Write the additional element as and the element corresponding to as . Thus the index type has elements, and for it consists only of .
QAlgorithms.Papers.Independent.Intakenext100.P34.GLetter
For every natural number , let , where . This defines an alphabet with three disjoint kinds of letters: a letter indexed by each permutation of , a letter indexed by each element of , and a letter indexed by each ordered pair with . The two orders and index distinct letters. When , there is one permutation letter, one letter of the second kind, and no letters of the third kind.
QAlgorithms.Papers.Independent.Intakenext100.P34.GRel
For every commutative ring and natural number , set and . In the free associative unital -algebra with generators for permutations of , for , and for ordered distinct pairs in , extend the notation by and let , . This defines a binary relation consisting exactly of the following ordered pairs, for every choice of the displayed permutations and indices satisfying the stated restrictions:
The definition itself supplies no additional closure rules for this relation. The parameter may be zero, in which case has only and every clause requiring distinct indices has no instances.
QAlgorithms.Papers.Independent.Intakenext100.P34.Laurent
For a commutative ring and any natural number , including , denotes the additive monoid algebra of the group over : its elements are finite sums
with coefficients , addition coefficientwise, and multiplication determined by . Thus it is the Laurent polynomial algebra in commuting variables; for , the exponent group has one element and this algebra is canonically .
QAlgorithms.Papers.Independent.Intakenext100.P34.Wheel
For a commutative ring , natural numbers , a hypothesis , an arbitrary , and a polynomial , this predicate says that is invariant under every permutation of its variables and that
The equality is an equality of polynomials over , with coefficients left unchanged by the substitutions. There is no requirement that or that be a unit or a root of unity. For , both substitutions are the identity, so only symmetry is required; for , every variable is substituted, and the condition becomes .
QAlgorithms.Papers.Independent.Intakenext100.P34.aCrossing
For a commutative ring , an implicitly quantified natural number , an index , and a Boolean whose default value is false, this defines to be the canonical image of the crossing letter in the free associative unital -algebra generated by all crossing letters with and Boolean , and by the two Boolean-labelled flag letters. The parameter named “inverse” is just the Boolean label: this definition imposes no inverse relation between and . There is no permissible when or .
QAlgorithms.Papers.Independent.Intakenext100.P34.aEval
Let be a commutative ring, and let specify units and moments , with and . For any natural number , define as the associative -algebra generated by invertible . Set
The quotient relations, for all valid indices, are
where when , and when . For a Laurent polynomial in commuting variables, the function is the ordered evaluation
where is the scalar map. The sum is finite, and the factors are multiplied in increasing index order. For , the product is empty and the function sends the constant Laurent polynomial to ; the target still has its invertible generator .
QAlgorithms.Papers.Independent.Intakenext100.P34.aMomentAt
Let be a commutative ring, and let specify units and moments , with and . Fix natural numbers , a witness , and an integer . The target is the associative -algebra generated by invertible ; define
Its defining relations, for all valid indices, are
where for and for . To define the Laurent polynomial to be evaluated, work first in , the algebra of finitely supported integer-exponent monomials, and set
Scalars here are mapped into ; all inverses are formal series inverses, and has unit constant coefficient . Define
If , then
where is the scalar map and the factors occur in increasing index order. The witness allows each index below to be used at level . For , including , this value is simply .
QAlgorithms.Papers.Independent.Intakenext100.P34.aMomentPolynomial
Let be a commutative ring, and let consist of units and moments , satisfying and . For any natural number and any integer , the value lies in the Laurent polynomial algebra , whose monomials have integer exponent vectors and whose elements have finite support. Write for the scalar map and identify scalar coefficients with their images. Define in
All displayed scalar terms are constant series. The ratio denominators have constant coefficient , and has the unit constant coefficient ; the inverse of uses that unit. With denoting coefficient extraction, the definition is
In particular, uses the positive-series branch when .
QAlgorithms.Papers.Independent.Intakenext100.P34.aMomentSeries
Let be a commutative ring, and let specify units and moments , with and . Fix natural numbers , a witness , and a Boolean , defaulting to false. Let be the associative -algebra on invertible , with
and relations
for all valid indices, where for and for . Define Laurent polynomials in , the algebra of finite sums of integer-exponent monomials, by putting
Scalars are mapped into , ratio denominators have constant coefficient , and is the formal inverse using its unit constant coefficient . For , let
with factors in increasing order and the scalar map. Then the definition is
Both choices use as their constant coefficient. When , these series are respectively and ; is allowed.
QAlgorithms.Papers.Independent.Intakenext100.P34.aRatio
For any ring , not necessarily commutative, and any four elements , the series is
Here is the formal power series variable, elements of are constant series, the inverse is the formal power series inverse with constant coefficient , and all products have the displayed order. The denominator has constant coefficient . No relation asserting that or is an inverse of another argument is required.
QAlgorithms.Papers.Independent.Intakenext100.P34.aScalarFraction
For any ring , not necessarily commutative, and arbitrary elements , define
Then is the formal power series
with and the coefficient in parentheses treated as a constant series. The two arguments are arbitrary; no inverse relation between them is assumed.
QAlgorithms.Papers.Independent.Intakenext100.P34.aShiftedPositive
Let be a commutative ring, and let specify units and moments , satisfying and . For any natural number , let , meaning finite -linear combinations of integer-exponent monomials with multiplication given by addition of exponent vectors, and let be its scalar map. In , put
and, writing scalars for their images under , put
Each denominator is inverted as a formal power series with constant coefficient . The definition is
with the product taken in increasing index order. When , as a coefficient algebra is canonically , and the product of ratio factors is empty and equals .
QAlgorithms.Papers.Independent.Intakenext100.P34.adjacentLeft
For every natural number and every , meaning with truncated subtraction, is the element of whose value is . There are no such inputs when or .
QAlgorithms.Papers.Independent.Intakenext100.P34.adjacentRight
For every natural number and every , meaning with truncated subtraction, is the element of whose value is . There are no such inputs when or .
QAlgorithms.Papers.Independent.Intakenext100.P34.affineContractionWord
Let be a commutative ring, and let consist of units and a function satisfying and . For an implicitly quantified natural number and an index , let and be the two canonical crossing generators in the free associative unital -algebra on the crossing letters and two flag letters. This defines
with embedded through the canonical scalar map. This is a word in the free algebra; the definition itself asserts no idempotence or other relation for . There is no permissible when or .
QAlgorithms.Papers.Independent.Intakenext100.P34.affineYWord
Let be a commutative ring, and let consist of units and a function satisfying and . For an implicitly quantified natural number , an index , and a Boolean defaulting to false, write and for the canonical crossing and flag generators of the free associative unital -algebra on these letters, and put and . This defines the word
where scalars are embedded by the canonical map from . Both crossing products are empty products equal to when , so . There is no permissible when . The same Boolean is used in every crossing and in the flag; no inverse relations between the Boolean-labelled generators are imposed here. The fields and their constraints are part of , although this word uses only .
QAlgorithms.Papers.Independent.Intakenext100.P34.awMap
For a commutative ring , parameters consisting of units and with and , and any natural number , this defines the canonical -algebra homomorphism from the free associative unital -algebra on crossing letters , where and is Boolean, and the two flag letters, to its ring quotient by the following relations. Denote the free generators by , identify Boolean labels with , put , , , and define
using the canonical scalar embedding and empty products equal to . For , let if and otherwise. The target quotient imposes, for all valid crossing indices and Boolean ,
The homomorphism sends each free-algebra element to its class under the smallest ring congruence containing these equations. The distant rule allows equal indices, and compression includes exponent zero. For or , the source has only the two flag generators and the quotient imposes only their two inverse equations.
QAlgorithms.Papers.Independent.Intakenext100.P34.ax
For a commutative ring , an implicitly quantified natural number , and a Boolean whose default value is false, this defines to be the canonical image of the flag letter labelled by in the free associative unital -algebra generated by the two flag letters and the crossing letters for and Boolean . Both flag generators exist for every , including . The parameter named “inverse” does not impose an inverse relation between the two flag generators.
QAlgorithms.Papers.Independent.Intakenext100.P34.coefficientPowerSum
For a commutative ring and natural numbers , this defines the polynomial in variables over obtained by mapping the integer coefficients of the integer polynomial through the canonical homomorphism ; equivalently, it is
For , the empty sum is zero, including when ; for , the polynomial is the constant .
QAlgorithms.Papers.Independent.Intakenext100.P34.dEval
Let be a commutative ring, and let consist of a unit whose value is , an element satisfying or , a sequence , and an optional pair . For a natural number , write for the quotient of the free associative unital -algebra on generators , for permutations of , together with and . Put , , and , for , and write . The defining relations are
All indices in these relations must exist; additionally, if , impose and , whereas imposes neither scalar relation. For , the defined element of is
where is the image of the coefficient under the structural map , and the product is taken in increasing index order. The zero polynomial gives an empty sum, hence zero; when , the monomial product is empty and equals , so the definition sends a constant polynomial to its scalar image in .
QAlgorithms.Papers.Independent.Intakenext100.P34.dMomentAt
Let be a commutative ring, and let specify a unit with value , a sign , a sequence , and an optional pair . Fix natural numbers with . Let be the associative unital -algebra generated by , for permutations of , by , and by for . Set , , , and . Its defining relations, for existing indices, are
If , also impose ; if , impose neither scalar relation. To define the element in question, put , and in form
where scalars are constant polynomials and series, each inverse has constant coefficient , and . If , the defined element is
with products in increasing index order. This is evaluation after renaming the variables to the first variables at level . The case gives ; is also allowed, in which case necessarily and the target is still the presented quotient .
QAlgorithms.Papers.Independent.Intakenext100.P34.dMomentPolynomial
Let be a commutative ring, and let specify a unit with value , an element , a sequence , and an optional pair of elements of . For arbitrary , put , work in , and regard elements of as constant series when they occur in . Define
Each inverse has a denominator with constant coefficient , and the product defining is in increasing index order. The defined polynomial is
The optional pair in does not enter this formula. The indices and may be zero; in particular , so is the constant polynomial .
QAlgorithms.Papers.Independent.Intakenext100.P34.dMomentSeries
Let be a commutative ring, and let consist of a unit with value , a sign , a sequence , and an optional pair . Fix natural numbers and a Boolean , whose default value is false. Define as the associative unital -algebra generated by permutation symbols , two elements , and for . With , , , and , its defining relations, for existing indices, are
If , additionally ; if , these scalar relations are absent. Put , define
where , scalars are constant series, and each inverse is the formal inverse with constant coefficient . Let be obtained from by the finite sum , with factors in increasing index order. The defined power series is
Empty products equal ; in particular gives the scalar moment series , with alternating signs in the true case, and is permitted.
QAlgorithms.Papers.Independent.Intakenext100.P34.dRatio
For any ring , not assumed commutative, and any , this definition gives the formal power series
where denotes its constant power series and is the formal power-series variable. The inverse is the formal power-series inverse with constant coefficient ; it exists because the displayed denominator has constant coefficient . Multiplication occurs in exactly the displayed order, with the inverse on the right, and there is no restriction on .
QAlgorithms.Papers.Independent.Intakenext100.P34.dRatioProduct
For any ring , any natural number , and any indexed family , this definition gives the ordered product
where, for ,
Elements of in this formula are constant power series, and each inverse is the formal inverse of a series with constant coefficient . Neither nor the family is assumed commutative; the outer product is in increasing index order. When , the product is empty and equals .
QAlgorithms.Papers.Independent.Intakenext100.P34.dbMap
For every commutative ring and natural number , this defines the canonical -algebra homomorphism from the free associative unital -algebra on symbols for permutations of , symbols , and symbols for , to its ring quotient imposing the following equations. For , let swap and , and put . The imposed equations are , for all permutations , for all , , and for both and every ; also, for every adjacent index , , if , if , and ; furthermore, whenever , and whenever are adjacent indices with . The homomorphism sends each free-algebra element to its quotient class. The parameter may be zero; the adjacent-index set is empty for or , and the -index set is empty for .
QAlgorithms.Papers.Independent.Intakenext100.P34.de
For the commutative coefficient ring , a natural number , and an adjacent index , let be the permutation of exchanging and . In the free associative unital -algebra with generators for all permutations , generators , and generators for , this definition assigns the element
This is an element of the free algebra before any relations are imposed. The adjacent-index set has size , with natural-number subtraction truncated at zero; thus there is no input when or .
QAlgorithms.Papers.Independent.Intakenext100.P34.dg
For a commutative ring , a natural number , and an index satisfying with truncated subtraction, let be the permutation exchanging and , let be its formal permutation generator, and let be the formal generator indexed by . In the free associative unital -algebra on all permutation letters, two Boolean-indexed letters, and the , the definition is
There are no such inputs when or .
QAlgorithms.Papers.Independent.Intakenext100.P34.dk
For a commutative ring , a natural number , and a Boolean value , is the canonical free generator corresponding to the formal letter in the free associative unital -algebra generated by permutation letters indexed by permutations of , the two Boolean-indexed letters, and letters for . Both Boolean choices are available for every , including .
QAlgorithms.Papers.Independent.Intakenext100.P34.dt
For a commutative ring , a natural number , and a permutation of , is the canonical free generator corresponding to the formal letter in the free associative unital -algebra generated by all permutation letters, two Boolean-indexed letters, and the letters for . This definition imposes no multiplication relations on the permutation-indexed generators, including the generator indexed by the identity permutation.
QAlgorithms.Papers.Independent.Intakenext100.P34.dwMap
Let be the commutative coefficient ring, , and consist of a unit representing , a sign , a sequence , and an optional scalar pair. Let be the free associative unital -algebra on , for permutations of , on , and on , for . For each adjacent index , write and
This definition is the canonical -algebra homomorphism from to its ring quotient obtained by imposing
together with and whenever the optional scalar pair is . In these equations in , all scalar elements mean their structural images, and every adjacent index must exist. The homomorphism sends each free-algebra element to its class under the smallest ring congruence generated by these equations. There is no admissibility hypothesis; compression includes exponent zero, and when or , the equations requiring adjacent indices are absent.
QAlgorithms.Papers.Independent.Intakenext100.P34.dy
For a commutative ring , a natural number , and an index satisfying , is the canonical free generator corresponding to the formal letter in the free associative unital -algebra generated by permutation letters indexed by permutations of , two Boolean-indexed letters, and the letters . There are no such inputs when .
QAlgorithms.Papers.Independent.Intakenext100.P34.gAction
For every natural number and permutation of , this defines a function on by and . When , this is the identity function on the singleton .
QAlgorithms.Papers.Independent.Intakenext100.P34.gY
For every commutative ring , natural number , element supplied as the parameter named half, and index , this defines an element of the free associative unital -algebra on permutation generators , generators indexed by , and generators indexed by ordered distinct pairs in , by
where is the scalar homomorphism into the free algebra. There is no hypothesis that is an inverse of or satisfies any other equation. For the sum is empty and equals zero; for there is no possible argument .
QAlgorithms.Papers.Independent.Intakenext100.P34.gbMap
For every commutative ring and natural number , this defines the canonical -algebra homomorphism from the free associative unital -algebra on generators for permutations of , for , and for ordered distinct pairs in , to the ring quotient imposing the following equations. Let and . For all permutations and all applicable indices, impose , , , and when ; impose for every , when , and when ; finally, impose for pairwise distinct , and for pairwise distinct . The homomorphism sends every free-algebra element to its quotient class. The case is included, with the unique permutation of the empty set, the sole index , and no generators.
QAlgorithms.Papers.Independent.Intakenext100.P34.geometric
For every semiring and every , this definition denotes the formal power series
Thus its coefficient of degree is , including coefficient in degree zero. No commutativity, invertibility, or convergence hypothesis is required.
QAlgorithms.Papers.Independent.Intakenext100.P34.gg
For every commutative ring , natural number , and indices , where , this defines in the free associative unital -algebra on permutation letters, index letters, and letters indexed by ordered distinct pairs in : if , its value is the canonical free generator labelled by ; if , its value is zero. For distinct indices, and are separate free generators. When , every value of this function is zero.
QAlgorithms.Papers.Independent.Intakenext100.P34.gk
For every commutative ring , natural number , and index , where , this defines to be the canonical free generator labelled by in the free associative unital -algebra on permutation letters , index letters , and letters indexed by ordered distinct pairs in . The distinguished index is allowed for every ; when , it is the only possible value of .
QAlgorithms.Papers.Independent.Intakenext100.P34.gt
For every commutative ring , natural number , and permutation of , this defines to be the canonical free generator labelled by in the free associative unital -algebra on permutation letters, letters indexed by , and letters indexed by ordered distinct pairs in . This definition imposes no permutation multiplication equations; in particular, is a free generator. The definition includes , when is the unique permutation of the empty set.
QAlgorithms.Papers.Independent.Intakenext100.P34.halfResolvent
For every semiring and every ordered pair , this definition denotes the formal power series
where is first inserted as a constant series. Its constant coefficient is , and its coefficient of degree is , in the displayed multiplication order. No assumption says that represents one half, is invertible, or commutes with .
QAlgorithms.Papers.Independent.Intakenext100.P34.infinityResolvent
For every semiring and every , this definition denotes the formal power series
Its constant coefficient is , and its coefficient of degree is . The definition requires neither commutativity nor invertibility of .
QAlgorithms.Papers.Independent.Intakenext100.P34.integralRoot
For every complex number , this defines the element of the subalgebra whose underlying complex value is , together with its membership in that subalgebra. No hypothesis that is a root of unity or an algebraic integer is required.
QAlgorithms.Papers.Independent.Intakenext100.P34.laurentVariable
Let be a commutative ring, let be a natural number, let , and let be a Boolean, defaulting to false. In the Laurent polynomial algebra , whose elements are finite -linear combinations of monomials with integer exponent vectors, is the single monomial with coefficient , exponent at coordinate when is false and exponent there when is true, and exponent at every other coordinate. Thus its value is or , respectively. There is no possible argument when .
QAlgorithms.Papers.Independent.Intakenext100.P34.leftMultiples
For any type equipped with a binary multiplication and any , this defines the subset
Thus membership means being a single left multiple of ; no addition, identity, associativity, or distributivity is assumed.
QAlgorithms.Papers.Independent.Intakenext100.P34.multiplicativeResolvent
For every type equipped with a semiring structure and every , this defines the formal power series
Here in the first product means the constant power series with value , and is the formal power-series variable. Thus the constant coefficient is zero and the coefficient of is for every . No commutativity of or invertibility of is assumed.
QAlgorithms.Papers.Independent.Intakenext100.P34.pairResolvent
For every type equipped with a ring structure and every , this defines the formal power series
The division in the coefficient formula is natural-number division. The constant coefficient is zero, every odd-degree coefficient is zero, and the coefficient of is for . No commutativity of or invertibility of is assumed.
QAlgorithms.Papers.Independent.Intakenext100.P34.ps
For every semiring and every , this abbreviation denotes the constant formal power series
whose coefficient of degree zero is and whose coefficient of every positive degree is . Commutativity of is not assumed.
QAlgorithms.Papers.Independent.Intakenext100.P34.seriesTail
For any semiring and any formal power series , this definition gives
Thus the constant coefficient of the result is , and its coefficient of degree is the coefficient of degree of ; the original constant coefficient is discarded. No commutativity or subtraction assumption on is required.
QAlgorithms.Papers.Independent.Intakenext100.P34.signedPow
For every type equipped with a monoid structure, every two elements , and every integer , this defines
where each exponent in the selected branch is a natural number. In particular, the value at is . The second argument, named “inverse” in the definition, is arbitrary: no hypothesis requires or .
QAlgorithms.Papers.Independent.Intakenext100.P34.trans
For every natural number and every satisfying , where subtraction is truncated at zero, is the permutation of that exchanges and and fixes every other element. There are no such inputs when or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.