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.
A source–sink move in A3: transporting the Euler and skew forms by an initial letter
Statement
Let be of type , with initial letter , and let , a reduced Coxeter word for the conjugate Coxeter element ; in the generator is final instead of initial, a source-sink move. For the forms of one computes, in the ordered basis , that is, in the fixed basis one has , , and , , . Then:
(i) The conjugation identities of The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment (3) hold: and for all taken from the simple basis. For example, using , and : and similarly for the remaining pairs.
(ii) The orientation of the rank-two subsystem changes sign when expressed in its canonical generators: in the relative order is before , in it is before , and correspondingly while ; the transported form is the same form read after applying the reflection to the two canonical roots. This is the sign convention used in The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment (4): the forms transport by conjugation while the orientation on the fixed canonical roots reverses. No Axiom of Choice is used.
Facts & Assumptions
Given: the type- Coxeter matrix with , the presented group , the space with its simple basis , the Coxeter form , the canonical reflection representation , the words and , and the forms , .
Coxeter elements, the oriented Euler form, the skew form, and the periodic word (1),(2): a Coxeter word uses each element of once; for a chosen ordered word, and when , when , when , with .
Coxeter words are commutation-connected; the Euler and skew forms depend only on the Coxeter element (1): every Coxeter word is reduced, and every reduced expression of a Coxeter element is again a Coxeter word.
The real Coxeter form, its radical, reflections, and form-preserving maps (2),(3): , , , and for .
The canonical reflection homomorphism, roots, reflections, and the positive cone (1): is a homomorphism with for every .
Coxeter elements, the oriented Euler form, the skew form, and the periodic word (2) combined with The real Coxeter form, its radical, reflections, and form-preserving maps (2),(3): for the word the triangular rule with , and gives the simple-basis entries , , , , , and the diagonal entries , hence , and .
The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment (3): if is initial in , then for all one has and .
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: the presentation has the relator for every .
Proof
The word evaluates to using [F7], and it uses each of once, so is a Coxeter word and, by [F2], a reduced Coxeter word for the conjugate Coxeter element ; in it is the final letter. This is the source-sink move.
Compute in the ordered basis from [F1] and the entries of [F3]: , , . Since precedes , which precedes in the word , the triangular rule gives , , , , and the three upper-triangular entries . This is the displayed matrix; subtracting its transpose gives the displayed . In the fixed basis the read-off entries are , , , while , , and .
The reflection acts on the simple basis by [F3] and [F4]: , , and .
Check on the nine simple pairs, using bilinearity, step 1.3, the entries of step 1.2 and the values of [F5]. Pair : . Pair : . Pair : . Pair : . Pair : . Pair : . Pair : . Pair : . Pair : . All nine pairs agree, so by bilinearity the identity holds on all of .
Transport of : since and by [F1], and since is linear and preserves the pairing of arguments' roles, step 2.1 gives for all basis vectors, hence for all vectors by bilinearity. This proves (i) by direct computation, illustrating the general identity [F6].
Clause (ii): from [F5], , and step 1.2 gives . In the noncommuting pair occurs in the order before , so the oriented entry is ; in the same pair occurs in the reversed order before , and the oriented entry is , positive in the reversed order. Moreover step 3.1 with exhibits the transported identity : the new form is the old form read after applying to the two canonical roots, so the forms are conjugate, while the sign on the fixed ordered canonical roots is reversed. This is the sign convention used in the rank-two alignment definition.
Conclusion: steps 1.1-1.3, 2.1, 3.1 and 4.1 verify (i) and (ii) by exact matrix and basis-pair computations. Every witness is a fixed basis vector or a fixed word, so no Choice is used.
Depends on
- Coxeter elements, the oriented Euler form, the skew form, and the periodic word
- Coxeter words are commutation-connected; the Euler and skew forms depend only on the Coxeter element
- The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
54 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
- N. Reading and D. E. Speyer, Sortable elements in infinite Coxeter groups, arXiv:0803.2722v3 (2010); Trans. Amer. Math. Soc. 363 (2011) 699-761 (standard reference, not scraped)
- N. Reading, Sortable elements and Cambrian lattices, arXiv:math/0512339v1 (2005); Algebra Universalis 56 (2007) 35-56 (standard reference, not scraped)
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Graduate Texts in Mathematics 231, Springer 2005 (standard reference, not scraped)