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 bases and nonnegative matrices for chamber labels
PDF p. 16: Proposition 4.6(1), proof
Statement
Let be a finite-rank Coxeter system with vertex set , canonical geometric representation , and positive roots . For , put and let be the positive roots of the standard parabolic subgroup . Fix and ; explicitly, and has minimum length in .
Then for every , and for every . The maps and are inverse isomorphisms. Their matrices in the indicated simple-root bases are entrywise nonnegative and are permutation matrices. Consequently . The assertions include empty and ; neither nor the parabolic subgroups are assumed finite.
Statement references
Facts & Assumptions
The geometric representation has symmetric bilinear form with and . Its roots are the -translates of simple roots, and positivity means nonnegative simple-root coordinates. Coxeter-system, roots, length and weak-order conventions
The label condition is , with of minimum length in this common set. The standard parabolic is generated by the for , and consists of their translates of the simple roots indexed by . Algebraic chamber-label set Standard parabolic subgroups and parabolic roots
For finite rank, . A minimum in sends into , and a minimum in has . Parabolic root subsystems and unique coset minima
An invertible real square matrix whose entries and inverse entries are nonnegative is a product of a permutation matrix and a strictly positive diagonal matrix; the empty matrix is included. Nonnegative inverse matrices preserve extremal basis rays
Relative to ordered domain and codomain bases, the column indexed by a domain basis vector is the coordinate column of its image under the linear map; empty bases give the corresponding zero-sized matrices. Coordinate columns [v]_B and matrices [T]_B^C of linear maps relative to ordered bases
Proof
Given: The finite-rank Coxeter system, , and label in the Statement.
Proof technique: direct.
Goal: Prove the two positive parabolic-root inclusions and the permutation-matrix conclusion.
For any subset , each generator with acts as the identity modulo , by the reflection formula. The same is therefore true of every element of . From , we have and . Fix and put . The element sends to ; since it is the identity modulo , its difference on shows . Thus . Interchanging and and replacing by gives . Applying to the first inclusion shows that both inclusions are equalities, so the restrictions of and are inverse isomorphisms.
Each is a root in , hence belongs to by [F3]. Since is minimum in , [F3] also makes it positive. Similarly, each is a root in and is positive because is minimum in . This proves both parabolic-root inclusions. Their nonnegative simple-root coordinates are precisely the columns of the respective matrices of the inverse isomorphisms in 1.1.
Choose orderings of the two finite simple-root bases. Their cardinalities agree by 1.1, and the two matrices are inverse and entrywise nonnegative by steps 1.1 and 2.1. By [F4], the matrix of is a permutation matrix times a strictly positive diagonal matrix. Thus each is a positive scalar multiple of one simple root, with the indices matched by a permutation. The reflection formula and show by expansion that each preserves ; hence every element of preserves , and every root has self-pairing . Consequently , so . The matrix of is therefore a permutation matrix, as is its inverse, and the displayed equality of simple-root sets follows. For empty bases the same conclusion is vacuous and the matrices are the unique matrices.
Depends on
- Coxeter-system, roots, length and weak-order conventions
- Algebraic chamber-label set
- Standard parabolic subgroups and parabolic roots
- Parabolic root subsystems and unique coset minima
- Nonnegative inverse matrices preserve extremal basis rays
- Coordinate columns [v]_B and matrices [T]_B^C of linear maps relative to ordered bases
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.
Sources
- Normalisers of parabolic subgroups of Artin–Tits groups and Tits cone intersections · PDF p. 16, Proposition 4.6(1), proof