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.
The four lifting squares in S4
Example
In with simple reflections , one-line notation and the inversion number (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4)), the four cases of the lifting property (The lifting property in all four descent cases, the cover criterion, reflection deletion, and directedness (1)) occur as follows (products are right multiplication, swapping the entries in positions and ).
(a) (), (), : () and (); here is a descent of and an ascent of , and indeed and , while fails: the two lifted elements are incomparable.
(b) , , : () and (); here is an ascent of both, and .
(c) (), (), : () and (); here is a descent of both, and , while fails.
(d) (), (), : () and (); here is a descent of and an ascent of , and , .
In each case are the four vertices of a Bruhat square whose sides are together with or or according to the case; cases (a) and (c) show that the extra comparisons and , respectively, cannot be asserted in all four cases: in (a) the comparison is false and in (c) the comparison is false.
Facts & Assumptions
Given: with generators , the elements of the four cases, and the products , displayed in the statement.
For type with , the assignment extends to an isomorphism and ; in particular a word in the is reduced if and only if its length equals the inversion number of its value. (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4))
One-line notation lists the values of a permutation in order of the arguments, and the composition convention is ; hence right multiplication by swaps the entries in positions and of the one-line form. (The finite symmetric group , one-line notation, and cycle notation)
The inversion number of is . (Inversions, inversion number, the sign , and even and odd permutations)
Lifting property in all four cases: if and , then (a) , give and ; (b) , give and ; (c) , give and ; (d) , give and . (The lifting property in all four descent cases, the cover criterion, reflection deletion, and directedness (1))
Subword criterion: for a reduced expression and , one has if and only if there are with , and the indices may be chosen with . (The subword characterization of Bruhat order and its independence of the reduced expression (1))
Distinct elements of equal length are incomparable: if and , then . (The Bruhat graph by length-increasing reflection chains, the Bruhat order, inversion symmetry, and reflection parity (2))
Verification
The displayed products are computed by [F2]: , , , , , , and . Their inversion numbers, computed with [F3] and equal to the lengths by [F1], are: , , , , , , , , and .
First certify in each case: in (a) and (b), occurs at positions of ; in (c), it occurs at positions of ; and in (d), occurs at positions of . Each ambient word has length equal to the inversion number of its value, so [F1] and [F5] prove these initial comparisons. The comparisons required by the four cases — and in (a), and in (b), and in (c), and and in (d) — are certified by subword witnesses in the displayed reduced words, each verified by multiplying out the indicated letters: is the subword at positions of ; is the subword at positions of and at positions of ; is the subword at positions of ; is the subword at position of and at position of ; is the subword at position of ; and is the subword at positions of . Each listed ambient word is reduced, since its value has inversion number equal to its length by [F1]; hence the subword criterion [F5] applies and gives the stated comparisons.
The two negative comparisons follow from length alone: in case (a) the elements and both have length and are distinct, so they are incomparable by [F6], and in particular fails; in case (c) the elements and both have length and are distinct, so they are incomparable by [F6], and in particular fails. The equalities of the displayed lengths with the inversion numbers were computed in step 1.1.
The descent and ascent patterns are read off the lengths computed in step 1.1: in (a) and ; in (b) and ; in (c) and ; and in (d) and .
Each of the four cases of [F4] is therefore instantiated: case (a) by the pair with , where step 1.2 gives and and step 2.1 shows the companion comparison fails; case (b) by the same pair with , where is an ascent of both and step 1.2 gives and ; case (c) by with , where is a descent of both, step 1.2 gives , and step 2.1 shows fails; and case (d) by with , where step 1.2 gives and . In each case the four elements form the lifting square of the theorem with the sides listed in the statement, and cases (a) and (c) show that the two extra comparisons cannot be asserted uniformly. All computations are finite enumerations in and use no choice principle.
Depends on
- The lifting property in all four descent cases, the cover criterion, reflection deletion, and directedness
- The subword characterization of Bruhat order and its independence of the reduced expression
- The Bruhat graph by length-increasing reflection chains, the Bruhat order, inversion symmetry, and reflection parity
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- Inversions, inversion number, the sign $\operatorname{sgn}(\sigma)=(-1)^{\operatorname{inv}(\sigma)}$, and even and odd permutations
- Group and abelian group
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
44 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Anders Bjorner and Francesco Brenti, Combinatorics of Coxeter Groups (Graduate Texts in Mathematics 231, Springer 2005; author-hosted complete PDF) (standard reference, not scraped)
- Carl Marberg, MATH 6150F Coxeter systems and Iwahori-Hecke algebras, Lecture 11: More about Bruhat order (HKUST, Spring 2017) (standard reference, not scraped)
- Tom Denton, Lifting property and poset structure of finite Coxeter groups (UC Davis MAT 280 lecture notes, 26 January 2009) (standard reference, not scraped)