Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Finite-Weyl canonical basic sets from Lusztig properties

Statement

Assume the Axiom of Choice. Let W be a finite Weyl group with integral nonnegative weight function L, and impose exactly the generic splitting and Lusztig properties specified in Finite-Weyl Lusztig data and the precise basic-set hypotheses, namely P2–P8 and P15′. Let HA be its Hecke algebra over A=Z[v,v−1]. For every unital specialization θ:A→k into a field, assume that k has characteristic zero or that every leading Schur integer fE is nonzero in k. Write the generic Schur element as cE=fEv−2αE plus terms of strictly higher v-degree.

Then Hk is split and has a unique canonical basic set for the decomposition matrix dE,M furnished by the free asymptotic models in Filtered projectives prove canonical basic-set reciprocity. Explicitly, there is an injection M↦E(M) from simple Hk-labels to generic labels, with

dE(M),M=1,αE(M)=min⁡{αE:dE,M>0},

and

dE,M>0 ⟹ E=E(M) or αE>αE(M).

Its image is the canonical basic set of Canonical basic sets for split Hecke specializations. In normalized generators the parameters are θ(v)L(s); in Geck's multiplicative generators they are θ(v2)L(s). No condition θ(cE)≠0 is imposed: nonsemisimple specializations are included. The Lusztig properties here are hypotheses, not universal assertions for all unequal weights or all Coxeter groups.

Facts & Assumptions

Given: The finite-Weyl data, the stated P2–P8 and P15′ hypotheses, the good specialization, and the Axiom of Choice.

[F1]

The homomorphism is ϕ(Dx)=∑z∈W, d∈Da(d)=a(z)hx,d,zndtz, with the sum over z∈W and distinguished d∈D. The layers Bi are (J,H)-bimodules, and P4 gives a(x)≤a(z) whenever hx,d,z≠0 (Finite-Weyl Lusztig data and the precise basic-set hypotheses, The asymptotic algebra, filtered layers and the specialization homomorphism).

[F2]

The Jk-simple VE has support in degree αE, the lowest Schur exponent; Jk is split under the nonvanishing of the leading integers fE (Leading Schur coefficients and split good-characteristic asymptotic specializations).

[F3]

The algebra Hk is split. For each simple M, with aM=max⁡{a(w):DwM≠0}, there is an injective assignment M↦E(M) with αE(M)=aM and [∗VE(M):M]=1 (Asymptotic induction identifies leading modular simples).

[F4]

The completion/free-model construction is available for every θ, including field extensions of its prime-generated residue field. It gives dE,M=[∗VE:M] and mult⁡Jk(VE,Bie)=δi,αEdE,M for a projective cover Hke of M (Complete local modular systems and integral idempotent lifting, Filtered projectives prove canonical basic-set reciprocity).

[F5]

The canonical basic-set axioms are multiplicity one, attainment of the least α in each column, and strict inequality for every other positive entry in that column (Canonical basic sets for split Hecke specializations).

Proof

1.1F1F2F4choosealgebra

Suppose dE,M>0. Choose w with a(w)=aM and DwM≠0. Since M is a composition factor of ∗VE by [F4], Dw cannot act as zero on that whole module. Thus ϕ(Dw) acts nontrivially on VE. In the formula of [F1], some surviving summand has hw,d,z≠0 and tzVE≠0. The latter implies a(z)=αE by [F2], while P4 gives aM=a(w)≤a(z). Hence every positive entry satisfies aM≤αE.

2.1F3F4step 1.1algebra

By [F3] and [F4], dE(M),M=1 and αE(M)=aM. Together with step 1.1 this proves that every column is nonzero and its least α is exactly aM. The assignment M↦E(M) is already injective. It remains to prove uniqueness of a generic label at that minimum.

2.2F1F2F3F4F6step 1.1choosealgebra

Fix M and a projective cover P=Hke as in [F4]. Put b=min⁡{i:Bie≠0}. The finite filtration starts with I0e=P and ends with zero, so this minimum exists, and the vanishing earlier layers implies P=Ibe. The quotient Pb=Bbe=P/Ib+1e is nonzero. The kernel K of the projective-cover map P→M is maximal, and superfluity makes it the unique maximal submodule: any proper submodule not contained in K would sum with K to P. Hence Ib+1e⊆K, so the cover map factors through a surjection πˉ:Pb→M. Its kernel Kˉ=K/Ib+1e is superfluous in Pb, since any submodule whose sum with Kˉ is Pb lifts to a submodule whose sum with K is P. The kernel Kˉ is also maximal because the quotient is simple. Therefore it is the unique maximal submodule and Pb has simple head M. This makes Pb indecomposable: a direct sum of two nonzero finite-dimensional modules has at least two simple summands in its head, even if isomorphic. But Pb is semisimple as a Jk-module and each Jk-summand is an Hk-submodule, since the action restricts through ϕ. Consequently it is exactly one VE1, with multiplicity one. Reciprocity gives αE1=b and dE1,M>0. Step 1.1 yields aM≤b. Conversely, [F3] and [F4] give dE(M),M=1 and αE(M)=aM, so reciprocity makes BaMe nonzero and b≤aM. Hence b=aM. Reciprocity then puts VE(M) in the single Jk-simple summand of Bbe, so E1=E(M) and dE1,M=1.

3.1F4step 2.1step 2.2algebra

If dE,M>0 and αE=aM, reciprocity puts VE in the nonzero layer BαEe, so αE≥b. Since aM≤b by step 2.2, equality holds throughout. The unique summand in Bbe is VE1, so E=E1. This applies to E(M) by step 2.1, giving E1=E(M). Thus a positive entry at the least α has precisely the label E(M); every other positive entry has strictly larger α.

4.1F2F3F4F5step 1.1step 3.1algebra∎

The image of the injection in [F3] now satisfies all axioms in [F5], proving existence. Those axioms also make the generic label the unique minimum in each column, proving uniqueness of the set and bijection. The parameter identities follow from Ss=vL(s)Ts, which changes (Ts−vL(s))(Ts+v−L(s))=0 into (Ss−v2L(s))(Ss+1)=0; applying θ gives the claimed specializations. Only fE was inverted in [F2] and [F4], and step 1.1 used the explicitly assumed Lusztig properties. Hence the proof imposes neither full-Schur nonvanishing nor any unstated general Coxeter assertion.

Source notes

This is Geck's Theorem 6.6 under its standing Section 5.2 hypotheses. Geck cites the asymptotic-algebra constructions, sketches the leading-Schur argument and splitting, and refers elsewhere for Proposition 6.7. The local supplier chain named above supplies these arguments; citations record provenance rather than replacing proof. In particular the reciprocity proof uses projected free modules over a complete local domain, so it does not assert that the right layer action is right multiplication by ϕ.

Depends on

Used by

Dependency tree · two levels

32 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