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.
Transfer to the root-action Brink–Howlett groupoid
Statement
Let be a Coxeter system with diagram vertex set , standard simple roots , and fixed . An associate of is a subset for which is conjugate to . Put . Let have exactly these associates as objects and arrows when , with composition .
An article arrow corresponds to the reversed arrow . Every article elementary label is a Brink–Howlett generator of this restricted , and every Brink–Howlett generator of this restricted groupoid corresponds to an article elementary label. No finite-rank assumption is imposed; the elementary labels require only their defining component to be spherical.
External input
Import the single-root generator formula for spherical , and closure of these generators under inversion, from Dyer–Gimenez, Lemma 1.25 and section 1.27. Apply this input only to the groupoid on the objects specified above. The cited proofs are not reconstructed here.
Facts & Assumptions
The elementary labels, their endpoints and the article composition convention are those of Standard expressions and their lengths. The root-action comparison on the same objects is supplied by Opposite-category convention for Brink–Howlett.
The simple roots are distinct basis vectors and the geometric action uses the standard reflection formulas (Coxeter-system, roots, length and weak-order conventions). For each finite set of simple generators, its restricted Coxeter presentation embeds in and intrinsic length equals ambient length (Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, assertion 1).
A finite Coxeter system has a unique longest element , with and ; in its canonical representation . Each of its standard parabolics also has a unique longest element (The longest element as the opposition of the chamber, and longest elements of finite parabolics, parts (1)(iii)–(v) and (2)).
The independent single-root generator formula and inverse-generator relation are the external inputs recorded above.
Proof
Given: The Coxeter system, fixed subset and restricted groupoid in the Statement, with the supplied mathematical premises and explicitly imported generator facts.
Goal: Identify the opposite groupoid and establish both directions of the elementary-generator correspondence.
The object set is the same as that of in [F1]. Its arrow condition is exactly the condition for in . For article arrows and , the corresponding composite in is . Thus reversal preserves the label of the article composite, as asserted.
Let be any component for which is finite. Distinct indices give distinct simple generators: the generator sends to , while for the coefficient of is . Hence is finite. By [F2], the restricted system on identifies with , with lengths preserved. The ambient reflection formulas restrict on the span of its simple roots to its canonical representation. Applying [F3] to this finite system therefore gives and with the same opposition permutation used for the article label. Applying the root formula twice gives ; the distinct basis vectors imply .
For put , so . Conjugation by permutes the simple generators of and sends the generators indexed by bijectively to those indexed by . It preserves length: replacing each letter in a shortest word gives one inequality, and the inverse conjugation gives the reverse inequality. Thus it carries the maximum-length element of to the maximum-length element of . Uniqueness in [F3] gives .
For an article elementary arrow put , and . Its label is . Step 2.1 and give by the imported single-root formula. Indeed , so the component containing is precisely . By step 1.1 this generator has source and target in . Both are associates of by [F1], so it belongs to the restricted groupoid. Only must be finite.
Conversely, let label a Brink–Howlett generator of the restricted groupoid, where is spherical. The cited inverse-generator relation says that its inverse is again a Brink–Howlett generator. Set and . By the finite-parabolic involutions in [F3], . By [F1] this is the article elementary arrow , so is an associate and . Since , one has ; step 1.2 gives . Step 2.1 now yields . Thus is exactly the reversal of the article elementary arrow , proving the converse without any finiteness condition on the other components.
Depends on
- Standard expressions and their lengths
- Opposite-category convention for Brink–Howlett
- Coxeter-system, roots, length and weak-order conventions
- Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank
- The longest element as the opposition of the chamber, and longest elements of finite parabolics
- Matthew Dyer and Harrison Gimenez, Root Systems, Tits Cones and Imaginary Cones of Brink-Howlett Groupoids · Lemma 1.25, opening formula and (d); section 1.27, generator definition and rank-one relation; section 1.4, rank convention.
Used by · 7
- Parallel classes of roots and finite inversion sets
- Independent arbitrary-rank factorization and simple-class inputs
- Every standard expression counts the same parallel classes
- Standard expressions are minimum generator words
- Appending an elementary factor is additive or removes its inverse
- Two elementary prefixes force a finite rank-two relative root set
- Every finite generator path reduces to a standard expression
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.
External dependencies
For b outside K, with E the finite-type component of K union {b} containing b, the generator label is nu(b,K)=w_E w_(E minus b). Its inverse is another such generator.
Hypotheses: A Coxeter system of arbitrary rank with its standard based root system; a union of full Brink–Howlett components; the indicated component E is spherical. Other components need not be finite.
Reading limits: Read the HTML statements in sections 1.3–1.4, 1.7–1.9 and 1.24–1.27, including Lemma 1.25(d). Import only the single-root formula and inverse relation. No reconstruction of their proofs, PDF inspection, whole-paper reading or reading of Brink–Howlett (1999) is claimed in this adjudication.
Sources
- Matthew Dyer and Harrison Gimenez, Root Systems, Tits Cones and Imaginary Cones of Brink-Howlett Groupoids · Lemma 1.25, opening formula and (d); section 1.27, generator definition and rank-one relation; section 1.4, rank convention.