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 and inversion-length facts
PDF p. 4: §2.2; PDF p. 8: Lemma 3.5 argument
Statement
Let be the Coxeter system of the stated Coxeter diagram, with geometric representation on , roots , positive roots , negative roots , length , and contragredient action on the algebraic dual . The index set may be infinite.
The roots decompose as . The contragredient action faithfully realizes as a group generated by linear reflections. For , . If , then .
Statement references
Facts & Assumptions
For a finite set of generators, roots have exactly one sign, the number of positive roots made negative by an element is its length, and length is invariant under inversion. If is negative, then . Root signs, inversions and descent translation
For a finite set of generators, the geometric representation is faithful. The root-length criterion and faithfulness of the canonical reflection representation
In a finite Coxeter system, a standard parabolic subgroup has the Coxeter presentation restricted to its generating subset, and its intrinsic length agrees with ambient length. Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
Proof
Given: The Coxeter presentation, geometric representation, roots, length and contragredient action in the Statement. Coxeter-system, roots, length and weak-order conventions
Proof technique: direct.
Goal: Prove the sign, reflection, inversion-count and descent assertions for the given system.
Finite subsystems. For finite , let be the group presented by the restricted Coxeter matrix, and let be the span of its simple roots. The natural map is injective: an equality of two finite -words in the presentation of has a derivation using finitely many defining relators and letters, all contained in some finite ; [F3] then gives the equality already in . Similarly, the intrinsic length of an element of equals its length in : any shorter ambient word and a finite derivation of its equality lie in some finite , contradicting [F3]. The action of on is its finite-rank geometric representation, because the defining reflection formulas restrict to those for .
Root signs and inversion counts. Each root belongs to a finite subsystem containing the letters of a word for and ; [F1] therefore gives it exactly one sign in the full basis. Fix , choose finite containing a word for it, and write . By [F1] and 1.1 the subsystem on supplies distinct positive roots made negative by . Conversely, any finite collection of such full-system roots, together with words representing them and , is contained in a finite subsystem . Their signs in that subsystem agree with their signs in the full basis, and [F1] and 1.1 show that at most of them occur. Hence the full inversion set has exactly elements. Reversing words in the involutory generators gives .
Faithful dual reflection action. If , choose finite containing a word for . By 1.1 its image in is nontrivial, so [F2] shows that acts nontrivially on , and hence on . The algebraic dual separates vectors: a nonzero finite linear combination of basis vectors is detected by a coordinate functional. Thus a nonidentity invertible operator on has nonidentity contragredient action on . For each generator, the dual formula is ; it fixes pointwise the hyperplane and negates the nonzero functional , so it is a linear reflection. These generator actions faithfully realize .
Descent. If is negative, take a finite subsystem containing and a word for . By [F1] its intrinsic lengths satisfy ; 1.1 transfers this inequality to . Reversal of words gives and . Together with 2.1 and 2.2, this proves every assertion.
Depends on
- Coxeter-system, roots, length and weak-order conventions
- Root signs, inversions and descent translation
- The root-length criterion and faithfulness of the canonical reflection representation
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
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 pp. 4, 8; §2.2 and Lemma 3.5 argument