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.
Arbitrary-rank Coxeter presentations, length, reflections, and Bruhat order
Definition
Let be any set, possibly infinite, and let be a Coxeter matrix: , and for distinct , . Let be the free group on , let be the normal closure of
and define . The image of in is also denoted . This is the Coxeter group presented by .
For , define its length by
The set is nonempty because every element of the quotient has a finite word in and the relators give ; its minimum exists by the well-ordering principle. A word of length for is a reduced expression; the empty word is the reduced expression of .
Define the reflection set . Write if for a reflection and . Define the reflection-chain Bruhat order by if there is a finite chain ; the empty chain is allowed. Length strictly increases on each nonempty chain, so this relation is a partial order. The exact reduced-subword description and finite-interval consequence needed below are established in Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank ↗.
When is finite, the presentation and length agree with Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, and the reflection-chain order agrees with The Bruhat graph by length-increasing reflection chains, the Bruhat order, inversion symmetry, and reflection parity. No exchange, standard-parabolic, reduced-subword, or interval-finiteness property is included in this definition; those properties are justified separately.
Depends on
- Free group on a set of generators
- Group presentation by generators and relations
- Relators and relations; finitely generated, finitely related, and finite presentations
- The normal closure of a subset of a group
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- The natural numbers $\mathbb{N}$ (von Neumann)
- The well-ordering principle
- Group and abelian group
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- The Bruhat graph by length-increasing reflection chains, the Bruhat order, inversion symmetry, and reflection parity
Used by
- A characteristic-two specialization collapses four weighted cell labels Counterexample
- The unequal-parameter Coxeter Hecke algebra Definition
- Weight functions and ordered group-algebra coefficients 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
- Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank Theorem
- The four weighted cells of A1×A1 give a canonical basic set at odd residue characteristic Theorem
Dependency tree · two levels
44 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
- Anders Björner and Francesco Brenti, Combinatorics of Coxeter Groups, GTM 231 (2005) (standard reference, not scraped)
- George Lusztig, Hecke Algebras with Unequal Parameters, revised arXiv text (2014) (standard reference, not scraped)