Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources