Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Finite-Weyl Lusztig data and the precise basic-set hypotheses

Definition

Work in the split generic finite-Weyl setting: W is a finite Weyl group, L:W→Z≥0 is a weight function, A=Z[v,v−1], and H=HA(W,L) has the symmetric normalization (Ts−vL(s))(Ts+v−L(s))=0. Its KL basis is Cw. Write K=Q(v) and assume the generic algebra HK is split semisimple, as in the generic setup of Canonical basic sets for split Hecke specializations. This hypothesis supplies the generic labels; this item asserts no new theorem on generic rational splitting. Let τ(Tw)=δw,1 be the canonical symmetrizing trace.

The A-linear algebra involution † is Ts↦−Ts−1, and put Dw=Cw†. Define structure constants by CxCy=∑zhx,y,zCz; equivalently DxDy=∑zhx,y,zDz. Define

a(z)=min⁡{n≥0:vnhx,y,z∈Z[v] for all x,y∈W},γx,y,z=[v0](va(z)hx,y,z−1).

The integer a(z) exists since W is finite and all h are Laurent polynomials invariant under bar. Let Δ(z) be the negative of the largest exponent in τ(Cz), and nz its nonzero coefficient. If τ(Cz)=0, put Δ(z)=∞ and nz=0. Let D={z:a(z)=Δ(z)}. In particular Δ(1)=0 and n1=1; P3 below forces a(1)=0.

The following are explicit hypotheses, not assertions for every unequal weight. They are precisely the subset used in Geck section 5.2:

  • P2: if d∈D and γx,y,d≠0, then x=y−1.
  • P3: for every y there is a unique d∈D with γy−1,y,d≠0.
  • P4: hx,y,z≠0 implies a(z)≥a(x) and a(z)≥a(y).
  • P5: in P3, γy−1,y,d=nd=±1.
  • P6: every d∈D satisfies d2=1.
  • P7: γx,y,z=γy,z,x.
  • P8: γx,y,z≠0 implies a(x)=a(y)=a(z).
  • P15′: if a(w)=a(y), then

∑uhx,u,yγw,x′,u−1=∑uhx,w,uγu,x′,y−1.

All sums are finite. These hypotheses produce the asymptotic algebra and modular theorem in the following proved suppliers; they do not assume positivity or irreducibility of cell modules. The generic Schur element cE(v) is determined by τK=∑EcE(v)−1tr⁡E. We use Geck's notation αE∈N and fE∈Z>0 for the Schur exponent and leading integer in Theorem 4.4. The local leading-Schur lemma below proves, from the stated P hypotheses, that cE(v) has lowest term fEv−2αE and that αE equals the support degree of VE in J. A specialization θ:A→k has u=θ(v)∈k×, multiplicative parameter ξ=u2, and is L-good when θ(fE)≠0 for every generic label E. Characteristic zero is always L-good. The modular theorem does not require θ(cE(v))≠0.

To compare normalizations, Geck's multiplicative generator is Ss=vL(s)Ts and obeys (Ss−v2L(s))(Ss+1)=0; after specialization its parameter is ξL(s). The asymptotic formulas below use Lusztig's revised convention Dw↔tw and coefficients nd in ϕ, with no diagonal sign change. Geck's signed starred convention is not mixed into these formulas.

Depends on

Used by

Dependency tree · two levels

19 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