Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedPipeline-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 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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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