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 root-length criterion and faithfulness of the canonical reflection representation
Statement
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 with root system (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let be the positive and negative roots and the open chamber of the dual action (Root sign coherence and the action of simple reflections on positive roots).
(1) Root-length criterion. For all and ,
(2) Disjoint chambers. If for some , then . Equivalently, the chambers () are pairwise disjoint, that is, is prefundamental for the -action on in the sense that forces for every .
(3) Faithfulness. The homomorphism is injective, the dual action is injective, and for every there is with .
Facts & Assumptions
Given: a finite set , a Coxeter matrix , the presented group with length function , the space with Coxeter form , the canonical reflection homomorphism with root system , and the dual action on with open chamber and half-spaces , .
For every and : the chamber satisfies or , and if and only if ; for the rank-two half-space alternative and the induction , hold (The rank-two half-space alternative and the chamber-length induction , ).
For every and : and ; moreover and for every , and (Root sign coherence and the action of simple reflections on positive roots, The dual action, chambers, faces, and root hyperplanes).
For all and one has , and is invariant under inversion: ; every element has a reduced expression with , and then has (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).
The dual action is a left action of on by linear bijections, with for every (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).
Proof
Set-up. Recall from [F2] that and for every , and that the two sign equivalences of the root system hold; from [F4] that every acts on as a bijection with inverse the action of ; and from [F1] that for every and every generator exactly one of , holds.
The two-sided root-length criterion. Fix and . By [F2], if and only if ; by [F1] applied to the element this holds if and only if . Since and is inversion invariant, [F3] gives and , so . Finally by [F3] and by [F2], so this is equivalent to the statement that if and only if ; both claims of (1) follow.
Disjoint chambers. Suppose and . Choose a reduced expression of and let be its first letter, so that with by [F3]. The intersection point lies in , so meets , whence because ; applying the bijection from [F4] and using that its square is the identity gives . By [F1] applied to , therefore and ; but , so , a contradiction. Hence ; and the stated equivalence holds because if and only if by [F4].
Faithfulness. If , then as well, so for all and by [F4]; hence for every and meets , so 1.3 gives . If the dual action of is the identity, then for any one has , which is nonempty, and 1.3 again gives . Finally let and let be the last letter of a reduced expression of , so that by [F3]; by the criterion of 1.2, .
Depends on
- The rank-two half-space alternative and the chamber-length induction $(P_n)$, $(Q_n)$
- Root sign coherence and the action of simple reflections on positive roots
- 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
- The dual action, chambers, faces, and root hyperplanes
- The dual action, the faces, and the rank-two chamber tiling
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- Monoid homomorphism and group homomorphism
- Linear functionals and the algebraic dual $V^*=\mathcal L(V,F)$
- Group and abelian group
Used by
- A faithful canonical realization that is not reflection faithful: the affine rank-two system Counterexample
- c-sortable elements, forced and unforced skips, skip roots, and the chamber cone Definition
- The geometric inversion set N(w) of an element of a Coxeter group Definition
- An indefinite Coxeter form with a faithful canonical reflection representation Example
- Chamber faces and their stabilizers in A₂ Example
- Dihedral diagrams I₂(m): Gram determinants, the infinite case, and the low-rank coincidences Example
- Parabolic double cosets of the infinite dihedral group Example
- Roots, inversions and chamber images in I₂(5), A₂ and infinite dihedral type Example
- The Wall form and line restrictions of a plane rotation, and the necessity of a common upper bound 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
- Classical Poincare products for A, B, D and I2(m) from the permutation and signed-permutation models Lemma
- Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers Lemma
- Coxeter words are commutation-connected; the Euler and skew forms depend only on the Coxeter element Lemma
- Finite inversion sets are recognized by their rank-two initial or final segments Lemma
- Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary Lemma
- Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction Lemma
- Plane subsystems, their canonical generators, and the angular order of their roots Lemma
- Root normals inside the moved space, factorizations into reflections, and independent normals Lemma
- Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements Lemma
- The affine slice: faithful isometric action, the alcove simplex, and its facet reflections Lemma
- The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id 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 parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J Lemma
- Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion Lemma
- Chamber collisions, point stabilizers, and the intersection rule Theorem
- Crystallographic finite type: the Weyl types, reduced realizations and lattice stability Theorem
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite Theorem
- Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives 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 total degree sum, the invariant Jacobian as the discriminant, anti-invariants, and the top coinvariant class Theorem
Dependency tree · two levels
82 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)