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 outside roots give a finite complementary parabolic
Statement
Use the arbitrary-rank geometric representation of Coxeter-system, roots, length and weak-order conventions and the orbit definition from Standard parabolic subgroups and parabolic roots. Let , , , , and , with connected-component notation from Connected component notation [I,a]. Vectors have finite support, even if the vertex set is infinite. If is finite, then is finite and is finite.
Facts & Assumptions
Given: the objects of Coxeter-system, roots, length and weak-order conventions, Standard parabolic subgroups and parabolic roots and Connected component notation [I,a], and finite . [F1] The set is -invariant by Outside parabolic roots form an invariant set, and its span contains by Connected propagation spans the component. [F2] For any finite set of simple generators, its restricted Coxeter presentation embeds in the ambient group by Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, part 1. [F3] The canonical representation of a Coxeter system on finitely many generators is faithful by The root-length criterion and faithfulness of the canonical reflection representation, part 3.
For any set , is the set of bijections , with operation and identity , as in The symmetric group Sym(X): the bijections of a set X under composition.
Proof
Given: the objects of Coxeter-system, roots, length and weak-order conventions, Standard parabolic subgroups and parabolic roots and Connected component notation [I,a], and finite . [F1] The set is -invariant by Outside parabolic roots form an invariant set, and its span contains by Connected propagation spans the component. [F2] For any finite set of simple generators, its restricted Coxeter presentation embeds in the ambient group by Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, part 1. [F3] The canonical representation of a Coxeter system on finitely many generators is faithful by The root-length criterion and faithfulness of the canonical reflection representation, part 3.
[F4] For any set , is the set of bijections , with operation and identity , as in The symmetric group Sym(X): the bijections of a set X under composition.
Goal: Establish the assertion in the Statement.
Proof technique: direct.
Each element of the finite set has finite support. Let be the union of those supports; it is finite, and . By [F1], , hence by linear independence of the simple-root basis. Thus and are finite.
Since , [F1] gives a map defined by for , using [F4]. Each such map is a bijection with inverse , and the geometric action gives and . If , then fixes , hence fixes and in particular by [F1]. By [F2] applied to finite , the group is the Coxeter group on the restricted matrix. Its restriction to is exactly the canonical representation, since the generator formulas coincide. Faithfulness [F3] gives . If , the composition identities give , so ; thus is injective. The set is finite: every map is determined by one image in the finite set for each of its finitely many elements, so there are finitely many such maps and hence finitely many bijections. Therefore is finite. For the subgroup is the identity and the same conclusion holds.
Depends on
- Coxeter-system, roots, length and weak-order conventions
- Standard parabolic subgroups and parabolic roots
- Connected component notation [I,a]
- Outside parabolic roots form an invariant set
- Connected propagation spans the component
- Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank
- The root-length criterion and faithfulness of the canonical reflection representation
- The symmetric group Sym(X): the bijections of a set X under composition
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.