Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 3 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 3 also cleared it.

Coxeter, Artin, and Hecke Interfaces

1 · Prerequisites

2 · Summary

From one finite Coxeter matrix (S,m) the page builds three presentation-level interfaces: the Artin monoid and group carried by the braid pairs alone, the positive section lifted from a reduced-word indexing of W, and the generic Hecke algebra with its standard basis and quadratic normalizations.

The Artin monoid A+ is the quotient of the word monoid S∗ by the smallest congruence containing every braid pair {s t s⋯ , t s t⋯ }, and the Artin group A is the quotient of the free group F(S) by the normal closure of the relators u v−1, so that no relation σs2=1 is imposed. The two words of a braid pair agree in A, and minimality of the congruence descends s↦σs to the canonical comparison γ:A+→A. The same universal property applied to s↦s produces the projection π:A→W with π∘γ=π+, and π is surjective because the images of the σs generate W. Quotienting A by the normal closure D of the squares of the generators returns the Coxeter presentation, the induced map A/D→W is an isomorphism, and ker⁡π=D.

Reduced-word control of W then produces the positive section. For each w the product of the σs along any reduced expression is independent of that expression by Matsumoto's theorem, giving bw∈A+ with π+(bw)=w and b1=[ε]; the map w↦bw is injective and a set-theoretic section, and bubv=buv holds exactly when ℓ(uv)=ℓ(u)+ℓ(v). The additive class length L on A+ and the group degree deg⁡ on A make the failure of multiplicativity explicit when S≠∅: bsbs=[ss]≠[ε]=bs2 for every s∈S, because L([ss])=2≠0=L([ε]), and the composite γ∘b is therefore not a group homomorphism either. Nothing here asserts injectivity of γ or of π+, an Ore or Garside condition, or an embedding of A+ into A.

The Hecke side of the interface reuses the same indexing. Since the generators Ts of the generic Hecke algebra satisfy the braid relations, the universal property of the Artin monoid gives a monoid homomorphism Θ:A+→H with Θ(σs)=Ts and Θ(bw)=Tw, so the positive section and the standard basis share one reduced-word indexing, with base-change compatibility of the specialized bases. The four normalizations Ts, Ss=vsTs, −Ts and −vs−1Ts are interconverted by unit changes of generators, and the root-length matching clause records exactly what a supplied root system must satisfy to match the canonical form: the diagram fixes the normalized products but neither the root lengths nor the individual values of the form. For Soergel and Kazhdan–Lusztig applications the page separates a faithful canonical representation from the reflection-faithful realization required by arguments that assume reflection faithfulness; the companion page computes a degenerate rank-two instance in which the canonical representation is faithful but not reflection faithful.

For the standard type-An−1 system the page records one conditional application: under AC, and only by consuming the independently published presentation-completeness theorem, the presentation-defined Artin group is identified with the geometric braid group. The companion coxeter-artin-and-hecke-interfaces-examples exercises the projection to Sn, the positive lifts, the positive braid monoid and the quadratic Hecke conventions.

Throughout the type-A discussion on this page and its companion, use the order-preserving relabelling k↦k+1 from the library's underlying set {0,…,n−1} to {1,…,n}. Thus (i i+1) denotes the transported adjacent transposition, and one-line notation and inversion positions use the transported labels; inversion numbers are unchanged.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Artin monoid and Artin group presentations, and the canonical monoid-to-group map

Definition

Let S be a finite set and let m be a Coxeter matrix on S (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so that m(s,s)=1 and m(s,t)=m(t,s)∈{2,3,… }∪{∞} for s≠t.

(1) Words. Let S∗ be the set of finite words u=s1s2⋯sk in the alphabet S (k≥0, letters read from left to right, concatenation written by juxtaposition, empty word ε; Words in an alphabet with formal inverses, elementary cancellation, and reduced words). Concatenation makes S∗ a monoid with identity ε (Semigroup and monoid).

(2) Braid pairs. Let s≠t in S with m:=m(s,t)<∞. The braid words of length m between s and t are the strictly alternating words u=u1u2⋯um and v=v1v2⋯vm defined by ui=s for odd i and ui=t for even i, while vi=t for odd i and vi=s for even i. A braid pair is an unordered pair {u,v} arising this way; m=2 contributes the commuting pair {st,ts} and m=∞ contributes nothing.

(3) The Artin monoid. A congruence on S∗ is an equivalence relation ∼ on S∗ (Equivalence relation, equivalence class, and the quotient set A/∼) with u∼v⇒xuy∼xvy for all x,y∈S∗. The total relation is a congruence and the intersection of a nonempty family of congruences is a congruence, so there is a smallest congruence ≡+ containing every braid pair: take the intersection of all congruences containing the braid pairs. Reflexivity, symmetry, transitivity and compatibility with concatenation hold in the intersection because they hold in each of its members. Put

A+:=A+(S,m):=S∗/ ⁣ ⁣≡+,

write [u] for the class of a word u, and define [u]⋅[v]:=[uv]. This multiplication is well defined: if u≡+u′ and v≡+v′, then uv≡+u′v≡+u′v′ by compatibility and transitivity. Associativity and the identity law descend from concatenation, so A+ is a monoid with identity [ε] (Semigroup and monoid); A+ is the Artin monoid of (S,m), and σs:=[s] for s∈S.

(4) The Artin group. Let F(S) be the free group on S (Free group on a set of generators) and, for s≠t with m(s,t)<∞, let ρs,t:=u v−1∈F(S) with u,v the braid words of (2). Let N:=⟨ ⁣⟨{ρs,t:s≠t, m(s,t)<∞}⟩ ⁣⟩F(S) be their normal closure (The normal closure of a subset of a group, Relators and relations; finitely generated, finitely related, and finite presentations), and put

A:=A(S,m):=F(S)/N.

Equivalently, A is the group presented by ⟨S∣u=v for every braid pair {u,v}⟩ in the sense of Group presentation by generators and relations; its elements are the left cosets gN, and the images σs of s∈S generate A (The quotient group G/N and coset product (gN)(hN)=ghN, The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, Group and abelian group). No relation σs2=1 is imposed: the element σs2 need not be trivial in A.

(5) The canonical comparison A+→A. The two braid words of a braid pair have equal images in A, because their difference lies in N. Hence the assignment s↦σs is constant on braid pairs, and by minimality of ≡+ it induces a monoid homomorphism

γ:A+⟶A,γ(σs)=σs,

regarding the group A as a monoid under its multiplication. It is the unique monoid homomorphism with γ(σs)=σs for all s. This is the construction whose universal property is proved in Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares ↗ (1); that lemma is the recorded justifier of this definition.

(6) Conventions and abstentions. (i) A value m(s,t)=∞ imposes no braid pair and hence no relation in either A+ or A. (ii) The constructions depend only on the pair (S,m). (iii) Nothing is asserted here about injectivity of γ or of A+→W, about Ore localisation or a group of fractions, about torsion-freeness of A, about the word problem, about A+ embedding in A, or about the K(π,1) property; in particular no multiplicativity of any lift of a reduced expression is claimed by this definition. (iv) No topological model (configuration space, hyperplane complement, Salvetti complex) is constructed or used. Part (3) establishes the congruence and quotient multiplication; Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares ↗ establishes their universal property.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares

Statement

Let (S,m) be a finite Coxeter matrix, W the presented Coxeter group with its universal property and length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let S∗, A+, A, the classes [u], the elements σs and γ:A+→A be as in Artin monoid and Artin group presentations, and the canonical monoid-to-group map.

(1) Universal property of the Artin monoid. Let M be a monoid (Semigroup and monoid; every group is a monoid, Group and abelian group) and let f:S→M be a map such that f(u)=f(v) in M for every braid pair {u,v}, where f(s1⋯sk):=f(s1)⋯f(sk). Then there is a unique monoid homomorphism fˉ:A+→M with fˉ(σs)=f(s) for all s∈S.

(2) Universal property of the Artin group. Let G be a group and let f:S→G satisfy f(u)=f(v) for every braid pair. Then there is a unique group homomorphism fˉ:A→G with fˉ(σs)=f(s) for all s∈S (Monoid homomorphism and group homomorphism). Consequently (A,(σs)s∈S) is the group presented by the Artin presentation ⟨S∣u=v (braid pairs)⟩ in the sense of Group presentation by generators and relations and Relators and relations; finitely generated, finitely related, and finite presentations.

(3) The projection onto W. The map s↦s from S to W sends every braid pair to an equality in W, so (2) gives a homomorphism

π:A⟶W,π(σs)=s,

which is surjective because the images π(σs)=s generate W. Moreover (1) with M=W gives π+:A+→W with π+(σs)=s, and π∘γ=π+.

(4) Quotient by the squares. Let D:=⟨ ⁣⟨{σs2:s∈S}⟩ ⁣⟩A be the normal closure in A of the squares of the generators. Then the relators uv−1 of A are trivial in A/D and σs2D=D for all s, so the assignment s↦σsD induces a homomorphism φ:W→A/D with φ(s)=σsD; the induced map πˉ:A/D→W is an isomorphism with inverse φ. Equivalently, imposing the relations σs2=1 on the Artin presentation returns the Coxeter presentation, and ker⁡π=D.

(5) Type-A application (conditional on the independent presentation theorem). Suppose (S,m) is the standard Coxeter system of type An−1 for some n≥2, with generators s1,…,sn−1, adjacent labels 3 and all other off-diagonal labels 2. Under AC, the Artin group A(S,m) is identified with the published geometric braid group on n strands by the generator correspondence σsi↦ the standard geometric half twist. The presentation-defined group agrees with BnArtin by The braid group by Artin presentation, and its isomorphism with the geometric braid group is supplied by the independently proved The Artin presentation is complete for geometric braids (whose AC hypothesis is part of this application). This is an application of that published theorem, not a topological proof here; the universal properties in (1)--(4) alone do not establish injectivity of the type-A comparison.

(6) Scope. No injectivity of γ or π+, no torsion-freeness of A, no solvability of the word problem, no Ore localisation, no monoid-to-group embedding and no general K(π,1) statement is made. The type-A identification is only the conditional application in (5).

Facts & Assumptions

Given: A finite Coxeter matrix (S,m), the presented group W of Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups with its universal property, the constructions S∗,A+,A,[u],σs,γ of Artin monoid and Artin group presentations, and the canonical monoid-to-group map, and, in (1) and (2), a monoid M or a group G with a map f:S→M or f:S→G whose two values on the words of every braid pair agree.

[F1]

A monoid is a set with an associative product and a two-sided identity, and a group is such a monoid in which every element is invertible. (Semigroup and monoid)

[F2]

On S∗ there is a smallest congruence ≡+ containing every braid pair, the classes satisfy [u][v]=[uv], and A+=S∗/ ⁣≡+ has the elements σs=[s]. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

[F3]

In A=F(S)/N the subgroup N is the normal closure of the elements ρs,t=uv−1 for s≠t with m(s,t)<∞. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

[F4]

Every map from a set X into a group extends uniquely to a group homomorphism on the free group F(X). (Free group on a set of generators)

[F5]

The normal closure of a subset R of a group is the smallest normal subgroup containing R. (The normal closure of a subset of a group)

[F6]

The kernel of every group homomorphism is a normal subgroup. (The image of a group homomorphism is a subgroup and its kernel is a normal subgroup)

[F7]

A homomorphism killing a normal subgroup factors uniquely through the quotient. (A homomorphism that kills a normal subgroup factors uniquely through the quotient group)

[F8]

The subgroup generated by a set is the smallest subgroup containing it. (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups)

[F9]

An isomorphism is a bijective group homomorphism. (Group isomorphisms, automorphisms and the set Aut⁡(G))

[F10]

A map on the generators of a presentation that sends every relator to the identity induces a unique homomorphism on the presented group, and that homomorphism is surjective exactly when the images of the generators generate the target. (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group)

[F11]

BnArtin is the group with generators σ1,…,σn−1 and the braid relations σiσi+1σi=σi+1σiσi+1 and the commuting relations σiσj=σjσi for ∣i−j∣>1. (The braid group by Artin presentation)

[F12]

Assume AC: the Artin presentation of The braid group by Artin presentation is a presentation of the geometric braid group Bngeom, the published surjection φn:BnArtin→Bngeom being an isomorphism. (The Artin presentation is complete for geometric braids)

[F13]

AC: every family of nonempty sets has a choice function. (The Axiom of Choice)

[F14]

The group W is presented by the generators S and the relators s2 (s∈S) and (st)m(s,t) (s≠t, m(s,t)<∞); in particular s2=1 and (st)m(s,t)=1 in W for those s,t. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups)

Proof

1.1F1F2

For (1), define f(s1⋯sk):=f(s1)⋯f(sk) and f(ε):=eM on S∗, and let ∼ be the relation u∼v:⇔f(u)=f(v). Then ∼ is an equivalence relation, and it is compatible with concatenation: if f(u)=f(v) then f(xuy)=f(x)f(u)f(y)=f(x)f(v)f(y)=f(xvy) for all x,y∈S∗. By hypothesis ∼ contains every braid pair, so minimality of ≡+ gives ≡+⊆∼; hence fˉ([u]):=f(u) is well defined, and fˉ([u][v])=fˉ([uv])=f(u)f(v)=fˉ([u])fˉ([v]) together with fˉ([ε])=eM makes fˉ a monoid homomorphism with fˉ(σs)=f(s). Conversely every element of A+ is a class of a word, hence a product of the elements σs=[s], so a monoid homomorphism out of A+ is determined by its values on the σs and fˉ is the unique homomorphism with fˉ(σs)=f(s).

1.2F14algebra

The two words of a braid pair have equal images in W. Let m=m(s,t)<∞, u=s t s⋯ and v=t s t⋯ be the alternating words of length m. In W one has s2=t2=1 and (st)m=1 by [F14]. If m=2k is even, then u=(st)k and v=(ts)k; from (st)(ts)=st2s=s2=1 one gets ts=(st)−1, hence (ts)k=(st)−k=(st)2k−k=(st)k=u because (st)2k=(st)m=1. If m=2k+1 is odd, then u=(st)ks and v=(ts)kt=(st)−kt=(st)m−kt=(st)k+1t=(st)ks=u, using (st)t=s and again ts=(st)−1.

1.3F3F4F5F6F7F8F10

For (2), regard S as a subset of the free group F(S). By [F4] the map f:S→G extends uniquely to a homomorphism f^:F(S)→G with f^(s)=f(s); on words this gives f^(u)=f(u) for the two words of any braid pair. For every braid pair, with ρs,t=uv−1 as in [F3], one has f^(ρs,t)=f^(u)f^(v)−1=f(u)f(v)−1=1, so f^ kills the set {ρs,t}; its kernel is a normal subgroup by [F6] and hence contains the normal closure N=⟨ ⁣⟨{ρs,t}⟩ ⁣⟩F(S) by [F5]. Thus [F7] gives a homomorphism fˉ:A→G with fˉ(gN)=f^(g), and in particular fˉ(σs)=f(s); it is unique with this property because the elements σs are the images of S and generate A in the sense of [F8]. Writing the relators as the equations u=v exhibits (A,(σs)) as the presented group ⟨S∣u=v (braid pairs)⟩: a homomorphism out of this presentation is exactly a map S→G whose two values on each braid pair agree, and it is unique, which is the universal property just proved.

2.1F8F10step 1.1step 1.2step 1.3

For (3), step 1.2 says that the map s↦s sends every braid pair to an equality in W, so (2) of step 1.3 yields π:A→W with π(σs)=s, and (1) with M=W applied to the same map yields π+:A+→W with π+(σs)=s. The homomorphism π is surjective: every element of W is a product of the images of elements of S, and these are the images under π of the generators σs of A, so π satisfies the surjectivity criterion of [F10]; equivalently the images π(σs)=s generate W by [F8]. Finally π∘γ=π+, because both sides are monoid homomorphisms A+→W agreeing on the σs, and these generate A+ by the uniqueness clause of step 1.1.

2.2F9F10F11step 1.3

For (5), let n≥2 and let m be the type-An−1 matrix on S={s1,…,sn−1}, so m(si,sj)=3 for ∣i−j∣=1 and m(si,sj)=2 for ∣i−j∣>1. Its braid pairs are then exactly the pairs of alternating words of length 3, {sisjsi, sjsisj} for ∣i−j∣=1, and the commuting pairs {sisj, sjsi} for ∣i−j∣>1; these are precisely the two relation families of [F11], so the identity correspondence si↔σi matches the defining relations of A(S,m) with those of BnArtin. By (2) of step 1.3 there is a homomorphism A(S,m)→BnArtin with σsi↦σi, and by [F10] applied to the presentation of [F11] there is a homomorphism BnArtin→A(S,m) with σi↦σsi; the two are inverse on the generators, hence mutually inverse and so isomorphisms by [F9].

3.1F12F13step 2.2

Under AC, [F12] identifies BnArtin with Bngeom by the published isomorphism φn carrying σi to the standard geometric half twist. Composing with the isomorphism of step 2.2 identifies A(S,m) with Bngeom under the stated generator correspondence. This is the only place where choice is used: the applied completeness theorem is an AC-conditional statement [F13], while the constructions and arguments of (1)--(4) and step 2.2 are explicit on finite relator sets and use no choice.

3.2F5F6F7constructalgebrastep 2.1

For (4), let D0:={σs2:s∈S}, so D=⟨ ⁣⟨D0⟩ ⁣⟩A. Since π(σs2)=π(σs)2=s2=1, each σs2 lies in ker⁡π, which is normal by [F6]; hence D⊆ker⁡π by [F5], and [F7] gives the induced homomorphism πˉ:A/D→W with πˉ(σsD)=s. For the inverse direction, put f(s):=σsD; then f(s)2=σs2D=D, and for s≠t with m=m(s,t)<∞ the defining braid relation of A and the relations σs2D=σt2D=D give (f(s)f(t))m=D: writing k:=⌊m/2⌋, the braid relation reads (σsσt)k=(σtσs)k when m=2k, so that (σsσt)2k=(σsσt)k(σsσt)k=(σsσt)k(σtσs)k=(σsσt)k−1σsσtσtσs(σtσs)k−1=⋯=1 in A/D by σs2=σt2=1, while for m=2k+1 it reads (σsσt)kσs=(σtσs)kσt, so that (σsσt)2k+1=(σsσt)kσsσt(σsσt)k=(σtσs)kσt2(σsσt)k=(σtσs)k(σsσt)k=D. The universal property of W (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups) therefore gives a homomorphism φ:W→A/D with φ(s)=σsD.

4.1F8F9F10step 3.2

The homomorphisms πˉ and φ of step 3.2 are mutually inverse: πˉ(φ(s))=πˉ(σsD)=s for all s, and φ(πˉ(σsD))=φ(s)=σsD for all s; two homomorphisms out of a group generated by a set are equal when they agree on that set, while W is generated by the images of S and A/D is generated by the σsD by [F8]. Hence πˉ is bijective, i.e. an isomorphism by [F9]. Since π is the composite of the quotient map A→A/D with πˉ and πˉ is injective, an element g∈A lies in ker⁡π exactly when gD=D, that is, exactly when g∈D; thus ker⁡π=D, and imposing the relations σs2=1 on the Artin presentation returns the Coxeter presentation in the sense of [F7] and [F10].

5.1given∎

Scope: nothing in the proof establishes injectivity of γ or of π+, torsion-freeness of A, solvability of the word problem, an Ore localisation, an embedding of A+ into A, or a general K(π,1) statement, and the only identification with geometric braids is the conditional application of step 3.1.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The reduced positive section b_w, its length additivity, and the degree homomorphism

Statement

Let (S,m) be a finite Coxeter matrix, W the presented group with length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let S∗, A+, A, γ:A+→A, σs=[s] and π+:A+→W be as in Artin monoid and Artin group presentations, and the canonical monoid-to-group map and Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares.

(1) The positive lift. For w∈W choose a reduced expression w=s1⋯sk (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups) and put

bw:=σs1⋯σsk∈A+.

Then bw depends only on w, not on the chosen reduced expression; b1=1A+=[ε]; and π+(bw)=w.

(2) The set-section. The map b:W→A+, w↦bw, satisfies π+∘b=idW and π∘γ∘b=idW, hence b is injective and is a set-theoretic section of both π+ and the composite π∘γ:A+→W.

(3) The positive length. There is a unique monoid homomorphism

L:A+⟶(N,+,0),L(σs)=1;

explicitly L([s1⋯sk])=k, so L is well defined, L(xy)=L(x)+L(y) and L(1A+)=0. Consequently L(bw)=ℓ(w) for every w∈W. Moreover the same assignment defines a group homomorphism

deg⁡:A⟶Z,deg⁡(σs)=1,

and deg⁡(γ(x))=L(x) for all x∈A+.

(4) Multiplicativity. For all u,v∈W:

bubv=buv⟺ℓ(uv)=ℓ(u)+ℓ(v).

If ℓ(uv)<ℓ(u)+ℓ(v), then bubv≠buv, and indeed L(bubv)=ℓ(u)+ℓ(v)>ℓ(uv)=L(buv).

(5) Failure of multiplicativity. If S≠∅ then b is not a monoid homomorphism: for s∈S one has bsbs=[ss] and bs2=b1=[ε], and these differ because L([ss])=2≠0=L([ε]). Likewise γ∘b:W→A is not a group homomorphism.

(6) Scope. No injectivity of γ:A+→A or of π+:A+→W, no Ore or Garside condition, no embedding of A+ into A, and no topological statement is made or needed.

Facts & Assumptions

Given: A finite Coxeter matrix (S,m), the group W with its length function ℓ and reduced expressions, and the constructions S∗, A+, A, γ, σs and π+ of the two items named in the statement.

[F1]

On S∗ there is a smallest congruence ≡+ containing every braid pair, the classes satisfy [u][v]=[uv] and A+=S∗/ ⁣≡+ has identity [ε] and elements σs=[s]. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

[F2]

Every map f:S→G into a group whose values on the two words of every braid pair agree extends uniquely to a group homomorphism fˉ:A→G with fˉ(σs)=f(s). (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)

[F3]

Every map f:S→M into a monoid whose values on the two words of every braid pair agree extends uniquely to a monoid homomorphism fˉ:A+→M with fˉ(σs)=f(s). (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)

[F4]

The homomorphism π+:A+→W satisfies π+(σs)=s and π∘γ=π+. (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)

[F5]

N is a set containing 0 on which addition is defined. (The natural numbers N (von Neumann), Addition of natural numbers)

[F6]

Addition on N satisfies m+0=m and is associative. (Addition of natural numbers, Addition is associative)

[F7]

0 is a two-sided identity for addition on N. (Left identity for addition)

[F8]

(Z,+,⋅,0,1) with the operations of Arithmetic on the integers is a commutative ring in which every element has an additive inverse; in particular (Z,+,0) is an abelian group, and its element 1 is the multiplicative identity. The natural numbers embed in Z by an injective map preserving addition and multiplication, and 2≠0 in N (The natural numbers N (von Neumann)); hence the images of the distinct naturals 2 and 0 differ, and since 1+1 is the image of 2 while 0 is the image of 0, the element 2:=1+1 is nonzero in Z. (The integers form a commutative ring, Arithmetic on the integers, The naturals embed in the integers)

[F9]

γ:A+→A is the unique monoid homomorphism with γ(σs)=σs for all s∈S. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

Proof

1.1F1given

The product σs1⋯σsk is independent of the reduced expression: by Matsumoto's theorem (Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups (1)), any two reduced expressions of an element w∈W are connected by finitely many replacements of an alternating subword s t s⋯ of length m(s,t)<∞ by the other alternating subword t s t⋯, inside some context x ( ⋅ ) y. Such a subword pair is exactly a braid pair of Artin monoid and Artin group presentations, and the canonical monoid-to-group map (2), so by the congruence property of ≡+ the two full words are equivalent and their classes in A+ coincide; hence the product in A+ depends only on w. A reduced expression of w exists because ℓ(w) is a minimum over a nonempty set of word lengths (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

2.1F1F3F4F9step 1.1

The empty word is a reduced expression of 1 because ℓ(1)=0, so b1=[ε]=1A+ by [F1]. For the projection, [F4] gives π+(σs)=s and π∘γ=π+ while [F9] makes γ a monoid homomorphism, so for a reduced expression w=s1⋯sk one has π+(bw)=π+(σs1)⋯π+(σsk)=s1⋯sk=w, and composing with π∘γ=π+ gives π∘γ∘b=π+∘b=idW.

2.2F3F5F6F7step 1.1

The length map exists and is unique: apply the monoid universal property [F3] to M:=(N,+,0) and the constant map f(s):=1, which is legitimate because the two words of a braid pair both have length m(s,t), so their images under the word-length map agree; this gives a unique monoid homomorphism L:A+→(N,+,0) with L(σs)=1. For a word u=s1⋯sk one has L([u])=L(σs1⋯σsk)=1+⋯+1=k by additivity [F6] and L([ε])=0 [F7], so L is the word length on classes and in particular L(bw)=k=ℓ(w) for every w.

3.1F2F3F8step 2.2

The degree map exists: apply the group universal property [F2] to G:=(Z,+,0) of [F8] and the constant map f(s):=1, whose two values on a braid pair both equal m(s,t); this gives a group homomorphism deg⁡:A→Z with deg⁡(σs)=1. Then deg⁡∘γ and L are monoid homomorphisms A+→Z agreeing on every generator: deg⁡(γ(σs))=deg⁡(σs)=1=L(σs), so by the uniqueness in [F3] they agree on all of A+, that is, deg⁡(γ(x))=L(x) for every x∈A+.

3.2F4step 2.1

The map b is injective and a section: if bu=bv then u=π+(bu)=π+(bv)=v, and π+∘b=idW and π∘γ∘b=idW were proved in step 2.1; a map with a left inverse is injective, so b is a set-theoretic section of both maps.

3.3F1step 1.1step 2.2algebra

For the forward direction of (4), suppose ℓ(uv)=ℓ(u)+ℓ(v) and let u=s1⋯sp, v=t1⋯tq be reduced expressions. The concatenated word s1⋯spt1⋯tq represents uv and has length p+q=ℓ(u)+ℓ(v)=ℓ(uv), so it is a reduced expression of uv; hence by step 1.1, buv=σs1⋯σspσt1⋯σtq=bubv. Conversely, if bubv=buv, then applying the additive map L of step 2.2 gives ℓ(u)+ℓ(v)=L(bu)+L(bv)=L(bubv)=L(buv)=ℓ(uv). In particular, if ℓ(uv)<ℓ(u)+ℓ(v) then L(bubv)=ℓ(u)+ℓ(v)>ℓ(uv)=L(buv), so bubv≠buv.

4.1F1F8step 2.1step 2.2step 3.1algebra

If S≠∅, fix s∈S. By part 1 of Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action the sign character of W satisfies sgn⁡(s)=−1≠1=sgn⁡(1), so s≠1 in W; since s is a word of length 1 we have ℓ(s)≤1, while ℓ(s)≠0 because the empty word is the only word of length 0 and its value is 1 (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so ℓ(s)=1. Hence the one-letter word s is a reduced expression and bs=[s] by step 1.1, while s2=1 in W with ℓ(1)=0 makes the empty word a reduced expression of s2, so bs2=b1=[ε] by step 2.1. Hence bsbs=[s][s]=[ss] by [F1], whereas L([ss])=2≠0=L([ε]) by step 2.2, so bsbs≠bs2 and b is not a monoid homomorphism. For the composite, (γ∘b)(s)2=γ([ss])=σs2 while (γ∘b)(s2)=γ([ε])=1A, and these differ because deg⁡(σs2)=2≠0=deg⁡(1A) by step 3.1, where 2=1+1≠0 in Z is the nontriviality recorded in [F8], and a group homomorphism preserves the identity (Monoid homomorphism and group homomorphism); so γ∘b is not a group homomorphism.

5.1given∎

Scope and choice: injectivity of γ and of π+, an Ore or Garside condition, an embedding of A+ into A and every topological statement are outside this result, and nothing here asserts them. No choice is used: bw is defined by the uniqueness proved in step 1.1, so it is a definite description rather than a selection among expressions, ≡+ is an intersection of a definable family of congruences, and all computations are finite.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary

Statement

Let (S,m) be a finite Coxeter matrix, W the presented Coxeter group with length ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let R, vs, H and its generators Ts be the generic Coxeter Hecke algebra of Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy (so R=Z[v1±1,…,vc±1] and vs=v[s]), with the standard basis elements Tw of Reduced-word independence of T_w and the length-multiplication rules and The standard basis of the generic Hecke algebra and base change. Let A+, γ, σs be as in Artin monoid and Artin group presentations, and the canonical monoid-to-group map and bw as in The reduced positive section b_w, its length additivity, and the degree homomorphism. Finally let V=RS, B and ρ:W→GL(V) be the Coxeter form and canonical reflection representation of The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, with root system Φ (Descent of the reflection representation, unit root norms, and conjugation of reflections).

(1) Indexing and coefficient compatibility of the Artin and Hecke interfaces. Because the generators Ts satisfy the braid relations of H, the universal property of the Artin monoid (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares (1)) gives a unique monoid homomorphism

Θ:A+⟶(H,⋅,1),Θ(σs)=Ts.

It satisfies Θ(bw)=Tw for every w∈W. Moreover the indexing is coefficient-compatible: (Tw)w∈W is an R-basis of H, and for every commutative ring R′ and ring homomorphism R→R′ the specialised elements (1⊗Tw) form an R′-basis of R′⊗RH (The standard basis of the generic Hecke algebra and base change (2),(4)). Thus the positive section b and the Hecke standard basis use the same reduced-word indexing, and Θ carries the monoid multiplication of A+ to the multiplication of H in that basis: Θ(bubv)=TuTv for all u,v∈W.

(2) Normalization conversions. In H: (i) Ts2=(vs−vs−1)Ts+1 (the normalized or T-normalization); (ii) the multiplicative generators Ss:=vsTs satisfy (Ss−Qs)(Ss+1)=0, i.e. Ss2=(Qs−1)Ss+Qs, where Qs:=vs2∈R; for a single parameter vs=v and Q=v2 this is the "S=qT, Q=q2" convention with q=v; (iii) the opposite-sign generators Hs:=−Ts satisfy Hs2=(vs−1−vs)Hs+1; (iv) the Soergel-calculus generators TsEW:=−vs−1Ts satisfy (TsEW+1)(TsEW−vs−2)=0, i.e. (TsEW)2=(vs−2−1)TsEW+vs−2.

The assignments Ts↔Ss=vsTs, Ts↔Hs=−Ts and Ts↔TsEW=−vs−1Ts, together with the identity on Ts, extend to R-algebra isomorphisms between the four corresponding presentations, with inverse displayed: Ts=vs−1Ss=−Hs=−vsTsEW. In every case the braid relations are preserved: when m is even the two alternating words contain each of s,t exactly m/2 times, and when m is odd the generators s,t are joined by an odd-labelled edge, so their parameters satisfy vs=vt (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy); in both cases the product of the scaling constants attached to the letters is the same on the two sides (with a single parameter simply vsm, (−1)m or (−vs−1)m). For the single-parameter specialization, put Hw:=(−1)ℓ(w)Tw and TwKL:=v−ℓ(w)Hw, where each basis element is the product along a reduced expression. Thus Hs=−Ts as in (iii), TsKL=TsEW as in (iv), and Hw=vℓ(w)TwKL. Here TKL denotes the original Kazhdan–Lusztig normalization with parameter q=v−2; it is distinct from the normalized T-basis in (i). For any finite family of polynomials Py,x(q) and an element written in that normalization as

Cx=vℓ(x)∑yPy,x(v−2)TyKL,

its coefficients in Cx=∑yhy,xHy are exactly hy,x=vℓ(x)−ℓ(y)Py,x(v−2). This proves the coefficient conversion used in Remark 3.2 of the Hodge-theory source whenever such an expansion is supplied, without constructing a canonical basis or asserting that the supplied polynomials are Kazhdan–Lusztig polynomials.

(3) Root-length matching for a supplied root system. Let β be a symmetric bilinear form on a real vector space E and let αs∈E (s∈S) be vectors with ∣αs∣:=β(αs,αs)1/2>0 such that

β(αs,αt)∣αs∣∣αt∣=−c(s,t)(s≠t),

where c(s,t):=cos⁡(π/m(s,t)) for finite m(s,t) and c(s,t):=1 when m(s,t)=∞ (the convention of the Coxeter form The real Coxeter form, its radical, reflections, and form-preserving maps, so that the right-hand side is the number B(es,et)), that {αs:s∈S} is linearly independent, and that the assignment v↦v−2β(v,αs)β(αs,αs)αs defines a representation of W on E. Then the linear map

φ:V⟶E,φ(es):=αs∣αs∣,

is an isomorphism of V onto span⁡{αs:s∈S}, it satisfies β(φu,φw)=B(u,w) for all u,w∈V, and it intertwines the canonical representation with the reflection representation generated by the αs: φ(ρ(s)v)=rαs(φ(v)) for all s∈S, v∈V. Consequently the labelled Coxeter diagram fixes B and the normalized products β(αs,αt)/(∣αs∣∣αt∣), but neither the root lengths ∣αs∣ nor the individual numbers β(αs,αt); a supplied root-system treatment with its own root-length normalization, coroot system and lattice data matches this canonical form exactly under the displayed normalization, and such a match is a hypothesis on the supplier, not a consequence of the Coxeter matrix. No root system, coroot system, Cartan matrix or lattice is constructed or identified here.

(4) The reflection-faithfulness boundary for Soergel applications. (a) For a field k, a realization of (W,S) in the sense of Elias–Williamson is a free finite-rank k-module h with subsets {αs∨}⊂h, {αs}⊂h∗ satisfying ⟨αs∨,αs⟩=2, the reflection assignment v↦v−⟨v,αs⟩αs∨ defining a representation of W, and the following condition on each distinct pair with finite m=m(s,t). Put x:=⟨αs∨,αt⟩ and y:=⟨αt∨,αs⟩, and define p0=q0=0, p1=q1=1, pj+1=xqj−pj−1 and qj+1=ypj−qj−1 for j≥1. Require pm=qm=0 (the two-colored quantum-number condition (3.3), with the recursion of Definition 3.5 of the source). An infinite label imposes no such condition. Such a realization is faithful when the action of W on h is faithful, and reflection faithful when it is faithful and the assignment sending each reflection of W (each conjugate of a simple reflection) to its full fixed space Fix⁡(w):={v:w(v)=v} is a bijection onto {Fix⁡(w):w∈W,codim⁡Fix⁡(w)=1} (the source's Definition 3.8). In the canonical case k=R, h=⨁sRαs∨ and ⟨αt∨,αs⟩=−2cos⁡(π/m(s,t)), with the source's convention π/∞:=0 under which the value for m(s,t)=∞ is −2. (b) Every element of W fixes the radical rad⁡(B)={v∈V:B(v,es)=0 ∀s∈S} pointwise: ρ preserves B (Descent of the reflection representation, unit root norms, and conjugation of reflections (2)) and ra(v)=v whenever B(v,a)=0 (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)), so each generator res and hence ρ(W) fixes rad⁡(B) pointwise. (c) Suppose dim⁡rad⁡(B)=dim⁡V−1≥1. Then rad⁡(B) is a hyperplane, and for every root α∈Φ the reflection rα has fixed hyperplane ker⁡B(−,α) (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2), Descent of the reflection representation, unit root norms, and conjugation of reflections (4)), which contains rad⁡(B) and therefore equals it; moreover the simple reflections ρ(s)≠ρ(t) (s≠t) are distinct reflections with the same fixed hyperplane. Hence the correspondence "reflection ↦ its fixed hyperplane" fails to be injective, and the canonical realization is not reflection faithful in the sense of Elias–Williamson even though ρ is faithful (The root-length criterion and faithfulness of the canonical reflection representation (3)). (d) Therefore a faithful canonical representation may not be substituted for a reflection-faithful realization in an argument that assumes reflection faithfulness. The source records Soergel's construction of a reflection-faithful representation for every Coxeter group over R (Example 3.2(2) and the discussion after Definition 3.8). Reflection faithfulness is a sufficient hypothesis for the classical Soergel theory over an infinite field of characteristic different from 2, but is not necessary for every Soergel application: the same discussion records Libedinsky's extension to the geometric realization and defines a Soergel realization as a faithful realization to which Soergel's techniques apply. That property is not asserted to be equivalent to reflection faithfulness. A concrete rank-two instance is computed on the companion page. (e) No Kazhdan–Lusztig canonical basis, bar-invariant basis, cell theory, Soergel bimodule or positivity statement is constructed here; those use the standard basis and bar involution of The standard basis of the generic Hecke algebra and base change and The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization together with the conversions of (2), and remain in their designated proof homes.

Facts & Assumptions

Given: A finite Coxeter matrix (S,m), the group W with length ℓ, the generic Hecke algebra H with its generators Ts, basis (Tw) and parameters vs, and the canonical data V=RS, B, ρ, Φ of the items named in the statement; in (3), a symmetric bilinear form β on a real vector space E with vectors αs satisfying the stated hypotheses.

[F1]

A bilinear form on V over F is a function B:V×V→F that is linear in each variable separately. (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms)

[F2]

The left and right radicals of a bilinear form B are rad⁡L(B)={u:B(u,v)=0 for every v} and rad⁡R(B)={v:B(u,v)=0 for every u}, and in the symmetric case they coincide. (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space)

[F3]

A function T:V→W between vector spaces over one field is linear when T(au+bv)=aT(u)+bT(v) for all a,b∈F, u,v∈V; a linear map vanishing on a spanning set vanishes identically, and a linear map sending a basis to linearly independent vectors is injective. (Linear map between vector spaces over the same field, Linear subspace of a vector space, Kernel and image of a linear map)

[F4]

A linear map has trivial kernel exactly when it is injective. (Kernel and image of a linear map)

[F5]

An R-algebra homomorphism f:A→B is a unital ring homomorphism satisfying f∘ηA=ηB, and such a map is automatically R-linear; two such homomorphisms agreeing on a set of generators agree everywhere. (Algebras over a commutative ring, central structure maps, and algebra homomorphisms)

Proof

1.1givenconstructalgebra

(1) The Hecke generators Ts satisfy the braid relations TsTtTs⋯=TtTsTt⋯ of the presentation of H (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy), and these are exactly the braid-pair identities of the Artin monoid, so the monoid universal property (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares (1)) applied to f(s):=Ts, with target the multiplicative monoid of H, gives a unique monoid homomorphism Θ:A+→H with Θ(σs)=Ts. For a reduced expression w=s1⋯sk one has Θ(bw)=Θ(σs1⋯σsk)=Θ(σs1)⋯Θ(σsk)=Ts1⋯Tsk=Tw, the last equality and the independence of Tw of the reduced expression being the defining properties of the standard basis (Reduced-word independence of T_w and the length-multiplication rules (1)-(2), whose proof consumes Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups). The R-basis property of (Tw) and the base-change compatibility of the specialised elements are clauses (2) and (4) of The standard basis of the generic Hecke algebra and base change, quoted here as the interface they describe.

1.2algebra

(2) All four quadratic relations are substitutions in the normalized relation (i), which is part of the presentation of H (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy). (ii) With Ss=vsTs and Qs=vs2: Ss2=vs2Ts2=vs2((vs−vs−1)Ts+1)=(vs2−1)vsTs+vs2=(Qs−1)Ss+Qs, which is equivalent to (Ss−Qs)(Ss+1)=0. (iii) With Hs=−Ts: Hs2=Ts2=(vs−vs−1)Ts+1=−(vs−vs−1)Hs+1=(vs−1−vs)Hs+1. (iv) With U=TsEW=−vs−1Ts: U2=vs−2Ts2=vs−2((vs−vs−1)Ts+1)=vs−2(−(vs−vs−1)vsU+1)=(vs−2−1)U+vs−2, which is (U+1)(U−vs−2)=0. The relation (ii) is also recorded as part 4 of The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization.

1.3F1F3algebra

(3) The map φ is linear by construction on the basis (es) of V (The real Coxeter form, its radical, reflections, and form-preserving maps), and it is injective with image span⁡{αs} because the vectors αs are linearly independent by hypothesis [F3]. Fix s and t≠s, put c:=c(s,t) (so c=cos⁡(π/m(s,t)) for finite m(s,t) and c=1 when m(s,t)=∞), and recall B(es,et)=−c and ra(v)=v−2B(v,a)B(a,a)a (The real Coxeter form, its radical, reflections, and form-preserving maps (2),(3)); then the canonical representation satisfies ρ(s)et=res(et)=et−2B(et,es)es=et+2c es for finite and infinite m(s,t) alike, so φ(ρ(s)et)=αt∣αt∣+2cαs∣αs∣, while the reflection rαs of the hypothesis gives rαs(φ(et))=αt∣αt∣−2β(αt,αs)∣αt∣ β(αs,αs)αs=αt∣αt∣+2cαs∣αs∣ by the normalized-product hypothesis; for t=s both sides equal −αs∣αs∣ because ρ(s)es=−es and rαs(αs)=−αs. Since the es form a basis and both sides are linear, the intertwining identity φ(ρ(s)v)=rαs(φ(v)) holds for all v∈V [F3]; the hypothesis that the assignment defines a representation of W is what makes the reflection representation s↦rαs well defined on W. Finally β(φes,φet)=β(αs,αt)∣αs∣∣αt∣=B(es,et) for all s,t — the case s≠t is the hypothesis and the case s=t gives 1=B(es,es) — so by bilinearity β(φu,φw)=B(u,w) for all u,w∈V [F1].

1.4F2given

(4)(b) Let v∈rad⁡(B), so B(v,es)=0 for every s∈S. The canonical generators are the reflections ρ(s)=res, and ra(u)=u whenever B(u,a)=0 (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)); hence ρ(s)v=v for every generator s, so every element of W, being a composite of generators and their inverses, fixes v; thus rad⁡(B) is fixed pointwise by ρ(W).

1.5givenalgebra

The canonical data form a realization as defined in (4)(a): take h=V, αs∨=es and αs=2B(−,es). The pairing on the diagonal is 2, and the reflection formula is ρ(s)v=v−αs(v)es, so it defines the supplied representation of W. For a finite label m=m(s,t) put θ=π/m; then x=y=−2cos⁡θ. The recursions defining pj,qj give pj=qj=(−1)j−1sin⁡(jθ)/sin⁡θ for j≥1: the cases j=1,2 and the induction follow from 2cos⁡θsin⁡(jθ)=sin⁡((j+1)θ)+sin⁡((j−1)θ) (The addition formulas for sine and cosine). The denominator is nonzero because 0<θ≤π/2 (The zero sets of sine and cosine and the least positive common period 2 pi), and sin⁡(mθ)=sin⁡π=0 (Quarter-turn values and shifts by pi/2 and pi), proving pm=qm=0. Infinite labels require no check.

2.1F5step 1.2

(2) The four presentations. For each of the three displayed substitutions let H∙ denote the R-algebra presented by generators Xs subject to the braid relations and the ∙-quadratic relation of step 1.2. The assignment Xs↦ the corresponding element of H respects the ∙-relation by step 1.2 and the braid relations: for even m the two alternating words contain each of the two letters exactly m/2 times, and for odd m the two letters are joined by an odd-labelled edge, so vs=vt by the parameter convention of the Hecke presentation; hence the products of the scaling constants vsi, −1 or vsi−1 attached to their letters coincide, and the assignment extends to an R-algebra homomorphism H∙→H by the presentation's universal property and [F5]. The inverse assignment Ts↦ the corresponding element of H∙ is well defined by the same computation with the roles reversed, since the displayed inverse formulas have the same shape; for instance Ts=vs−1Ss satisfies (vs−1Ss)2=vs−2((Qs−1)Ss+Qs)=(vs−vs−1)(vs−1Ss)+1, which is the T-relation. The two assignments are inverse on generators, so they are mutually inverse R-algebra isomorphisms by the uniqueness clause of [F5].

2.2F2F3F4step 1.4

(4)(c) Assume dim⁡rad⁡(B)=dim⁡V−1≥1. Then rad⁡(B) is a hyperplane. For a root α∈Φ the reflection rα is defined with B(α,α)=1 (Descent of the reflection representation, unit root norms, and conjugation of reflections (3)) and its fixed space is the kernel of the nonzero linear functional B(−,α), a hyperplane (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)) [F3]; as rad⁡(B) is fixed pointwise by step 1.4 and contained in that kernel, the fixed hyperplane of rα is exactly rad⁡(B). If s≠t then ρ(s)≠ρ(t): otherwise B(v,es)es=B(v,et)et for all v∈V, and evaluating at v=es gives es=B(es,et)et, contradicting the linear independence of es,et. So two distinct reflections share the same fixed hyperplane and the correspondence "reflection ↦ its fixed hyperplane" is not injective, although ρ is faithful with trivial kernel (The root-length criterion and faithfulness of the canonical reflection representation (3)) [F4].

2.3step 1.1step 1.2algebra

For the single-parameter coefficient conversion, a reduced word w=s1⋯sk gives Hw=Hs1⋯Hsk=(−1)kTw and TwKL=Ts1KL⋯TskKL=v−kHw by the substitutions in step 1.2; their independence of the reduced word follows from that of Tw, since k=ℓ(w). Their scaling factors are units, so both families are bases by the standard-basis property in step 1.1. Substituting TyKL=v−ℓ(y)Hy in the given finite expansion gives Cx=∑yvℓ(x)−ℓ(y)Py,x(v−2)Hy; uniqueness of coefficients in the H-basis proves the stated formula. The original-normalization parameter is q=v−2 because the generator TsKL satisfies (TsKL+1)(TsKL−q)=0 by step 1.2. This is a change-of-basis computation for any supplied finite expansion, not an existence proof for the canonical basis or its polynomials.

3.1given∎

Scope and choice: clauses (4)(d) and (4)(e) record the interface and its boundary — the fact that a reflection-faithful realization is additional data not supplied by the Coxeter matrix, and the abstention from every Kazhdan–Lusztig, cell-theoretic, Soergel-bimodule and positivity construction, which belong to their designated proof homes. No such object is constructed here, and no choice is used: all four normalizations are explicit substitutions with constants in R or R, and the radical computation uses only the displayed defining formulas.

5 · Examples, counterexamples and false statements

None yet.

Sources