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.
Finite roots and finite Coxeter groups at finite rank
Statement
In the arbitrary-rank setting of Coxeter-system, roots, length and weak-order conventions and Standard parabolic subgroups and parabolic roots, let be finite. Then is finite if and only if is finite.
Facts & Assumptions
Given: finite , the root orbit of Standard parabolic subgroups and parabolic roots in the geometric representation of Coxeter-system, roots, length and weak-order conventions. Put ; the vectors for form a basis of .
The Coxeter group presented on with restricted matrix is isomorphic to by the map sending its generator indexed by to , by Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, part 1.
The canonical reflection representation of a Coxeter group with finitely many generators is faithful, by The root-length criterion and faithfulness of the canonical reflection representation, part 3.
Proof
Given: finite , the root orbit of Standard parabolic subgroups and parabolic roots in the geometric representation of Coxeter-system, roots, length and weak-order conventions. Put ; the vectors for form a basis of .
[F1] The Coxeter group presented on with restricted matrix is isomorphic to by the map sending its generator indexed by to , by Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, part 1.
[F2] The canonical reflection representation of a Coxeter group with finitely many generators is faithful, by The root-length criterion and faithfulness of the canonical reflection representation, part 3.
Goal: Establish the assertion in the Statement.
Proof technique: direct.
If is finite, the expression exhibits as the image of the finite set . If is empty, is empty and is the identity group, so both are finite.
For and , the ambient reflection formula gives . Since , each such generator preserves bijectively, and hence acts on . The restricted form has exactly the Coxeter-form entries for . Under the basis identification sending the canonical vector indexed by to , these generator actions are therefore the canonical simple reflections for . The isomorphism in [F1] consequently identifies the restricted action with that canonical representation on every group element. Since is finite, [F2] makes the restricted action faithful.
Conversely, suppose is finite. For and , one has ; applying the same observation to shows that permutes . This gives a homomorphism from to the finite permutation group of . Every for belongs to , by taking . An element of the kernel thus fixes the basis of pointwise and, by linearity, acts identically on . The faithfulness established in step 1.2 forces that element to be the identity. The permutation homomorphism is injective, so is finite. Together with step 1.1 this proves the equivalence.
Depends on
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.