Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

The four weighted cells of A1×A1 give a canonical basic set at odd residue characteristic

Statement

Let W=⟨s,t∣s2=t2=1, (st)2=1⟩, the finite Weyl group A1×A1, and let L(s)=1, L(t)=2. Form its weighted Hecke algebra with coefficient v and the symmetric quadratic convention (Tr−vL(r))(Tr+v−L(r))=0. Let O=Zp for an odd prime p, let q=1+p, and specialize v↦q. Write K=Qp, k=Fp, and let D be the decomposition matrix of the four explicit O-lattices obtained from the cell quotients.

The left, right, and two-sided cells are the four singleton sets {1},{s},{t},{st}. Their four cell modules are pairwise distinct one-dimensional K-modules, and each has an O-stable rank-one lattice. Their reductions are the four distinct simple Hk-modules, so D is the 4×4 identity matrix up to the displayed ordering. Consequently, relative to any integer-valued statistic α on the generic simple modules, these four cell modules form a canonical basic set in the sense of Canonical basic sets for split Hecke specializations.

This is a finite Weyl case. In Geck's normalization, its specialization also satisfies the exact hypothesis θ(cχ)≠0 for every generic irreducible character in Theorem 4.11; the proof below verifies the decomposition matrix directly.

Facts & Assumptions

Given: The weighted Coxeter and Hecke conventions in the Statement, an odd prime p, and the definitions of the KL basis, cells, cell modules, and canonical basic set.

[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; reduced words and subwords give the finite lower intervals needed for triangularity.

[F2]

Weight functions and ordered group-algebra coefficients and Simple-generator weights extend uniquely to a weight function: a weight function is additive on length-additive products, and simple-generator labels extend exactly when they agree along finite odd-labelled edges.

[F3]

The unequal-parameter Coxeter Hecke algebra and The arbitrary-rank weighted Hecke basis and Bruhat-triangular bar: the Hecke generators satisfy their stated quadratic and braid relations, and the standard elements form a free coefficient-module basis after specialization to a commutative coefficient ring.

[F4]

Existence and uniqueness of the ordered-group unequal-parameter Kazhdan–Lusztig basis: the elements Cw form a bar-invariant triangular basis, with Cs=Ts+v−L(s) for L(s)>0.

[F5]

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 cell preorders, and the cell quotients are modules with bases given by their cell elements.

[F6]

Canonical basic sets for split Hecke specializations: for the chosen lattice decomposition matrix D, the minimum αˇM and the two multiplicity/order conditions define a canonical basic set.

[F7]

The canonical Hecke trace and symmetrizing form and The canonical Hecke trace is symmetric and perfect: for a finite Coxeter group, the coefficient of the identity standard basis element defines a trace with a symmetric perfect pairing, and this trace is preserved by commutative base change.

[F8]

Schur elements of a split semisimple algebra with a symmetrizing trace: for a split semisimple algebra with symmetrizing trace τ, the Schur elements cE, when they exist, are the nonzero scalars in τ=∑EcE−1χE.

Proof

Given: The presentation W, weights L(s)=1,L(t)=2, the specialization v↦q=1+p, and the facts above.

1.1F1F2constructalgebra

From (st)2=1 and s2=t2=1, st=(st)−1=ts. Thus every word reduces to one of 1,s,t,st. The homomorphism to (Z/2Z)2 sending s↦(1,0), t↦(0,1) respects all relators and separates these four elements, so they are distinct. Their lengths are 0,1,1,2, respectively. Since the only finite edge has even label 2, the odd-edge condition in [F2] permits the unequal labels 1,2; it gives a well-defined weight function L.

2.1F1F3F4step 1.1algebra

Put C1=1, Cs=Ts+v−1, and Ct=Tt+v−2. The rank-two relations give Ts2=(v−v−1)Ts+1 and Tt2=(v2−v−2)Tt+1, so direct expansion gives Cs2=(v+v−1)Cs and Ct2=(v2+v−2)Ct. The generators commute because m(s,t)=2, and Cst:=CsCt=CtCs=Tst+v−2Ts+v−1Tt+v−3. These elements are bar invariant and have leading standard term Tw with lower Bruhat support and negative coefficients; uniqueness in [F4] identifies them as the KL basis.

2.2F3step 1.1algebra

For r∈{s,t}, set as=q, at=q2. The specialized quadratic relation is (Tr−ar)(Tr+ar−1)=0. Since ar+ar−1≡2(modp), it is a unit in O, so er+=(Tr+ar−1)/(ar+ar−1) and er−=(ar−Tr)/(ar+ar−1) belong to HO. They sum to 1, their product is zero by the quadratic relation, and (Tr−ar)er+=(Tr+ar−1)er−=0, so they are complementary idempotents. Every rank-one element b+cTr equals (b+car)er++(b−car−1)er−, making both summands free of rank one. The commuting rank-one subalgebras tensor to HO with the standard rank-four basis [F3], so the four products esϵetδ give HO≅O4 and hence HK≅K4, Hk≅k4.

3.1F3F4step 2.1algebra

The complete left-product table is determined by CsC1=Cs, CtC1=Ct, Cs2=(v+v−1)Cs, CtCs=Cst, CsCt=Cst, Ct2=(v2+v−2)Ct, CsCst=Cs2Ct=(v+v−1)Cst, and CtCst=CsCt2=(v2+v−2)Cst. The right table is identical because the algebra is commutative. With an arrow y→x when Cx occurs in CrCy or CyCr, the only non-loop arrows are 1→s, 1→t, s→st, and t→st. No transition points back, so mutual comparability has four singleton classes for each left, right, and two-sided preorder.

4.1F3F4F5step 3.1algebra

In the quotient for {1}, both Cs and Ct vanish, so Ts=Cs−v−1 and Tt=Ct−v−2 act by −v−1 and −v−2. In the quotient for {s}, CtCs=Cst vanishes while Cs2=(v+v−1)Cs; hence (Ts,Tt) acts by (v,−v−2). In the quotient for {t}, CsCt=Cst vanishes, so Ts acts by −v−1; Ct2=(v2+v−2)Ct gives Tt-eigenvalue v2. In the quotient for {st}, CsCst=(v+v−1)Cst and CtCst=(v2+v−2)Cst, so the action is (v,v2). By [F5] each is a well-defined one-dimensional cell module. Their four eigenvalue pairs are distinct over K, since q+q−1≠0 and q2+q−2≠0 in the characteristic-zero field K.

5.1F5step 4.1step 2.2

The four cell characters from step 4.1 take values in O, so Λ=O with the displayed scalar actions is an HO-stable rank-one lattice for each. Their reductions have Ts,Tt eigenvalues respectively (−1,−1), (1,−1), (−1,1), and (1,1) in k. Since p is odd these are four distinct characters of Hk≅k4; each is simple, and each reduced lattice has composition multiplicity one for exactly its matching character. Thus D=I4, up to ordering.

6.1F7F8step 1.1step 2.2step 5.1algebra

Let K0=Q(v) be the generic coefficient field and put Ur=vL(r)Tr, which has eigenvalues Qr=v2L(r) and −1. By [F7], the canonical trace on the normalized standard basis Uw takes value 1 on the identity and 0 on nonidentity elements, and its generic pairing is symmetrizing. For one rank-one factor, the algebra over K0 is K0×K0, with characters χ+(Ur)=Qr, χ−(Ur)=−1. By [F8], write τ=c+−1χ++c−−1χ−. Evaluating at 1 and Ur gives c+−1+c−−1=1 and Qrc+−1−c−−1=0; solving yields c+=1+Qr and c−=1+Qr−1. For A1×A1, the algebra and trace are tensor products of the rank-one factors, so the four Schur elements are products of one term from {1+v2,1+v−2} and one from {1+v4,1+v−4}. Under the residue map v↦1 in k, each product is 4≠0. Thus Geck's Theorem 4.11 has its exact finite-Weyl and nonvanishing hypotheses here and gives the identity decomposition matrix; step 5.1 has already proved the same conclusion directly.

7.1F6step 5.1∎

For any integer-valued α, an identity decomposition matrix has exactly one nonzero entry in each column, equal to 1. Thus for each simple M, αˇM is the α-value of its matching cell module; all other rows in that column vanish. Both conditions in [F6] hold, so the four cell modules form a canonical basic set. The claim is restricted to this explicit finite Weyl group and this odd-characteristic specialization.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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