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.
Divisibility of positive lifts and weak order
PDF p. 22: Lemma 5.9, opening proof paragraphs; PDF p. 23: Lemma 5.9, opening proof paragraphs
Statement
Let be a finite-rank Coxeter system of spherical type, meaning that is finite. Let be its Artin–Tits group, its submonoid generated by the standard generators , and the homomorphism sending to . Write for the minimum length of a word in representing . For a reduced expression , define its positive lift by , and put .
For , say that left-divides if for some . On use the prefix weak order: if for some with . Restriction of is an isomorphism from with left divisibility to with this order, with inverse . The article calls the latter left weak Bruhat order; the prefix convention here is also called right weak order.
The left-divisibility least common multiple of any two elements of exists in and belongs to .
Statement references
Facts & Assumptions
Positive lifts are independent of reduced expression, satisfy , and obey whenever . The stated prefix relation is right weak order. (Reduced-word lifts and the prefix-order convention)
In spherical type, the presented positive Artin monoid embeds as ; its Garside element has left divisors precisely the reduced positive lifts, and every pair has a left-divisibility lcm. (Independent spherical Artin Garside input)
Word length in the positive generators gives an additive degree on . Under the embedding this degree transports to , and . (Positive degree and atoms of the presented Artin monoid, Reduced Coxeter lifts in the presented positive monoid, Identifying the presented monoid with its positive image)
Every element of is represented by a finite positive word. Coxeter length is the minimum length of a representing word; concatenating representative words gives . (Positive Artin and parabolic monoids, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups)
An order isomorphism between posets is a bijection that preserves and reflects the order. (Order embedding and order isomorphism)
Proof
Given: The spherical Coxeter and Artin–Tits data in the statement.
Goal: Prove the poset identification and lcm closure.
The lift map is a section of by [F1], hence it is injective and restricts to its inverse on . If , choose as in the prefix definition. Then [F1] gives , and , so left-divides .
Conversely, suppose with . Choose a positive word for of length and put . Its image is a word of length for , so by [F4]. Additivity of degree and [F3] give . Applying gives , and [F4] now gives . Thus both inequalities are equalities and . Together with step 1.1 this proves the poset isomorphism.
Let . By [F2] each left-divides , and their left-divisibility lcm exists. Since is a common upper bound, the defining least-upper-bound property gives that left-divides . The left divisors of are exactly by [F2], so . This proves the remaining assertion.
Depends on
- Artin–Tits group, pure subgroup and positive lifts
- Positive Artin and parabolic monoids
- Reduced-word lifts and the prefix-order convention
- Independent spherical Artin Garside input
- Positive degree and atoms of the presented Artin monoid
- Reduced Coxeter lifts in the presented positive monoid
- Identifying the presented monoid with its positive image
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Order embedding and order isomorphism
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. 22–23, Lemma 5.9, opening proof paragraphs