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.

Unequal-Parameter Hecke Cells and Representations: Examples and Counterexamples

1 · Prerequisites

2 · Summary

These examples test the A-page conventions in two small finite Coxeter groups. The B2 computation records four explicit KL transitions without classifying all cells. The characteristic-two example shows that distinct generic cell labels can specialize to one simple module; it draws no conclusion about canonical-basic-set existence.

Companion: unequal-parameter-hecke-cells-and-representations.

B2: unequal rank-two parameters

A B2 unequal-parameter KL basis and four left-cell transitions uses I2(4), L(s)=1, and L(t)=2. It computes Cs,Ct,Cst,Cts, the two quadratic KL products, and four left-preorder edges. Its TikZ diagrams specify both the Coxeter edge label and the direction and coefficient convention for the cell transitions.

A1×A1: a modular label collapse

A characteristic-two specialization collapses four weighted cell labels uses L(s)=1,L(t)=2 and v↦3 over Z2. The four generic cell characters are distinct over Q2, while the special algebra is F2[x,y]/(x2,y2) with one simple module. All four stable rank-one lattices reduce to that module.

The example refutes universal preservation of cell labels under modular reduction. It does not assert whether a canonical basic set exists in this specialization.

Source boundary

Geck's §4.1 gives both the exact nonzero-Schur-element condition under which his finite-Weyl identity-decomposition theorem applies and a separate type-G2 example where a canonical basic set fails to exist. The A-page verifies the theorem's hypothesis for its odd-characteristic A1×A1 case; the characteristic-two A1×A1 example here is computed directly and is not identified with Geck's type-G2 counterexample.

The rank-one example A nonsemisimple L-good rank-one specialization has a singleton basic set verifies every required Lusztig property and specializes at v=i. Both full Schur elements vanish, while both leading Schur integers remain one. Its dual-number algebra has a singleton canonical basic set, illustrating the general theorem's nonsemisimple scope.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedOpen item page →

A B2 unequal-parameter KL basis and four left-cell transitions

Example

Let W=I2(4)=⟨s,t∣s2=t2=1, (st)4=1⟩, and put L(s)=1, L(t)=2. In HA(W,L), with A=Z[v,v−1], set Cs=Ts+v−1,Ct=Tt+v−2. Then Cst=CsCt=Tst+v−2Ts+v−1Tt+v−3,Cts=CtCs=Tts+v−1Tt+v−2Ts+v−3,Cs2=(v+v−1)Cs,Ct2=(v2+v−2)Ct. The cell convention is that x←Ly when Cx has nonzero coefficient in CrCy for some r∈{s,t}; the diagram below uses a directed edge y→x for this transition. It records the four transitions 1→s, 1→t, s→ts, and t→st. It does not assert a complete classification of the I2(4) cells.

stm(s;t)=41stststCs¢Ct¢Ct¢Cs¢

The top edge is the Coxeter graph, labelled by its braid length. In the lower directed graph, an edge labelled Cr⋅ means left multiplication by Cr; the source is y, the target is x, and Cx has coefficient 1 in the product CrCy. The equations in the proof establish each edge directly, so the diagram is only a summary.

Facts & Assumptions

Given: The Coxeter system I2(4), the weights L(s)=1,L(t)=2, and the weighted KL and cell conventions in the Statement.

[F1]

Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order, Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, and Simple-generator weights extend uniquely to a weight function: the Coxeter presentation defines length and Bruhat order; finite-generator parabolics preserve lengths and Bruhat order has the reduced-subword description; simple labels extend exactly when finite odd edges have equal labels.

[F2]

The unequal-parameter Coxeter Hecke algebra and The arbitrary-rank weighted Hecke basis and Bruhat-triangular bar: the quadratic relation is Tr2=(vL(r)−v−L(r))Tr+1, and the standard elements form a basis.

[F3]

Existence and uniqueness of the ordered-group unequal-parameter Kazhdan–Lusztig basis: the KL basis is the unique bar-invariant basis triangular below Bruhat order, with negative-exponent lower coefficients and the stated positive-weight simple-generator normalization.

[F4]

Unequal-parameter left, right, and two-sided cells and cell quotients: x←Ly exactly when the coefficient of Cx in CrCy is nonzero for a simple generator r.

Verification

Given: The data in the Statement.

1.1F1algebra

Since m(s,t)=4 is even, the weight extension criterion [F1] permits L(s)=1,L(t)=2. Put r=st. The presentation gives t=sr and srs=ts=r−1. Hence every word is rj or rjs for some j∈{0,1,2,3}, so ∣W∣≤8. Map s to reflection across the horizontal axis and t to reflection across the diagonal y=x. Their product is a rotation by 90 degrees, so these transformations generate all eight symmetries of the square and define a surjection from W onto that group. Thus W is that dihedral group. In particular 1,s,t,st,ts are distinct; s,t have length one and st,ts length two. The reduced-subword theorem [F1] then gives the lower intervals below st and ts as {1,s,t,st} and {1,s,t,ts}.

2.1F1F2F3step 1.1algebra

By [F3], Cs=Ts+v−1 and Ct=Tt+v−2. Expanding in the standard basis [F2] gives CsCt=Tst+v−2Ts+v−1Tt+v−3. Each lower term is indexed by a strict Bruhat subword from step 1.1 and has negative exponent. Since Cs,Ct are bar invariant, their product is bar invariant; uniqueness in [F3] identifies it with Cst. Reversing the product gives CtCs=Tts+v−1Tt+v−2Ts+v−3=Cts.

3.1F2F3F4step 2.1algebra∎

The quadratic relation gives Cs2=Ts2+2v−1Ts+v−2=(v+v−1)Ts+1+v−2=(v+v−1)Cs. Using L(t)=2 gives Ct2=(v2+v−2)Ct. Also CsC1=Cs, CtC1=Ct, CtCs=Cts, and CsCt=Cst. By [F4], these products give the four directed transitions displayed in the Statement and diagram. The proof establishes only these edges and makes no claim that the list is exhaustive.

CounterexampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A characteristic-two specialization collapses four weighted cell labels

Statement refuted

For every modular specialization of an unequal-parameter Hecke algebra, distinct generic weighted cell-module labels remain pairwise distinct among the simple modules of the special algebra.

Facts & Assumptions

Given: The Coxeter presentation, the unequal weights, the specialization v↦3, and the weighted KL and cell conventions.

[F1]

Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order and Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank: the Coxeter presentation determines length and Bruhat order, and finite-generator parabolics preserve intrinsic and ambient lengths.

[F2]

Weight functions and ordered group-algebra coefficients and Simple-generator weights extend uniquely to a weight function: weights add on length-additive products, and labels on simple generators extend when equal on odd-labelled edges.

[F3]

The unequal-parameter Coxeter Hecke algebra, The arbitrary-rank weighted Hecke basis and Bruhat-triangular bar, and Existence and uniqueness of the ordered-group unequal-parameter Kazhdan–Lusztig basis: the quadratic and braid relations define the weighted algebra, the standard elements form a basis after base change, and the KL elements are the unique bar-invariant triangular basis.

[F4]

Unequal-parameter left, right, and two-sided cells and cell quotients and Weighted cell quotients are well-defined modules and bimodules: coefficient transitions define the cells, and their quotients are modules with bases indexed by the cells.

[F5]

Canonical basic sets for split Hecke specializations: a decomposition matrix records composition multiplicities of the chosen stable lattices after reduction.

Counterexample

Given: Let W=A1×A1=⟨s,t∣s2=t2=1, (st)2=1⟩ with L(s)=1,L(t)=2. Specialize v↦3 in O=Z2, with fraction field K=Q2 and residue field k=F2. The four generic cell-module labels have eigenvalue pairs (−3−1,−3−2),(3,−3−2),(−3−1,32),(3,32) for (Ts,Tt). They are pairwise distinct over K, but every corresponding O-lattice reduces to the same simple Hk-module. This refutes the asserted universal label preservation and makes no claim about existence or nonexistence of a canonical basic set.

1.1F1F2algebra

Since the only finite edge has even label 2, the assignments L(s)=1,L(t)=2 extend to a weight function by [F2]. The relation (st)2=1 gives st=ts, so every element is one of 1,s,t,st. The map to (Z/2Z)2 sending s,t to the two standard basis vectors separates these four elements; their lengths are 0,1,1,2.

2.1F3step 1.1algebra

In k=F2, both 3 and 32 reduce to 1, and their negatives and inverses also reduce to 1. Put x=Ts−1 and y=Tt−1 in Hk. The specialized quadratic relations and characteristic two give x2=y2=0, and x,y commute, so the generators define a surjection k[x,y]/(x2,y2)→Hk. Its source has basis 1,x,y,xy, while [F3] and the four-element group from step 1.1 give Hk dimension four with standard basis 1,Ts,Tt,Tst; since Ts=1+x and Tt=1+y, the map is surjective between four-dimensional spaces and is an isomorphism. The ideal r=(x,y) satisfies r3=0 and Hk/r≅k. If M is a simple Hk-module, then rM is a submodule; if it equalled M, nilpotence would imply M=r3M=0. Thus rM=0, so M is the unique one-dimensional simple module of Hk/r.

2.2F1F3F4step 1.1algebra

Let C1=1, Cs=Ts+v−1, and Ct=Tt+v−2. The quadratic relations give Cs2=(v+v−1)Cs and Ct2=(v2+v−2)Ct. Since s,t commute, Cst:=CsCt=CtCs=Tst+v−2Ts+v−1Tt+v−3. The standard basis and Bruhat subword property in [F1,F3] show triangularity with negative lower coefficients; bar invariance and uniqueness in [F3] identify the KL elements. The complete left products are CsC1=Cs, CtC1=Ct, CsCs=(v+v−1)Cs, CtCs=Cst, CsCt=Cst, CtCt=(v2+v−2)Ct, CsCst=Cs2Ct=(v+v−1)Cst, and CtCst=CsCt2=(v2+v−2)Cst. Right products agree because the algebra is commutative. Hence the only non-loop arrows are 1→s, 1→t, s→st, and t→st, so all four cells are singletons. In the {1}-quotient Cs,Ct vanish, giving (Ts,Tt)=(−v−1,−v−2); in the {s}-quotient Cs2 gives Ts=v and CtCs=Cst vanishes, giving Tt=−v−2; in the {t}-quotient CsCt=Cst vanishes, giving Ts=−v−1, and Ct2 gives Tt=v2; in the {st}-quotient the last two products give (Ts,Tt)=(v,v2). By [F4] these are well-defined cell modules, with exactly the four action pairs in the counterexample.

3.1F3step 2.2algebra

At v=3, the two possible Ts-eigenvalues 3,−3−1 are distinct in K, since 3+3−1=10/3≠0. The two possible Tt-eigenvalues 32,−3−2 are distinct since 32+3−2=82/9≠0. Thus the four pairs listed in this counterexample label four distinct one-dimensional simple HK-modules. Each has an O-stable lattice Λ=O, because all four eigenvalues lie in O.

4.1F4F5step 3.1step 2.1∎

Each of the four lattices from step 3.1 reduces to the one-dimensional character Ts=Tt=1, which is the unique simple module found in step 2.1. Each reduction is itself simple, so its composition multiplicity is one. Hence the decomposition matrix has four rows and one column, all entries equal to 1, by [F5]. The four generic labels have collapsed to one special simple label, proving the claimed failure of universal label preservation. This calculation does not decide whether some subset satisfies the canonical-basic-set conditions.

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A nonsemisimple L-good rank-one specialization has a singleton basic set

Example

Take W=A1={1,s}, L(s)=1, A=Z[v,v−1], and specialize to k=C by v↦i. The specialized algebra is C[ε]/(ε2), hence is not semisimple and has one simple module M with Ts=i. The two generic labels have characters Ts=v and Ts=−v−1, Schur elements 1+v2 and 1+v−2, leading integers both one, and Schur exponents zero and one. Both full Schur elements vanish at i, but the characteristic is L-good. The decomposition matrix has one column with two entries equal to one, and the canonical basic set is the singleton consisting of the first generic label. The exact Lusztig properties required by the general theorem are verified directly below.

Facts & Assumptions

Given: The rank-one quadratic relation (Ts−v)(Ts+v−1)=0 and specialization v=i.

[F1]

Finite-Weyl Lusztig data and the precise basic-set hypotheses fixes the KL/dagger, a, γ, P2–P8/P15′, normalization and Schur-exponent conventions.

[F2]

Leading Schur coefficients and split good-characteristic asymptotic specializations identifies the integer fE and exponent αE of the generic Schur element and explains the L-good condition.

[F3]

Finite-Weyl canonical basic sets from Lusztig properties gives basic-set uniqueness and strict minimal-exponent selection once the exact hypotheses hold.

Verification

1.1F1givenconstructalgebra

The generic algebra has two distinct roots v,−v−1 over Q(v), so it is split with its two displayed one-dimensional characters. The KL basis is C1=1, Cs=Ts+v−1, and Cs2=(v+v−1)Cs by expansion of the quadratic relation. Therefore a(1)=0, a(s)=1, and τ(C1)=1, τ(Cs)=v−1 give D={1,s} and n1=ns=1. The only nonzero γ are γ1,1,1=γs,s,s=1.

2.1F1step 1.1algebra

P2, P3, P5, P6, P7 and P8 follow immediately from these two diagonal γ entries and s2=1. P4 holds for the only products C1Cw=Cw=CwC1 and Cs2=(v+v−1)Cs. For P15′, the condition a(w)=a(y) forces w=y, since the two values are distinct. Its left side is then δw,x′hx,w,w and its right side is δy,x′hx,w,y, identical because w=y. Thus every required P property is checked, not imported from a general cell theorem.

2.2F1F2step 1.1algebra

For the two characters write τ=c+−1χ++c−−1χ−. Evaluating on 1 and Ts gives c+−1+c−−1=1 and vc+−1−v−1c−−1=0. Hence c+=1+v2 and c−=1+v−2. Their lowest terms give (f+,α+)=(1,0) and (f−,α−)=(1,1) as in [F2]. Both specialize to zero at v=i, whereas the leading integers stay nonzero.

3.1F2F3step 2.1step 2.2algebra∎

At v=i both roots equal i, so Hk=C[Ts]/((Ts−i)2). Put ε=Ts−i. The element ε is nonzero and square-zero, since 1,Ts form the rank-two basis. On a simple module, the nilpotent ideal (ε) must act by zero: otherwise its image would be the whole simple and iteration would contradict its nilpotence. Thus the quotient Hk/(ε)=C gives the unique simple M. Both global free rank-one character models reduce to it, so the decomposition column is (1,1)t. Its unique least Schur exponent is zero, with multiplicity one, selecting exactly the first label. These are also precisely the axioms and uniqueness conclusion in [F3]. This verifies concretely that full-Schur vanishing is compatible with the general nonsemisimple basic-set theorem.

Sources