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.
Root sign coherence and the action of simple reflections on positive roots
Statement
Let be a finite set, a Coxeter matrix, the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with Coxeter form , the reflections (The real Coxeter form, its radical, reflections, and form-preserving maps), the canonical reflection homomorphism , the root system , the reflections , and the positive cone (The canonical reflection homomorphism, roots, reflections, and the positive cone); every root satisfies (Descent of the reflection representation, unit root norms, and conjugation of reflections (3)). Let be the chamber and its interior of the dual action and put (The dual action, chambers, faces, and root hyperplanes).
(1) Sign criterion for the cone. For : if and only if for every .
(2) Roots have a sign. Every root lies in or in , and not in both. Hence, with one has , , for every , and for every and In particular for all when , and for all when .
(3) Simple reflections act on positive roots. For every , equivalently .
Facts & Assumptions
Given: a finite set , a Coxeter matrix , the presented group with its universal property, the space with its canonical basis , the Coxeter form , the canonical reflection homomorphism with root system and reflection set , the positive cone and the negative cone , and the dual action on with chamber , interior and root hyperplanes .
For every and , exactly one of and holds, and in the second case ; equivalently, if and only if (The rank-two half-space alternative and the chamber-length induction , ).
The reflections are defined for by ; one has and , and the assignment induces the homomorphism (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).
The root system is , every root satisfies , the set is invariant under every , and for all , (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 is given by ; the closed chamber is , its interior is and is nonempty, and are disjoint open half-spaces, and the dual basis functionals satisfy and for every (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).
On the finite-dimensional real vector space with basis : every has unique coordinates with , evaluation is linear in for fixed , and sums and nonnegative multiples of elements of lie in (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear combination of a finite list, and the span as the smallest linear subspace containing , Linear functionals and the algebraic dual ).
Proof
Set-up. Every satisfies for all , so that and for all ; moreover . Every root is of the form with , hence nonzero, and is again a root, so .
The sign criterion, forward direction. Let , so all and some . For linearity gives , since all summands are nonnegative and the summand at is positive.
The sign criterion, converse direction. Let . If then for every , so assume ; then some coordinate is negative. Let with so small that . Then for every , so , and . Hence some element of evaluates negatively, and the criterion of (1) holds in both directions.
The equivalence of the two criteria. By 1.2 and 1.3, for every : if and only if for every .
Roots have a sign. Fix and . For one has ; by [F1] applied to the element either or . In the first case for every , so by 2.1 and hence in ; in the second case for every , so for every , whence by 2.1 and , so it lies in . The two alternatives are exclusive because while by 1.1. Since every root is some and is a root, this gives and ; taking gives and hence . Reading the two cases displayed above as equivalences with 2.1 gives and , and with 2.1 the last sentence of (2) follows.
Simple reflections act on positive roots. Fix . That is [F2]. Let . Since and is -invariant by [F3], , so by 3.1 either or . Suppose , that is , and write by [F2] with . In coordinates: for and . Since all coordinates are nonnegative and not all vanish, and since all its coordinates are nonpositive; for both statements apply to , so for all , that is with . Then , so and , contradicting the choice of . Hence ; moreover , because and is an involution, so would give . Thus , and applying the involution once more gives equality. Finally : indeed maps into by [F3], and by [F2], so this map is a bijection of ; consequently . This is (3), while (1) is 2.1 and (2) is 3.1.
Depends on
- The rank-two half-space alternative and the chamber-length induction $(P_n)$, $(Q_n)$
- 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
- Linear functionals and the algebraic dual $V^*=\mathcal L(V,F)$
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Monoid homomorphism and group homomorphism
- Group and abelian group
Used by
- The geometric inversion set N(w) of an element of a Coxeter group Definition
- The Tits cone, its interior, and the negative-root set of a functional Definition
- A vector with mixed signs is not a root, while every root has a sign Example
- All meets and joins of the right weak order of A₂ (S₃), with the left order and the inversion sets compared Example
- An indefinite Coxeter form with a faithful canonical reflection representation Example
- Chamber faces and their stabilizers in A₂ 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
- The Tits cone of infinite dihedral type: interior, boundary, and stabilizers 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
- Cartan-number products, allowed edge labels, tree scalings and reflection stability 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
- 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
- Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements Lemma
- The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id Lemma
- The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) Lemma
- The finite-type Coxeter cell: exposed faces and normal cones Lemma
- The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] 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
- A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types Theorem
- Chamber collisions, point stabilizers, and the intersection rule Theorem
- Finite noncrossing intervals are lattices, independently of the Coxeter element Theorem
- Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives Theorem
- 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 root-length criterion and faithfulness of the canonical reflection representation Theorem
- The separating-root lemma, the exact facet halfspaces of the added cones, and the spherical convexity of |X(sigma)| Theorem
Dependency tree · two levels
81 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)