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.
The geometric inversion set of an element of a Coxeter group
Definition
Let be a finite set, a Coxeter matrix, the presented group with length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with Coxeter form and canonical reflection homomorphism (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let be the signed root system (Root sign coherence and the action of simple reflections on positive roots).
(1) Definition. For the inversion set of is Its elements are the roots inverted by . This is a subset of , defined before any finiteness or independence assertion; by construction , and is determined by the linear map .
(2) Elementary identities. ; for every and consequently whenever one of the two sets is finite. For every and , with , in the first case and , so the union is disjoint.
The identities are elementary: because would force for , and are disjoint. For the second identity let : then means , and with one has and , so and ; conversely for some gives because , and , so . Since is a bijection, the cardinality statement follows. For the recursion, let ; then , and maps bijectively onto itself while (Root sign coherence and the action of simple reflections on positive roots (3)), so is a bijection of that carries onto . By the root-length criterion (The root-length criterion and faithfulness of the canonical reflection representation (1)) one has and . If this gives , and hence with ; if it gives , and hence .
(3) Convention on reduced words. We keep the left action of on . If is a reduced expression, then the suffix roots are elements of , and the prefix roots are elements of . That these lists are exactly and , that their elements are pairwise distinct positive roots, and that in particular , is proved in The inversion formula , the root-reflection dictionary and strong exchange ↗; no finiteness or independence beyond the identities of (2) is asserted here.
For the two membership statements put and . Since by reducedness of the expression, the root-length criterion gives and also, applied to the reversed reduced expression of , gives . Moreover , so , which shows ; and , so , which shows .
Depends on
- Root sign coherence and the action of simple reflections on positive roots
- The root-length criterion and faithfulness of the canonical reflection representation
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Monoid homomorphism and group homomorphism
Used by
- A set of two reflections of A2 that fails both closure and the segment criterion Counterexample
- Meets and joins are not intersection and union of inversion sets: the A₂ counterexample Counterexample
- c-sortable elements, forced and unforced skips, skip roots, and the chamber cone 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
- All meets and joins of the right weak order of A₂ (S₃), with the left order and the inversion sets compared Example
- Roots, inversions and chamber images in I₂(5), A₂ and infinite dihedral type Example
- The Coxeter complex of I₂(5): the circle triangulated by the ten chambers Example
- The Euler and skew forms of c = s1s2s3 in A3, and the orientation of its rank-two subsystems Example
- A transported simple root lies in the positive span of the simple root and the inversion roots Lemma
- An element with full left descent makes the Coxeter group finite and is the longest element Lemma
- Binary meets, meets of arbitrary nonempty subsets, and joins of bounded subsets in weak order Lemma
- Coxeter words are commutation-connected; the Euler and skew forms depend only on the Coxeter element Lemma
- Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction Lemma
- Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements Lemma
- The cone criterion, monotonicity of the projection, and the greatest sortable element below w Lemma
- The finite-type Coxeter cell: exposed faces and normal cones Lemma
- The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment Lemma
- The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic Lemma
- The weak parabolic projection, its adjoints, and the cover-join lemmas Lemma
- Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion Lemma
- Sortable elements form a sublattice and the c-Cambrian quotient is its lattice-homomorphic image Theorem
- The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere Theorem
- The finite-negativity criterion, the reduction step, and convexity of the Tits cone Theorem
- The interior of the Tits cone, finite parabolic stabilizers, and local finiteness Theorem
- The inversion formula |N(w)|=ℓ(w), the root-reflection dictionary and strong exchange Theorem
- The longest element as the opposition of the chamber, and longest elements of finite parabolics Theorem
- The separating-root lemma, the exact facet halfspaces of the added cones, and the spherical convexity of |X(sigma)| Theorem
- The upper endpoint of a c-Cambrian fiber, interval fibers and the explicit formula u_c(w) = pi_c⁻¹(ww0)w0 Theorem
Dependency tree · two levels
65 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
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press, 2008; author's complete institutional PDF) (standard reference, not scraped)
- Anders Bjorner and Francesco Brenti, Combinatorics of Coxeter Groups (Graduate Texts in Mathematics 231, Springer 2005; author-hosted full PDF) (standard reference, not scraped)