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.
Weight functions and ordered group-algebra coefficients
Definition
Let be as in Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order. A totally ordered abelian group is an abelian group with a total order invariant under translation. Its group algebra consists of finite sums , where , with . Define the ring involution , and set
A weight function is a map such that whenever . Its simple-generator parameters are for . The exact criterion for prescribing those values on the simple generators is proved in Simple-generator weights extend uniquely to a weight function ↗. No sign restriction on is part of this definition.
The coefficient ordering used on the weighted Kazhdan–Lusztig basis is the given order on , through . The group algebra elements are units for every .
Depends on
Used by
- A characteristic-two specialization collapses four weighted cell labels Counterexample
- The unequal-parameter Coxeter Hecke algebra Definition
- A B2 unequal-parameter KL basis and four left-cell transitions Example
- Simple-generator weights extend uniquely to a weight function Lemma
- The arbitrary-rank weighted Hecke basis and Bruhat-triangular bar Lemma
- Existence and uniqueness of the ordered-group unequal-parameter Kazhdan–Lusztig basis Theorem
- The four weighted cells of A1×A1 give a canonical basic set at odd residue characteristic Theorem
Dependency tree · two levels
11 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
- George Lusztig, Hecke Algebras with Unequal Parameters, revised arXiv text (2014) (standard reference, not scraped)
- Meinolf Geck, Modular Representations of Hecke Algebras, EPFL lecture notes (2006) (standard reference, not scraped)