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.
Rotation parameters and the two switchback completions
Statement
Let be a Coxeter system and let be finitary, meaning that is finite. All the following constructions take place in the finite standard parabolic Coxeter system . For , let be its parabolic longest element and let be Coxeter length in .
Use the following singular-expression conventions. Write for the unique Bruhat-maximal element of a double coset , using the Bruhat order of . Let be the Coxeter monoid product on the underlying set , with the Coxeter braid relations and idempotence for . For and , where these arrows are respectively - and -double cosets, set . A singular expression with successive subsets differing by one vertex denotes the composite of the double cosets in the displayed order. The notation records the path , with an addition required to add a missing vertex and a deletion required to remove a present one. An expression is reduced if each composition of a prefix with the next factor is reduced; a composition through is reduced when . Brackets with larger inclusions or deletions abbreviate the corresponding monotone single-vertex chains. In particular means an inclusion chain from to followed by a deletion chain from to . An atomic expression concatenates the three-subset expressions of its atomic factors.
Let with . Put , for , , , , , and . Let be Ko's maximal index for which the rotation word is reduced. The first word consists, for , of the atomic steps , where . The second word is obtained by reversing and applying to every subset and vertex. Both are atomic reduced expressions from to . They express the same coset as the compressed expression . Their first added vertices are respectively and .
Facts & Assumptions
Given: The data and hypotheses in the Statement.
Atoms and their minimal representatives are related by the finite formula, and reduced atomic compositions translate to standard expressions. Atomic reduced compositions and standard products use the same order Core and atomic double cosets
The singular-expression conventions, Bruhat-maximal elements, Coxeter monoid composition and reduced-composition criterion are imported from Ko Sections 1.2–1.3 and 2.1–2.2, Definitions 2.1–2.3 and Definition 3.9, as specified in the External input section.
In the finite system , Ko Proposition 4.3 supplies the atoms, Proposition 4.5 and Lemma 4.7 give and , and Remark 4.8 and Proposition 4.9 supply the two reduced switchback completions.
External input
The singular-expression construction in the Statement is the imported convention of Ko Sections 1.2–1.3 and 2.1–2.2: Section 2.1 specifies the unique maximal double-coset representatives with respect to the Bruhat order, Definition 2.1 specifies composition by the Coxeter monoid product of these representatives, (2.4)–(2.5) specify the subset and plus/minus notation, Definitions 2.2–2.3 specify reducedness, and Definition 3.9 specifies atomic expressions. The monoid presentation, identification with , existence of the Bruhat-maximal elements and well-definedness of this composition are imported, not proved here. The compressed notation expands inclusions and deletions into monotone single-vertex chains; the intermediate subsets have no effect on the composite, since the longest element of the largest parabolic absorbs the generators of each smaller one in the Coxeter monoid.
Ko's Proposition 4.3, Proposition 4.5, Lemma 4.7, Remark 4.8 and Proposition 4.9 supply atomicity, the endpoint identities, reducedness and the switchback equality. These are imported in the finite system , with , . The cited Elias–Ko proofs underlying the switchback result were not independently reconstructed.
Proof
Goal: Identify the two reduced atomic words and their common compressed expression.
Since , the required condition holds in . By [F3], each is atomic and the rotation endpoints satisfy and . Hence and . The imported switchback extension in Remark 4.8 identifies the reduced word with . Its first two portions are successive inclusions and its last two portions are successive deletions. Under the monotone-chain convention in [F2], their concatenations give exactly the compressed expression . These atomic factors and their compositions use the convention of [F1].
The imported Proposition 4.9 applies a switchback, commutes the two additions and the two deletions, then applies the reversed opposition-transformed switchback. This is exactly : its initial addition is , its final deletion is , and its endpoints are again . Both words are reduced and atomic by [F3], in the composition sense of [F1] and [F2]. The initial addition of is , so the two words are distinct. Reversing and applying opposition to the subset path constructs the second expression; the equality with the first expression is supplied by Proposition 4.9, rather than by treating reversal alone as equality of cosets.
Depends on
- Atomic reduced compositions and standard products use the same order
- Core and atomic double cosets
- Hankyung Ko, An atomic Coxeter presentation, arXiv:2312.16666v3 · Section 4 opening and Notation 4.1, Definition 4.2, PDF p. 13; Proposition 4.3, Definition 4.4, Proposition 4.5 and Lemma 4.7, p. 14; Remark 4.8 (4.8), Proposition 4.9 (4.9)–(4.13), p. 15; Definition 4.10, pp. 15–16
- Hankyung Ko, An atomic Coxeter presentation, arXiv:2312.16666v3 — singular-expression conventions · Section 1.2, (1.3)–(1.4), PDF p. 3; Section 1.3, p. 4; Section 2.1, paragraph on unique Bruhat extrema of finitary double cosets, p. 8; Section 2.2, Definition 2.1 and (2.4)–(2.5), p. 9; Definitions 2.2–2.3 and Proposition 2.4, p. 10; Definition 3.9, p. 13
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
In a finite Coxeter system with opposition c↦bar c and s≠bar t, the recursion of Definition 4.2 gives the atoms [L_j,I_j,L_(j+1)] of Proposition 4.3. At the maximal reduced index d of Definition 4.4 one has u_d=t and u_(d+1)=bar s. Remark 4.8 identifies the maximal atomic word with [L_0,I_0,T,I_d,L_(d+1)]. Proposition 4.9 equates that word to its reversed opposition transform; both words are atomic and reduced. Definition 4.10 names this relation the atomic braid relation.
Hypotheses: An ambient Coxeter system (W,S), a finitary subset T⊆S, and the finite standard parabolic system (W_T,T). In Ko Section 4 replace its S by T, take s=a and t=bar b, and require a≠b. Every indexing subset lies in T and is therefore finitary.
Reading limits: Read the extracted PDF text of the Section 4 opening, Notation 4.1, Definitions 4.2 and 4.4, Propositions 4.3, 4.5 and 4.9, Lemma 4.7, Remark 4.8 and Definition 4.10, including the printed arguments and formulas (4.1)–(4.15). The underlying Elias–Ko and Elias–Ko–Libedinsky–Patimo papers were not read or reconstructed. This repair inspected extracted PDF text only; no visual inspection is claimed. No whole-paper reading or independent proof of the imported switchback theorem is claimed.
For finitary J,K,H, singular morphisms J→K are double cosets. Write M(p) for the unique Bruhat-maximal element of p, in the Bruhat order of the Coxeter system. The Coxeter monoid has the Coxeter braid relations and idempotent generators c*c=c, with underlying elements identified with W. Singular composition is p*q=W_J(M(p)*M(q))W_H for p:J→K and q:K→H. A single-step expression [J_0,…,J_m] is the composition of W_(J_(i-1))eW_(J_i); the plus/minus notation records the added/deleted vertices. The composition p*q is reduced exactly when (M(p)w_K^(-1))M(q) is length additive; an expression is reduced when every prefix-to-next-step composition is reduced. Multi-step notation records alternating inclusions and deletions. Atomic expressions concatenate the expressions of their atomic factors. Reversing a reduced expression preserves reducedness.
Hypotheses: A Coxeter system and finitary subsets at all objects. Here all objects are subsets of the fixed finitary T, and products and lengths are taken in (W_T,T).
Reading limits: Read the extracted PDF text of Sections 1.2–1.3, Section 2.1 (including the paragraph specifying Bruhat extrema), the Coxeter-monoid presentation in Section 2.2, Definitions 2.1–2.3, formulas (2.4)–(2.5), Proposition 2.4 and Definition 3.9. Import these conventions and their stated well-definedness; no reconstruction of their cited foundational proofs or of the underlying papers is claimed. The subsequent redundancy reformulation in Definition 2.3 is not used.
Sources
- Hankyung Ko, An atomic Coxeter presentation, arXiv:2312.16666v3 · Section 4 opening and Notation 4.1, Definition 4.2, PDF p. 13; Proposition 4.3, Definition 4.4, Proposition 4.5 and Lemma 4.7, p. 14; Remark 4.8 (4.8), Proposition 4.9 (4.9)–(4.13), p. 15; Definition 4.10, pp. 15–16
- Hankyung Ko, An atomic Coxeter presentation, arXiv:2312.16666v3 — singular-expression conventions · Section 1.2, (1.3)–(1.4), PDF p. 3; Section 1.3, p. 4; Section 2.1, paragraph on unique Bruhat extrema of finitary double cosets, p. 8; Section 2.2, Definition 2.1 and (2.4)–(2.5), p. 9; Definitions 2.2–2.3 and Proposition 2.4, p. 10; Definition 3.9, p. 13