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 characterization of the inverse two-generator element
PDF p. 19: Remark 4.17
Statement
Let be the Coxeter system indexed by a set , possibly infinite, with its standard geometric representation and positive and negative roots and . For , let be the subgroup generated by the simple generators indexed by , let be its associated parabolic root set, and put . An associate of is a subset whose standard parabolic subgroup is conjugate to .
Let be an associate of , let distinct satisfy , and put . Let be the two-generator element constructed in the proof of the minimal common left multiple lemma. Then is the unique satisfying and .
Statement references
Facts & Assumptions
The construction in the minimal common left multiple lemma takes , where and , with the union of the components of the diagram induced on that meet . The relative-longest lemma makes spherical and gives . Here denotes the longest element of a finite standard parabolic subgroup . Two-generator minimal common left multiple Finite relative longest element without spherical ambient rank
In a finite-rank Coxeter system, every root is positive or negative, with the two signs disjoint, and every nonidentity element sends at least one simple root to a negative root. Root sign coherence and the action of simple reflections on positive roots The root-length criterion and faithfulness of the canonical reflection representation
Every group element has a finite word in the simple generators. For each finite , the canonical map from the Coxeter group presented by the restricted matrix on into is injective with image , by part 1 of Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank. Thus , with the generators indexed by , is a finite-rank Coxeter system. The geometric reflection formulas in Coxeter-system, roots, length and weak-order conventions restrict to its standard representation on . Its roots identify with , and their positive and negative signs agree with the ambient signs because their coordinates outside are zero.
Proof
Given: The Coxeter system, roots, subsets and finite relative-root hypothesis in the Statement.
Proof technique: direct.
Goal: Prove the two root-sign conditions for and show that they determine it in .
By [F1], lies in , and for a positive root the condition is equivalent to . Indeed . The action of preserves , directly from its definition as the -orbit of the simple roots indexed by . Consequently sends the stated difference into and sends into ; for the latter, write a root under consideration as and choose a finite set of indices containing and the letters in words for and . By [F3], both and are roots of that finite-rank Coxeter system with their ambient signs, so [F2] gives root-sign dichotomy.
Let satisfy both displayed conditions. Choose a finite containing the indices in words for both and . By [F3], is the Coxeter group for the restricted matrix, its roots are , and the actions of , and on them are the finite-rank geometric actions with the same signs. For every positive root of the finite subsystem on , the two conditions for and step 1.1 show that and have the same sign: belongs either to or to its complement in . These images remain roots of the subsystem on . Thus sends every positive root of that subsystem to a positive root: write such a root as either or , with positive, and use the matching signs. By [F2] applied to this finite-rank Coxeter system, in , hence also in , so . This proves uniqueness and the assertion.
Source notes
Remark 4.17 attributes the characterization to the discussion following Proposition 2.1 of the article's reference [5]. The proof above uses the completed relative-longest supplier and a finite-subsystem argument; it does not claim to reproduce that discussion.
Depends on
- Coxeter-system, roots, length and weak-order conventions
- Standard parabolic subgroups and parabolic roots
- Associates of a parabolic subset
- Standard expressions and their lengths
- Two-generator minimal common left multiple
- Finite relative longest element without spherical ambient rank
- Root sign coherence and the action of simple reflections on positive roots
- The root-length criterion and faithfulness of the canonical reflection representation
- Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank
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. 19, Remark 4.17