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 , , , and specialize to by . The specialized algebra is , hence is not semisimple and has one simple module with . The two generic labels have characters and , Schur elements and , leading integers both one, and Schur exponents zero and one. Both full Schur elements vanish at , 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 and specialization .
Finite-Weyl Lusztig data and the precise basic-set hypotheses fixes the KL/dagger, , , P2–P8/P15′, normalization and Schur-exponent conventions.
Leading Schur coefficients and split good-characteristic asymptotic specializations identifies the integer and exponent of the generic Schur element and explains the L-good condition.
Finite-Weyl canonical basic sets from Lusztig properties gives basic-set uniqueness and strict minimal-exponent selection once the exact hypotheses hold.
Verification
The generic algebra has two distinct roots over , so it is split with its two displayed one-dimensional characters. The KL basis is , , and by expansion of the quadratic relation. Therefore , , and , give and . The only nonzero are .
P2, P3, P5, P6, P7 and P8 follow immediately from these two diagonal entries and . P4 holds for the only products and . For P15′, the condition forces , since the two values are distinct. Its left side is then and its right side is , identical because . Thus every required P property is checked, not imported from a general cell theorem.
For the two characters write . Evaluating on and gives and . Hence and . Their lowest terms give and as in [F2]. Both specialize to zero at , whereas the leading integers stay nonzero.
At both roots equal , so . Put . The element is nonzero and square-zero, since 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 gives the unique simple . Both global free rank-one character models reduce to it, so the decomposition column is . 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
- Meinolf Geck, Modular Representations of Hecke Algebras, sections 4–6 (standard reference, not scraped)
- George Lusztig, Hecke Algebras with Unequal Parameters, revised text, sections 18–21 (standard reference, not scraped)