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.
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
Definition
Let be a finite set and let satisfy for all and for all . Such an is a Coxeter matrix on .
The presented group. Let be the set of relators where is the free group on (Free group on a set of generators, Reduced words form the free group on an alphabet) and is the -fold product (Powers : natural exponents in a monoid and integer exponents in a group, with ), and let be the normal closure of in (The normal closure of a subset of a group, The normal closure of is the set of finite products of conjugates of elements of and their inverses). Define and write (as well as ) for the image of in (The quotient group and coset product , Group and abelian group).
Universal property. For every group and every map with for all and in for all with , there is a unique group homomorphism with for all (Monoid homomorphism and group homomorphism, A homomorphism that kills a normal subgroup factors uniquely through the quotient group, Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group, Group presentation by generators and relations, Relators and relations; finitely generated, finitely related, and finite presentations, In , the words and represent the same element if and only if ).
Length and reduced words. For put The minimum exists: every element of the free group is represented by a finite word in (Words in an alphabet with formal inverses, elementary cancellation, and reduced words), and in because , so every element of is the value of a finite word in ; the set of admissible is therefore nonempty and has a least element by the well-ordering principle (The well-ordering principle, The natural numbers (von Neumann)). A word in is a reduced expression of when and , and nonreduced otherwise. The empty word is a word in of length , and ; it is the reduced expression of .
Terminology. The pair is the Coxeter system presented by the Coxeter matrix ; when is understood, we also say that is the Coxeter group presented by .
Standard parabolic subgroups. For put (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
Conventions. is declared to be the order of in ; a value imposes no relator on . This definition asserts no finiteness, faithfulness, or completeness property of the presentation: the statements that the elements are pairwise distinct in (so that may be viewed as a labelled subset of ), that , that a word is reduced exactly when it admits no two-letter deletion, and that is the Coxeter system presented by the restricted matrix with intrinsic length equal to the ambient length are recorded with their justifiers below and are not used before those results.
Remarks
The properties announced in the Conventions paragraph are supplied later in this pair: pairwise distinctness of the simple generators, , and the deletion characterisation of reduced words in Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action ↗; the intrinsic presentation and length of the standard parabolic subgroups in Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification ↗. Until those results are available, and are to be read exactly as constructed above.
No form of choice is used in the construction: is the quotient of the free group on the finite set by an explicitly generated normal closure, and the only minimisation in the definition is over a nonempty set of natural numbers.
Depends on
- Words in an alphabet with formal inverses, elementary cancellation, and reduced words
- Free group on a set of generators
- Reduced words form the free group on an alphabet
- Group presentation by generators and relations
- Relators and relations; finitely generated, finitely related, and finite presentations
- The normal closure of $R$ is the set of finite products of conjugates of elements of $R$ and their inverses
- Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group
- In $\langle X\mid R\rangle$, the words $u$ and $v$ represent the same element if and only if $u^{-1}v\in\langle\!\langle R\rangle\!\rangle$
- The normal closure of a subset of a group
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- A homomorphism that kills a normal subgroup factors uniquely through the quotient group
- Monoid homomorphism and group homomorphism
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- Group and abelian group
- Powers $g^{n}$: natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$
- The natural numbers $\mathbb{N}$ (von Neumann)
- The well-ordering principle
Used by
- A faithful canonical realization that is not reflection faithful: the affine rank-two system Counterexample
- A parabolic quotient interval of S4 whose Möbius value is 0, so the Eulerian sign formula does not extend to quotients Counterexample
- A set of two reflections of A2 that fails both closure and the segment criterion Counterexample
- I₂(5) admits no crystallographic scaling and no reduced crystallographic root system with that base pairing Counterexample
- The positive lift b_w is not a monoid homomorphism Counterexample
- Artin monoid and Artin group presentations, and the canonical monoid-to-group map Definition
- Coxeter diagrams: edges, labels, components and finite type Definition
- Coxeter elements, the noncrossing interval [1,c], and the Kreweras map w ↦ w⁻¹c Definition
- Coxeter elements, the oriented Euler form, the skew form, and the periodic word Definition
- Crystallographic scalings: scaled simple roots, coroots and the root, coroot and weight lattices Definition
- Deleted-position labels from a fixed reduced expression, the lexicographic shelling criterion, and Möbius data Definition
- Irreducible affine Coxeter type: the corank-one form, the radical quotient, and the affine slice Definition
- Length generating series, descent-class series, spherical subsets, and the multivariate descent polynomial Definition
- Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator Definition
- Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization Definition
- Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups Definition
- The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)⁻¹a Definition
- The Bruhat graph by length-increasing reflection chains, the Bruhat order, inversion symmetry, and reflection parity Definition
- The canonical reflection homomorphism, roots, reflections, and the positive cone Definition
- The Coxeter nerve and its Moussong metric Definition
- The dual action, chambers, faces, and root hyperplanes Definition
- The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset Definition
- The geometric inversion set N(w) of an element of a Coxeter group Definition
- The geometric representation on the simple-root basis over a common splitting field, and the root set Definition
- The real Coxeter form, its radical, reflections, and form-preserving maps Definition
- The recursive initial-letter sortable projection Definition
- The right and left weak orders, intervals, covers, and meets and joins of subsets Definition
- The Tits cone, its interior, and the negative-root set of a functional Definition
- Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy Definition
- Words, heaps, linear extensions, commutation classes, and fully commutative elements Definition
- A moved-space intersection in A₃ that is not the meet Example
- A nonreduced word deleted by its repeated prefix reflection, and an exchange step Example
- A point outside the Tits cone with infinite stabilizer Example
- A source–sink move in A3: transporting the Euler and skew forms by an initial letter Example
- A vector with mixed signs is not a root, while every root has a sign Example
- All maximal chains of a rank-three interval in S4, their deleted-position labels, and the lexicographically first chain Example
- All meets and joins of the right weak order of A₂ (S₃), with the left order and the inversion sets compared Example
- All skips and the cone walls of the sortable element s1s2 in A3 Example
- An indefinite Coxeter form with a faithful canonical reflection representation Example
- Bruhat versus weak comparability in S4 Example
…and 126 more results.
Dependency tree · two levels
53 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 2014 book text, arXiv:math/0208154v2) (standard reference, not scraped)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press 2008; author's complete PDF) (standard reference, not scraped)