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.

✓ 4 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. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Coxeter, Artin, and Hecke Interfaces — Examples

1 · Prerequisites

2 · Summary

This companion is a dependency leaf: its entries test the constructions of coxeter-artin-and-hecke-interfaces and use only that page's prerequisite closure.

For the standard type-An−1 system the examples run the whole presentation-level dictionary. Composing the type-A isomorphism W≅Sn with the projection of the Artin group produces the surjection πn:Gn→Sn with πn(σi)=(i i+1); the same assignment on the monoid of positive words gives a negative-free section w↦bw which is injective and satisfies πn+(bw)=w. Two explicit computations exhibit the mechanism: for n≥3, the length-additive pair s1,s2 satisfies bs1bs2=bs1s2, while the longest element of S3 shows the independence of the lift from the chosen reduced expression through the braid move. Because the two presentations coincide word for word, the positive Artin monoid is identified with the published positive braid monoid by the universal properties; no embedding into the group or geometric model is claimed.

The companion counterexample exhibits the converse boundary of the length criterion: for a single generator the element bs2=b1 is the empty-word class, while bsbs=[ss] is distinguished by the class length, so the positive lift is not a monoid homomorphism and its composite with γ is not a group homomorphism. The precise dropped hypothesis is length additivity.

On the Hecke side the examples compare the quadratic normalizations S=qT with Q=q2, the opposite-sign form and the Soergel-calculus form, and record the rank-one Kazhdan–Lusztig conversion, so that coefficients are compared only after the substitution; no canonical basis or positivity statement is constructed. The final counterexample isolates the reflection-faithfulness boundary: in the rank-two system m(s,t)=∞ (the A~1 diagram) the canonical representation is faithful, yet its one-dimensional radical is the only full fixed space of codimension one of an element of W, so the two simple reflections share a fixed hyperplane and the realization is not reflection faithful; arguments assuming reflection faithfulness must supply a realization satisfying that hypothesis separately.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Type-A Artin projections, positive lifts, and the positive braid monoid

Example

Let n≥2, S={s1,…,sn−1} and let m be the type-An−1 Coxeter matrix on S: m(si,si)=1, m(si,sj)=3 when ∣i−j∣=1, and m(si,sj)=2 when ∣i−j∣>1. Let W be the presented Coxeter group with length ℓ, let Gn:=A(S,m) and Gn+:=A+(S,m) be the Artin group and monoid of Artin monoid and Artin group presentations, and the canonical monoid-to-group map, and let π:Gn→W, π+:Gn+→W, γ, σi:=σsi and bw be as in Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares and The reduced positive section b_w, its length additivity, and the degree homomorphism. By the type-A clause of Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4), si↦(i i+1) extends to an isomorphism W→Sn (The finite symmetric group Sn, one-line notation, and cycle notation) with ℓ(w)=inv⁡(w), the inversion number (Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations).

Throughout, relabel the library's underlying set {0,…,n−1} as {1,…,n} by k↦k+1, as in that supplier. Cycle symbols, one-line lists and inversion positions below use these transported labels; the order-preserving relabelling leaves inversion numbers unchanged.

  1. The Artin-to-symmetric map. Composing with that isomorphism, si↦(i i+1) extends to a surjective homomorphism

πn:Gn⟶Sn,πn(σi)=(i i+1),

with πn(σi1⋯σik)=si1⋯sik for every word; the same assignment on the generators gives a monoid homomorphism πn+:Gn+→Sn with πn∘γ=πn+. Surjectivity holds because the adjacent transpositions generate Sn (the existence follows from the universal property (2) of Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares, since the braid words of the type-A matrix are equal in Sn).

  1. Positive lifts. For w∈Sn the element bw=σi1⋯σik of any reduced expression is well defined, satisfies πn+(bw)=w, and the map w↦bw is injective (The reduced positive section b_w, its length additivity, and the degree homomorphism (1),(2)). For instance, when n≥3,

bs1s2=σ1σ2,bs1bs2=σ1σ2=bs1s2

because inv⁡(s1s2)=2=1+1, an instance of the length-additive case of The reduced positive section b_w, its length additivity, and the degree homomorphism (4).

  1. Two reduced expressions of the longest element. For n=3, w0=(1 3)=s1s2s1=s2s1s2 has ℓ(w0)=3=inv⁡(w0), and the two reduced expressions are related by the braid move σ1σ2σ1=σ2σ1σ2 in G3, so

bw0=σ1σ2σ1=σ2σ1σ2,

a nonempty instance of the independence clause (1) of The reduced positive section b_w, its length additivity, and the degree homomorphism.

  1. Positive braid monoid. For the same standard type-An−1 indexing, the generators and positive braid relations of Gn+ agree exactly with the presentation of Bn+ in Positive braid monoid. Thus the assignment σi↦σ‾i gives a monoid isomorphism Gn+≅Bn+ by the quotient universal properties. This is only an identification by positive presentations; it does not assert that Bn+ embeds in Gn or construct a geometric braid monoid.

  2. Scope. This example proves only the stated presentation-level maps, lifts and finite calculations. It constructs no topological model, proves no Garside or lattice property, and makes no claim about the embedding of the positive monoid into the group. The type-A group identification with geometric braids is the separate conditional application in A2, using its independently published completeness theorem. The failure of b to be multiplicative is the companion counterexample.

Facts & Assumptions

Given: An integer n≥2, the type-An−1 Coxeter matrix on S={s1,…,sn−1}, the group W with length ℓ, and the constructions Gn=A(S,m), Gn+=A+(S,m), γ, σi and bw of the items named in the statement, together with the isomorphism W→Sn, si↦(i i+1), of the type-A clause (4) of Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification.

[F1]

A 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)

[F2]

A 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]

bw is well defined independently of the reduced expression, b1=[ε], and π+(bw)=w. (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F4]

π+∘b=idW and π∘γ∘b=idW, hence b is injective and is a set-theoretic section. (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F5]

bubv=buv if and only if ℓ(uv)=ℓ(u)+ℓ(v). (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F6]

For n≥2 the symmetric group has the presentation with generators si=(i i+1) and relations si2=1, sisi+1si=si+1sisi+1 and sisj=sjsi for ∣i−j∣>1. (The symmetric group has the Coxeter presentation)

[F7]

For n≥2 the adjacent transpositions sj=(j j+1) generate Sn. Generation follows directly from the zero-indexed adjacent-swap proof of Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4). The repaired Adjacent transpositions generate the finite symmetric group Sn also proves generation in exactly the transported one-based model fixed above; the direct argument here remains valid.

[F8]

In the transported one-based model fixed above, an inversion of σ∈Sn is a pair (i,j) with 1≤i<j≤n and σ(i)>σ(j), and inv⁡(σ) is the number of inversions. (Inversions, inversion number, the sign sgn⁡(σ)=(−1)inv⁡(σ), and even and odd permutations)

[F9]

Let M be a monoid and a1,…,an−1∈M satisfy aiai+1ai=ai+1aiai+1 and aiaj=ajai for ∣i−j∣>1; then there is exactly one monoid homomorphism φ:Bn+→M with φ(σ‾i)=ai. (Positive braid monoid)

[F10]

The subgroup generated by a set is contained in every subgroup containing that set. (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups)

Verification

1.1F2F6F7F10

The braid pairs of the type-An−1 matrix are the pairs of alternating words {sisi+1si, si+1sisi+1} for ∣i−j∣=1 and the commuting pairs {sisj, sjsi} for ∣i−j∣>1; their images under f(si):=(i i+1) are equal in Sn by the presentation of [F6]. Hence [F2] gives a homomorphism πn:Gn→Sn with πn(σi)=(i i+1). Its image is a subgroup of Sn containing the adjacent transpositions, which generate Sn by [F7], so the image is all of Sn by [F10]: πn is surjective.

1.2F1F9

The monoid isomorphism Gn+≅Bn+: define φ:Gn+→Bn+ on generators by φ(σi):=σ‾i. The braid pairs of the type-A matrix map to the two defining word pairs of Bn+ of [F9], whose two members are ≡+-equivalent in Bn+, so [F1] gives a monoid homomorphism φ. Conversely the elements ai:=σi∈Gn+ satisfy aiai+1ai=ai+1aiai+1 and aiaj=ajai for ∣i−j∣>1, because the corresponding alternating words are ≡+-equivalent in A+(S,m) and hence equal in Gn+; so [F9] gives a monoid homomorphism ψ:Bn+→Gn+ with ψ(σ‾i)=σi. The composites φ∘ψ and ψ∘φ fix every generator, hence are the respective identities by the uniqueness clauses of [F1] and [F9]; thus φ and ψ are mutually inverse isomorphisms.

2.1F1step 1.1

The same assignment f(si):=(i i+1) has equal values on the two words of every braid pair by [F6], so [F1] with M=Sn gives a monoid homomorphism πn+:Gn+→Sn with πn+(σi)=(i i+1). The composites πn∘γ and πn+ are monoid homomorphisms Gn+→Sn agreeing on every generator σi, so they are equal by the uniqueness clause of [F1]: πn∘γ=πn+.

3.1F3F4step 2.1

The map b:Sn→Gn+ is well defined by the type-A isomorphism of the given data: its input w∈Sn corresponds to the unique element of W with the same name, and [F3] applies. It satisfies πn+(bw)=w by [F3], and πn∘γ∘b=idSn because πn∘γ=πn+ by step 2.1 and πn+∘b=id by [F4]; in particular b is injective by [F4] and is a set-theoretic section of both πn+ and πn∘γ.

4.1F5F8step 3.1

For n≥3, the element s1s2 permutes the first three symbols as in S3 and fixes the others; it corresponds to (1 2)(2 3)=(1 2 3), whose one-line form is [2,3,1,4,…,n] (with no tail when n=3); the pairs (1,3) and (2,3) are its only inversions: (1,2) is not an inversion and all pairs involving the increasing tail contribute none, so inv⁡(s1s2)=2 by [F8]. By the given type-A clause ℓ(s1s2)=2 while ℓ(s1)=ℓ(s2)=1, so ℓ(s1s2)=ℓ(s1)+ℓ(s2) and [F5] gives bs1bs2=bs1s2; explicitly both sides equal σ1σ2, and no braid move is needed for this pair.

4.2F8step 3.1

For n=3, the two words s1s2s1 and s2s1s2 both act as the transposition (1 3), whose one-line form [3,2,1] has all three pairs as inversions, so inv⁡(w0)=3 by [F8]; with ℓ(w0)=3 by the given type-A clause, both words have length ℓ(w0) and hence are reduced expressions of w0. Step 3.1 therefore gives bw0 as the product along either word, and the two products are equal in G3 because σ1σ2σ1 and σ2σ1σ2 are the two words of a braid pair of A(S,m), hence equal in G3+ and in G3.

5.1given∎

Scope and choice: only presentation-level maps, the positive monoid isomorphism and the displayed finite computations are proved; no topological model, no Garside or lattice property, and no embedding of Gn+ into Gn or Bn+ into Bn is asserted. All constructions are given on generators of explicitly presented monoids and groups, and no choice is used.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-08Open item page →

The positive lift b_w is not a monoid homomorphism

Statement refuted

For every finite Coxeter matrix (S,m) with S≠∅, the positive lift b:W→A+, w↦bw, is a monoid homomorphism; that is, bubv=buv for all u,v∈W (and dually, γ∘b:W→A is a group homomorphism).

Facts & Assumptions

Given: The rank-one Coxeter matrix with S={s} and m(s,s)=1, the presented group W with its length function ℓ, and the constructions S∗, A+, A, γ, σs and the lift b of Artin monoid and Artin group presentations, and the canonical monoid-to-group map, Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares and The reduced positive section b_w, its length additivity, and the degree homomorphism.

[F1]

A braid pair requires two distinct letters s≠t, and A+ is the quotient of S∗ by the smallest congruence containing the braid pairs, with [u][v]=[uv] and σs=[s]. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

[F2]

bw depends only on w and not on the chosen reduced expression, b1=1A+=[ε], and π+(bw)=w. (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F3]

The monoid homomorphism L:A+→(N,+,0) satisfies L([s1⋯sk])=k, hence is additive with L(1A+)=0 and L(bw)=ℓ(w). (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F4]

The same assignment defines a group homomorphism deg⁡:A→Z with deg⁡(σs)=1 and deg⁡(γ(x))=L(x) for all x∈A+. (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F5]

bubv=buv holds if and only if ℓ(uv)=ℓ(u)+ℓ(v). (The reduced positive section b_w, its length additivity, and the degree homomorphism)

[F6]

A monoid homomorphism satisfies f(xy)=f(x)f(y) and f(e)=e′; a group homomorphism satisfies f(xy)=f(x)f(y) and preserves the identity. (Monoid homomorphism and group homomorphism)

Counterexample

1.1F1F3

The rank-one data: since a braid pair requires two distinct letters, the braid-pair set of ({s},m) is empty by [F1], so ≡+ is the diagonal and A+=S∗ is the free monoid on the single generator s, with elements [sk] for k≥0 and [si]=[sj] exactly when i=j, because L([sk])=k by [F3]. The relator set of W is {s2}, so W=⟨s∣s2=1⟩={1,s} with ℓ(1)=0 and ℓ(s)=1 (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action).

2.1F2step 1.1

The positive lifts are b1=[ε] (the empty word is a reduced expression of 1 because ℓ(1)=0) and bs=[s]=σs (the one-letter word is a reduced expression of s because ℓ(s)=1), by the definition of b and step 1.1.

3.1F1F2F3F6step 2.1

But bsbs=[s][s]=[ss] by the product rule of [F1], while bs⋅s=bs2=b1=[ε] since s2=1 in W; the two are different elements of A+, because L([ss])=2≠0=L([ε]) by [F3]. Hence bsbs≠bs⋅s, so the assignment b is not a monoid homomorphism: it fails to preserve the product s⋅s=1.

4.1F3F4F6step 3.1

The same defect appears at the group level: (γ∘b)(s)2=γ([ss])=σs2 while (γ∘b)(s2)=γ([ε])=1A, and σs2≠1A because deg⁡(σs2)=2≠0=deg⁡(1A) by [F3] and [F4], a group homomorphism preserving the identity. Thus γ∘b is not a group homomorphism W→A.

4.2F1F3F5step 3.1

The failure is not an artefact of the rank-one computation: for every finite Coxeter matrix with S≠∅ and every s∈S, [ss] is the class of the word ss in A+(S,m), and its length satisfies L([ss])=2≠0=L([ε]) by [F3]; combined with s2=1 in W and ℓ(s)=1 (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action) this gives bsbs≠bs2 for the ambient monoid, and no parabolic reduction is needed. The general theorem records that bubv=buv holds exactly on the pairs with ℓ(uv)=ℓ(u)+ℓ(v) by [F5], so the refuted statement is obtained by dropping that length hypothesis.

5.1given∎

Scope and choice: this counterexample is a finite computation in the rank-one system plus the stated supplier clauses; it constructs no topological model, claims nothing about embeddings of A+ into A, and uses no choice.

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

Quadratic Hecke normalizations: S=qT with Q=q^2, the opposite-sign form, and the Soergel-calculus and Kazhdan-Lusztig conversions

Example

Let S={s} and let H be the generic Hecke algebra over R=Z[v±1] with generator T=Ts and the single relation (T−v)(T+v−1)=0, equivalently T2=(v−v−1)T+1 (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy, The standard basis of the generic Hecke algebra and base change).

  1. The four generators and relations. Put q:=v, Q:=q2=v2, and

S:=qT,H−:=−T,TEW:=−q−1T.

Then, in H,

S2=(Q−1)S+Q,(H−)2=(v−1−v)H−+1,(TEW+1)(TEW−q−2)=0,

i.e. (TEW)2=(q−2−1)TEW+q−2. Moreover {1,T}, {1,S}, {1,H−} and {1,TEW} are each R-bases of H, and the four normalizations are interconverted by

T=q−1S=−H−=−qTEW,S=qT,TEW=−q−1T,

which are mutually inverse changes of generators. The first displayed relation is the multiplicative convention "S=qT, Q=q2" (The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization (4)); the second is the opposite-sign normalization and the third is the quadratic relation of Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary (2).

  1. The rank-two consistency check. For S={s,t} with m=m(s,t)<∞ and the single parameter vs=vt=v (a legitimate specialization; equality of the two parameters is forced when m is odd by Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy), the same substitutions preserve the braid relation TsTtTs⋯=TtTsTt⋯ (both sides have m factors, so they acquire the same factor qm, (−1)m or (−q−1)m), and on the standard bases the substitutions are diagonal:

Sw=qℓ(w)Tw,Hw−=(−1)ℓ(w)Tw,TwEW=(−q−1)ℓ(w)Tw.

In particular both alternating products have the same sign and the same multiplicative factor, including for odd-length braid words.

  1. Kazhdan–Lusztig conversion (rank one). Let TKL be the generator of the presentation with the single relation (TKL)2=(q−2−1)TKL+q−2, so that T=−qTKL. Then the substitution sends TKL to TEW=−q−1T, and with HKL:=qTKL the corresponding element qTEW=−T=H− satisfies (HKL)2=(q−1−q)HKL+1; this is the rank-one instance of the conversion Hx=vℓ(x)TxKL and hy,x=vℓ(x)−ℓ(y)Py,x(v−2) recorded in the Hodge-theory source. The conversion is stated here so that coefficients are compared only after it; no canonical basis, Kazhdan–Lusztig polynomial or positivity statement is constructed in this example.

Facts & Assumptions

Given: The rank-one Hecke datum S={s}, the ring R=Z[v±1], the algebra H with generator T=Ts and relation (T−v)(T+v−1)=0, the parameters q=v, Q=q2, and the substituted generators S=qT, H−=−T, TEW=−q−1T; in the rank-two part, the system S={s,t} with m=m(s,t)<∞ and vs=vt=v.

[F1]

In the generic Hecke algebra the normalized relation is Ts2=(vs−vs−1)Ts+1. (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)

[F2]

The multiplicative generators Ss:=vsTs satisfy (Ss−Qs)(Ss+1)=0 with Qs=vs2. (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)

[F3]

The opposite-sign generators Hs:=−Ts satisfy Hs2=(vs−1−vs)Hs+1. (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)

[F4]

The Soergel-calculus generators TsEW:=−vs−1Ts satisfy (TsEW+1)(TsEW−vs−2)=0. (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)

[F5]

The four normalizations are interconverted by Ts=vs−1Ss=−Hs=−vsTsEW. (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)

[F6]

In the single-parameter normalization, Hx=vℓ(x)TxKL; for a supplied finite expansion Cx=vℓ(x)∑yPy,x(v−2)TyKL, its Hy-coefficients are hy,x=vℓ(x)−ℓ(y)Py,x(v−2). (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary)

[F7]

The induced scalar action of an R-algebra makes it an R-module and its multiplication R-bilinear, so multiplication by a unit of R is an R-linear bijection. (Algebras over a commutative ring, central structure maps, and algebra homomorphisms)

Verification

1.1F1F2F3F4F5F7

The four relations of part 1 are the relations [F1]–[F4] specialized to vs=v: the normalized relation is the defining relation T2=(v−v−1)T+1, and the other three read S2=(Q−1)S+Q, (H−)2=(v−1−v)H−+1 and (TEW+1)(TEW−q−2)=0 with Q=q2. The interconversions are [F5] at vs=v. In rank one the standard basis of The standard basis of the generic Hecke algebra and base change is {1,T}, and {1,S}, {1,H−}, {1,TEW} are obtained by fixing 1 and scaling the other basis vector T by the units q, −1, −q−1, respectively. For each such unit a, the R-linear map 1↦1, T↦aT has inverse 1↦1, T↦a−1T, hence carries a basis to a basis by [F7].

2.1F2F3F4F5step 1.1

For the rank-two check, each of the three substitutions multiplies every generator by one constant: Ss↦v, Hs↦−1, TsEW↦−v−1. Hence an alternating product of m factors acquires the same constant factor, vm, (−1)m or (−v−1)m, on both sides of the braid relation, so the braid relation is preserved by each substitution; this is exactly the content of the corresponding change of generators in [F2]–[F5]. For the diagonal formulas, the substituted standard-basis element is the product of the images of the generators along a reduced expression, Sw=Ss1⋯Ssk=vkTs1⋯Tsk=vℓ(w)Tw, and similarly Hw−=(−1)ℓ(w)Tw and TwEW=(−v−1)ℓ(w)Tw, using the product rule and independence of the standard basis in Reduced-word independence of T_w and the length-multiplication rules (1).

2.2F1F5F6step 1.1

For the rank-one Kazhdan–Lusztig conversion, set TKL:=−q−1T, which is part 1's TEW; since T=−qTKL and the relation for T holds, the substitution is consistent, and TKL satisfies (TKL)2=q−2T2=q−2((v−v−1)T+1)=(q−2−1)TKL+q−2 by the computation of step 1.1. With HKL:=qTKL=−T=H− one gets (HKL)2=(H−)2=(v−1−v)H−+1=(q−1−q)HKL+1, the rank-one case of the recorded conversion [F6] with ℓ(s)=1.

3.1given∎

Scope and choice: this example compares four quadratic normalizations and verifies the exponent conversions of the standard bases in one rank-two family; it constructs no canonical basis, no Kazhdan–Lusztig polynomial and no positivity or bar-invariance statement, all of which remain in their designated proof homes, and the general coefficient conversion [F6] is supplied by the seam lemma. Every computation is a substitution in R=Z[v±1], and no choice is used.

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

A faithful canonical realization that is not reflection faithful: the affine rank-two system

Statement refuted

Every faithful realization of a finite-rank Coxeter system is reflection faithful in the sense of Elias–Williamson; in particular the canonical geometric realization of a Coxeter system is reflection faithful whenever its reflection representation is faithful.

Facts & Assumptions

Given: The rank-two system S={s,t} with m(s,t)=∞, the group W=⟨s,t∣s2=t2=1⟩, the space V=RS=Res⊕Ret, the Coxeter form B and the canonical representation ρ:W→GL(V) with ρ(s)=rs, ρ(t)=rt, and the root system Φ (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections).

[F1]

The radicals of a bilinear form B on V are rad⁡L(B)={u:B(u,v)=0 for every v} and rad⁡R(B)={v:B(u,v)=0 for every u}; for a symmetric form they coincide, and the form is degenerate exactly when the radical is nonzero. (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space, Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms)

[F2]

The matrix of a linear map T:V→W in ordered bases has as its columns the coordinate columns of the images of the basis vectors. (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases)

[F3]

The subgroup generated by a set is contained in every subgroup containing that set; in particular every element of W lies in the set of finite products of the generators and their inverses, which is a subgroup containing them. (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups)

Counterexample

1.1given

The representation is faithful: ρ is injective by clause (3) of The root-length criterion and faithfulness of the canonical reflection representation, applied to the system S={s,t}, m(s,t)=∞. Hence ρ is a faithful canonical realization of the system, and by clause (4)(a) of Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary the canonical construction is a realization in the sense of Elias–Williamson, with h=V, αs∨=es and αs the functional 2B(−,es).

1.2F1algebra

The radical: since m(s,t)=∞ one has B(es,es)=B(et,et)=1 and B(es,et)=−1 (The real Coxeter form, its radical, reflections, and form-preserving maps). Hence B(es+et,es)=1−1=0 and B(es+et,et)=−1+1=0, so R(es+et)⊆rad⁡(B); for v=aes+bet, one has B(v,es)=a−b and B(v,et)=b−a. Thus v lies in the radical exactly when a=b. The radical is therefore the one-dimensional line rad⁡(B)=R(es+et), and is a hyperplane.

1.3F1F3

The radical is fixed pointwise by W: for a=es or et and v∈rad⁡(B) one has B(v,a)=0, so the reflection formula gives ra(v)=v (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)); a composite of finitely many maps fixing a vector fixes it, and every element of W is a finite product of the generators s,t and their inverses by [F3]. Hence every element of W, in particular ρ((st)k) for k≠0, fixes rad⁡(B) pointwise.

1.4givenalgebra

There are infinitely many reflections: by part (4) of The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness, st has infinite order in W. Put r:=st; since sr−1=sts=rs, induction gives sr−m=rms and hence rmsr−m=r2ms for every m∈Z. Each r2ms lies in the reflection set T={wsw−1:w∈W, s∈S} (The canonical reflection homomorphism, roots, reflections, and the positive cone (2)), and the elements r2ms, m∈Z, are pairwise distinct: if r2ms=r2m′s then right multiplication by s gives r2m=r2m′, hence r2(m−m′)=1 and m=m′ because r has infinite order. So W has infinitely many reflections. Moreover (st)k for k≠0 has infinite order, whereas every conjugate of s or t is an involution; hence these powers are not reflections.

2.1F1F2step 1.2algebra

The matrices of the two generators in the basis (es,et) follow from the reflection formula with 2c(s,t)=2 for m=∞: rs(es)=−es and rs(et)=et+2es, and rt(et)=−et, rt(es)=es+2et (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)). By step 1.2 the fixed space of rs is ker⁡B(−,es)={aes+bet:a−b=0}=R(es+et)=rad⁡(B), and similarly Fix⁡(rt)=ker⁡B(−,et)=rad⁡(B): the two distinct reflections rs≠rt have the same fixed hyperplane. In coordinates [F2] [rs]=(−1201),[rt]=(102−1), differ in their (1,1)-entries, so indeed rs≠rt while Fix⁡(rs)=Fix⁡(rt).

3.1F1F2step 1.2step 1.3step 1.4algebra

Every full fixed space of codimension one of an element of W equals rad⁡(B). Every element of W is rk or rks for some k∈Z with r:=st: repeatedly deleting adjacent equal letters from a word in s,t (using s2=t2=1) leaves an alternating word, and the alternating words are (st)k, (st)ks, (ts)k=(st)−k and (ts)kt=(st)−k−1s. For every reflection waw−1 of W, with a∈{s,t}, its image is ρ(waw−1)=rρ(w)ea with ρ(w)ea∈Φ (Descent of the reflection representation, unit root norms, and conjugation of reflections (4)); its fixed space is ker⁡B(−,α), a hyperplane (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)) containing rad⁡(B) by step 1.3, hence equal to rad⁡(B). For the elements rk write A:=ρ(r), whose matrix is the product of the two matrices of step 2.1, A=(3−22−1); then N:=A−I=(2−22−2) satisfies N2=0, so Ak=(I+N)k=I+kN for every k∈Z (the case k=−1 being (I+N)−1=I−N when N2=0), and (I+kN)v=v with k≠0 exactly when Nv=0, i.e. exactly when v∈ker⁡(A−I)={aes+bet:a=b}=rad⁡(B); the identity A0=I fixes all of V, of codimension zero. For the elements rks one has (rks)2=rk(srks)=rkr−k=1 because srs=r−1, so ρ(rks) is an involution; it fixes rad⁡(B) pointwise by step 1.3, while ρ(rks)=Akrs=(I+kN)rs=(−1−2k2+2k−2k1+2k)≠I, so its fixed space is a proper subspace containing the hyperplane rad⁡(B), hence equals rad⁡(B). Therefore the only full fixed space of codimension one of an element of W is rad⁡(B).

4.1F1step 1.4step 2.1step 3.1

Conclusion: the assignment "reflection ↦ its fixed hyperplane" is not injective, since the distinct reflections rs≠rt of step 2.1 have the same image rad⁡(B); it also cannot be a bijection onto the codimension-one fixed subspaces, since by step 1.4 the set of reflections is infinite while by step 3.1 the set of full fixed spaces of codimension one of elements of W is the singleton {rad⁡(B)}. Hence the faithful canonical realization ρ is not reflection faithful in the sense of Elias–Williamson (Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary (4)), and any Soergel-calculus or Kazhdan–Lusztig argument invoking reflection faithfulness must supply a realization satisfying that hypothesis separately. The failure is caused by the degeneracy of B: the radical is a codimension-one fixed subspace, fixed by non-reflections and by all reflections alike.

5.1given∎

Scope and choice: this is a counterexample in the rank-two system m(s,t)=∞; it constructs no Soergel bimodule, no reflection-faithful realization and no Kazhdan–Lusztig object, and it claims nothing beyond the failure of reflection faithfulness for this canonical realization. Every argument is a finite matrix and line computation plus the supplied order, faithfulness and reflection facts, and no choice is used.

5 · Examples, counterexamples and false statements

None yet.

Sources